Handwritten digit recognition through inferring graph grammars. A first appproach

  • Damián López
  • José M. Sempere
Poster Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1451)


Graph grammars have been widely used in areas such as program semantics, concurrence and parallelism, or graphic generation. This work is concerned with pattern recognition tasks and how to use a class of graph grammars (web grammars) to modelize the objects in both the learning and recognition phases. First, we give some definitions and basic notation referring to web grammars. We then propose an adaptation of a previous method for learning web grammars and we report some preliminary results on a handwritten digit recognition task together with future work to be carried out.


Pattern Recognition Graph Grammars Grammatical Inference 


  1. 1.
    N. ABE, M. Mizumoto, J. Toyoda AND H. Tanaka Web Grammars and Several Graphs. Journal of Computer and System Sciences 7, 37–65. 1973.Google Scholar
  2. 2.
    G. Rozenserg (Ed.)Handbook of Graph Grammars and Computing by Graph Transformation, Volume 1: Foundations World Scientific, 1997.Google Scholar
  3. 3.
    R. González and M. ThomasonSyntactic Pattern Recognition. An Introduction. Addison-Wesley Publishing Company. 1978.Google Scholar
  4. 4.
    J. Hopcroft, J. UllmanIntroduction to Automata Theory, Languages and Computation. Addison-Wesley Publishing Company. 1979.Google Scholar
  5. 5.
    D. López Inferencia de Gramáticas de Grafos para una tarea de Reconocimiento de Dígitos Manuscritos. Technical Report, DSIC-II/34/97 Departamento de Sistemas Informáticos y Computación, Polytechnic University of Valencia. September 1997.Google Scholar
  6. 6.
    Ugo G. Montanari Separable Graphs, Planar Graphs and Web Grammars. Information and Control 16, pp 243–267. 1970.CrossRefGoogle Scholar
  7. 7.
    J. Oncina, P. García Inferring Regular Languajes in Polinomial Update Time. Pattern Recognition and Image Analysis. Selected Papers from the IVth Spanish Symposium. Series in Machine Perception and Artificial Inteligence. Vol. 1. World Scientific. 1992.Google Scholar
  8. 8.
    B. J. Oommen, K. Zhang, W. Lee Numerical Similarity and Dissimilarity Measures Between Two Trees. IEEE Transactions on Computers. To be published.Google Scholar
  9. 9.
    B. J. Oommen, R. K. S. Loke On the Recognition of Noisy Subsecuence Trees. SSPR'98.Google Scholar
  10. 10.
    John L. Pfaltz Web Grammars and Picture Description. Computer Graphics and Image Processing 1, 193–220. 1972.Google Scholar
  11. 11.
    S. Yebra Implementación y estudio de diversos algoritmos de Thinning. Proyecto Final de Carrera E. U. I, Polytechnic University of Valencia. 1995.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Damián López
    • 1
  • José M. Sempere
    • 1
  1. 1.Departamento de Sistemas Informáticos y ComputaciónUniversidad Politécnica de ValenciaValenciaSpain

Personalised recommendations