Convex Color Image Segmentation with Optimal Transport Distances
Idioma
en
Communication dans un congrès
Este ítem está publicado en
Proceedings of the fifth International Conference on Scale Space and Variational Methods in Computer Vision, Proceedings of the fifth International Conference on Scale Space and Variational Methods in Computer Vision, International Conference on Scale Space and Variational Methods in Computer Vision (SSVM'15), 2015-05-31, Lège Cap Ferret. 2015-05-31p. 256-269
Resumen en inglés
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 ...Leer más >
Palabras clave en inglés
Optimal transport
Wasserstein distance
Sinkhorn distance
convex optimization
image segmentation