Advertisement

Character recognition with k-head finite array automata

  • Henning Fernau
  • Rudolf Freund
  • Markus Holzer
Handwritten Character Recognition
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1451)

Abstract

We introduce the, concept of k-head finite two-dimensional array automata and show how this model of two-dimensional array automata can be applied in the field of syntactic: character recognition. Moreover, we discuss some of the problems arising; with implementing the theoretical concept to obtain an efficient tool for the syntactic analysis of handwritten (uppercase characters.

References

  1. 1.
    M. Blum and C. Hewitt, Automata on a two-dimensional tape. In: IEEE Symposium on Switching and Automata Theory (1967), pp. 155–160.Google Scholar
  2. 2.
    C. R. Cook and P. S.-P. Wang, A Chomsky hierarchy of isotonic: array grammars and languages, Computer Graphics and Image Processing 8 (1978), pp. 144–152.Google Scholar
  3. 3.
    J. Dassow and Ch. Păun, Regulated Rewriting in Formal Language Theory (Springer, Berlin, 1989).Google Scholar
  4. 4.
    W. Dittmann, Character recognition by array systems of bounded index, Diploma thesis, Techn. Univ. Wien, Austria, 1997.Google Scholar
  5. 5.
    H. Fernau and P. Freund, Bounded parallelism in array grammars used for character recognition. In: P. Perner, P. S.-P. Wang, and A. Rosenfeld (eds.), Proceedings SSPR'96, LNCS 1121 (Springer, Berlin, 1996), pp. 40–49.Google Scholar
  6. 6.
    H. Fernau, R. Freund, and M. Holzer, Regulated array grammars of finite index, Part I. Theoretical investigations, to appear in: [13].Google Scholar
  7. 7.
    H. Fernau, R. Freund, and M. Holzer, Regulated array grammars of finite index, Part II: Syntactic pattern recognition, to appear in: [13].Google Scholar
  8. 8.
    R. Freund, Array grammar systems with prescribed teams of array productions. In: J. Dassow, Ch. Păun and A. Salomaa (eds.), Developments in Language Theory II (Gordon and Breach, London, 1996), pp. 220–229.Google Scholar
  9. 9.
    R. Freund, Syntactic recognition of handwritten characters by programmed array grammars with attribute vectors, Seventh International Conference on Image Analysis and Processing, Bari, Italy, in: Progress in Image Analysis and Processing III (ed. S. Impedovo, World Scientific Publ., Singapore, 1993), pp. 357–364.Google Scholar
  10. 10.
    O. Ibarra and R. T. Melson, Some results concerning automata on two-dimensional tapes, International Journal of Computer Mathematics, Series A 4 (1974), pp. 269–279.Google Scholar
  11. 11.
    K. Inoue and I. Takanami, A survey of two-dimensional automata theory. In: J. Dassow and J. Kelemen (eds.), Machines, Languages, and Complexity, IMYCS'88, LNCS 381 (Springer, Berlin, 1988), pp. 72–91.Google Scholar
  12. 12.
    A. Nakamura, Parallel Σ-erasing array acceptors, Computer Graphics and Image Processing 14 (1980), pp. 80–86.CrossRefGoogle Scholar
  13. 13.
    Ch. Păun and A. Salomaa (eds.), Grammatical Models of Multi-Agent Systems (Gordon and Breach, Reading, UK, 1998).Google Scholar
  14. 14.
    A. L. Rosenberg, On multihead finite automata, IBM J. Res. Develop. 10 (1966), pp. 388–394.Google Scholar
  15. 15.
    A. Rosenfeld, Some notes on finite-state picture languages, Information and Control 31 (1976), pp. 177–184.CrossRefGoogle Scholar
  16. 16.
    A. Rosenfeld, Picture Languages (Academic Press, Reading, MA, 1979).Google Scholar
  17. 17.
    J. H. Sossa, An improved parallel algorithm for thinning digital patterns, Pattern Recognition Letters 10 (1989), pp. 77–80.CrossRefGoogle Scholar
  18. 18.
    P. S.-P. Wang, Some new results on isotonic array grammars, Information Processing Letters 10 (1980), pp. 129–131.CrossRefGoogle Scholar
  19. 19.
    P. S.-P. Wang, An application of array grammars to clustering analysis for syntactic patterns, Pattern Recognition 17, 4 (1984), pp. 441–451.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Henning Fernau
    • 1
  • Rudolf Freund
    • 2
  • Markus Holzer
    • 1
  1. 1.Wilhelm-Schickard-Institut für InformatikUniversität TübingenTübingenGermany
  2. 2.Institut für ComputersprachenTechnische Universität WienWienAustria

Personalised recommendations