Noisy 1-bit compressive sensing: models and algorithms
From MaRDI portal
Recommendations
- 1-bit compressive sensing: reformulation and RRSP-based sign recovery theory
- One-bit compressed sensing via \(\ell_p\) \((0<p<1)\)-minimization method
- Robust Decoding from 1-Bit Compressive Sampling with Ordinary and Regularized Least Squares
- Stability of 1-bit compressed sensing in sparse data reconstruction
- One-bit compressive sensing of dictionary-sparse signals
Cites work
- scientific article; zbMATH DE number 1391397 (Why is no real title available?)
- Breakdown of equivalence between the minimal \(\ell^1\)-norm solution and the sparsest solution
- Compressed sensing
- Convex analysis and monotone operator theory in Hilbert spaces
- Democracy in action: quantization, saturation, and compressive sensing
- Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- One-bit compressed sensing by linear programming
- Proximité et dualité dans un espace hilbertien
- Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors
- Robust 1-bit Compressed Sensing and Sparse Logistic Regression: A Convex Programming Approach
- Robust 1-bit Compressive Sensing Using Adaptive Outlier Pursuit
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Stable signal recovery from incomplete and inaccurate measurements
- Support-vector networks
- The elements of statistical learning. Data mining, inference, and prediction
- The restricted isometry property and its implications for compressed sensing
- Trust, But Verify: Fast and Accurate Signal Recovery From 1-Bit Compressive Measurements
- Variational Analysis
Cited in
(21)- Sparse regularization with the ℓ0 norm
- 1-bit compressive sensing: reformulation and RRSP-based sign recovery theory
- One-bit compressive sensing of dictionary-sparse signals
- Statistical mechanics analysis of thresholding 1-bit compressed sensing
- One-bit compressed sensing via \(\ell_p\) \((0<p<1)\)-minimization method
- Quadratic Convergence of Smoothing Newton's Method for 0/1 Loss Optimization
- Robust Decoding from 1-Bit Compressive Sampling with Ordinary and Regularized Least Squares
- Robust 1-bit compressed sensing via hinge loss minimization
- Characterization of \(\ell_1\) minimizer in one-bit compressed sensing
- Just least squares: binary compressive sampling with low generative intrinsic dimension
- Adaptive iterative hard thresholding for least absolute deviation problems with sparsity constraints
- Sparse inverse covariance matrix estimation via the \(\ell_0\)-norm with Tikhonov regularization
- NBIHT: An Efficient Algorithm for 1-Bit Compressed Sensing With Optimal Error Decay Rate
- کاربرد روش تکمیل تنسوری بهینهسازی شده تک بیتی در بازیافت تصاویر دیجیتالی مخدوش
- \(\ell_0\)-minimization methods for image restoration problems based on wavelet frames
- Distributed Decoding From Heterogeneous 1-Bit Compressive Measurements
- A reliable iteration algorithm for one-bit compressive sensing on the unit sphere
- Multiplicative noise removal with a sparsity-aware optimization model
- Stability of 1-bit compressed sensing in sparse data reconstruction
- Capped \(\ell_p\) approximations for the composite \(\ell_0\) regularization problem
- An approach to one-bit compressed sensing based on probably approximately correct learning theory
This page was built for publication: Noisy 1-bit compressive sensing: models and algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q900771)
