Enhanced joint sparsity via iterative support detection

DOI10.1016/J.INS.2017.06.034zbMATH Open1435.94065arXiv1412.2675OpenAlexW2963313658MaRDI QIDQ778436FDOQ778436

Authors: Ya-Ru Fan, Yilun Wang, Ting-Zhu Huang 

Publication date: 2 July 2020

Published in: Information Sciences (Search for Journal in Brave)

Abstract: Joint sparsity has attracted considerable attention in recent years in many fields including sparse signal recovery in compressed sensing (CS), statistics, and machine learning. Traditional convex models suffer from the suboptimal performance though enjoying tractable computation. In this paper, we propose a new non-convex joint sparsity model, and develop a corresponding multi-stage adaptive convex relaxation algorithm. This method extends the idea of iterative support detection (ISD) from the single vector estimation to the multi-vector estimation by considering the joint sparsity prior. We provide some preliminary theoretical analysis including convergence analysis and a sufficient recovery condition. Numerical experiments from both compressive sensing and feature learning show the better performance of the proposed method in comparison with several state-of-the-art alternatives. Moreover, we demonstrate that the extension of ISD from the single vector to multi-vector estimation is not trivial. In particular, while ISD does not work well for reconstructing the signal channel sparse Bernoulli signal, it does achieve significantly improved performance when recovering the multi-channel sparse Bernoulli signal thanks to its ability of natural incorporation of the joint sparsity structure.

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

Recommendations

• Sparse signal reconstruction via iterative support detection
• Greedy subspace pursuit for joint sparse recovery
• Joint sparse recovery based on variances
• Reducing effects of bad data using variance based joint sparsity recovery
• A fast algorithm for recovery of jointly sparse vectors based on the alternating direction methods

zbMATH Keywords

nonconvex optimizationcompressive sensingjoint sparsity\(\ell_{2,1}\)-norm minimizationiterative support detectionmulti-task feature learning

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Nonconvex programming, global optimization (90C26)

Cites Work

• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Enhancing sparsity by reweighted \(\ell _{1}\) minimization
• Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
• Sparse solutions to linear inverse problems with multiple measurement vectors
• Sparse signal reconstruction via iterative support detection
• Algorithms for simultaneous sparse approximation. I: Greedy pursuit
• Efficient block-coordinate descent algorithms for the group Lasso
• Exact Joint Sparse Frequency Recovery via Optimization Methods
• Subspace Methods for Joint Sparse Recovery
• Composite SAR imaging using sequential joint sparsity
• Average Case Analysis of Multichannel Sparse Recovery Using Convex Relaxation
• The null space property for sparse recovery from multiple measurement vectors
• A fast algorithm for recovery of jointly sparse vectors based on the alternating direction methods
• \(L_p\)-norm regularization algorithms for optimization over permutation matrices
• Cartoon-texture image decomposition via non-convex low-rank texture regularization
• Improving Noise Robustness in Subspace-Based Joint Sparse Recovery
• OMP Based Joint Sparsity Pattern Recovery Under Communication Constraints

Cited In (1)

• Greedy subspace pursuit for joint sparse recovery

Uses Software

• Yall1
• MALSAR

This page was built for publication: Enhanced joint sparsity via iterative support detection

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