6533b7d8fe1ef96bd126afa1

RESEARCH PRODUCT

Refitting Solutions Promoted by $$\ell _{12}$$ Sparse Analysis Regularizations with Block Penalties

Charles-alban DeledalleSamuel VaiterNicolas PapadakisJoseph Salmon

subject

Artifact (error)Total variationComputer scienceRegular polygon02 engineering and technologyInverse problem01 natural sciences[INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]010104 statistics & probabilityRefitting0202 electrical engineering electronic engineering information engineeringBias correction020201 artificial intelligence & image processingBias correction0101 mathematics[MATH]Mathematics [math]AlgorithmBlock (data storage)

description

International audience; 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.

10.1007/978-3-030-22368-7_11http://dx.doi.org/10.1007/978-3-030-22368-7_11