Computer Vision and Image Understanding
CONDENSATION—Conditional Density Propagation forVisual Tracking
International Journal of Computer Vision
Shape Similarity Measure Based on Correspondence of Visual Parts
IEEE Transactions on Pattern Analysis and Machine Intelligence
Probabilistic Detection and Tracking of Motion Boundaries
International Journal of Computer Vision - Special issue on Genomic Signal Processing
Contour Tracking by Stochastic Propagation of Conditional Density
ECCV '96 Proceedings of the 4th European Conference on Computer Vision-Volume I - Volume I
FORMS: a flexible object recognition and modelling system
ICCV '95 Proceedings of the Fifth International Conference on Computer Vision
Shock Graphs and Shape Matching
ICCV '98 Proceedings of the Sixth International Conference on Computer Vision
Recognition of Shapes by Editing Their Shock Graphs
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
Path Similarity Skeleton Graph Matching
IEEE Transactions on Pattern Analysis and Machine Intelligence
EMMCVPR'07 Proceedings of the 6th international conference on Energy minimization methods in computer vision and pattern recognition
Nonparametric belief propagation
CVPR'03 Proceedings of the 2003 IEEE computer society conference on Computer vision and pattern recognition
PAMPAS: real-valued graphical models for computer vision
CVPR'03 Proceedings of the 2003 IEEE computer society conference on Computer vision and pattern recognition
Hi-index | 0.00 |
We present a novel method to obtain high quality skeletons of binary shapes. The obtained skeletons are connected and one pixel thick. They do not require any pruning or any other post-processing. The computation is composed of two major parts. First, a small set of salient contour points is computed. We use Discrete Curve Evolution, but any other robust method could be used. Second, particle filters are used to obtain the skeleton. The main idea is that the particles walk along the skeletal paths between pairs of the salient points. We provide experimental results that clearly demonstrate that the proposed method significantly outperforms other well-known methods for skeleton computation.