An online polygonal approximation of digital signals and curves with Dynamic Programming algorithm

A fast online algorithm was developed for polygonal approximation of signals and curves with a minimum number of line segments for a given constraint on the standard deviation of the approximation error. A continuous Dynamic Programming search with piecewise backtracking of the locally optimal solutions is performed in overlapping windows. The developed online algorithm can be used for polygonal approximation of data streams, time series, digital signals, curves, and trajectories.

• Type: Conference
• Year: 2008
• Where: ICPR
• Authors: Alexander Kolesnikov
• Keywords: Computer Vision, Fast Online Algorithm, ICPR 2008, Online Algorithm, Polygonal Approximation