2D parallel thinning and shrinking based on sufficient conditions for topology preservation
AbstractThinning and shrinking algorithms, respectively, are capable of extracting medial lines and topological kernels from digital binary objects in a topology preserving way. These topological algorithms are composed of reduction operations: object points that satisfy some topological and geometrical constraints are removed until stability is reached. In this work we present some new sufficient conditions for topology preserving parallel reductions and fiftyfour new 2D parallel thinning and shrinking algorithms that are based on our conditions. The proposed thinning algorithms use five characterizations of endpoints.
Download data is not yet available.
How to Cite
Németh, G., Kardos, P., & Palágyi, K. (2011). 2D parallel thinning and shrinking based on sufficient conditions for topology preservation. Acta Cybernetica, 20(1), 125-144. https://doi.org/10.14232/actacyb.20.1.2011.10