On the Detection of Dominant Points on Digital Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
Non-parametric dominant point detection
Pattern Recognition
Pattern Recognition Letters
Techniques for Assessing Polygonal Approximations of Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
A boundary concavity code to support dominant point detection
Pattern Recognition Letters
Detection of Dominant Points Based on Noise Suppression and Error Minimisation
ICITA '05 Proceedings of the Third International Conference on Information Technology and Applications (ICITA'05) Volume 2 - Volume 02
Optimized polygonal approximation by dominant point deletion
Pattern Recognition
Dominant point detection by reverse polygonization of digital curves
Image and Vision Computing
Optimal blurred segments decomposition of noisy shapes in linear time
Computers and Graphics
Curvature estimation in noisy curves
CAIP'07 Proceedings of the 12th international conference on Computer analysis of images and patterns
A discrete geometry approach for dominant point detection
Pattern Recognition
| Hi-index | 0.00 |
A new and fast method for dominant point detection and polygonal representation of a discrete curve is proposed. Starting from results of discrete geometry [1, 2], the notion of maximal blurred segment of width ν has been proposed, well adapted to possibly noisy and/or not connected curves [3]. For a given width, the dominant points of a curve C are deduced from the sequence of maximal blurred segments of C in O(n log2 n) time. Comparisons with other methods of the literature prove the efficacity of our approach.