Stability of 1-bit compressed sensing in sparse data reconstruction
From MaRDI portal
Publication:2217038
DOI10.1155/2020/8849395zbMath1459.94039OpenAlexW3110643669MaRDI QIDQ2217038
Zhongfeng Sun, Jingyong Tang, Yuefang Lian, Jin Chuan Zhou
Publication date: 18 December 2020
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2020/8849395
Convex programming (90C25) Applications of mathematical programming (90C90) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Sampling theory in information and communication theory (94A20)
Uses Software
Cites Work
- 1-bit compressive sensing: reformulation and RRSP-based sign recovery theory
- Recovery of sparsest signals via \(\ell^q \)-minimization
- Compressed sensing with coherent and redundant dictionaries
- Iterative hard thresholding for compressed sensing
- Uniform recovery of fusion frame structured sparse signals
- The restricted isometry property and its implications for compressed sensing
- A simple proof of the restricted isometry property for random matrices
- Quantization of compressive samples with stable and robust recovery
- Atomic Decomposition by Basis Pursuit
- Robustness of Sparse Recovery via <inline-formula> <tex-math notation="LaTeX">$F$ </tex-math></inline-formula>-Minimization: A Topological Viewpoint
- Certifying the Restricted Isometry Property is Hard
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Sparse representations in unions of bases
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Iteratively reweighted least squares minimization for sparse recovery
- Robust Nonnegative Sparse Recovery and the Nullspace Property of 0/1 Measurements
- Sparse Optimization Theory and Methods
- RSP-Based Analysis for Sparsest and Least $\ell_1$-Norm Solutions to Underdetermined Linear Systems
- Sparse Recovery Conditions and Performance Bounds for $\ell _p$-Minimization
- Stability analysis of a class of sparse optimization problems
- Weak Stability of ℓ1-Minimization Methods in Sparse Data Reconstruction
- Characterization of ℓ1 minimizer in one-bit compressed sensing
- Weakly Convex Regularized Robust Sparse Recovery Methods With Theoretical Guarantees
- Compressed sensing