A one-pass thinning algorithm and its parallel implementation

Chin, Roland T.; Wan, Hong-Khoon; Strover, D. L.; Iverson, Rob

doi:10.1016/0734-189x(87)90054-5

Cited by 141 publications

(30 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We propose several new parallel algorithms to compute curvilinear skeletons (Sec. 8), in which topological and geometrical conditions are clearly separated, unlike in many previous works.…”

Section: Introductionmentioning

confidence: 81%

See 1 more Smart Citation

Two-Dimensional Parallel Thinning Algorithms Based on Critical Kernels

Bertrand

Couprie

2008

J Math Imaging Vis

View full text Add to dashboard Cite

Critical kernels constitute a general framework settled in the category of abstract complexes for the study of parallel thinning in any dimension. The most fundamental result in this framework is that, if a subset Y of X contains the critical kernel of X, then Y is guaranteed to have "the same topology as X". Here, we focus on 2D structures in spaces of two and three dimensions. We introduce the notion of crucial pixel which permits to make a link with the framework of digital topology. Thanks to simple local characterizations, we are able to express thinning algorithms by the way of sets of masks. We propose several new parallel algorithms, which are both fast and simple to implement, to obtain symmetrical or non-symmetrical skeletons of 2D objects in 2D or 3D grids. We prove some properties of these skeletons, related to topology preservation, to minimality and to the inclusion of the topological axis which may be seen as a generalization of the medial axis. We also show how to use critical kernels in order to prove very simply the topological soundness of existing thinning schemes. At last, we make clear the link between critical kernels, minimal non-simple sets, and P-simple points.

show abstract

“…We propose several new parallel algorithms to compute curvilinear skeletons (Sec. 8), in which topological and geometrical conditions are clearly separated, unlike in many previous works.…”

Section: Introductionmentioning

confidence: 81%

“…Since then, many 2D parallel thinning algorithms have been proposed, see in particular [41,35,1,32,8,15,14,19,11,2,30]. A fundamental property required for such algorithms is that they do preserve the topology of the original objects.…”

Section: Introductionmentioning

confidence: 99%

Two-Dimensional Parallel Thinning Algorithms Based on Critical Kernels

Bertrand

Couprie

2008

J Math Imaging Vis

View full text Add to dashboard Cite

show abstract

“…3. Thinning by CWSI (Chin et al, 1987) (a), AFP3 (Guo and Hall, 1992) (b), CYS (Chen, 1996) (c). Parker et al (1994) introduced the force-based approach with a new idea for thinning strategy based on a definition of a 'skeletal pixel' as being as far from the object outline as possible while maintaining basic connectivity properties.…”

Section: General Ideas and Examplesmentioning

confidence: 99%

“…The resulting skeleton is then expanded to its original scale. Chin et al (1987) wrote a paper presenting a onesubcycle thinning algorithm and its parallel implementation. They called it a 'one-pass algorithm'.…”

Section: General Ideas and Examplesmentioning

confidence: 99%

K3M: A universal algorithm for image skeletonization and a review of thinning techniques

Saeed¹,

Tabędzki²,

Rybnik³

et al. 2010

International Journal of Applied Mathematics and Computer Science

163

View full text Add to dashboard Cite

This paper aims at three aspects closely related to each other: first, it presents the state of the art in the area of thinning methodologies, by giving descriptions of general ideas of the most significant algorithms with a comparison between them. Secondly, it proposes a new thinning algorithm that presents interesting properties in terms of processing quality and algorithm clarity, enriched with examples. Thirdly, the work considers parallelization issues for intrinsically sequential algorithms of thinning. The main advantage of the suggested algorithm is its universality, which makes it useful and versatile for a variety of applications.

show abstract

“…Since then, many 2D parallel thinning algorithms have been proposed, see for example [25,1,19,7,11,13,9,18]. A fundamental property required for such algorithms is that they do preserve the topology of the original objects.…”

Section: Introductionmentioning

confidence: 99%

New 2D Parallel Thinning Algorithms Based on Critical Kernels

Bertrand

Couprie

2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Critical kernels constitute a general framework settled in the category of abstract complexes for the study of parallel thinning in any dimension. In this context, we propose several new parallel algorithms, which are both fast and simple to implement, to obtain symmetrical skeletons of 2D objects in 2D or 3D grids. We prove some properties of these skeletons, related to topology preservation, and to the inclusion of the topological axis which may be seen as a generalization of the medial axis.

show abstract

A one-pass thinning algorithm and its parallel implementation

Cited by 141 publications

References 10 publications

Two-Dimensional Parallel Thinning Algorithms Based on Critical Kernels

Two-Dimensional Parallel Thinning Algorithms Based on Critical Kernels

K3M: A universal algorithm for image skeletonization and a review of thinning techniques

New 2D Parallel Thinning Algorithms Based on Critical Kernels

Contact Info

Product

Resources

About