MPTV: Matching Pursuit Based Total Variation Minimization for Image Deconvolution
Dong Gong, Mingkui Tan, Qinfeng Shi, Anton van den Hengel, Yanning, Zhang

TL;DR
This paper introduces MPTV, a novel matching pursuit based total variation minimization method for image deconvolution that reduces over-smoothing and improves robustness by applying inhomogeneous regularization.
Contribution
The paper proposes a new convex quadratic constrained linear programming model and a cutting-plane based MPTV algorithm that enhances image deconvolution by addressing over-smoothing and solution bias.
Findings
MPTV outperforms state-of-the-art methods in image deconvolution tasks.
The inhomogeneous regularization reduces ringing artifacts and over-smoothing.
MPTV is less sensitive to parameter choices and more robust to blur kernel errors.
Abstract
Total variation (TV) regularization has proven effective for a range of computer vision tasks through its preferential weighting of sharp image edges. Existing TV-based methods, however, often suffer from the over-smoothing issue and solution bias caused by the homogeneous penalization. In this paper, we consider addressing these issues by applying inhomogeneous regularization on different image components. We formulate the inhomogeneous TV minimization problem as a convex quadratic constrained linear programming problem. Relying on this new model, we propose a matching pursuit based total variation minimization method (MPTV), specifically for image deconvolution. The proposed MPTV method is essentially a cutting-plane method, which iteratively activates a subset of nonzero image gradients, and then solves a subproblem focusing on those activated gradients only. Compared to existing…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
