An Optimal Transport Analogue of the Rudin–Osher–Fatemi Model and Its Corresponding Multiscale Theory
From MaRDI portal
Publication:6202907
DOI10.1137/23M1564109arXiv2305.00580OpenAlexW4391401487WikidataQ128992150 ScholiaQ128992150MaRDI QIDQ6202907FDOQ6202907
Publication date: 27 February 2024
Published in: SIAM Journal on Mathematical Analysis (Search for Journal in Brave)
Abstract: We develop a theory for image restoration with a learned regularizer that is analogous to that of Meyer's characterization of solutions of the classical variational method of Rudin-Osher-Fatemi (ROF). The learned regularizer we use is a Kantorovich potential for an optimal transport problem of mapping a distribution of noisy images onto clean ones, as first proposed by Lunz, "Oktem and Sch"onlieb. We show that the effect of their restoration method on the distribution of the images is an explicit Euler discretization of a gradient flow on probability space, while our variational problem, dubbed Wasserstein ROF (WROF), is the corresponding implicit discretization. We obtain our geometric characterisation of the solution in this setting by first proving a more general convex analysis theorem for variational problems with solutions characterised by projections. We then use optimal transport arguments to obtain our WROF theorem from this general result, as well as a decomposition of a transport map into large scale "features" and small scale "details", where scale refers to the magnitude of the transport distance. Further, we leverage our theory to analyze two algorithms which iterate WROF. We refer to these as iterative regularization and multiscale transport. For the former we prove convergence to the clean data. For the latter we produce successive approximations to the target distribution that match it up to finer and finer scales. These algorithms are in complete analogy to well-known effective methods based on ROF for iterative denoising, respectively hierarchical image decomposition. We also obtain an analogue of the Tadmor Nezzar Vese energy identity which decomposes the Wasserstein 2 distance between two measures into a sum of non-negative terms that correspond to transport costs at different scales.
Full work available at URL: https://arxiv.org/abs/2305.00580
Optimal transportation (49Q22) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Nonlinear total variation based noise removal algorithms
- Robust Estimation of a Location Parameter
- Optimal transport for applied mathematicians. Calculus of variations, PDEs, and modeling
- Constructing optimal maps for Monge's transport problem as a limit of strictly convex costs
- Optimal Transport
- An algorithm for total variation minimization and applications
- Oscillating patterns in image processing and nonlinear evolution equations. The fifteenth Dean Jacqueline B. Lewis memorial lectures
- The Discontinuity Set of Solutions of the TV Denoising Problem and Some Extensions
- The Variational Formulation of the Fokker--Planck Equation
- Variational methods in imaging
- A note on the measurability of convex sets
- A Multiscale Image Representation Using Hierarchical (BV,L2) Decompositions
- Regularized regression and density estimation based on optimal transport
- \{Euclidean, metric, and Wasserstein\} gradient flows: an overview
- A multiscale theory for image registration and nonlinear inverse problems
- Book Review: Geometry of isotropic convex bodies
- Imaging with Kantorovich--Rubinstein Discrepancy
- A fast approach to optimal transport: the back-and-forth method
- Wasserstein-Based Projections with Applications to Inverse Problems
This page was built for publication: An Optimal Transport Analogue of the Rudin–Osher–Fatemi Model and Its Corresponding Multiscale Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6202907)
