Globally sparse and locally dense signal recovery for compressed sensing

DOI10.1016/J.JFRANKLIN.2014.01.009MaRDI QIDQ2410784zbMATH OpenOpenAlexFDO

Authors Yipeng Liu

Publication date 19 October 2017

Published in Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jfranklin.2014.01.009

zbMATH Keywords

combination of a sparsity constraint and a data fitting constraintsparse group signal model (block-sparse signal)sparsity regularized least squarestotal variationunderdetermined linear inverse problem

Mathematics Subject Classification ID

Inverse problems in optimal control (49N45) Least squares and related methods for stochastic control systems (93E24) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• The \(\ell_{2,q}\) regularized group sparse optimization: lower bound theory, recovery bound and algorithms
• Robust group lasso: model and recoverability
• An efficient semismooth Newton method for adaptive sparse signal recovery problems
• Block-sparse compressed sensing: non-convex model and iterative re-weighted algorithm
• On oracle-type local recovery guarantees in compressed sensing

Cites work

• Atomic Decomposition by Basis Pursuit
• Block-Sparse Recovery via Convex Optimization
• Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
• C-HiLasso: A Collaborative Hierarchical Sparse Modeling Framework
• Greed is Good: Algorithmic Results for Sparse Approximation
• scientific article; zbMATH DE number 845714 (Why is no real title available?)
• Image recovery via total variation minimization and related problems
• Matching pursuits with time-frequency dictionaries
• Matrix Analysis
• Model Selection and Estimation in Regression with Grouped Variables
• Model-Based Compressive Sensing
• On compressive sensing applied to radar
• On the asymptotic properties of the group lasso estimator for linear models
• On the Reconstruction of Block-Sparse Signals With an Optimal Number of Measurements
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
• Sparse Reconstruction by Separable Approximation
• Sparse solutions to linear inverse problems with multiple measurement vectors
• Statistics for high-dimensional data. Methods, theory and applications.
• The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
• The Group Lasso for Logistic Regression
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• Variable selection via the weighted group Lasso for factor analysis models

Cited in

(4)

• Local recovery bounds for prior support constrained compressed sensing
• The Benefits of Acting Locally: Reconstruction Algorithms for Sparse in Levels Signals With Stable and Robust Recovery Guarantees
• Two new approaches to compressed sensing exhibiting both robust sparse recovery and the grouping effect
• Nonconvex nonsmooth low-rank minimization for generalized image compressed sensing via group sparse representation

Describes a project that uses

Uses Software

• CVX
• PDCO
• SeDuMi

This page was built for publication: Globally sparse and locally dense signal recovery for compressed sensing

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