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.

• Type: Conference
• Year: 2008
• Where: ICPR
• Authors: Alexander Kolesnikov
• Keywords: Computer Vision, Constrained Piecewise Linear, Continuous Piecewise Linear, ICPR 2008, Piecewise Linear Approximation