Abstract
We introduce a class of adaptive non-smooth convex variational problems for image denoising in terms of a common data fitting term and a support functional as regularizer. Adaptivity is modeled by a set-valued mapping with closed, compact and convex values, that defines and steers the regularizer depending on the variational solution. This extension gives rise to a class of quasi-variational inequalities. We provide sufficient conditions for the existence of fixed points as solutions, and an algorithm based on solving a sequence of variational problems. Denoising experiments with spatial and spatio-temporal image data and an adaptive total variation regularizer illustrate our approach.
| Original language | English |
|---|---|
| Journal | Computational Optimization and Applications |
| Volume | 54 |
| Issue number | 2 |
| Pages (from-to) | 371-398 |
| Number of pages | 28 |
| ISSN | 0926-6003 |
| DOIs | |
| Publication status | Published - 03.2013 |
UN SDGs
This output contributes to the following UN Sustainable Development Goals (SDGs)
-
SDG 9 Industry, Innovation, and Infrastructure
Fingerprint
Dive into the research topics of 'A class of quasi-variational inequalities for adaptive image denoising and decomposition'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver