Distance transformations in digital images
Computer Vision, Graphics, and Image Processing
Computer Vision, Graphics, and Image Processing
IEEE Transactions on Pattern Analysis and Machine Intelligence
Hierarchical Shape Description Via the Multiresolution Symmetric Axis Transform
IEEE Transactions on Pattern Analysis and Machine Intelligence
Euclidean distance transformations amd model-guided image interpretation
Pattern Recognition Letters
Artificial Intelligence
Finding local maxima in a pseudo-Euclidean distance transform
Computer Vision, Graphics, and Image Processing
Parametrisable skeletonization of binary and multi-level images
Pattern Recognition Letters
Simulating the Grassfire Transform Using an Active Contour Model
IEEE Transactions on Pattern Analysis and Machine Intelligence
Ridge points in Euclidean distance maps
Pattern Recognition Letters
Continuous skeleton computation by Voronoi diagram
CVGIP: Image Understanding
Generating skeletons and centerlines from the distance transform
CVGIP: Graphical Models and Image Processing
Neighborhoods for distance transformations using ordered propagation
CVGIP: Image Understanding
Cortical surface maps and Euclidean skeletons for intersubject brain image registration
Cortical surface maps and Euclidean skeletons for intersubject brain image registration
Sequential Operations in Digital Picture Processing
Journal of the ACM (JACM)
Digital Picture Processing
Veinerization: A New Shape Description for Flexible Skeletonization
IEEE Transactions on Pattern Analysis and Machine Intelligence
Optimal Parallel Algorithms for Finding Proximate Points, with Applications
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Pattern Analysis and Machine Intelligence
Digital distance transforms in 3D images using information from neighbourhoods up to 5 × 5 × 5
Computer Vision and Image Understanding
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
Generation of the Euclidean Skeleton from the Vector Distance Map by a Bisector Decision Rule
CVPR '98 Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
Skeletonization of Ribbon-Like Shapes Based on a New Wavelet Function
IEEE Transactions on Pattern Analysis and Machine Intelligence
Skeletonization based on error reduction
Pattern Recognition
Triangle refinement in a constrained Delaunay triangulation skeleton
Pattern Recognition
IEEE Transactions on Pattern Analysis and Machine Intelligence
Skeleton Pruning by Contour Partitioning with Discrete Curve Evolution
IEEE Transactions on Pattern Analysis and Machine Intelligence
Discrete bisector function and Euclidean skeleton in 2D and 3D
Image and Vision Computing
General neighborhood sequences in Zn
Discrete Applied Mathematics
2D Euclidean distance transform algorithms: A comparative survey
ACM Computing Surveys (CSUR)
Harmonic 1-form based skeleton extraction from examples
Graphical Models
A skeleton family generator via physics-based deformable models
IEEE Transactions on Image Processing
Surface Thinning in 3D Cubical Complexes
IWCIA '09 Proceedings of the 13th International Workshop on Combinatorial Image Analysis
A Voronoi-based model for emergency planning usingsequential-scan algorithms
ISI'09 Proceedings of the 2009 IEEE international conference on Intelligence and security informatics
Polygon subdivision for pocket machining process planning
Computers and Industrial Engineering
EMMCVPR'07 Proceedings of the 6th international conference on Energy minimization methods in computer vision and pattern recognition
Skeleton growing and pruning with bending potential ratio
Pattern Recognition
Linear Time Algorithms for Exact Distance Transform
Journal of Mathematical Imaging and Vision
Robust skeletonization using the discrete λ-medial axis
Pattern Recognition Letters
Skeleton simplification by key points identification
MCPR'10 Proceedings of the 2nd Mexican conference on Pattern recognition: Advances in pattern recognition
Skeleton representation of character based on multiscale approach
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part II
Axial representation of character by using wavelet transform
FSKD'05 Proceedings of the Second international conference on Fuzzy Systems and Knowledge Discovery - Volume Part II
Skeleton pruning by contour partitioning
DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
Discrete bisector function and euclidean skeleton
DGCI'05 Proceedings of the 12th international conference on Discrete Geometry for Computer Imagery
Geographic knowledge discovery from Web Map segmentation through generalized Voronoi diagrams
Expert Systems with Applications: An International Journal
On the generation and pruning of skeletons using generalized Voronoi diagrams
Pattern Recognition Letters
Topological maps and robust hierarchical Euclidean skeletons in cubical complexes
Computer Vision and Image Understanding
Empirical mode decomposition on skeletonization pruning
Image and Vision Computing
Intensity-Based Skeletonization of CryoEM Gray-Scale Images Using a True Segmentation-Free Algorithm
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Automated generation of control skeletons for use in animation
The Visual Computer: International Journal of Computer Graphics
| Hi-index | 0.15 |
The skeleton is an important representation for shape analysis. A common approach for generating discrete skeletons takes three steps: 1) computing the distance map, 2) detecting maximal disks from the distance map, and 3) linking the centers of maximal disks (CMDs) into a connected skeleton. Algorithms using approximate distance metrics are abundant and their theory has been well established. However, the resulting skeletons may be inaccurate and sensitive to rotation. In this paper, we study methods for generating skeletons based on the exact Euclidean metric. We first show that no previous algorithms identifies the exact set of discrete maximal disks under the Euclidean metric. We then propose new algorithms and show that they are correct. To link CMDs into connected skeletons, we examine two prevalent approaches: connected thinning and steepest ascent. We point out that the connected thinning approach does not work properly for Euclidean distance maps. Only the steepest ascent algorithm produces skeletons that are truly medially placed. The resulting skeletons have all the desirable properties: they have the same simple connectivity as the figure, they are well-centered, they are insensitive to rotation, and they allow exact reconstruction. The effectiveness of our algorithms is demonstrated with numerous examples.