Noisy 1-bit compressive sensing: models and algorithms

DOI10.1016/j.acha.2014.12.001zbMath1331.65085OpenAlexW1974335001MaRDI QIDQ900771

Yuesheng Xu, Na Zhang, Dao-Qing Dai, Li-Xin Shen

Publication date: 22 December 2015

Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.acha.2014.12.001

zbMATH Keywords

noisy measurementssparse signal reconstructionfixed-point proximity algorithmsone-bit compressive sensing

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (12)

Robust Decoding from 1-Bit Compressive Sampling with Ordinary and Regularized Least Squares ⋮ Multiplicative noise removal with a sparsity-aware optimization model ⋮ Distributed Decoding From Heterogeneous 1-Bit Compressive Measurements ⋮ Just least squares: binary compressive sampling with low generative intrinsic dimension ⋮ Sparse regularization with the ℓ0 norm ⋮ $ \newcommand{\e}{{\rm e}} \ell_{0}$ -minimization methods for image restoration problems based on wavelet frames ⋮ Capped \(\ell_p\) approximations for the composite \(\ell_0\) regularization problem ⋮ Sparse inverse covariance matrix estimation via the $ \newcommand{\e}{{\rm e}} \ell_{0}$ -norm with Tikhonov regularization ⋮ Characterization of ℓ1 minimizer in one-bit compressed sensing ⋮ One-bit compressed sensing via ℓ _p (0 < p < 1)-minimization method ⋮ Quadratic Convergence of Smoothing Newton's Method for 0/1 Loss Optimization ⋮ Adaptive iterative hard thresholding for least absolute deviation problems with sparsity constraints

Cites Work

• Unnamed Item
• Democracy in action: quantization, saturation, and compressive sensing
• The restricted isometry property and its implications for compressed sensing
• Breakdown of equivalence between the minimal \(\ell^1\)-norm solution and the sparsest solution
• Support-vector networks
• One-Bit Compressed Sensing by Linear Programming
• 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
• Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• Variational Analysis
• Trust, But Verify: Fast and Accurate Signal Recovery From 1-Bit Compressive Measurements
• Robust 1-bit Compressive Sensing Using Adaptive Outlier Pursuit
• Stable signal recovery from incomplete and inaccurate measurements
• Proximité et dualité dans un espace hilbertien
• Convex analysis and monotone operator theory in Hilbert spaces
• Compressed sensing
• The elements of statistical learning. Data mining, inference, and prediction

This page was built for publication: Noisy 1-bit compressive sensing: models and algorithms