Stability of 1-bit compressed sensing in sparse data reconstruction
Summary: 1-bit compressing sensing (CS) is an important class of sparse optimization problems. This paper focuses on the stability theory for 1-bit CS with quadratic constraint. The model is rebuilt by reformulating sign measurements by linear equality and inequality constraints, and the quadratic constraint with noise is approximated by polytopes to any level of accuracy. A new concept called restricted weak RSP of a transposed sensing matrix with respect to the measurement vector is introduced. Our results show that this concept is a sufficient and necessary condition for the stability of 1-bit CS without noise and is a sufficient condition if the noise is available.
- 1-bit compressive sensing: reformulation and RRSP-based sign recovery theory
- A simple proof of the restricted isometry property for random matrices
- Atomic decomposition by basis pursuit
- Certifying the Restricted Isometry Property is Hard
- Characterization of \(\ell_1\) minimizer in one-bit compressed sensing
- Compressed sensing
- Compressed sensing with coherent and redundant dictionaries
- Iterative hard thresholding for compressed sensing
- Iteratively reweighted least squares minimization for sparse recovery
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Quantization of compressive samples with stable and robust recovery
- Recovery of sparsest signals via \(\ell^q \)-minimization
- Robust Nonnegative Sparse Recovery and the Nullspace Property of 0/1 Measurements
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Robustness of Sparse Recovery via <inline-formula> <tex-math notation="LaTeX">$F$ </tex-math></inline-formula>-Minimization: A Topological Viewpoint
- RSP-Based Analysis for Sparsest and Least \ell₁-Norm Solutions to Underdetermined Linear Systems
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Sparse optimization theory and methods
- Sparse Recovery Conditions and Performance Bounds for $\ell _p$-Minimization
- Sparse representations in unions of bases
- Stability analysis of a class of sparse optimization problems
- The restricted isometry property and its implications for compressed sensing
- Uniform recovery of fusion frame structured sparse signals
- Weak stability of \(\ell_1\)-minimization methods in sparse data reconstruction
- Weakly Convex Regularized Robust Sparse Recovery Methods With Theoretical Guarantees
- The stochastic geometry of unconstrained one-bit data compression
- Robust Decoding from 1-Bit Compressive Sampling with Ordinary and Regularized Least Squares
- Statistical mechanics analysis of thresholding 1-bit compressed sensing
- 1-bit compressive sensing: reformulation and RRSP-based sign recovery theory
- NBIHT: An Efficient Algorithm for 1-Bit Compressed Sensing With Optimal Error Decay Rate
- Weak stability of \(\ell_1\)-minimization methods in sparse data reconstruction
- Characterization of \(\ell_1\) minimizer in one-bit compressed sensing
- Noisy 1-bit compressive sensing: models and algorithms
This page was built for publication: Stability of 1-bit compressed sensing in sparse data reconstruction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2217038)
