Skip to main content

Parallel thinning algorithm based on the wave propagation's model

  • Posters
  • Conference paper
  • First Online:
Computer Analysis of Images and Patterns (CAIP 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 970))

Included in the following conference series:

  • 111 Accesses

Abstract

A pseudo one pass parallel thinning algorithm using 3×3 masks is proposed. Since electromagnetic waves propagate along the direction of wave vector, we suggest verifying for each edge point its interior normal neighbor (INN), the nearest neighbor to the wave vector. In each iteration, the algorithm first marks all edge points to differentiate edge and interior pixels and then it erases all removal edge points in one scan. Due to INN, the few masks used have a size of 3×3 and less than half of mask pixels need verification. The algorithm is fast and easy to implement. Properties are proved and results presented.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. Blum, “A transformation for extracting new descriptors of shape”, Symp. Models Percep. Speech Visual Form, M.I.T. Press, Cambridge, MA, 1964.

    Google Scholar 

  2. L. Calabi & W.E. Hartnett, “Shape recognition, prairie fires, convex deficiencies and skeletons”, Amer. Math. Monthly, vol. 75, no. 4, 335–342,1968.

    Google Scholar 

  3. C. Arcelli, L.P. Cordella & S. Levialdi, “From local maxima to connected skeletons” IEEE Trans. PAMI, vol. 3, no. 2, 134–143,1981.

    Google Scholar 

  4. Xia, “Skeletonization via the realization of the fire front's propagation and extinction in digital binary shapes”, IEEE Trans. PAMI, vol. 11, no. 10, 1076–1086,1989.

    Google Scholar 

  5. N.J. Naccachi & R. Shinghal, “SPTA: A proposed algorithm for thinning binary patterns”, IEEE. Trans. SMC, vol. 14, no. 3, 409–418,1984.

    Google Scholar 

  6. C. Arcelli & G. Sanniti di Baja, “A Width-independent Fast Thinning Algorithm”, IEEE Trans. PAMI, vol. 7, no. 4, 1985, 463–474.

    Google Scholar 

  7. L. Lam, S.W. Lee & C.Y. Suen, “Thinning methodologies — a comprehensive survey”, IEEE Trans. PAMI, vol. 14, no. 9, 869–885,1992.

    Google Scholar 

  8. T.Y. Zhang & C.Y. Suen, “A fast parallel algorithm for thinning digital patterns”, Commun. ACM, vol. 27, no. 3, 237–239,1984.

    Google Scholar 

  9. S. Suzuki & K. Abe, “Binary picture thinning by an iterative parallel two-subcycle operation”, Pattern Recognition, vol. 20, no. 3, 297–307,1987.

    Google Scholar 

  10. M.V. Nagendraprasad, P.S.P. Wang & A. Gupta, “An improved algorithm for thinning binary patterns”, Proc. 11th ICPR, the Hague, the Netherland, 386–389, 1992.

    Google Scholar 

  11. B.K. Jang & R.T. Chin, “One-pass parallel thinning: analysis, properties and quantitive evaluation”, IEEE Trans. PAMI, vol. 14, no. 11, 1129–1240,1992.

    Google Scholar 

  12. Xia, “A new thinning algorithm for binary images”, 8th ICPR, Paris, 995–997,1986.

    Google Scholar 

  13. M. Born & E. Wolf, Principle of Optics, New York: Pergamon, 5th ed. 1975.

    Google Scholar 

  14. T. Toffoli & N. Margolus, Cellular Automata Machines, MIT Press, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Václav Hlaváč Radim Šára

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Xia, F. (1995). Parallel thinning algorithm based on the wave propagation's model. In: Hlaváč, V., Šára, R. (eds) Computer Analysis of Images and Patterns. CAIP 1995. Lecture Notes in Computer Science, vol 970. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60268-2_405

Download citation

  • DOI: https://doi.org/10.1007/3-540-60268-2_405

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60268-2

  • Online ISBN: 978-3-540-44781-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics