A Single-Step 2D Thinning Scheme with Deletion of P-Simple Points

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10657)

Abstract

Thinning is a frequently applied technique for producing skeletons from digital binary pictures in a topology-preserving way. Bertrand proposed a two-step thinning scheme that is based on P-simple points. In this paper, we give two sufficient conditions for topology-preserving reductions working on the three possible 2D regular grids. The new conditions combined with parallel thinning strategies and geometrical constraints yield a single-step thinning scheme that deletes solely P-simple points.

Keywords

Shape analysis Digital topology Regular 2D grids Topology preservation P-simple points 

Notes

Acknowledgments

This work was supported by the grant OTKA K112998 of the National Scientific Research Fund.

References

  1. 1.
    Bertrand, G.: On \(P\)-simple points. Compte Rendu de l’Académie des Sciences de Paris, Série Math. I(321), 1077–1084 (1995)MathSciNetMATHGoogle Scholar
  2. 2.
    Bertrand, G.: \(P\)-simple points: a solution for parallel thinning. In: Proceedings of the 5th International Conference on Discrete Geometry for Computer Imagery, DGCI 2005, pp. 233–242 (1995)Google Scholar
  3. 3.
    Bertrand, G., Couprie, M.: Two-dimensional parallel thinning algorithms based on critical kernels. J. Math. Imaging Vis. 31, 35–56 (2008)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Hall, R.W.: Parallel connectivity-preserving thinning algorithms. In: Kong, T.Y., Rosenfeld, A. (eds.) Topological Algorithms for Digital Image Processing, pp. 145–179. Elsevier Science (1996)Google Scholar
  5. 5.
    Kardos, P., Palágyi, K.: On topology preservation in triangular, square, and hexagonal grids. In: Proceedings of the 8th International Symposium on Image and Signal Processing and Analysis, ISPA 2013, pp. 782–787 (2013)Google Scholar
  6. 6.
    Kardos, P., Palágyi, K.: Unified characterization of P-simple points in triangular, square, and hexagonal grids. In: Barneva, R.P., Brimkov, V.E., Tavares, J.M.R.S. (eds.) CompIMAGE 2016. LNCS, vol. 10149, pp. 79–88. Springer, Cham (2017).  https://doi.org/10.1007/978-3-319-54609-4_6 CrossRefGoogle Scholar
  7. 7.
    Kong, T.Y.: On topology preservation in 2-D and 3-D thinning. Int. J. Pattern Recogn. Artif. Intell. 9, 813–844 (1995)CrossRefGoogle Scholar
  8. 8.
    Kong, T.Y., Rosenfeld, A.: Digital topology: introduction and survey. Comput. Vis. Graph. Image Process. 48, 357–393 (1989)CrossRefGoogle Scholar
  9. 9.
    Kovalevsky, V.A.: Geometry of Locally Finite Spaces. Publishing House, Berlin, Germany (2008)Google Scholar
  10. 10.
    Marchand-Maillet, S., Sharaiha, Y.M.: Binary Digital Image Processing - A Discrete Approach. Academic Press, Cambridge (2000)MATHGoogle Scholar
  11. 11.
    Siddiqi, K., Pizer, S. (eds.): Medial Representations - Mathematics, Algorithms and Applications. Computational Imaging and Vision, vol. 37. Springer, Heidelberg (2008).  https://doi.org/10.1007/978-1-4020-8658-8 MATHGoogle Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Department of Image Processing and Computer GraphicsUniversity of SzegedSzegedHungary

Personalised recommendations