Skip to main content

Digital Transforms in Handwriting Recognition

  • Conference paper
Fundamentals in Handwriting Recognition

Part of the book series: NATO ASI Series ((NATO ASI F,volume 124))

Abstract

Digital transforms have been intensively used in the field of pattern recognition with the advance of computers. In the field of handwriting recognition, applications of such mathematical transformations ranges from character and numeral recognition, to word recognition and signature verification. This tutorial presents the fundamentals of digital transforms and their use in handwriting recognition. The tutorial is divided into three parts. The first part deals with the fundamental concepts and an overview of digital transforms. The second part deals with the implementation of digital transforms. Specifically the Discrete Fourier Transform (DFT) is explained in detail. Some computational aspects of the DFT are evaluated and some algorithms for Fast Fourier Transform are presented. In particular the “Radix-2 FFT” algorithms are discussed in detail. In the last part of the tutorial, some applications are presented: the DFT represents one of the most powerful tools for plane curve analysis and recognition. This is useful in handwriting recognition where the major information for the description and the classification of the pattern can be found in its boundary. Furthermore, Fourier Transform allows accurate analysis of plane curves and it was recently used for an experimental observation of human behaviour in recognizing handwritten characters. The results of such experiment pose suggestive questions about human ability in handwriting recognition which are now on the frontiers of the research in this field: How does man recognize handwritten pattern? Which features of a pattern are the most important for its recognition process? What about ambiguous patterns and their properties and about human recognition of ambiguous patterns? How could be automatically treated ambiguous patterns?

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Impedovo, Introduzione all’ Analisi Spettrale ed Algoritmi “FFT”, Bari. Adriatica Editrice, 1987.

    Google Scholar 

  2. I. J. Good, A New Finite Series for Legendre Polynomials, Proc. Camb. Phil. Soc., 51, 385–388, 1958.

    Article  MathSciNet  Google Scholar 

  3. A. N. Kolmogorov, S. V. Fomin, Elementi di Teoria delle Funzioni e di Analisi Funzionale, Mosca: Edizioni MIR, 1980, pp. 398–399.

    Google Scholar 

  4. L. R. Rabiner, B. Gold, Theory and Applications of Digital Signal Processing, Englewood Cliffs, NJ: Prentice-Hall, 1975.

    Google Scholar 

  5. J. W. Cooley, P. A. W. Lewis, P. D. Welch, The Fast Fourier Transform, Proc. IEEE, 55, 1675–1677, October 1967.

    Google Scholar 

  6. J. W. Cooley, P. A. W. Lewis, P. D. Welch, The Fast Fourier Transform and its Applications, IEEE Transaction and Education, 12 (1), March 1969.

    Google Scholar 

  7. S. Winograd, On Computing the Discrete Fourier Transform, Mathematics of computation, 32, 175–199, 1978.

    MATH  MathSciNet  Google Scholar 

  8. H. J. Nussbaumer, Digital Filtering Using Complex Marsenne Transform, IBM Journal of Res. and Dev., 20(5), 498–504, Sept. 1976.

    Article  MATH  MathSciNet  Google Scholar 

  9. J. H. McClellan, C. M. Rader, Number Theory in Digital Signal Processing, Englewood Cliffs, NJ: Prentice-Hall, 1979.

    MATH  Google Scholar 

  10. A. V. Oppenheim, R. V. Schafer, Digital Signal Processing, Englewood Cliffs, NJ: Prentice-Hall, 1975.

    MATH  Google Scholar 

  11. B. A. Blesser, T. Kuklinsky, R.J. Shillman, Empirical tests for feature extraction selection based on a psychological theory of character recognition, Pattern Recognition, 8, 77–85, 1976.

    MATH  Google Scholar 

  12. S. Impedovo, G. Dimauro, G. Pirlo, Ambiguity in the recognition process: some considerations on human variable behaviour, in From Pixels to Features III — Frontiers in Handwriting Recognition, S. Impedovo and J.-C. Simon (eds.), Elsevier, 1992.

    Google Scholar 

  13. M. Castellano, G. Dimauro, S. Impedovo, G. Pirlo, Ambiguous Patterns: Investigation on their properties, in Progress in Image Analysis and Processing, Edited by V. Cantoni, World Scientific, 1989.

    Google Scholar 

  14. R. Legault, C.Y. Suen, C. Nadal, Classification of Confusing Handwritten Numerals by Human Subjects, First IWFHR, Montreal, Canada, April 1990.

    Google Scholar 

  15. C.Y. Suen, P. Ahmed, Computer recognition of totally unconstrained handwritten zip codes, International Journal of Pattern Recognition and Artificial Intelligence, Word Scientific, 1(1), 1–15, 1987.

    Google Scholar 

  16. D. Dutta Majumder et Al., How to quantify shape distance for 2-D regions, Proc. of 7th ICPR, Montreal, Canada, pp. 72-74, 1984.

    Google Scholar 

  17. S. Impedovo, B. Marangelli, A.M. Fanelli, A Fourier descriptor set for recognizing nonstylized numerals, IEEE Trans. Syst. Man and Cybern., SMC 8–8, 640–645, Aug. 1978.

    Google Scholar 

  18. E. Person, K.S. Fu, Shape discrimination using Fourier descriptors, IEEE Trans. Syst. Man and Cybern., SMC 7–3, 170–179, Mar. 1977.

    Article  Google Scholar 

  19. C.T. Zahn et Al., Fourier descriptors for plane closed curve, IEEE Trans. Comp., C21–3, 269–281, Mar. 1972.

    Article  MathSciNet  Google Scholar 

  20. A. Krzyzak, S.Y. Lueng, C.Y. Suen, Reconstruction of two dimensional patterns by Fourier descriptors, 9-th ICPR, Rome, Italy, pp. 555-558, Nov. 1988.

    Google Scholar 

  21. S. Impedovo, N. Abbattista, Hand-written numeral recognition; the organization degree measurement, Proc. 6th ICPR, Munich, Germany, pp. 40-43, Oct. 1982.

    Google Scholar 

  22. S. Impedovo, Power pattern-resolution in human vision — some consideration on the handwritten numeral resolution, Proc. SPIE, vol.548 — Appl. of Art. Intell. II, Washington, USA, pp. 263-268, 1985.

    Google Scholar 

  23. S. Impedovo, G. Dimauro, An interactive system for the selection of handwritten numeral classes, Proc. of 10th ICPR, Atlantic City, USA, pp. 563-566, 1990.

    Google Scholar 

  24. H. Samet, Region representation: quadtrees from binary arrays, Computer Graphics and Image Processing, May 1980, pp. 88-93.

    Google Scholar 

  25. HERMIA: An Heterogeneus and Reconfigurable Machine for Image Analysis, MVA IAPR Workshop on Machine Vision Applications, Tokyo, pp. 397–400, Nov. 28-30, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dimauro, G. (1994). Digital Transforms in Handwriting Recognition. In: Impedovo, S. (eds) Fundamentals in Handwriting Recognition. NATO ASI Series, vol 124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-78646-4_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-78646-4_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-78648-8

  • Online ISBN: 978-3-642-78646-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics