Refitting Solutions Promoted by l(12) Sparse Analysis Regularizations with Block Penalties

Affiliation auteurs!!!! Error affiliation !!!!
TitreRefitting Solutions Promoted by l(12) Sparse Analysis Regularizations with Block Penalties
Type de publicationConference Paper
Year of Publication2019
AuteursDeledalle C-A, Papadakis N, Salmon J, Vaiter S
EditorLellmann J, Burger M, Modersitzki J
Conference NameSCALE SPACE AND VARIATIONAL METHODS IN COMPUTER VISION, SSVM 2019
PublisherDeutsche Arbeitsgemeinschaft Mustererkennung e V; Deutsche Forschungsgemeinschaft; Univ Lubeck, Inst Math & Image Comp
Conference LocationGEWERBESTRASSE 11, CHAM, CH-6330, SWITZERLAND
ISBN Number978-3-030-22368-7; 978-3-030-22367-0
Mots-clésbias correction, Refitting, total variation
Résumé

In inverse problems, the use of an l(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.

DOI10.1007/978-3-030-22368-7_11