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

DOI10.1007/978-3-319-25040-3_10zbMATH Open1376.94007OpenAlexW2294760314MaRDI QIDQ2807499FDOQ2807499

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

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

zbMATH Keywords

optimal transportrelaxationcolor transfer

Mathematics Subject Classification ID

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

Cited In (8)

• Title not available (Why is that?)
• A smoothed dual approach for variational Wasserstein problems
• Semidual regularized optimal transport
• A smoothed dual approach for variational Wasserstein problems
• Learning to match via inverse optimal transport
• A transportation \(L^p\) distance for signal analysis
• Convex color image segmentation with optimal transport distances
• Regularized discrete optimal transport

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)