High-order block RIP for nonconvex block-sparse compressed sensing

DOI10.1515/JIIP-2022-0017MaRDI QIDQ6583081zbMATH OpenFDO

Authors Jianwen Huang, Xin-Ling Liu, Jingyao Hou, Jianjun Wang, Feng Zhang, Jinping Jia

Publication date 6 August 2024

Published in Journal of Inverse and Ill-posed Problems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/JIIP-2022-0017

zbMATH Keywords

block restricted isometry propertyblock sparsitycompressed sensingmixed \(l_2/l_p\) minimization

Mathematics Subject Classification ID

Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Sampling theory in information and communication theory (94A20)

Recommendations

• The high order block RIP condition for signal recovery
• Block sparse recovery via mixed l₂/l₁ minimization
• scientific article; zbMATH DE number 6830655
• A sufficient condition on recovery of block sparse signals via mixed minimization
• A simple Gaussian measurement bound for exact recovery of block-sparse signals

Cites work

• A general theory of concave regularization for high-dimensional sparse estimation problems
• A new bound on the block restricted isometry constant in compressed sensing
• A perturbation analysis based on group sparse representation with orthogonal matching pursuit
• A simple proof of the restricted isometry property for random matrices
• Block sparse recovery via mixed l₂/l₁ minimization
• Block-Sparse Recovery via Convex Optimization
• Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
• Compressed sensing
• Compressed sensing of color images
• Fast implementation of orthogonal greedy algorithm for tight wavelet frames
• Group sparse recovery in impulsive noise via alternating direction method of multipliers
• Improved iteratively reweighted least squares for unconstrained smoothed _q minimization
• Limits on Sparse Data Acquisition: RIC Analysis of Finite Gaussian Matrices
• On the Gap Between Restricted Isometry Properties and Sparse Recovery Conditions
• On the null space property of \(l_q\)-minimization for \(0 < q \leq 1\) in compressed sensing
• On the Reconstruction of Block-Sparse Signals With an Optimal Number of Measurements
• Optimal RIP bounds for sparse signals recovery via \(\ell_p\) minimization
• Perturbation analysis of \(L_{1-2}\) method for robust sparse recovery
• Recovery analysis for block _p-_1 minimization with prior support information
• Restricted \(p\)-isometry property and its application for nonconvex compressive sensing
• Restricted isometry properties and nonconvex compressive sensing
• Robust Recovery of Signals From a Structured Union of Subspaces
• Robust Sparse Recovery in Impulsive Noise via $\ell _p$ -$\ell _1$ Optimization
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Sharp RIP bound for sparse signal and low-rank matrix recovery
• Sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit
• Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
• The high order block RIP condition for signal recovery
• Uniform recovery of fusion frame structured sparse signals
• Uniform RIP Conditions for Recovery of Sparse Signals by $\ell _p\,(0< p\leq 1)$ Minimization
• Weighted \(l_p- l_1\) minimization methods for block sparse recovery and rank minimization

Cited in

(1)

• Near-optimal tensor recovery guarantees for transformed total variation minimization

This page was built for publication: High-order block RIP for nonconvex block-sparse compressed sensing

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