An adaptive finite difference method for total variation minimization
(2025) In Numerical Algorithms- 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... (More)
- 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 applicability of our adaptive scheme. (Less)
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/12e7e61d-afbe-48de-b516-d0ceb3522ea5
- author
- Jacumin, Thomas
LU
and Langer, Andreas
LU
- organization
- publishing date
- 2025-03-19
- type
- Contribution to journal
- publication status
- published
- subject
- in
- Numerical Algorithms
- pages
- 36 pages
- publisher
- Springer
- external identifiers
-
- scopus:105000520409
- ISSN
- 1572-9265
- DOI
- 10.1007/s11075-025-02044-6
- project
- Lokalt adaptiva metoder för fria diskontinuitetsproblem
- language
- English
- LU publication?
- yes
- id
- 12e7e61d-afbe-48de-b516-d0ceb3522ea5
- date added to LUP
- 2025-04-26 11:09:47
- date last changed
- 2025-08-12 16:26:38
@article{12e7e61d-afbe-48de-b516-d0ceb3522ea5, 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 applicability of our adaptive scheme.}}, author = {{Jacumin, Thomas and Langer, Andreas}}, issn = {{1572-9265}}, language = {{eng}}, month = {{03}}, publisher = {{Springer}}, series = {{Numerical Algorithms}}, title = {{An adaptive finite difference method for total variation minimization}}, url = {{http://dx.doi.org/10.1007/s11075-025-02044-6}}, doi = {{10.1007/s11075-025-02044-6}}, year = {{2025}}, }