Abstract
Although the multidimensional primitives are more powerful than string primitives and there also exist some works concerning distance measure between multidimensional objects, there are no many applications of this kind of languages to syntactic pattern recognition tasks. In this work, multidimensional primitives are used for object modelling in a handwritten digit recognition task under a syntactic approach. Two well-known tree language inference algorithms are considered to build the models, using as error model an algorithm obtaining the editing distance between a tree automaton and a tree; the editing distance algorithm gives the measure needed to complete the classification. The experiments carried out show the good performance of the approach.
Chapter PDF
Similar content being viewed by others
References
C. Arcelli, G. Sanniti DI Baja A width-independent fast thinning algorithm. IEEE Transactions on Pattern Analysis and Machine Intelligence Vol. 7. No. 4. pp. 463–474. 1985.
H. Bunke String matching for structural pattern recognition. In Syntactic and Structural Pattern Recognition: Theory and Applications. Eds. H. Bunke, A. San-feliu. World Scientific. 1990.
R. O. Duda, P. E. Hart Syntactic pattern recognition and applications. John Wiley and sons. 1973.
K. S. Fu Syntactic pattern recognition and applications. Prentice-Hall, 1982.
R. González and M. Thomason Syntactic Pattern Recognition. An Introduction. Addison-Wesley Publishing Company. 1978.
P. Garcia Learning k-testable tree sets from positive data Technical Report DSIC II/46/1993. Departamento de Sistemas Informáticos y Computación. Universidad Politécnica de Valencia. 1993.
P. Garcia, J. Oncina Inference of recognizable tree sets. Technical Report DSIC II/47/1993. Departamento de Sistemas Informáticos y Computación. Universidad Politécnica de Valencia. 1993.
G. M. Hunter, K. Steiglitz Operations on images using quad trees. IEEE Transactions on Pattern Analysis and Machine Intelligence Vol. 1. No. 2. pp. 145–153. 1979.
E. Jeltsch, H-J. Kreowski Grammatical inference based on hyperedge replacement. In LNCS 532 Graph grammars and their application to computer science. pp. 461–474. Springer-Verlag 1991.
D. López, J. M. Sempere Handwritten digit recognition through inferring graph grammars. A first approach. In LNCS 1451 Advances on Pattern Recognition. Joint of the SSPR and SPR International Workshops. pp. 483–491. Springer-Verlag 1998.
D. López, J. M. Sempere, P. García Error correcting analysis for tree languages. To be published on IJPRAI.
S. Y. Lu, K. S. Fu Error-correcting tree automata for syntactic pattern recognition. IEEE Transactions on Computers. C-27. No. 11. pp. 1040–1053. 1978.
I. Piñaga Inferencia de lenguajes de árboles. Proyecto final de carrera. Facultad de Informática. Universidad Politécnica de Valencia. 1999.
B. J. Oommen, K. Zhang, W. Lee Numerical Similarity and Dissimilarity Measures Between Two Trees. IEEE Transactions on Computers. To be published.
B. J. Oommen, R. K. S. Loke On the Recognition of Noisy Subsecuence Trees. In LNCS 1451 Advances on Pattern Recognition. Joint of the SSPR and SPR International Workshops. pp. 169–180. Springer-Verlag 1998.
J. R. Rico Off-line cursive handwritten word recognition based on tree extraction and an optimized classification distance. In VIII National Symposium on Pattern Recognition and Image Analysis. M.I. Torres and A. Sanfeliu (Eds.) Vol. 2, pp. 15–16. 1999.
G. Rozenberg (ed.) Handbook of Graph Grammars and Computing by Graph Transformation, Volume 1: Foundations World Scientific, 1997.
Y. Sakakibara Efficient Learning of Context-Free Grammars from Positive Structural Examples. Information and Computation 97, 23–60. 1992
G. A. Stephen String search. Technical Report TR-92-gas-01.School of Engineering Science. University College of North Wales. Gwynedd. United Kingdom. October 1992.
K. C. Tai The tree to tree correction problem Journal of the ACM Vol. 26, No 3, pp. 422–433. 1979.
E. Tanaka, K. S. Fu Error-correcting parsers for formal languages IEEE Transactions on Computers C-27 No. 7. pp. 605–616. 1978.
K. Zhang, D. Shasha Simple Fast Algorithms for the Editing Distance between Trees and Related Problems. SIAM J. Computation Vol. 18, No 6. 1245–1262. 1989
K. Zhang, R. Statman, D. Shasha On the Editing Distance between unordered labeled Trees. Information Processing Letters 42, 133–139. 1992
K. Zhang, T. Jiang Some MAX SNP-hard results concerning unordered labeled trees. Information Processing Letters 49, 249–254. 1994
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
López, D., Piñaga, I. (2000). Syntactic Pattern Recognition by Error Correcting Analysis on Tree Automata. In: Ferri, F.J., Iñesta, J.M., Amin, A., Pudil, P. (eds) Advances in Pattern Recognition. SSPR /SPR 2000. Lecture Notes in Computer Science, vol 1876. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44522-6_14
Download citation
DOI: https://doi.org/10.1007/3-540-44522-6_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67946-2
Online ISBN: 978-3-540-44522-7
eBook Packages: Springer Book Archive