Constrained piecewise linear approximation of digital curves

Author

Kolesnikov, Alexander

Author_Institution

Dept. of Comput. Sci. & Stat., Univ. of Joensuu, Joensuu

fYear

2008

fDate

8-11 Dec. 2008

Firstpage

1

Lastpage

4

Abstract

We have considered a problem of continuous piecewise linear approximation of the digital curves with a minimum number of the line segments. Fast sub-optimal 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 reduced-search dynamic programming algorithm to get a practically optimal solution in a few iterations. The proposed algorithms have demonstrated both high efficiency and time performance.

Keywords

approximation theory; dynamic programming; image representation; image segmentation; piecewise linear techniques; constrained piecewise linear approximation; digital curves; fast suboptimal algorithm; line segments; reduced-search dynamic programming algorithm; Approximation algorithms; Approximation error; Computer science; Dynamic programming; Heuristic algorithms; Image analysis; Lagrangian functions; Piecewise linear approximation; Piecewise linear techniques; Statistics;

fLanguage

English

Publisher

ieee

Conference_Titel

Pattern Recognition, 2008. ICPR 2008. 19th International Conference on

Conference_Location

Tampa, FL

ISSN

1051-4651

Print_ISBN

978-1-4244-2174-9

Electronic_ISBN

1051-4651

Type

conf

DOI

10.1109/ICPR.2008.4761656

Filename

4761656