Abstract
The crucial methodological assumptions for constructing syntactic pattern recognition methods are presented in the paper. The frontiers constituting key open problems in the area of syntactic pattern recognition are identified. A survey and an analysis of the main methods based on an enhancement of context-free grammars results in formulating methodological principles for defining such methods. A discussion of key issues concerning a construction of graph grammar-basedmethods allows us to define methodological rules in this important area of syntactic pattern recognition.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aho, A.V.: Indexed grammars - an extension of context-free grammars. Journal of the Association for Computing Machinery 15, 647â671 (1968)
Alquezar, R., Sanfeliu, A.: Recognition and learning of a class of context-sensitive languages described by augmented regular expressions. Pattern Recognition 30, 163â182 (1997)
Bunke, H.O., Haller, B.: A parser for context free plex grammars. In: Nagl, M. (ed.) WG 1989. LNCS, vol. 411, pp. 136â150. Springer, Heidelberg (1990)
Bunke, H.O., Sanfeliu, A. (eds.): Syntactic and Structural Pattern Recognition - Theory and Applications. World Scientific, Singapore (1990)
Dassow, J., Paun, G.: Regulated Rewriting in Formal Language Theory. Springer, New York (1990)
Ferruci, F., Tortora, G., Tucci, M., Vitiello, G.: A predictive parser for visual languages specified by relational grammars. In: Proc. IEEE Symp. Visual Lang. VL 1994, pp. 245â252 (1994)
FlasiĆski, M.: On the parsing of deterministic graph languages for syntactic pattern recognition. Pattern Recognition 26, 1â16 (1993)
FlasiĆski, M.: Power properties of NLC graph grammars with a polynomial membership problem. Theoretical Computer Science 201, 189â231 (1998)
FlasiĆski, M., Jurek, J.: Dynamically programmed automata for quasi context sensitive languages as a tool for inference support in pattern recognition-based real-time control expert systems. Pattern Recognition 32, 671â690 (1999)
FlasiĆski, M.: Inference of parsable graph grammars for syntactic pattern recognition. Fundamenta Informaticae 80, 379â413 (2007)
Fu, K.S.: Syntactic Pattern Recognition and Applications. Prentice Hall, Englewood Cliffs (1982)
Goldfarb, L.: Pattern representation and the future of pattern recognition. In: Proc. ICPR 2004 Workshop, Cambridge UK, August 22 (2004)
Gonzales, R.C., Thomason, M.G.: Syntactic Pattern Recognition: An Introduction. Addison-Wesley, Reading (1978)
Jain, A.K., Duin, R.P.W., Mao, J.: Statistical pattern recognition: a review. IEEE Trans. Pattern Anal. Machine Intell. 22, 4â37 (2000)
Janssens, D., Rozenberg, G.: On the structure of node-label-controlled graph languages. Information Sciences 20, 191â216 (1980)
Jurek, J.: On the linear computational complexity of the parser for quasi context sensitive languages. Pattern Recognition Letters 21, 179â187 (2000)
Jurek, J.: Recent developments of the syntactic pattern recognition model based on quasi-context sensitive languages. Pattern Recognition Letters 26, 1011â1018 (2005)
Marcus, S.: Contextual grammars. Rev. Roum. Math. Pures Appl. 14, 1525â1534 (1969)
Oates, T., Armstrong, T., Becerra-Bonache, L., Atamas, M.: Inferring grammars for mildly context sensitive languages in polynomial time. In: Sakakibara, Y., Kobayashi, S., Sato, K., Nishino, T., Tomita, E. (eds.) ICGI 2006. LNCS (LNAI), vol. 4201, pp. 137â147. Springer, Heidelberg (2006)
Okhotin, A.: Boolean grammars. Information and Computation 194, 19â48 (2004)
Pavlidis, T.: Structural Pattern Recognition. Springer, New York (1977)
Peng, K.J., Yamamoto, T., Aoki, Y.: A new parsing scheme for plex grammars. Pattern Recognition 23, 393â402 (1990)
Rosenfeld, A., Milgram, D.L.: Web automata and web grammars. Machine Intelligence 7, 307â324 (1972)
Rosenkrantz, D.J.: Programmed grammars and classes of formal languages. Journal of the Association for Computing Machinery 16, 107â131 (1969)
Rosenkrantz, D.J., Stearns, R.E.: Properties of deterministic top-down grammars. Information Control 17, 226â256 (1970)
Shi, Q.Y., Fu, K.S.: Parsing and translation of attributed expansive graph languages for scene analysis. IEEE Trans. Pattern Analysis Mach. Intell. 5, 472â485 (1983)
Tadeusiewicz, R., Ogiela, M.R.: Medical Image Understanding Technology. Springer, Heidelberg (2004)
Tanaka, E.: Theoretical aspects of syntactic pattern recognition. Pattern Recognition 28, 1053â1061 (1995)
Turan, G.: On the complexity of graph grammars. Rep. Automata Theory Research Group. Szeged (1982)
Vijay-Shanker, K., Weir, D.J.: The equivalence of four extensions of context-free grammars. Mathematical Systems Theory 27, 511â546 (1994)
Wittenburg, K.: Earley-style parsing for relational grammars. In: Proc. IEEE Symp. Visual Lang. VL 1992, pp. 192â199 (1992)
Zhang, D.Q., Zhang, K., Cao, J.: A context-sensitive graph grammar formalism for the specification of visual languages. The Computer Journal 44, 186â200 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
FlasiĆski, M., Jurek, J. (2011). Syntactic Pattern Recognition: Survey of Frontiers and Crucial Methodological Issues. In: Burduk, R., KurzyĆski, M., WoĆșniak, M., Ć»oĆnierek, A. (eds) Computer Recognition Systems 4. Advances in Intelligent and Soft Computing, vol 95. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20320-6_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-20320-6_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20319-0
Online ISBN: 978-3-642-20320-6
eBook Packages: EngineeringEngineering (R0)