Estimation of block sparsity in compressive sensing

DOI10.1142/S0219691322500345MaRDI QIDQ5052929zbMATH OpenOpenAlexFDO

Authors Zhiyong Zhou, J. Yu

Publication date 25 November 2022

Published in International Journal of Wavelets, Multiresolution and Information Processing (Search for Journal in Brave)

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

zbMATH Keywords

block sparsitycompressive sensingmultivariate centered isotropic symmetric \(\alpha\)-stable distribution

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Robustness and adaptive procedures (parametric inference) (62F35) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Abstract: Explicitly using the block structure of the unknown signal can achieve better reconstruction performance in compressive sensing. Theoretically, an unknown signal with block structure can be accurately recovered from a few number of under-determined linear measurements provided that it is sufficiently block sparse. From the practical point of view, a severe concern is that the block sparse level appears often unknown. In this paper, we introduce a soft measure of block sparsity $k_{a}lpha(mathbfx)=left(lVertmathbfxVer{t}_{2,alpha}/lVertmathbfxVer{t}_{2,1}ight{)}^{fracalpha1-alpha}$ with $alphain[0,infty]$, and propose an estimation procedure by using multivariate centered isotropic symmetric $alpha$-stable random projections. The limiting distribution of the estimator is established. Simulations are conducted to illustrate our theoretical results.

Recommendations

• A simple Gaussian measurement bound for exact recovery of block-sparse signals
• The high order block RIP condition for signal recovery
• Block-sparse compressed sensing: non-convex model and iterative re-weighted algorithm
• A new analysis for support performance with block generalized orthogonal matching pursuit
• How well can we estimate a sparse vector?

Cites work

• A mathematical introduction to compressive sensing
• Atomic Decomposition by Basis Pursuit
• Blind Multiband Signal Reconstruction: Compressed Sensing for Analog Signals
• Block-Sparse Recovery via Convex Optimization
• Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
• Compressed sensing
• Compressed sensing of color images
• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
• Decoding by Linear Programming
• Estimation in high dimensions: a geometric perspective
• scientific article; zbMATH DE number 3947305 (Why is no real title available?)
• scientific article; zbMATH DE number 819510 (Why is no real title available?)
• Iterative hard thresholding for compressed sensing
• Iterative Reweighted <formula formulatype="inline"><tex Notation="TeX">$\ell_{2}/\ell_{1}$</tex> </formula> Recovery Algorithms for Compressed Sensing of Block Sparse Signals
• Model Selection and Estimation in Regression with Grouped Variables
• Model-Based Compressive Sensing
• Multivariate elliptically contoured stable distributions: theory and estimation
• Multivariate stable distributions
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• On the Reconstruction of Block-Sparse Signals With an Optimal Number of Measurements
• One-bit compressed sensing by linear programming
• Recovery analysis for weighted mixed \(\ell_2 / \ell_p\) minimization with \(0 < p \leq 1\)
• Reduce and Boost: Recovering Arbitrary Sets of Jointly Sparse Vectors
• Robust Recovery of Signals From a Structured Union of Subspaces
• Robust scale estimation based on the empirical characteristic function
• Robust scale estimation in the error‐components model using the empirical characteristic function
• Sampling Theorems for Signals From the Union of Finite-Dimensional Linear Subspaces
• Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
• Sparse solutions to linear inverse problems with multiple measurement vectors
• Stable signal recovery from incomplete and inaccurate measurements
• Structured Compressed Sensing: From Theory to Applications
• The Group Lasso for Stable Recovery of Block-Sparse Signal Representations
• Theoretical Results on Sparse Representations of Multiple-Measurement Vectors
• Uniform Central Limit Theorems
• Unknown Sparsity in Compressed Sensing: Denoising and Inference

Cited in

(8)

• Recovering block-structured activations using compressive measurements
• A new bound on the block restricted isometry constant in compressed sensing
• A perturbation analysis of block-sparse compressed sensing via mixed _2/_1 minimization
• An Analysis of Block Sampling Strategies in Compressed Sensing
• On the Reconstruction of Block-Sparse Signals With an Optimal Number of Measurements
• Exploiting Prior Information in Block-Sparse Signals
• Block-sparse compressed sensing: non-convex model and iterative re-weighted algorithm
• Accuracy guaranties for \(\ell_{1}\) recovery of block-sparse signals

Describes a project that uses

Uses Software

• PDCO
• CoSaMP

This page was built for publication: Estimation of block sparsity in compressive sensing

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