Advertisement

Basic techniques and symbol-level recognition — An overview

  • Lawrence O'Gorman
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1072)

Abstract

This is an overview paper that describes methods used in graphics recognition from the stage of the initial scanned image to that of the graphics features. The objective is to give context and background to the papers in this section — and, because it is introductory material — to the rest of the papers in this book.

Methods are described under the categories of: pixel-level processing, line-level processing, and feature detection. In the pixel-level processing section, thresholding, noise reduction, and compression are discussed. In the line-level processing section, thinning, chain coding, region detection, and polygonalization are discussed. And in the final section on feature detection, critical point detection, line and curve fitting, and shape recognition are discussed.

Keywords

Noise Reduction Feature Detection Document Image Straight Line Segment Chain Code 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    L. O'Gorman, R. Kasturi, “Document Image Analysis”, IEEE Computer Society Press, Los Vaqueros, CA, 1994.Google Scholar
  2. 2.
    N. Otsu, “A threshold selection method from gray-level histograms”, IEEE Trans. Systems, Man, and Cybernetics, Vol. SMC-9, No. 1, Jan. 1979, pp. 62–66.Google Scholar
  3. 3.
    S.S. Reddi, S.F. Rudin, H.R. Keshavan, “An optimal multiple threshold scheme for image segmentation”, IEEE Trans. Systems, Man, and Cybernetics, Vol. SMC-14, No. 4, July/Aug, 1984, pp. 661–665.Google Scholar
  4. 4.
    W-H. Tsai, “Moment-preserving thresholding: A new approach”, Computer Vision, Graphics, and Image Processing, Vol. 29, 1985, pp. 377–393.Google Scholar
  5. 5.
    L. O'Gorman, “Binarization and multi-thresholding of document images using connectivity”, CVGIP: Graphical Models and Image Processing, Vol. 56, No. 6, Nov. pp. 494–506, 1994.Google Scholar
  6. 6.
    K.Y. Wong, “Multi-function auto-thresholding algorithm”, IBM Technical Disclosure Bulletin, Vol. 21, No. 7, 1978, pp. 3001–3003.Google Scholar
  7. 7.
    R.G. Casey, K.Y. Wong, “Document analysis systems and techniques”, in Image Analysis Applications, R. Kasturi and M.M. Trivedi (eds), Marcel Dekker, 1990, pp. 1–36.Google Scholar
  8. 8.
    M. Kamel, A. Zhao, “Extraction of binary character/graphics images from grayscale document images”, CVGIP: Graphical Models and Image Processing, Vol. 55, No. 3, 1993, pp. 203–217.Google Scholar
  9. 9.
    J.M. White, G.D. Rohrer, “Image thresholding for optical character recognition and other applications requiring character image extraction”, IBM J. Res. Development, Vol. 27, no. 4, July 1983, pp. 400–411.Google Scholar
  10. 10.
    O. D. Trier, T. Taxt, “Evaluation of binarization methods for document images”, IEEE Trans. PAMI, Vol. 17, No. 3, Mar. 1995, pp. 312–320.Google Scholar
  11. 11.
    R.M. Haralick, S.R. Sternberg, X. Zhuang, “Image analysis using mathematical morphology”, IEEE Trans. PAMI, Vol 9, July 1987, pp. 532–550.Google Scholar
  12. 12.
    L. O'Gorman, “Image and document processing techniques for the RightPages Electronic Library System”, Int. Conf. Pattern Recognition (ICPR), The Netherlands, Sept. 1992, pp. 260–263.Google Scholar
  13. 13.
    R. Aravind, G. L. Cash, D. L. Duttweiler, H-M. Hang, B. G. Haskell, A. Puri, “Image and video coding standards”, AT&T Technical Journal, Jan–Feb., 1993, pp. 67–88.Google Scholar
  14. 14.
    JBIG, “Progressive bi-level image compression”, ISO/IEC International Standard 11544, 1993.Google Scholar
  15. 15.
    I. H. Witten, A. Moffat, T. C. Bell, “Managing Gigabytes: Compressing and Indexing Documents and Images”, Van Nostrand Reinhold Publ., New York, 1994.Google Scholar
  16. 16.
    L. Lam, S-W. Lee, C.Y. Suen, “Thinning methodologies — A comprehensive survey”, IEEE Trans. Pattern Analysis and Machine Intelligence, Vol. 14, No. 9, Sept. 1992, pp. 869–885.Google Scholar
  17. 17.
    C.J. Hilditch, “Linear skeletons from square cupboards”, Machine Intelligence 4, 1969, pp. 403–420.Google Scholar
  18. 18.
    N.J. Naccache, R. Shinghal, “SPTA: A proposed algorithm for thinning binary patterns”, IEEE Trans. Systems, Man, and Cybernetics, Vol. SMC-14, No. 3, 1984, pp. 409–418.Google Scholar
  19. 19.
    L. O'Gorman, “k x k Thinning”, CVGIP, Vol. 51, pp. 195–215, 1990.Google Scholar
  20. 20.
    H. Freeman, “Computer processing of line drawing images”, Computing Surveys, Vol. 6, No. 1, 1974, pp. 57–98.CrossRefGoogle Scholar
  21. 21.
    J.F. Harris, J. Kittler, B. Llewellyn, G. Preston, “A modular system for interpreting binary pixel representations of line-structured data”, in Pattern Recognition: Theory and Applications, J. Kittler, K.S. Fu, L.F. Pau (eds.), D. Reidel Publishing Co. pp. 311–351, 1982.Google Scholar
  22. 22.
    L. O'Gorman, “Primitives Chain Code”, in “Progress in Computer Vision and Image Processing”, edited by A. Rosenfeld and L. G. Shapiro, Academic Press, San Diego, 1992 pp. 167–183.Google Scholar
  23. 23.
    U. E. Ramer, “An iterative procedure for the polygonal approximation of plane curves”, Computer Graphics and Image Processing, 1:244–256, 1972Google Scholar
  24. 24.
    I. Tomek, “Two algorithms for piecewise-linear continuous fit of functions of one variable”, IEEE Trans. Computer, Vol. C-23, No. 4, pp. 445–448, 1974Google Scholar
  25. 25.
    C. M. Williams, “An efficient algorithm for the piecewise linear approximation of planar curves,” Computer Graphics and Image Processing, 8:286–293, 1978Google Scholar
  26. 26.
    J. Sklansky, V. Gonzalez, “Fast polygonal approximation of digitized curves,” Pattern Recognition, 12:327–331, 1980CrossRefGoogle Scholar
  27. 27.
    C. M. Williams, “Bounded straight-line approximation of digitized planar curves and lines,” Computer Graphics and Image Processing, 16:370–381, 1981Google Scholar
  28. 28.
    K. Wall, P.E. Danielsson, “A fast sequential method for polygonal approximation of digitized curves,” Computer Graphics and Image Processing, 28:220–227, 1984Google Scholar
  29. 29.
    Y. Kurozumi, W. A. Davis, “Polygonal approximation by minimax method,” Computer Graphics and Image Processing, Vol. 19, 1982, pp. 248–264.Google Scholar
  30. 30.
    A. Rosenfeld, E. Johnston, “Angle detection on digital curves”, IEEE Trans. Computers, 22: 875–878, Sept. 1973.Google Scholar
  31. 31.
    A. Rosenfeld, J.S. Weszka, “An improved method of angle detection on digital curves”, IEEE Trans. Computer, Vol. C-24, 1975, pp. 940–941.Google Scholar
  32. 32.
    H. Freeman, L. Davis, “A corner-finding algorithm for chain-coded curves”, IEEE Trans. Computer, Vol. C-26, 1977, pp. 297–303.Google Scholar
  33. 33.
    L. O'Gorman, “Curvilinear feature detection from curvature estimation”, 9th Int. Conference on Pattern Recognition, Rome, Italy Nov., 1988, pp. 1116–1119.Google Scholar
  34. 34.
    H. Asada, M. Brady, “The curvature primal sketch”, IEEE Trans. Pattern Analysis and Machine Intelligence, Vol. PAMI-8, No. 1, Jan., 1986, pp. 2–14.Google Scholar
  35. 35.
    A.P. Pridmore, J. Porrill, J.E.W. Mayhew, “Segmentation and description of binocularly viewed contours”, Image and Vision Computing, Vol. 5, No. 2, May 1987, pp. 132–138.Google Scholar
  36. 36.
    R. O. Duda, P. E. Hart, Pattern Classification and Scene Analysis, Wiley-Interscience, New York, 1973, pp. 332–335.Google Scholar
  37. 37.
    D. H. Ballard, C. M. Brown, Computer Vision, Prentice-Hall, New Jersey, 1982, pp. 485–489.Google Scholar
  38. 38.
    P.L. Rosin, G.A.W. West, “Segmentation of edges into lines and arcs”, Image and Vision Computing, Vol. 7, No. 2, May 1989, pp. 109–114.Google Scholar
  39. 39.
    J. Illingworth, J. Kittler, “A survey of the Hough transform”, Computer Graphics and Image Processing, 44:87–116, 1988.Google Scholar
  40. 40.
    M. K. Hu, “Visual pattern recognition by moment invariants”, in Computer Methods in Image Analysis, J. K. Aggarwal, R. O. Duda, A. Rosenfeld (eds.), IEEE Computer Society, Los Angeles, 1977.Google Scholar
  41. 41.
    A. K. Jain, Fundamentals of Digital Image Processing, Prentice Hall, New Jersey, 1989, pp. 377–381.Google Scholar
  42. 42.
    T. Pavlidis, “A review of algorithms for shape analysis”, Computer Graphics and image processing”, vol. 7, 1978, pp. 243–258.Google Scholar
  43. 43.
    S. Marshall, “Review of shape coding techniques”, Image and Vision Computing, Vol. 7, No. 4, Nov. 1989, pp. 281–294.Google Scholar
  44. 44.
    C. Arcelli, L. P. Cordella, G. Sanniti di Baja (eds.), Visual Form: Analysis and Recognition, (Proceedings of the International Workshop on Visual Form, May, 1991, Capri, Italy), Plenum Press, New York, 1992.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Lawrence O'Gorman
    • 1
  1. 1.AT&T Bell LaboratoriesMurray Hill

Personalised recommendations