Skip to main content

Abstract

This chapter and the next two chapters deal with class 2 pictures where regions of fixed gray level or color are well defined. A major concern in the study of such images is the concept of shape, a term that is not easy to define quantitatively. One faces this problem when sampling an analog bilevel image. The size of the cells of the sampling grid must be small enough so that the shapes of regions of a given color remain unaltered in reconstructing the image. Sections 7.2, 7.4, and 7.6 deal with this and with other aspects of the digitization problem. Another set of problems in processing such images involves transforming them into a set of curves, or going back from a set of curves to plane regions. The tracing of the contour of a region is discussed in Section 7.5. Reconstructing the region from its contour, or filling, will be treated in Chapter 8. Instead of finding the contour, one may choose to thin a region to its skeleton, a matchstick type of figure whose curves or lines reflect the shape of the region. Thinning algorithms will be treated in Chapter 9.

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.

Relevant Literature

  1. Ali, F. and Pavlidis, T. “Syntactic Recognition of Handwritten Numerals,” IEEE Trans. Systems, Man, Cybernetics, SMC-7 (1977), pp. 537–541.

    Article  Google Scholar 

  2. Fu, K. S. Syntactic Methods in Pattern Recognition, New York: Academic Press, 1974, 295pp.

    MATH  Google Scholar 

  3. Fu, K. S. (ed.) Syntactic Pattern Recognition, Applications, Heidelberg: Springer-Verlag, 1977, 270pp.

    MATH  Google Scholar 

  4. Kelley, J. L. General Topology, Princeton, N.J.: Van Nostrand, 1955.

    MATH  Google Scholar 

  5. Morrin, T. H. “Chain-Link Compression of Arbitrary Black-White Images,” CGIP, 5 (1976), pp. 172–189.

    Google Scholar 

  6. Mylopoulos, J. and Pavlidis, T. “On the Topological Properties of Quantized Spaces,” JACM, 18 (April 1971), Part I pp. 239–246, Part II pp. 247–254.

    Google Scholar 

  7. Pavlidis, T. “A Minimum Storage Boundary Tracing Algorithm and its Application in Automatic Inspection,” IEEE Trans. Systems, Man, Cybernetics, SMC-8 (1978), pp. 66–69.

    Google Scholar 

  8. Pavlidis, T. “A Review of Algorithms for Shape Analysis,” CGIP, 7 (April 1978), pp. 243–258.

    Google Scholar 

  9. Pavlidis, T. “Algorithms for Shape Analysis of Contours and Waveforms,” IEEE Trans. Pattern Analysis and Machine Intelligence, PAMI-2 (July 1980), pp. 301–312.

    Article  Google Scholar 

  10. Rosenfeld, A. “Connectivity in Digital Pictures,” JACM, 17 (1970) pp. 146–160.

    Article  MATH  MathSciNet  Google Scholar 

  11. Sobel, I. “Neighborhood Coding of Binary Images for Fast Contour Following and General Binary Array Processing,” CGIP, 8 (August 1978), pp. 127–135.

    Google Scholar 

  12. Ullmann, J. R. “Picture Analysis in Character Recognition,” in Digital Picture Analysis, (A. Rosenfeld, ed.), Heidelberg: Springer 1976, pp. 295–343.

    Google Scholar 

  13. Wu, L. D. “On Freeman’s Conjecture about the Chain Code of a Line,” Proc. Fifth Intern. Conf. on Pattern Recognition, Miami Beach, December 1980, pp. 32–34. (Published by IEEE Computer Society, IEEE Catalog No. 80CH1499–3.)

    Google Scholar 

  14. Yamamoto, K. and Mori, S. “Recognition of handprinted characters by outermost point method,” Proc. Fourth Intern. Joint Conf. on Pattern Recognition, Kyoto, November 1978, pp. 794–796.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1982 Computer Science Press, Inc.

About this chapter

Cite this chapter

Pavlidis, T. (1982). Bilevel Pictures. In: Algorithms for Graphics and Image Processing. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-93208-3_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-93208-3_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-93210-6

  • Online ISBN: 978-3-642-93208-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics