A New Sequential Thinning Algorithm to Preserve
Topology and Geometry of the Image

Ashwin.M.; Dinesh Babu.G.

doi:https://doi.org/10.14445/22315373/IJMTT-V2I2P501

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 2 | Issue 2 | Year 2011 | Article Id. IJMTT-V2I2P501 | DOI : https://doi.org/10.14445/22315373/IJMTT-V2I2P501

A New Sequential Thinning Algorithm to Preserve Topology and Geometry of the Image

Ashwin.M., Dinesh Babu.G.

Citation :

Ashwin.M., Dinesh Babu.G., "A New Sequential Thinning Algorithm to Preserve Topology and Geometry of the Image," International Journal of Mathematics Trends and Technology (IJMTT), vol. 2, no. 2, pp. 1-4, 2011. Crossref, https://doi.org/10.14445/22315373/IJMTT-V2I2P501

Abstract

A thinning algorithm is used to reduce unnecessary information by peeling objects layer by layer so that the result is sufficient to allow topological analysis. It has several applications, but is particularly useful for skeletonization. A new sequential thinning algorithm is introduced to preserve both the topology and geometry of the object. In sequential thinning, only a single point may be deleted at a time and it always guarantees the preservation of the topology of the original image. It is based on removing the central pixel in the 3x3 neighborhood of the candidate pixel which preserves the topology and geometry. The algorithm is based on computing the local Euler number before and after removing the candidate pixel and then checking whether there is a difference in the computed values. Furthermore, in order to preserve the geometric criteria (preserve end points of the object), we consider change of the boundary length when removing the central pixel.

Keywords

skeletonization techniques, sequential thinning algorithm

References

1. Sajjad Baloch, and Hamid Krim, Object Recognition through TopoGeometric Shape Models Using Error-Tolerant Sub graph Isomorphisms, IEEE transactions on image processing, vol. 19, no. 5, May 2010
2. Michielsen, K. and De Raedt, H. 2000. Morphological Image Analysis. Computer Physics Communication 132, 94-103.
3. Borgefors.G, Nystrm, I., and Di Bja, G.S. 1999. Computing Skeletons in three dimensions. Pattern Recognition 32, 1225-1236.
4. Toriwaki, J. and Yonekura, T. 2002. Euler Number and Connectivity Indexes of a 3D digital Picture. Review Forma, 17, 183-209.
5. Ohser, J., Nagel, W. and Schladitz, K. 2002. The Euler number of discretized sets - on the choice of adjacency in homogenous lattices. In: Mecke KR, Stoyan D, eds. Morphology of Condensed Matter. Heidelberg: Springer.
6. Ohser, J., Nagel, W. and Schladitz, K. 2003. The Euler number of discretized sets - surprising results in three dimensions. Image Analysis and Stereology 22, 11-19.
7. Serra, J. 1982. Image Analysis and Mathematical Morphology, Vol.1. London: Academic press.
8. Soille, P. 1999. Morphological Image Analysis: Principles and Application.
9. http://www.inf.u-szeged.hu/ lagyi/skel/skel.html
10. Object recognition from sub-sampled image processing submitted by Alex North in September 2005.
11. Skeletons in Digital Image Processing published by Gisela Klette in July 2002.
12. Skeletons in Digital Image Processing published by Gisela Klette in July 2002.
13. Algorithms for 2-Dimensional Object Recognition published by A.Ashbrook and N.A.Thacker in 1998.
14. Digital Image Processing using MATLAB by Gonzalez ,Woods & Eddins, Prentice Hall, 2004.