Two-Dimensional Parallel Thinning Algorithms Based on Critical Kernels

DOI10.1007/S10851-007-0063-0zbMATH Open1523.68123MaRDI QIDQ6483458FDOQ6483458

Authors: Gilles Bertrand, Michel Couprie 

Publication date: 31 March 2009

Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)

Recommendations

• On parallel thinning algorithms: minimal non-simple sets, P-simple points and critical kernels
• A New 3D Parallel Thinning Scheme Based on Critical Kernels
• Isthmus-based parallel and asymmetric 3D thinning algorithms
• Powerful parallel and symmetric 3D thinning schemes based on critical kernels
• 2D parallel thinning and shrinking based on sufficient conditions for topology preservation

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Computational aspects of digital topology (68U03)

Cited In (8)

• Metrical properties of a collection of 2D parallel thinning algorithms
• On parallel thinning algorithms: minimal non-simple sets, P-simple points and critical kernels
• A 3D sequential thinning scheme based on critical kernels
• Isthmus-based parallel and asymmetric 3D thinning algorithms
• Powerful parallel and symmetric 3D thinning schemes based on critical kernels
• A New 3D Parallel Thinning Scheme Based on Critical Kernels
• A parallel thinning algorithm for grayscale images
• Title not available (Why is that?)

This page was built for publication: Two-Dimensional Parallel Thinning Algorithms Based on Critical Kernels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6483458)