Combinatorial pyramids and discrete geometry for energy-minimizing segmentation - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2006

Combinatorial pyramids and discrete geometry for energy-minimizing segmentation

Résumé

This paper defines the basis of a new hierarchical framework for segmentation algorithms based on energy minimization schemes. This new framework is based on two formal tools. First, a combinatorial pyramid encode efficiently a hierarchy of partitions. Secondly, discrete geometric estimators measure precisely some important geometric parameters of the regions. These measures combined with photometrical and topological features of the partition allows to design energy terms based on discrete measures. Our segmentation framework exploits these energies to build a pyramid of image partitions with a minimization scheme. Some experiments illustrating our framework are shown and discussed.
Fichier principal
Vignette du fichier
article.pdf (255.21 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00308162 , version 1 (15-06-2009)

Identifiants

Citer

Martin Braure de Calignon, Luc Brun, Jacques-Olivier Lachaud. Combinatorial pyramids and discrete geometry for energy-minimizing segmentation. Proc. Int. Symposium on Visual Computing (ISVC2006), Nov 2006, Lake Tahoe, Nevada, United States. pp.306--315, ⟨10.1007/11919629_32⟩. ⟨hal-00308162⟩
126 Consultations
228 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More