Concurrent grammar inference machines for 2-D pattern recognition: a comparison with the level set approach

Parallel processing promises scalable and effective computing power which can handle the complex data structures of knowledge representation languages efficiently. Past and present sequential architectures, despite the rapid advances in computing technology, have yet to provide such processing power and to offer a holistic solution to the problem. This paper presents a fresh attempt in formulating alternative techniques for grammar learning, based upon the parallel and distributed model of connectionism, to facilitate the more cognitively demanding task of pattern understanding. The proposed method has been compared with the contemporary approach of shape modelling based on level sets, and demonstrated its potential as a prototype for constructing robust networks on high performance parallel platforms.

[1]  D. Cremers,et al.  Diffusion-snakes: combining statistical shape knowledge and image information in a variational framework , 2001, Proceedings IEEE Workshop on Variational and Level Set Methods in Computer Vision.

[2]  Guillermo Sapiro,et al.  Geodesic Active Contours , 1995, International Journal of Computer Vision.

[3]  Franz-Josef Brandenburg,et al.  Cycle Chain Code Picture Languages , 1990, Graph-Grammars and Their Application to Computer Science.

[4]  J A Sethian,et al.  A fast marching level set method for monotonically advancing fronts. , 1996, Proceedings of the National Academy of Sciences of the United States of America.

[5]  Tao Zhang,et al.  Tracking objects using density matching and shape priors , 2003, Proceedings Ninth IEEE International Conference on Computer Vision.

[6]  Peter Fletcher.  Neural networks for learning grammars , 1993 .

[7]  Jezekiel Ben-Arie,et al.  Pictorial Recognition of Objects Employing Affine Invariance in the Frequency Domain , 1998, IEEE Trans. Pattern Anal. Mach. Intell..

[8]  K. P. Lam,et al.  An Analytical Design of High-Speed Pixel Transformation for Object Boundary Enhancement , 1997, Euro-Par.

[9]  Peter Fletcher,et al.  Connectionist learning of regular graph grammars , 2001 .

[10]  Peter Fletcher,et al.  The foundations of connectionist computation , 2000, Connect. Sci..

[11]  Wen Fang,et al.  Using Statistical Shape Priors in Geodesic Active Contours for Robust Object Detection , 2006, 18th International Conference on Pattern Recognition (ICPR'06).

[12]  Kumpati S. Narendra,et al.  Identification and control of dynamical systems using neural networks , 1990, IEEE Trans. Neural Networks.

[13]  O. Faugeras,et al.  Statistical shape influence in geodesic active contours , 2002, 5th IEEE EMBS International Summer School on Biomedical Imaging, 2002..

[14]  P. Fletcher.  Mathematical Theory of Recursive Symbol Systems , 2004 .

[15]  M. B. Stegmann,et al.  A Brief Introduction to Statistical Shape Analysis , 2002 .

[16]  Marc Parizeau,et al.  A Fuzzy-Syntactic Approach to Allograph Modeling for Cursive Script Recognition , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[17]  John F. Kolen,et al.  Dynamical Recurrent Networks , 2001 .

[18]  Alan L. Yuille,et al.  Feature extraction from faces using deformable templates , 2004, International Journal of Computer Vision.