Parallel algorithms for 2D-image recognition

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(log/sup 2/(n)) time with n/sup 6/ processors. For unambiguous context-free and linear image grammars, they prove that only O(n/sup 3/) is needed. For deterministic parallel image grammars, the recognition can be done in O(log/sup 2/(n)) time by using n/sup 2/ processors.<<ETX>>

[1]  Wojciech Rytter,et al.  The Complexity of Two-Way Pushdown Automata and Recursive Programs , 1985 .

[2]  Ahmed Saoudi,et al.  Parallel Recognition of High Dimensional Images , 1992, Int. J. Pattern Recognit. Artif. Intell..

[3]  Azriel Rosenfeld,et al.  Array Grammar Normal Forms , 1973, Inf. Control..

[4]  Leslie G. Valiant,et al.  General Context-Free Recognition in Less than Cubic Time , 1975, J. Comput. Syst. Sci..

[5]  Rani Siromoney,et al.  Puzzle Grammars and Context-Free Array Grammars , 1991, Int. J. Pattern Recognit. Artif. Intell..

[6]  Walter L. Ruzzo,et al.  Tree-size bounded alternation(Extended Abstract) , 1979, J. Comput. Syst. Sci..

[7]  Jan van Leeuwen,et al.  The Membership Question for ET0L-Languages is Polynomially Complete , 1975, Inf. Process. Lett..

[8]  Jay Earley,et al.  An efficient context-free parsing algorithm , 1970, Commun. ACM.

[9]  V. Rajkumar Dare,et al.  Parallel Generation of Finite Images , 1989, Int. J. Pattern Recognit. Artif. Intell..

[10]  Wojciech Rytter,et al.  On the Parallel Recognition of Unambiguous Context-Free Languages , 1991, Theor. Comput. Sci..

[11]  Michael A. Harrison,et al.  Introduction to formal language theory , 1978 .

[12]  Sartaj Sahni,et al.  Parallel Matrix and Graph Algorithms , 1981, SIAM J. Comput..

[13]  P. S. Wang.  Array Grammars, Patterns and Recognizers , 1989, Array Grammars, Patterns and Recognizers.