2D parallel thinning and shrinking based on sufficient conditions for topology preservation

Thinning 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 con...

Full description

Saved in:
Bibliographic Details
Main Authors: Németh Gábor
Kardos Péter
Palágyi Kálmán
Corporate Author: Conference for PhD Students in Computer Science (7.) (2010) (Szeged)
Format: Article
Published: 2011
Series:Acta cybernetica 20 No. 1
Kulcsszavak:Számítástechnika, Kibernetika
Subjects:
doi:10.14232/actacyb.20.1.2011.10

Online Access:http://acta.bibl.u-szeged.hu/12903
Description
Summary:Thinning 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.
Physical Description:125-144
ISSN:0324-721X