One-bit compressed sensing via ℓ p (0 < p < 1)-minimization method

DOI10.1088/1361-6420/ab779bzbMath1468.94130OpenAlexW3008251836MaRDI QIDQ5000599

Jingyao Hou, Feng Zhang, Jian-Jun Wang, Jian-Wen Huang

Publication date: 14 July 2021

Published in: Inverse Problems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1088/1361-6420/ab779b

zbMATH Keywords

covering numberthresholding algorithmone-bit compressed sensingGaussian mean widthnonconvex \(\ell_p\)-minimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items

One-bit tensor completion via transformed tensor singular value decomposition

Uses Software

• Daisy

Cites Work

• Unnamed Item
• Unnamed Item
• A mathematical introduction to compressive sensing
• On block coherence of frames
• Stable recovery of sparse signals via \(\ell_p\)-minimization
• New bounds on the restricted isometry constant \(\delta _{2k}\)
• Enhancing sparsity by reweighted \(\ell _{1}\) minimization
• Noisy 1-bit compressive sensing: models and algorithms
• Iterative thresholding algorithm based on non-convex method for modified \(l_p\)-norm regularization minimization
• Recovery of signals under the condition on RIC and ROC via prior support information
• The convex geometry of linear inverse problems
• Group sparse recovery in impulsive noise via alternating direction method of multipliers
• Dimension reduction by random hyperplane tessellations
• Minimization of non-smooth, non-convex functionals by iterative thresholding
• One-bit compressed sensing with non-Gaussian measurements
• One-Bit Compressed Sensing by Linear Programming
• On optimal solutions of the constrained ℓ ₀ regularization and its penalty problem
• Unknown Sparsity in Compressed Sensing: Denoising and Inference
• One-Bit Compressive Sensing With Norm Estimation
• 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
• Compressed sensing recovery via nonconvex shrinkage penalties
• Asymptotic Minimax Character of the Sample Distribution Function and of the Classical Multinomial Estimator
• Restricted isometry properties and nonconvex compressive sensing
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Stable recovery of sparse overcomplete representations in the presence of noise
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• Shifting Inequality and Recovery of Sparse Signals
• Sparse Recovery of Nonnegative Signals With Minimal Expansion
• Robust 1-bit Compressive Sensing Using Adaptive Outlier Pursuit
• <formula formulatype="inline"><tex Notation="TeX">$L_{1/2}$</tex> </formula> Regularization: Convergence of Iterative Half Thresholding Algorithm
• High-Dimensional Probability
• One-bit compressive sensing of dictionary-sparse signals
• The Improved Bounds of Restricted Isometry Constant for Recovery via <formula formulatype="inline"><tex Notation="TeX">$\ell_{p}$</tex> </formula>-Minimization
• $ \newcommand{\e}{{\rm e}} \ell_{0}$ -minimization methods for image restoration problems based on wavelet frames
• Compressed sensing