# A convex formulation for global histogram based binary segmentation

Abstract : In this paper, we present a general convex formulation for global histogram-based binary segmentation. The model relies on a data term measuring the histograms of the regions to segment w.r.t. reference histograms as well as TV regularization allowing the penalization of the length of the interface between the two regions. The framework is based on some $l^1$ data term, and the obtained functional is minimized with an algorithm adapted to non smooth optimization. We present the functional and the related numerical algorithm and we then discuss the incorporation of color histograms, cumulative histograms or structure tensor histograms. Experiments show the interest of the method for a large range of data including both gray-scale and color images. Comparisons with a local approach based on the Potts model or with a recent one based on Wasserstein distance also show the interest of our method.
Document type :
Conference papers
Domain :

Cited literature [31 references]

https://hal.archives-ouvertes.fr/hal-00834068
Submitted on : Friday, June 14, 2013 - 10:30:42 AM
Last modification on : Thursday, January 11, 2018 - 6:21:22 AM
Document(s) archivé(s) le : Sunday, September 15, 2013 - 4:10:24 AM

### File

hist_based_segm_EMMCVPR13.pdf
Files produced by the author(s)

### Identifiers

• HAL Id : hal-00834068, version 1

### Citation

Romain Yildizoglu, Jean-François Aujol, Nicolas Papadakis. A convex formulation for global histogram based binary segmentation. International Conference on Energy Minimization Methods in Computer Vision and Pattern Recognition, Aug 2013, Sweden. pp.1-14. ⟨hal-00834068⟩

Record views