An algorithm for the optimum piecewise linear approximation of digitized curves

Author

Pérez, Juan-Carlos ; Vidal, Enrique

Author_Institution

Dept. de Sistemas Inf. y Comput., Univ. Politecnica de Valencia, Spain

fYear

1992

fDate

30 Aug-3 Sep 1992

Firstpage

167

Lastpage

170

Abstract

A dynamic programming algorithm for piecewise linear approximation of a digitized curve is presented. This approximation yields a global minimization of the total error between the approximating straight-line segments and the original points. Many error measures can be used with this algorithm although a lower computational cost can be achieved if error measures that can be computed incrementally are used. Two incremental formulations of classical error measures, along with the results of a sample experiment, are also presented

Keywords

approximation theory; dynamic programming; image processing; image recognition; piecewise-linear techniques; approximating straight-line segments; digitized curve; dynamic programming; error measures; global minimization; image processing; image recognition; incremental formulations; piecewise linear approximation; Approximation algorithms; Computational efficiency; Dynamic programming; Heuristic algorithms; Pattern analysis; Pattern classification; Piecewise linear approximation; Piecewise linear techniques; Signal analysis; Signal processing algorithms;

fLanguage

English

Publisher

ieee

Conference_Titel

Pattern Recognition, 1992. Vol.III. Conference C: Image, Speech and Signal Analysis, Proceedings., 11th IAPR International Conference on

Conference_Location

The Hague

Print_ISBN

0-8186-2920-7

Type

conf

DOI

10.1109/ICPR.1992.201953

Filename

201953