Relaxed Cheeger Cut for Image SegmentationReport as inadecuate

Relaxed Cheeger Cut for Image Segmentation - Download this document for free, or read online. Document in PDF available to download.

1 LaBRI - Laboratoire Bordelais de Recherche en Informatique 2 IMS - Laboratoire de l-intégration, du matériau au système

Abstract : 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.

Author: Ludovic Paulhac - Vinh-Thong Ta - Rémi Mégret -



Related documents