One-bit compressed sensing via _p (0
From MaRDI portal
Publication:5000599
Recommendations
- One-bit compressive sensing of dictionary-sparse signals
- Noisy 1-bit compressive sensing: models and algorithms
- 1-bit compressive sensing: reformulation and RRSP-based sign recovery theory
- Characterization of \(\ell_1\) minimizer in one-bit compressed sensing
- One-bit compressed sensing by linear programming
Cites work
- scientific article; zbMATH DE number 49190 (Why is no real title available?)
- scientific article; zbMATH DE number 1149836 (Why is no real title available?)
- <formula formulatype="inline"><tex Notation="TeX">$L_{1/2}$</tex> </formula> Regularization: Convergence of Iterative Half Thresholding Algorithm
- A mathematical introduction to compressive sensing
- Asymptotic Minimax Character of the Sample Distribution Function and of the Classical Multinomial Estimator
- Compressed sensing
- Compressed sensing recovery via nonconvex shrinkage penalties
- Dimension reduction by random hyperplane tessellations
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Group sparse recovery in impulsive noise via alternating direction method of multipliers
- High-dimensional probability. An introduction with applications in data science
- Iterative thresholding algorithm based on non-convex method for modified \(l_p\)-norm regularization minimization
- Minimization of non-smooth, non-convex functionals by iterative thresholding
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- New bounds on the restricted isometry constant \(\delta _{2k}\)
- Noisy 1-bit compressive sensing: models and algorithms
- On block coherence of frames
- On optimal solutions of the constrained \({\ell}_{0}\) regularization and its penalty problem
- One-Bit Compressive Sensing With Norm Estimation
- One-bit compressed sensing by linear programming
- One-bit compressed sensing with non-Gaussian measurements
- One-bit compressive sensing of dictionary-sparse signals
- Recovery of signals under the condition on RIC and ROC via prior support information
- Restricted isometry properties and nonconvex compressive sensing
- 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
- Shifting Inequality and Recovery of Sparse Signals
- Sparse Recovery of Nonnegative Signals With Minimal Expansion
- Stable recovery of sparse overcomplete representations in the presence of noise
- Stable recovery of sparse signals via \(\ell_p\)-minimization
- The Improved Bounds of Restricted Isometry Constant for Recovery via <formula formulatype="inline"><tex Notation="TeX">$\ell_{p}$</tex> </formula>-Minimization
- The convex geometry of linear inverse problems
- Unknown Sparsity in Compressed Sensing: Denoising and Inference
- \(\ell_0\)-minimization methods for image restoration problems based on wavelet frames
Cited in
(10)- One-bit compressed sensing with non-Gaussian measurements
- One-bit compressive sensing of dictionary-sparse signals
- Noisy 1-bit compressive sensing: models and algorithms
- Characterization of \(\ell_1\) minimizer in one-bit compressed sensing
- NBIHT: An Efficient Algorithm for 1-Bit Compressed Sensing With Optimal Error Decay Rate
- One-bit compressed sensing by greedy algorithms
- One-bit tensor completion via transformed tensor singular value decomposition
- A reliable iteration algorithm for one-bit compressive sensing on the unit sphere
- Theory and fast learned solver for \(\ell^1\)-TV regularization
- An approach to one-bit compressed sensing based on probably approximately correct learning theory
This page was built for publication: One-bit compressed sensing via \(\ell_p\) \((0<p<1)\)-minimization method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5000599)
