Title :
Parallel algorithms for 2D-image recognition
Author :
Rytter, W. ; Saoudi, A.
Author_Institution :
Inst. of Inf., Warsaw Univ., Poland
fDate :
30 Aug-3 Sep 1992
Abstract :
Studies the parallel recognition of 2D-images generated by parallel context-free image grammars. The authors show that the recognition of an n×n image can be done in O (log2(n)) time with n6 processors. For unambiguous context-free and linear image grammars, they prove that only O(n3) is needed. For deterministic parallel image grammars, the recognition can be done in O(log2(n)) time by using n2 processors
Keywords :
computational complexity; context-free grammars; image recognition; parallel algorithms; 2D-images; O(log2(n)) time; deterministic parallel image grammars; image recognition; parallel context-free image grammars; parallel recognition; time complexity; Image generation; Image recognition; Informatics; Mars; Parallel algorithms; Parallel processing; Pattern recognition; Phase change random access memory; Random access memory; Read-write memory;
Conference_Titel :
Pattern Recognition, 1992. Vol. IV. Conference D: Architectures for Vision and Pattern Recognition, Proceedings., 11th IAPR International Conference on
Conference_Location :
The Hague
Print_ISBN :
0-8186-2925-8
DOI :
10.1109/ICPR.1992.202143
