Dominant point detection: A new proposal

A New Algorithm for Polygonal Approximation Based on Ant Colony Optimization

“…The experimental results have been, finally, compared to many existing methods for dominant point detection. In table 3 for each algorithm we show the number of detected point, N p, the approximation error, E 2 , the compression ratio, CR = N/N p, as suggested in [1] and [7] to measure the efficiency of the dominant point detectors and to compare them. Analyzing the table, we can affirm that the proposed approach is superior to many existing algorithms based on exact search methodology, too.…”

“…In shape analysis an important step consists in extracting meaningful features from digital curves. Dominant points are those points that have curvature extreme on the curve and they can suitably describe the curve for both visual perception and recognition [1], [2]. There are many approaches developed for detecting dominant points.…”

A new thresholding approach for automatic generation of polygonal approximations

“…If the number of DP is different, then the parameterized W E 2 has showed better performance [4]. In the experiments, for the sake of completeness, the values of DP , CR, ISE, E ∞ , W E, W E 2 and W E 3 have been used (see tables 1 and 2).…”

“…• Heuristic approach: these methods construct the approximating polygon using some reasonable geometric or perceptual features of the contours [10] -Parametric approach: these methods take into account a parameter to generate the polygonal approximations [2,4,5,7,18,21,22,23].…”

Generalized Hough Transform for Shape Matching

“…Dominant points are those points that have curvature extreme on the curve and they can suitably describe the curve for both visual perception and recognition [3]. Dominant points can be applied to produce a simplified representation of a shape contour for further processing.…”