Three-dimensional object recognition from single two-dimensional images
Artificial Intelligence
On the Detection of Dominant Points on Digital Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
Non-parametric dominant point detection
Pattern Recognition
A Theory of Multiscale, Curvature-Based Shape Representation for Planar Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
Detection of significant points and polygonal approximation of digitized curves
Pattern Recognition Letters
An algorithm for detection of dominant points and polygonal approximation of digitized curves
Pattern Recognition Letters
Pattern Recognition Letters
Optimum polygonal approximation of digitized curves
Pattern Recognition Letters
Another look at the dominant point detection of digital curves
Pattern Recognition Letters
Effective classification of planar shapes based on curve segment properties
Pattern Recognition Letters
Techniques for Assessing Polygonal Approximations of Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
Convexity rule for shape decomposition based on discrete contour evolution
Computer Vision and Image Understanding
A boundary concavity code to support dominant point detection
Pattern Recognition Letters
Silhouette-Based Isolated Object Recognition through Curvature Scale Space
IEEE Transactions on Pattern Analysis and Machine Intelligence
On Critical Point Detection of Digital Shapes
IEEE Transactions on Pattern Analysis and Machine Intelligence
Pattern Recognition Letters
Multiscale contour corner detection based on local natural scale and wavelet transform
Image and Vision Computing
A novel approach to polygonal approximation of digital curves
Journal of Visual Communication and Image Representation
Optimized polygonal approximation by dominant point deletion
Pattern Recognition
Dominant point detection by reverse polygonization of digital curves
Image and Vision Computing
Angle Detection on Digital Curves
IEEE Transactions on Computers
Dominant point detection: A new proposal
Image and Vision Computing
Hi-index | 0.00 |
A new algorithm for dominant points of digital planar curves is presented. This algorithm is relied on a new method for quasi-collinear point supression. All the break points are obtained from the initial contour. The proposed algorithm deletes quasi-collinear break points using a variable distance as treshold value. The resultant points are dominant points. This aproximation is compared with other algorithms. The experimental results show that this method works well for digital planar curves with features of several sizes.