A fast sequential method for polygonal approximation of digitized curves
Computer Vision, Graphics, and Image Processing
Optimum Uniform Piecewise Linear Approximation of Planar Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
Computational-geometric methods for polygonal approximations of a curve
Computer Vision, Graphics, and Image Processing
Optimum polygonal approximation of digitized curves
Pattern Recognition Letters
An algorithm for polygonal approximation based on iterative point elimination
Pattern Recognition Letters
Techniques for Assessing Polygonal Approximations of Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
Improving fitting quality of polygonal approximation by using the dynamic programming technique
Pattern Recognition Letters
Pattern Recognition Letters
Reduced-search dynamic programming for approximation of polygonal curves
Pattern Recognition Letters
Detection of Dominant Points Based on Noise Suppression and Error Minimisation
ICITA '05 Proceedings of the Third International Conference on Information Technology and Applications (ICITA'05) Volume 2 - Volume 02
Polygonal approximation of closed discrete curves
Pattern Recognition
A Mutation-Particle Swarm Algorithm for Error-Bounded Polygonal Approximation of Digital Curves
ICIC '08 Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues
Journal of Visual Communication and Image Representation
Expert Systems with Applications: An International Journal
Data reduction of large vector graphics
Pattern Recognition
A new measurement for assessing polygonal approximation of curves
Pattern Recognition
An optimal polygonal boundary encoding scheme in the rate distortion sense
IEEE Transactions on Image Processing
| Hi-index | 0.10 |
In this paper we consider a problem of the polygonal approximation of digital curves with a minimum number of approximation segments for a given error bound with L"2-norm. The Integral Square Error bound is defined by the number of vertices in the curve and by constraint on the Root-Mean-Squared-Error (RMSE) of the polygonal approximation. This paper proposes a new, fast and efficient algorithm for solving the problem. The algorithm that is offered was based on searching for the shortest path in a feasibility graph that has been constructed on the vertices of the input curve. The proposed algorithm provides a solution with 97% optimality on average in what is practically real time. This algorithm can also be used in combination with the Reduced-Search Dynamic Programming algorithm as a preliminary step for finding a near-optimal result in an acceptable time. Experiments conducted with the large size vector data have demonstrated both the high degree of efficiency and the fast performance time of the proposed algorithms. These algorithms can be used in practical applications for image vectorization and segmentation, the analysis of shapes and time series, the simplification of vector maps, and the compression of vector data.