Polygonal approximation of 2-D shape through boundary merging
Pattern Recognition Letters
On the Detection of Dominant Points on Digital Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
Detection of significant points and polygonal approximation of digitized curves
Pattern Recognition Letters
Detecting the dominant points by the curvature-based polygonal approximation
CVGIP: Graphical Models and Image Processing
Matching Point Features with Ordered Geometric, Rigidity, and Disparity Constraints
IEEE Transactions on Pattern Analysis and Machine Intelligence
Optimum polygonal approximation of digitized curves
Pattern Recognition Letters
A new split-and-merge technique for polygonal approximation of chain coded curves
Pattern Recognition Letters
Techniques for Assessing Polygonal Approximations of Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
Shortest paths algorithms: theory and experimental evaluation
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Reduced-search dynamic programming for approximation of polygonal curves
Pattern Recognition Letters
Optimized polygonal approximation by dominant point deletion
Pattern Recognition
Polygonal approximation of digital planar curves through break point suppression
Pattern Recognition
Angle Detection on Digital Curves
IEEE Transactions on Computers
A rotationally invariant two-phase scheme for corner detection
Pattern Recognition
Polygonal approximation of closed contours
SCIA'03 Proceedings of the 13th Scandinavian conference on Image analysis
Polygonal approximation of digital planar curves through adaptive optimizations
Pattern Recognition Letters
Hidden Markov Model-Based Weighted Likelihood Discriminant for 2-D Shape Classification
IEEE Transactions on Image Processing
Fuzzy spline interpolation with optimal property in parametric form
Information Sciences: an International Journal
| Hi-index | 0.07 |
Contour polygonal approximation is usually defined as a set of selected points, which describes a polygon and best represents the original contour. This paper presents a novel graph based approach to compute a polygonal approximation of a shape contour. In a graph, such points correspond to a high transitivity region of the graph. We use the vertex betweenness to measure the importance of each vertice in a graph according to the number of shortest paths where each vertice occurs. By selecting the vertices with higher vertex betweenness, a polygon which retains the main characteristics of the contour is achieved. By using benchmark curves, a comparative experiment with other commonly used algorithms is presented. Results indicate that the proposed approach produced efficient and effective polygonal approximations for digital planar curves.