Reduced-search dynamic programming for approximation of polygonal curves

Authors:
Alexander Kolesnikov;Pasi Fränti
Affiliations:
Department of Computer Science, University of Joensuu, P.O. Box 111, FIN-80101 Joensuu, Finland and Institute of Automation and electrometry, Pr.Ak.Koptyug, 1, Novosibirsk-90, 630090 Russia;Department of Computer Science, University of Joensuu, P.O. Box 111, FIN-80101 Joensuu, Finland
Venue:
Pattern Recognition Letters
Year:
2003

Citing 10
Cited 21

Computational-geometric methods for polygonal approximations of a curve

Computer Vision, Graphics, and Image Processing
A non-parametric sequential method for polygonal approximation of digital curves

Pattern Recognition Letters
Optimum polygonal approximation of digitized curves

Pattern Recognition Letters
Optimal polygonal approximation of digitized curves

Proceedings of the 17th meeting of the Austrian Association for pattern recognition on Image analysis and synthesis
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
Algorithms for straight line fitting using k-means

Pattern Recognition Letters
A new method for polygonal approximation using genetic algorithms

Pattern Recognition Letters
An efficient algorithm for the optimal polygonal approximation of digitized curves

Pattern Recognition Letters
An optimal polygonal boundary encoding scheme in the rate distortion sense

IEEE Transactions on Image Processing

Online Segmentation of Freehand Stroke by Dynamic Programming

ICDAR '05 Proceedings of the Eighth International Conference on Document Analysis and Recognition
Polygonal approximation of closed discrete curves

Pattern Recognition
Optimized polygonal approximation by dominant point deletion

Pattern Recognition
Approximation of Curvature and Velocity for Gesture Segmentation and Synthesis

Gesture-Based Human-Computer Interaction and Simulation
Optimal blurred segments decomposition of noisy shapes in linear time

Computers and Graphics
Tabu split and merge for the simplification of polygonal curves

SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Data reduction of large vector graphics

Pattern Recognition
Polygonal approximation of closed contours

SCIA'03 Proceedings of the 13th Scandinavian conference on Image analysis
Minimum description length approximation of digital curves

ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
A linear algorithm for polygonal approximations of thick curves

CAIP'05 Proceedings of the 11th international conference on Computer Analysis of Images and Patterns
A split-based method for polygonal approximation of shape curves

PReMI'05 Proceedings of the First international conference on Pattern Recognition and Machine Intelligence
Fast guaranteed polygonal approximations of closed digital curves

SCIA'05 Proceedings of the 14th Scandinavian conference on Image Analysis
Optimal encoding of vector data with polygonal approximation and vertex quantization

SCIA'05 Proceedings of the 14th Scandinavian conference on Image Analysis
Optimal blurred segments decomposition in linear time

DGCI'05 Proceedings of the 12th international conference on Discrete Geometry for Computer Imagery
Segmentation and multi-model approximation of digital curves

Pattern Recognition Letters
ISE-bounded polygonal approximation of digital curves

Pattern Recognition Letters
A non-heuristic dominant point detection based on suppression of break points

ICIAR'12 Proceedings of the 9th international conference on Image Analysis and Recognition - Volume Part I
Optimal algorithm for lossy vector data compression

ICIAR'07 Proceedings of the 4th international conference on Image Analysis and Recognition
A novel framework for making dominant point detection methods non-parametric

Image and Vision Computing
Polygonal approximation of digital planar curves through vertex betweenness

Information Sciences: an International Journal
A new geometric descriptor for symbols with affine deformations

Pattern Recognition Letters

Quantified Score

Hi-index	0.10

Visualization

Abstract

Approximation of polygonal curves with minimum error (min-ε problem) can be solved by dynamic programming, or by graph-theoretical approach. These methods provide optimal solution but they are slow for a large number of vertices. Faster methods exist but they lack the optimality. We try to bridge the gap between the slow but optimal, and the fast but sub-optimal algorithms by giving a new near-optimal approximation algorithm based on reduced-search dynamic programming. The algorithm can be iterated as many times as further improvement is achieved in the optimization. It is simple, fast, and it has a low space complexity.