Arc segmentation in linear time - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

Arc segmentation in linear time

Résumé

A linear algorithm based on a discrete geometry approach is proposed for the detection of digital arcs and digital circles using a new representation of them. It is introduced by inspiring from the work of Latecki. By utilizing this representation, we transform the problem of digital arc detection into a problem of digital straight line recognition. We then develop a linear method for arc segmentation of digital curves.
Fichier principal
Vignette du fichier
arcsegmentation_caip.pdf (241.72 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00594835 , version 1 (21-05-2011)

Identifiants

  • HAL Id : hal-00594835 , version 1

Citer

Thanh Phuong Nguyen, Isabelle Debled-Rennesson. Arc segmentation in linear time. 14th International Conference on Computer Analysis of Images and Patterns - CAIP 2011, Aug 2011, Seville, Spain. pp.8. ⟨hal-00594835⟩
216 Consultations
441 Téléchargements

Partager

Gmail Facebook X LinkedIn More