A graph-cut approach to image segmentation using an affinity graph based on l0−sparse representation of features - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

A graph-cut approach to image segmentation using an affinity graph based on l0−sparse representation of features

Abstract

We propose a graph-cut based image segmentation method by constructing an affinity graph using l0 sparse representation. Computing first oversegmented images, we associate with all segments, that we call superpixels, a collection of features. We find the sparse representation of each set of features over the dictionary of all features by solving a l0-minimization problem. Then, the connection information between superpixels is encoded as the non-zero representation coefficients, and the affinity of connected superpixels is derived by the corresponding representation error. This provides a l0 affinity graph that has interesting properties of long range and sparsity, and a suitable graph cut yields a segmentation. Experimental results on the BSD database demonstrate that our method provides perfectly semantic regions even with a constant segmentation number, but also that very competitive quantitative results are achieved.
Fichier principal
Vignette du fichier
SR-hal.pdf (573.67 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00833278 , version 1 (26-07-2013)

Identifiers

  • HAL Id : hal-00833278 , version 1

Cite

Xiaofang Wang, Huibin Li, Charles-Edmond Bichot, Simon Masnou, Liming Chen. A graph-cut approach to image segmentation using an affinity graph based on l0−sparse representation of features. IEEE International Conference on Image Processing, Sep 2013, Melbourne, Australia. pp.4019-4023. ⟨hal-00833278⟩
432 View
1034 Download

Share

Gmail Facebook X LinkedIn More