Fast guaranteed polygonal approximations of closed digital curves

Authors:
Fabien Feschet
Affiliations:
LLAIC1 Laboratory, IUT Clermont-Ferrand, Aubière Cedex, France
Venue:
SCIA'05 Proceedings of the 14th Scandinavian conference on Image Analysis
Year:
2005

Citing 13
Cited 2

On the Detection of Dominant Points on Digital Curves

IEEE Transactions on Pattern Analysis and Machine Intelligence
An algorithm for detection of dominant points and polygonal approximation of digitized curves

Pattern Recognition Letters
Optimum polygonal approximation of digitized curves

Pattern Recognition Letters
Another look at the dominant point detection of digital curves

Pattern Recognition Letters
Convexity rule for shape decomposition based on discrete contour evolution

Computer Vision and Image Understanding
An efficient algorithm for the optimal polygonal approximation of digitized curves

Pattern Recognition Letters
An automatic and efficient dynamic programming algorithm for polygonal approximation of digital curves

Pattern Recognition Letters
Optimal Time Computation of the Tangent of a Discrete Curve: Application to the Curvature

DCGI '99 Proceedings of the 8th International Conference on Discrete Geometry for Computer Imagery
Reduced-search dynamic programming for approximation of polygonal curves

Pattern Recognition Letters
Hierarchical representation of digitized curves through dominant point detection

Pattern Recognition Letters
Digital straightness: a review

Discrete Applied Mathematics - The 2001 international workshop on combinatorial image analysis (IWCIA 2001)
Canonical representations of discrete curves

Pattern Analysis & Applications
Optimal blurred segments decomposition in linear time

DGCI'05 Proceedings of the 12th international conference on Discrete Geometry for Computer Imagery

A discrete geometry approach for dominant point detection

Pattern Recognition
Dynamic minimum length polygon

IWCIA'11 Proceedings of the 14th international conference on Combinatorial image analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present in this paper a new non-parametric method for polygonal approximations of digital curves. In classical polygonal approximation algorithms, a starting point is randomly chosen on the curve and heuristics are used to ensure its effectiveness. We propose to use a new canonical representation of digital curves where no point is privileged. We restrict the class of approximation polygons to the class of digital polygonalizations of the curve. We describe the first algorithm which computes the polygon with minimal Integral Summed Squared Error in the class in both linear time and space, which is optimal, independently of any starting point.