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

From MaRDI portal
Revision as of 11:57, 7 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4573298

DOI10.1109/TSP.2011.2162324zbMath1393.94314OpenAlexW2140532408MaRDI QIDQ4573298

ZaiWen Wen, Wotao Yin, Jason N. Laska, 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




Related Items (23)

Robust Decoding from 1-Bit Compressive Sampling with Ordinary and Regularized Least SquaresQuantization and Compressive Sensing1-bit compressive sensing: reformulation and RRSP-based sign recovery theoryDistributed Decoding From Heterogeneous 1-Bit Compressive MeasurementsNoisy 1-bit compressive sensing: models and algorithmsJust least squares: binary compressive sampling with low generative intrinsic dimensionGeneralized left-localized Cayley parametrization for optimization with orthogonality constraintsA splitting method for orthogonality constrained problemsClassification Scheme for Binary Data with ExtensionsThe landscape of empirical risk for nonconvex lossesA feasible method for optimization with orthogonality constraintsTwo adaptive scaled gradient projection methods for Stiefel manifold constrained optimizationSimple Classification using Binary DataDual-density-based reweighted \(\ell_1\)-algorithms for a class of \(\ell_0\)-minimization problemsA derivative-free algorithm for spherically constrained optimizationNonuniqueness of solutions of a class of \(\ell_0\)-minimization problemsJoint image compression-encryption scheme using entropy coding and compressive sensingOn the Atomic Decomposition of Coorbit Spaces with Non-integrable KernelGlobal optimization with orthogonality constraints via stochastic diffusion on manifoldCharacterization of ℓ1 minimizer in one-bit compressed sensingOne-Bit Compressed Sensing by Linear ProgrammingDeterministic construction of sparse binary matrices via incremental integer optimizationAdaptive iterative hard thresholding for least absolute deviation problems with sparsity constraints







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