Anzeige
Erschienen in:
2010 | OriginalPaper | Buchkapitel
Parallel Computing Scheme for Graph Grammar-Based Syntactic Pattern Recognition
verfasst von : Mariusz Flasiński, Janusz Jurek, Szymon Myśliński
Erschienen in: Parallel Processing and Applied Mathematics
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Real-time syntactic pattern recogniton imposes strict computing time constraints on new techniques developed. Recently, a method for an analysis of hand postures of the Polish Sign Language based on the
ETPL
(
k
) graph grammars (Flasiński:
Patt. Recogn.
26 (1993), 1-16;
Theor. Comp. Sci.
201 (1998), 189-231) has been constructed. In order to make a system implemented more feasible for the users, a research into parallelization of a pattern recognition process has been led. Possible techniques of tasks distribution have been tested. It has allowed us to define an optimum strategy of parallelization. The results are presented in the paper.