Fast polygonal approximation of digital curves

Isabelle Debled-Rennesson 1 Salvatore Tabbone 2 Laurent Wendling 2
1 ADAGE - Applying discrete algorithms to genomics
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
2 QGAR - Querying Graphics through Analysis and Recognition
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : In this paper, we have extended the approach defined in "Debled-Rennesson et al, Segmentation of discrete curves into fuzzy segments,IWCIA'03" 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 location. 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.
Type de document :
Communication dans un congrès
17th International Conference on Pattern Recognition - ICPR'04, Aug 2004, Cambridge, United Kingdom, 1, pp.465-468, 2004
Liste complète des métadonnées

https://hal.inria.fr/inria-00100038
Contributeur : Publications Loria <>
Soumis le : mardi 26 septembre 2006 - 10:13:39
Dernière modification le : jeudi 11 janvier 2018 - 06:19:59

Identifiants

  • HAL Id : inria-00100038, version 1

Collections

Citation

Isabelle Debled-Rennesson, Salvatore Tabbone, Laurent Wendling. Fast polygonal approximation of digital curves. 17th International Conference on Pattern Recognition - ICPR'04, Aug 2004, Cambridge, United Kingdom, 1, pp.465-468, 2004. 〈inria-00100038〉

Partager

Métriques

Consultations de la notice

261