Refitting solutions promoted by $\ell_{12}$ sparse analysis regularization with block penalties
Langue
en
Communication dans un congrès
Ce document a été publié dans
International Conference on Scale Space and Variational Methods in Computer Vision (SSVM'19), 2019-06-30, Hofgeismar. 2019 n° 11603, p. 131-143
Springer International Publishing
Résumé en anglais
In inverse problems, the use of an $\ell_{12}$ analysis regularizer induces a bias in the estimated solution. We propose a general refitting framework for removing this artifact while keeping information of interest contained ...Lire la suite >
In inverse problems, the use of an $\ell_{12}$ analysis regularizer induces a bias in the estimated solution. We propose a general refitting framework for removing this artifact while keeping information of interest contained in the biased solution. This is done through the use of refitting block penalties that only act on the co-support of the estimation. Based on an analysis of related works in the literature, we propose a new penalty that is well suited for refitting purposes. We also present an efficient algorithmic method to obtain the refitted solution along with the original (biased) solution for any convex refitting block penalty. Experiments illustrate the good behavior of the proposed block penalty for refitting.< Réduire
Projet Européen
Nonlocal Methods for Arbitrary Data Sources
Project ANR
Generalized Optimal Transport Models for Image processing - ANR-16-CE33-0010
Origine
Importé de halUnités de recherche