Pattern Recognition Letters
Optimum polygonal approximation of digitized curves
Pattern Recognition Letters
An algorithm for polygonal approximation based on iterative point elimination
Pattern Recognition Letters
Optimized polygonal approximation by dominant point deletion
Pattern Recognition
Dominant point detection by reverse polygonization of digital curves
Image and Vision Computing
Polygonal approximation of digital planar curves through break point suppression
Pattern Recognition
Dominant point detection: A new proposal
Image and Vision Computing
| Hi-index | 0.00 |
In this work, we propose a new unsupervised stop condition for heuristic methods that employ break point suppression to obtain polygonal approximations. Using a stop condition, these heuristic methods delete redundant break points until a required level of approximation is satisfied. The new stop condition is based on the optimisation of the F"2 measure. Comparisons with original stop conditions of several methods show that the new stop condition yields a measurable improvement in the approximation. The polygonal approximations obtained with the new stop condition are more efficient and better adjusted to the original contours. The new stop condition can be combined with supervised optimal methods to obtain a reference approximation of the original contour with a minimum number of points. In this case, the resulting methods are unsupervised methods.