loading...
Fast Polygonal Approximation of Digital Curves
Cambridge UK August 23-August 26
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICPR.2004.133416517th International Conference on Patt ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
I. Debled-Rennesson, LORIA-INRIA, France
S. Tabbone, LORIA-INRIA, France
L. Wendling, LORIA-INRIA, France
In this paper, we have extended the approach defined in [Segmentation of Discrete Curves into Fuzzy Segments, Segmentation of Discrete Curves into Fuzzy Segments, extented version] to a multiorder analysis. The approach is based on the arithmetical definition of discrete lines [G?om?trie discr?te, calculs en nombre entiers et algorithmique] 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.
Citation:
I. Debled-Rennesson, S. Tabbone, L. Wendling, "Fast Polygonal Approximation of Digital Curves," icpr, vol. 1, pp.465-468, 17th International Conference on Pattern Recognition (ICPR'04) - Volume 1, 2004
Usage of this product signifies your acceptance of the Terms of Use.