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
Segmentation of edges into lines and arcs
Image and Vision Computing
Optimum polygonal approximation of digitized curves
Pattern Recognition Letters
Numerical methods for approximating digitized curves by piecewise circular arcs
Proceedings of the 6th international congress on Computational and applied mathematics
Techniques for Assessing Polygonal Approximations of Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
IEEE Transactions on Pattern Analysis and Machine Intelligence
Pattern Recognition Letters
Pattern Recognition Letters
Pattern Recognition Letters
Reduced-search dynamic programming for approximation of polygonal curves
Pattern Recognition Letters
Approximation of digital curves with line segments and circular arcs using genetic algorithms
Pattern Recognition Letters
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
Trajectory clustering: a partition-and-group framework
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Data reduction of large vector graphics
Pattern Recognition
Minimum description length approximation of digital curves
ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
Trajectory representation in location-based services: problems & solution
WISEW'03 Proceedings of the Fourth international conference on Web information systems engineering workshops
Approximation of a polyline with a sequence of geometric primitives
ICIAR'06 Proceedings of the Third international conference on Image Analysis and Recognition - Volume Part II
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
| Hi-index | 0.10 |
This paper examines a problem in the multi-model representation of digital curves. It presents Dynamic Programming algorithms for curves approximation with a Minimum Description Length for a given error threshold with measure L"~ or L"2. For the error measure L"~, the optimal algorithm was based on a search for the shortest path in the weighted multigraph constructed on the vertices of the curve. As for the case with an approximation with L"2-norm, the optimal algorithm includes the construction of the shortest path in two-dimensional search space. We then proposed various fast and efficient versions of the algorithms for the solution of the problem. We proceeded to test these algorithms on large-size contours and were able to demonstrate a good trade-off between time performance and the efficiency of the solutions. We were thus able to produce results for the optimal and fast near-optimal algorithms for a two-model approximation with line segments and circular arcs. In addition, the proposed algorithm was demonstrated on the adaptive motion model for trajectory segmentation.