Sciweavers

Share
ICPR
2008
IEEE

Constrained piecewise linear approximation of digital curves

10 years 7 months ago
Constrained piecewise linear approximation of digital curves
We have considered a problem of continuous piecewise linear approximation of the digital curves with a minimum number of the line segments. Fast suboptimal algorithm for constrained piecewise linear approximation is suggested to construct continuous piecewise linear representation of the input curve for a given error bound. The proposed fast sub-optimal algorithm can be used in combination with ReducedSearch Dynamic Programming algorithm to get a practically optimal solution in a few iterations. The proposed algorithms have demonstrated both high efficiency and time performance.
Alexander Kolesnikov
Added 30 May 2010
Updated 30 May 2010
Type Conference
Year 2008
Where ICPR
Authors Alexander Kolesnikov
Comments (0)
books