TL;DR
This paper proposes a regularized and relaxed discrete optimal transport framework for image color manipulation, enabling robust color transfer, noise artifact removal, and color normalization across multiple images through convex optimization and barycenter computation.
Contribution
It introduces a novel regularized and relaxed formulation of discrete optimal transport tailored for image processing, including new algorithms for color transfer and barycenter computation.
Findings
Robust color transfer maps that handle large color palette variations.
Effective removal of colorization artifacts due to noise.
A convergent algorithm for computing barycenters for color normalization.
Abstract
This article introduces a generalization of the discrete optimal transport, with applications to color image manipulations. This new formulation includes a relaxation of the mass conservation constraint and a regularization term. These two features are crucial for image processing tasks, which necessitate to take into account families of multimodal histograms, with large mass variation across modes. The corresponding relaxed and regularized transportation problem is the solution of a convex optimization problem. Depending on the regularization used, this minimization can be solved using standard linear programming methods or first order proximal splitting schemes. The resulting transportation plan can be used as a color transfer map, which is robust to mass variation across images color palettes. Furthermore, the regularization of the transport plan helps to remove colorization…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
