Convex Color Image Segmentation with Optimal Transport Distances

Julien Rabin 1 Nicolas Papadakis 2
1 Equipe Image - Laboratoire GREYC - UMR6072
GREYC - Groupe de Recherche en Informatique, Image, Automatique et Instrumentation de Caen
Abstract : This work is about the use of regularized optimal-transport distances for convex, histogram-based image segmentation. In the considered framework, fixed exemplar histograms define a prior on the statistical features of the two regions in competition. In this paper, we investigate the use of various transport-based cost functions as discrepancy measures and rely on a primal-dual algorithm to solve the obtained convex optimization problem.
Liste complète des métadonnées

Cited literature [15 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01133447
Contributor : Julien Rabin <>
Submitted on : Thursday, March 19, 2015 - 1:24:04 PM
Last modification on : Thursday, February 7, 2019 - 3:49:13 PM
Document(s) archivé(s) le : Monday, April 17, 2017 - 6:38:20 PM

File

MK_segmentation_final_SSVM.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01133447, version 1

Citation

Julien Rabin, Nicolas Papadakis. Convex Color Image Segmentation with Optimal Transport Distances. Scale Space and Variational Methods in Computer Vision, May 2015, Lège Cap Ferret, France. ⟨hal-01133447⟩

Share

Metrics

Record views

334

Files downloads

373