Fast Polygonal Approximation of Digital Curves

  • Authors:
  • I. Debled-Rennesson;S. Tabbone;L. Wendling

  • Affiliations:
  • LORIA-INRIA, France;LORIA-INRIA, France;LORIA-INRIA, France

  • Venue:
  • ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 1 - Volume 01
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we have extended the approach defined in [Segmentation of Discrete Curves into Fuzzy Segments, Segmentation of Discrete Curvesinto 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.