Selection of relevant nodes from component-trees in linear time - Université de Reims Champagne-Ardenne Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

Selection of relevant nodes from component-trees in linear time

Résumé

Component-trees associate to a discrete grey-level image a descriptive data structure induced by the inclusion relation between the binary components obtained at successive level-sets. This article presents a method to extract a subset of the component-tree of an image enabling to fit at best a given binary target selected beforehand in the image. A proof of the algorithmic efficiency of this method is proposed. Application examples related to the extraction of drop caps from ancient documents emphasise the usefulness of this technique in the context of assisted segmentation.
Fichier principal
Vignette du fichier
Passat_DGCI_2011.pdf (375.16 Ko) Télécharger le fichier
Passat DGCI 2011 Poster.pdf (642.7 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01695039 , version 1 (28-02-2018)

Identifiants

Citer

Nicolas Passat, Benoît Naegel. Selection of relevant nodes from component-trees in linear time. Discrete Geometry for Computer Imagery (DGCI), 2011, Nancy, France. pp.453-464, ⟨10.1007/978-3-642-19867-0_38⟩. ⟨hal-01695039⟩
91 Consultations
94 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More