DocumentCode :
419539
Title :
Fast polygonal approximation of digital curves
Author :
Debled-Rennesson, I. ; Tabbone, S. ; Wendlin, L.
Author_Institution :
Fac. des Sci., LORIA-INRIA, Vandoeuvre-les-Nancy, France
Volume :
1
fYear :
2004
fDate :
23-26 Aug. 2004
Firstpage :
465
Abstract :
In this paper, we have extended the approach defined in to a multiorder analysis. The approach is based on the arithmetical definition of discrete lines with variable thickness. We provide a framework to analyse a digital curve at different levels of thickness. The extremities points of a segment provided at a high resolution are tracked at lower resolution in order to refine their locations. The high resolution level is automatically defined from the stability of the number of segments between two consecutive levels. The method is threshold-free and automatically provides a partitioning of a digital curve into its meaningful parts.
Keywords :
approximation theory; image resolution; image segmentation; digital curves; extremities points; image resolution; image segmentation; multiorder analysis; polygonal approximation; stability; Approximation error; Approximation methods; Design methodology; Dynamic programming; Extremities; Fuzzy logic; Iterative algorithms; Noise level; Stability; Thickness control;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Pattern Recognition, 2004. ICPR 2004. Proceedings of the 17th International Conference on
ISSN :
1051-4651
Print_ISBN :
0-7695-2128-2
Type :
conf
DOI :
10.1109/ICPR.2004.1334165
Filename :
1334165
Link To Document :
بازگشت