Relaxed Cheeger Cut for Image Segmentation - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

Relaxed Cheeger Cut for Image Segmentation

Résumé

Motivated by recent advances in spectral clustering that show the relation between the non linear p-Laplacian graph operator and the Cheeger cut problem, we propose to study and apply this methodology for image segmentation. Based on a ℓ 1 relaxation of the initial clustering problem, we show that these methods can outperform usual well-known graph based approaches, e.g., min-cut/max-flow algorithm or ℓ 2 spectral cluster- ing, for unsupervised and very weakly supervised image segmentation. Experimental results demonstrate the benefits and the relevance of the proposed methodology especially for noisy image or when very few pixels are labeled for interactive image segmentation.
Fichier principal
Vignette du fichier
icpr12.pdf (1.67 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00708970 , version 1 (23-12-2012)

Identifiants

  • HAL Id : hal-00708970 , version 1

Citer

Ludovic Paulhac, Vinh-Thong Ta, Rémi Mégret. Relaxed Cheeger Cut for Image Segmentation. International Conference on Pattern Recognition, 2012, Tsukuba, Japan. ⟨hal-00708970⟩
315 Consultations
99 Téléchargements

Partager

Gmail Facebook X LinkedIn More