Non-convex relaxation of optimal transport for color transfer between images

DOI10.1007/978-3-319-25040-3_10MaRDI QIDQ2807499zbMATH OpenOpenAlexFDO

Authors Julien Rabin, Nicolas Papadakis

Publication date 25 May 2016

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-25040-3_10

zbMATH Keywords

optimal transportrelaxationcolor transfer

Mathematics Subject Classification ID

Information theory (general) (94A15) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Recommendations

• Regularized discrete optimal transport
• Convex color image segmentation with optimal transport distances
• Supervised optimal transport
• Optimal transport for manifold-valued images
• A review of optimal transport in image processing

Cited in

(8)

• A smoothed dual approach for variational Wasserstein problems
• A transportation \(L^p\) distance for signal analysis
• A smoothed dual approach for variational Wasserstein problems
• Learning to match via inverse optimal transport
• Semidual regularized optimal transport
• Convex color image segmentation with optimal transport distances
• Regularized discrete optimal transport
• scientific article; zbMATH DE number 6668768 (Why is no real title available?)

This page was built for publication: Non-convex relaxation of optimal transport for color transfer between images

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2807499)