Skip to Main content Skip to Navigation

Paradigmes de segmentation de graphe : comparaisons et applications en traitement d'images

Cédric Allène 1, 2 
2 imagine [Marne-la-Vallée]
LIGM - Laboratoire d'Informatique Gaspard-Monge, CSTB - Centre Scientifique et Technique du Bâtiment, ENPC - École des Ponts ParisTech
Abstract : Graph segmentation techniques are often used in image processing since an image can be seen as a weighted graph. In this thesis, we show some links existing between several weighted graph segmentation paradigms. We first present different definitions of watersheds and select the one which framework allows comparison with specific spanning forests. We show that such a watershed relative to arbitrary markers is equivalent to a cut induced by a shortest path spanning forest. Then, cuts induced by minimum spanning forests are demonstrated as being particular cases which advantageously avoid some undesirable results. Finally, we show that minimum cuts coincide with cuts induced by maximum spanning forests for some particular weight functions. In a second part, we present two applications using graph segmentation : image renaissance and texture blending for 3D reconstruction
Document type :
Complete list of metadata

Cited literature [224 references]  Display  Hide  Download
Contributor : ABES STAR :  Contact
Submitted on : Thursday, November 4, 2010 - 10:46:39 AM
Last modification on : Saturday, January 15, 2022 - 3:57:33 AM
Long-term archiving on: : Saturday, February 5, 2011 - 2:45:33 AM


Version validated by the jury (STAR)


  • HAL Id : tel-00532601, version 1


Cédric Allène. Paradigmes de segmentation de graphe : comparaisons et applications en traitement d'images. Informatique et langage [cs.CL]. Université Paris-Est, 2009. Français. ⟨NNT : 2009PEST1012⟩. ⟨tel-00532601⟩



Record views


Files downloads