Trust, But Verify: Fast and Accurate Signal Recovery From 1-Bit Compressive Measurements

DOI10.1109/TSP.2011.2162324MaRDI QIDQ4573298zbMATH OpenOpenAlexFDO

Authors Jason N. Laska, Zaiwen Wen, Wotao Yin, Richard G. Baraniuk

Publication date 18 July 2018

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tsp.2011.2162324

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Rate-distortion theory in information and communication theory (94A34)

Cited in

(27)

• Characterization of \(\ell_1\) minimizer in one-bit compressed sensing
• Nonuniqueness of solutions of a class of \(\ell_0\)-minimization problems
• Distributed Decoding From Heterogeneous 1-Bit Compressive Measurements
• Adaptive iterative hard thresholding for least absolute deviation problems with sparsity constraints
• A reliable iteration algorithm for one-bit compressive sensing on the unit sphere
• Joint image compression-encryption scheme using entropy coding and compressive sensing
• Just least squares: binary compressive sampling with low generative intrinsic dimension
• Quantization and compressive sensing
• A splitting method for orthogonality constrained problems
• Global optimization with orthogonality constraints via stochastic diffusion on manifold
• A feasible method for optimization with orthogonality constraints
• Generalized left-localized Cayley parametrization for optimization with orthogonality constraints
• On the atomic decomposition of coorbit spaces with non-integrable kernel
• Deterministic construction of sparse binary matrices via incremental integer optimization
• Noisy 1-bit compressive sensing: models and algorithms
• Dual-density-based reweighted \(\ell_1\)-algorithms for a class of \(\ell_0\)-minimization problems
• 1-bit compressive sensing: reformulation and RRSP-based sign recovery theory
• A derivative-free algorithm for spherically constrained optimization
• Robust Decoding from 1-Bit Compressive Sampling with Ordinary and Regularized Least Squares
• Two adaptive scaled gradient projection methods for Stiefel manifold constrained optimization
• One-bit compressed sensing by linear programming
• Computing one-bit compressive sensing via zero-norm regularized DC loss model and its surrogate
• The landscape of empirical risk for nonconvex losses
• Robust decoding from binary measurements with cardinality constraint least squares
• Classification scheme for binary data with extensions
• Simple classification using binary data
• A randomized feasible algorithm for optimization with orthogonal constraints

This page was built for publication: Trust, But Verify: Fast and Accurate Signal Recovery From 1-Bit Compressive Measurements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4573298)