Parallel thinning algorithm based on the wave propagation's model

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


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [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. [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. [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. [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. [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. [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. [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. [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. [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. [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. [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. [12]
    Xia, “A new thinning algorithm for binary images”, 8th ICPR, Paris, 995–997,1986.Google Scholar
  13. [13]
    M. Born & E. Wolf, Principle of Optics, New York: Pergamon, 5th ed. 1975.Google Scholar
  14. [14]
    T. Toffoli & N. Margolus, Cellular Automata Machines, MIT Press, 1987.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Franck Xia
    • 1
  1. 1.Department of Information SystemsUniversity of MacauMacau

Personalised recommendations