Image Analysis Using Mathematical Morphology
IEEE Transactions on Pattern Analysis and Machine Intelligence
A one-pass thinning algoruthm and its parallel implementation
Computer Vision, Graphics, and Image Processing
Connectivity in Digital Pictures
Journal of the ACM (JACM)
Digital Picture Processing
Image Analysis and Mathematical Morphology
Image Analysis and Mathematical Morphology
Fast Homotopy-Preserving Skeletons Using Mathematical Morphology
IEEE Transactions on Pattern Analysis and Machine Intelligence
One-Pass Parallel Thinning: Analysis, Properties, and Quantitative Evaluation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Morphological Reversible Contour Representation
IEEE Transactions on Pattern Analysis and Machine Intelligence
IEEE Transactions on Pattern Analysis and Machine Intelligence
Morphological Image Processing for Evaluating Malaria Disease
IWVF-4 Proceedings of the 4th International Workshop on Visual Form
Design of a Cellular Architecture for Fast Computation of the Skeleton
Journal of VLSI Signal Processing Systems
Symmetry Maps of Free-Form Curve Segments via Wave Propagation
International Journal of Computer Vision - Special Issue on Computational Vision at Brown University
Adaptive mathematical morphology for edge linking
Information Sciences—Informatics and Computer Science: An International Journal
Decomposition of two-dimensional shapes for efficient retrieval
Image and Vision Computing
Applications of self-organization networks spatially isomorphic to patterns
Information Sciences: an International Journal
Fitting distal limb segments for accurate skeletonization in human action recognition
Journal of Ambient Intelligence and Smart Environments
On the generation and pruning of skeletons using generalized Voronoi diagrams
Pattern Recognition Letters
| Hi-index | 0.15 |
A precise definition of digital skeletons and a mathematical framework for the analysis of a class of thinning algorithms, based on morphological set transformation, are presented. A particular thinning algorithm (algorithm A) is used as an example in the analysis. Precise definitions and analyses associated with the thinning process are presented, including the proof of convergence, the condition for one-pixel-thick skeletons, and the connectedness of skeletons. In addition, a necessary and sufficient condition for the thinning process in general is derived, and an algorithm (algorithm B) based on this condition is developed. Experimental results are used to compare the two thinning algorithms, and issues involving noise immunity and skeletal bias are addressed.