An Adaptive Finite Difference Method for Total Variation Minimization
Thomas Jacumin, Andreas Langer

TL;DR
This paper introduces an adaptive finite difference scheme for total variation minimization in image processing, utilizing a grid refinement based on primal-dual gap error estimates, and demonstrates its effectiveness through numerical experiments.
Contribution
It presents a novel adaptive finite difference method with automatic grid refinement for total variation problems, including a semi-smooth Newton solver for non-uniform grids.
Findings
Finer discretization can increase the discrete total variation value.
The adaptive scheme improves image denoising and motion estimation results.
Numerical experiments validate the method's applicability and efficiency.
Abstract
In this paper, we propose an adaptive finite difference scheme in order to numerically solve total variation type problems for image processing tasks. The automatic generation of the grid relies on indicators derived from a local estimation of the primal-dual gap error. This process leads in general to a non-uniform grid for which we introduce an adjusted finite difference method. Further we quantify the impact of the grid refinement on the respective discrete total variation. In particular, it turns out that a finer discretization may lead to a higher value of the discrete total variation for a given function. To compute a numerical solution on non-uniform grids we derive a semi-smooth Newton algorithm in 2D for scalar and vector-valued total variation minimization. We present numerical experiments for image denoising and the estimation of motion in image sequences to demonstrate the…
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.
Taxonomy
TopicsTopology Optimization in Engineering
