Sciweavers

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

10

DGCI
2006
Springer

favoriteEmaildiscussreport

114views Discrete Geometry» more DGCI 2006»

Fast Polynomial Segmentation of Digitized Curves

13 years 6 months ago

Fast Polynomial Segmentation of Digitized Curves

Download inwe.hogent.be

We propose a linear-time algorithm for curve segmentation which is based on constructive polynomial fitting. This work extends previous work on constructive fitting by taking the topological properties of a digitized curve into account. The algorithm uses uniform (or L) fitting and it works for segments of arbitrary thickness. We illustrate the algorithm with the segmentation of contours into straight and parabolic segments.

Peter Veelaert, Kristof Teelen

Real-time Traffic

Algorithm | Constructive Polynomial Fitting | Curve Segmentation | DGCI 2006 | Discrete Geometry |

claim paper

Related Content

» Applications of Digital Straight Segments to Economical Image Encoding

» A Fast Corner Detection Algorithm Based on Area Deviation

» Fast And Robust Dominant Points Detection On Digital Curves

» An online polygonal approximation of digital signals and curves with Dynamic Programming a...

» Constrained piecewise linear approximation of digital curves

» Boundary Estimation from IntensityColor Images with Algebraic Curve Models

» A novel segmentation algorithm for pulmonary nodule in chest radiograph

» Efficient design of 2D nonseparable filters of low complexity

» Direct Segmentation for Reverse Engineering

Post Info
More Details (n/a)

Added	13 Oct 2010
Updated	13 Oct 2010
Type	Conference
Year	2006
Where	DGCI
Authors	Peter Veelaert, Kristof Teelen

Comments (0)