Three-dimensional object recognition from single two-dimensional images
Artificial Intelligence
Pattern Recognition Letters
Optimum polygonal approximation of digitized curves
Pattern Recognition Letters
Techniques for Assessing Polygonal Approximations of Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
Breakpoint Detection Using Covariance Propagation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Locating Perceptually Salient Points on Planar Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
Comparison of Methods for Detecting Corner Points from Digital Curves
Selected Papers from the First International Workshop on Graphics Recognition, Methods and Applications
A novel approach to polygonal approximation of digital curves
Journal of Visual Communication and Image Representation
Unimodal thresholding for edge detection
Pattern Recognition
Polygonal approximation of digital planar curves through break point suppression
Pattern Recognition
Dominant point detection: A new proposal
Image and Vision Computing
A methodology for quantitative performance evaluation of detection algorithms
IEEE Transactions on Image Processing
ISE-bounded polygonal approximation of digital curves
Pattern Recognition Letters
A novel framework for making dominant point detection methods non-parametric
Image and Vision Computing
Hi-index | 0.01 |
This paper presents a novel method for assessing the accuracy of unsupervised polygonal approximation algorithms. This measurement relies on a polygonal approximation called the ''reference approximation''. The reference approximation is obtained using the method of Perez and Vidal [11] by an iterative method that optimizes an objective function. Then, the proposed measurement is calculated by comparing the reference approximation with the approximation to be evaluated, taking into account the similarity between the polygonal approximation and the original contour, and penalizing polygonal approximations with an excessive number of points. A comparative experiment by using polygonal approximations obtained with commonly used algorithms showed that the proposed measurement is more efficient than other proposed measurements at comparing polygonal approximations with different number of points.