Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

ICPR
2008
IEEE

favoriteEmaildiscussreport

184views Computer Vision» more ICPR 2008»

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

13 years 11 months ago

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

Download figment.cse.usf.edu

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.

Alexander Kolesnikov

Real-time Traffic

Computer Vision | Fast Online Algorithm | ICPR 2008 | Online Algorithm | Polygonal Approximation |

claim paper

Related Content

» Multiresolution Approximation of Polygonal Curves in Linear Complexity

» Speeding up Simplification of Polygonal Curves using Nested Approximations

» Constrained piecewise linear approximation of digital curves

» Document reconstruction using dynamic programming

» FPGABased Content Protection System for Embedded Consumer Electronics

» Automated Online Mechanism Design and Prophet Inequalities

» Activitydriven clock design for low power circuits

» Performance optimal processor throttling under thermal constraints

» NESTA A Fast and Accurate FirstOrder Method for Sparse Recovery

Post Info
More Details (n/a)

Added	30 May 2010
Updated	30 May 2010
Type	Conference
Year	2008
Where	ICPR
Authors	Alexander Kolesnikov

Comments (0)