Image Restoration Models with Optimal Transport and Total Variation Regularization
Weijia Huang, Zhongyi Huang, Wenli Yang, Wei Zhu
TL;DR
This work introduces image restoration models that fuse total variation regularization with a Wasserstein-1–based data fidelity, leveraging the dual Lipschitz norm and connections to Meyer's G-norm for cartoon-texture decomposition. The authors develop a practical algorithm combining Primal-Dual Hybrid Gradient (PDHG) updates for the OT component with an augmented Lagrangian approach for TV, and they prove existence, uniqueness, and convergence of minimizers. The framework is extended with a nonconvex KR-Log-TV variant and a Meyer-inspired MTV regularization to better preserve contrast and suppress staircasing. Numerical experiments on diverse images illustrate enhanced texture preservation and image contrast over classical ROF and other decomposition approaches, with solid convergence behavior and flexibility in discretization and convolutional extensions.
Abstract
In this paper, we propose image restoration models using optimal transport (OT) and total variation regularization. We present theoretical results of the proposed models based on the relations between the dual Lipschitz norm from OT and the G-norm introduced by Yves Meyer. We design a numerical method based on the Primal-Dual Hybrid Gradient (PDHG) algorithm for the Wasserstain distance and the augmented Lagrangian method (ALM) for the total variation, and the convergence analysis of the proposed numerical method is established. We also consider replacing the total variation in our model by one of its modifications developed in \cite{zhu}, with the aim of suppressing the stair-casing effect and preserving image contrasts. Numerical experiments demonstrate the features of the proposed models.
