Skip to main content

A New Contour Generation Thinning Algorithm

  • Chapter
Visual Form
  • 113 Accesses

Abstract

Xu and Wang’s Contour Generation Thinning Algorithm is a sequential algorithm as defined by Rosenfeld. It is an iterative procedure where pixels belonging to the contours of the components are processed from a queue of pointers and as a result of the processing, the pointers of new contour pixels are put into another queue. The order in which the contour pixels are placed in and processed from the queue affects the final result. In many instances, spurious end points are generated.

A new algorithm is proposed where the removal condition is related to the idea of multiple pixels. It is a parallel algorithm in which the order of execution of contour pixels will not affect the shape of the skeleton.

A further improvement is in the incorporation of a set of flags in each pixel to denote the direction of propagation of the wave front. The use of these flags reduces the computations involved in determining whether a pixel is multiple or not. After the removal of a non-multiple pixel, the interior pixels which become the new contour can be identified directly using these directions. Furthermore, those interior pixel will inherit these directions and their flags can be set accordingly. In this way, a very efficient algorithm has been constructed.

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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. C. Arcelli. “Pattern thinning by contour tracing”, Computer Graphics and Image Processing, vol. 17, no. 2, pp. 130–144, 1980.

    Article  Google Scholar 

  2. Pavlidis, T. “A thinning algorithm for discrete binary images”, Computer Graphics and Image Processing, vol. 13, pp. 142–157, 1980.

    Article  Google Scholar 

  3. W. Xu and C. Wang. “CGT: a fast thinning algorithm implemented on a sequential computer”, IEEE Trans. Systems, Man and Cybernetics, vol. SMC-17, no. 5, pp. 847–851, 1987.

    Google Scholar 

  4. P.C.K. Kwok. “A thinning algorithm by contour generation”, Communications ACM, vol. 31, no. 11, pp. 1314–1324, 1988.

    Article  Google Scholar 

  5. H. Freeman. “On the encoding of arbitrary geometric configuration”, IEEE Trans. Electronic Computers, vol. EC-10, pp. 260–268, 1961.

    Article  MathSciNet  Google Scholar 

  6. N.J. Naccache and R. Shinghal. “SPTA: a proposed algorithm for thinning binary patterns. IEEE Trans. Systems, Man and Cybernetics, vol. SMC-14, no. 3, pp. 409–418, 1984.

    Article  Google Scholar 

  7. T.Y. Zhang and C.Y. Suen. “A fast parallel algorithm for thinning digital patterns”, Communications ACM, vol. 27, no. 3, pp. 236–239, 1984.

    Article  Google Scholar 

  8. A. Rosenfeld and J.L. Pfaltz. “Sequential operations in digital picture processing”, Journal ACM, vol. 13, no. 4, pp. 471–494, 1966.

    Article  MATH  Google Scholar 

  9. L. J. van Vliet and B. J.H. Verwer. “A contour processing method for fast binary neighbourhood operations”, Pattern Recognition Letters, vol. 7, pp. 27–36, 1988.

    Article  Google Scholar 

  10. B.J.H. Verwer. “Improved metrics in image processing applied to the Hilditch skeleton”, Proceedings of the 9th International Conference on Pattern Recognition, vol. 1, pp. 137–142, 1988.

    Google Scholar 

  11. I. Sobel. “Neighborhood coding of binary images for fast contour following and general binary array processing”, Computer Graphics and Image Processing, vol. 8, pp. 127–135.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer Science+Business Media New York

About this chapter

Cite this chapter

Kwok, P.C.K. (1992). A New Contour Generation Thinning Algorithm. In: Arcelli, C., Cordella, L.P., di Baja, G.S. (eds) Visual Form. Springer, Boston, MA. https://doi.org/10.1007/978-1-4899-0715-8_34

Download citation

  • DOI: https://doi.org/10.1007/978-1-4899-0715-8_34

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4899-0717-2

  • Online ISBN: 978-1-4899-0715-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics