Locally sparse reconstruction using the ^1,-norm

DOI10.3934/IPI.2015.9.1093zbMATH Open1332.65062arXiv1405.5908OpenAlexW2963047269MaRDI QIDQ256102FDOQ256102

Authors: Pia Heins, Michael Möller, Martin Burger 

Publication date: 9 March 2016

Published in: Inverse Problems and Imaging (Search for Journal in Brave)

Abstract: This paper discusses the incorporation of local sparsity information, e.g. in each pixel of an image, via minimization of the $el{l}^{1,infty}$-norm. We discuss the basic properties of this norm when used as a regularization functional and associated optimization problems, for which we derive equivalent reformulations either more amenable to theory or to numerical computation. Further focus of the analysis is put on the locally 1-sparse case, which is well motivated by some biomedical imaging applications. Our computational approaches are based on alternating direction methods of multipliers (ADMM) and appropriate splittings with augmented Lagrangians. Those are tested for a model scenario related to dynamic positron emission tomography (PET), which is a functional imaging technique in nuclear medicine. The results of this paper provide insight into the potential impact of regularization with the $el{l}^{1,infty}$-norm for local sparsity in appropriate settings. However, it also indicates several shortcomings, possibly related to the non-tightness of the functional as a relaxation of the $el{l}^{0,infty}$-norm.

Full work available at URL: https://arxiv.org/abs/1405.5908

Recommendations

• Reconstruction using local sparsity. A novel regularization technique and an asymptotic analysis of spatial sparsity priors
• ADMM-EM method for \(L_1\)-norm regularized weighted least squares PET reconstruction
• Minimizing \(L_1\) over \(L_2\) norms on the gradient
• Composite SAR imaging using sequential joint sparsity
• A note on the minimization of a Tikhonov functional with \(\ell^1\)-penalty

zbMATH Keywords

inverse problems\(\ell^{1\infty}\)-regularizationcompressed sensinglocal sparsitymixed normsvariational methods

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Computing methodologies for image processing (68U10) Inverse problems in optimal control (49N45)

Cites Work

• Title not available (Why is that?)
• Distributed optimization and statistical learning via the alternating direction method of multipliers
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
• Title not available (Why is that?)
• Regression Shrinkage and Selection via The Lasso: A Retrospective
• Model Selection and Estimation in Regression with Grouped Variables
• Robust principal component analysis?
• Title not available (Why is that?)
• Structured sparsity through convex optimization
• Decoding by Linear Programming
• Just relax: convex programming methods for identifying sparse signals in noise
• Characterization of the subdifferential of some matrix norms
• Robust Matrix Decomposition With Sparse Corruptions
• Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
• Algorithms for simultaneous sparse approximation. II: Convex relaxation
• Application of the alternating direction method of multipliers to separable convex programming problems
• A proximal-based deomposition method for compositions method for convex minimization problems
• An affine scaling methodology for best basis selection
• Optimization with sparsity-inducing penalties
• Title not available (Why is that?)
• Compressed sensing and best \(k\)-term approximation
• (Nonlocal) total variation in medical imaging
• On Sparse Representations in Arbitrary Redundant Bases
• Greed is Good: Algorithmic Results for Sparse Approximation
• Recovery Algorithms for Vector-Valued Data with Joint Sparsity Constraints
• Monotone Operators and the Proximal Point Algorithm
• Title not available (Why is that?)
• Regularization methods in Banach spaces.
• Uncertainty principles and ideal atomic decomposition
• Convergence rates of convex variational regularization
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Probabilistic and RIPless Theory of Compressed Sensing
• Sparse solutions to linear inverse problems with multiple measurement vectors
• A Convex Model for Nonnegative Matrix Factorization and Dimensionality Reduction on Physical Space
• An iterative algorithm for nonlinear inverse problems with joint sparsity constraints in vector-valued regimes and an application to color image inpainting
• Decomposition method with a variable parameter for a class of monotone variational inequality problems
• On verifiable sufficient conditions for sparse signal recovery via \(\ell_{1}\) minimization
• Sparse regression using mixed norms

Cited In (4)

• Collaborative total variation: a general framework for vectorial TV models
• The Benefits of Acting Locally: Reconstruction Algorithms for Sparse in Levels Signals With Stable and Robust Recovery Guarantees
• Modern regularization methods for inverse problems
• ORKA: Object reconstruction using a K-approximation graph

This page was built for publication: Locally sparse reconstruction using the \(\ell^{1,\infty}\)-norm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q256102)