Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors
From MaRDI portal
Publication:2989301
DOI10.1109/TIT.2012.2234823zbMath1364.94130arXiv1104.3160OpenAlexW2112038498MaRDI QIDQ2989301
Richard G. Baraniuk, Jason N. Laska, Laurent Jacques, Petros T. Boufounos
Publication date: 8 June 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1104.3160
Related Items (54)
Binary vectors for fast distance and similarity estimation ⋮ Error bounds for consistent reconstruction: random polytopes and coverage processes ⋮ Sparse recovery from inaccurate saturated measurements ⋮ Sigma delta quantization with harmonic frames and partial Fourier ensembles ⋮ Robust Decoding from 1-Bit Compressive Sampling with Ordinary and Regularized Least Squares ⋮ A survey on compressive sensing: classical results and recent advancements ⋮ Quantization and Compressive Sensing ⋮ 1-bit compressive sensing: reformulation and RRSP-based sign recovery theory ⋮ Phase retrieval by binary questions: which complementary subspace is closer? ⋮ Unnamed Item ⋮ Generalized notions of sparsity and restricted isometry property. II: Applications ⋮ Quantization of compressive samples with stable and robust recovery ⋮ On the number of faces and radii of cells induced by Gaussian spherical tessellations ⋮ One-bit gridless DOA estimation with multiple measurements exploiting accelerated proximal gradient algorithm ⋮ Sigma Delta Quantization for Images ⋮ A unified approach to uniform signal recovery from nonlinear observations ⋮ Distributed Decoding From Heterogeneous 1-Bit Compressive Measurements ⋮ Fast Metric Embedding into the Hamming Cube ⋮ Noisy 1-bit compressive sensing: models and algorithms ⋮ Just least squares: binary compressive sampling with low generative intrinsic dimension ⋮ Sparse recovery from saturated measurements ⋮ Weighted ${\ell}_{{1}}$-minimization for sparse recovery under arbitrary prior information ⋮ Representation and coding of signal geometry ⋮ Time for dithering: fast and quantized random embeddings via the restricted isometry property ⋮ High-dimensional estimation with geometric constraints: Table 1. ⋮ One-bit sensing, discrepancy and Stolarsky's principle ⋮ Bipolar measurement matrix using chaotic sequence ⋮ One-bit compressed sensing with non-Gaussian measurements ⋮ Democracy in action: quantization, saturation, and compressive sensing ⋮ Quantized Compressed Sensing: A Survey ⋮ Classification Scheme for Binary Data with Extensions ⋮ Fast binary embeddings with Gaussian circulant matrices: improved bounds ⋮ Dimension reduction by random hyperplane tessellations ⋮ On recovery guarantees for one-bit compressed sensing on manifolds ⋮ Compressive sensing based sampling and reconstruction for wireless sensor array network ⋮ Estimation in High Dimensions: A Geometric Perspective ⋮ Non-Gaussian hyperplane tessellations and robust one-bit compressed sensing ⋮ Simple Classification using Binary Data ⋮ Joint image compression-encryption scheme using entropy coding and compressive sensing ⋮ Memoryless scalar quantization for random frames ⋮ Endpoint Results for Fourier Integral Operators on Noncompact Symmetric Spaces ⋮ On the Atomic Decomposition of Coorbit Spaces with Non-integrable Kernel ⋮ Sparse classification: a scalable discrete optimization perspective ⋮ Characterization of ℓ1 minimizer in one-bit compressed sensing ⋮ One-Bit Compressed Sensing by Linear Programming ⋮ One-bit compressed sensing via ℓ p (0 < p < 1)-minimization method ⋮ Unnamed Item ⋮ AdaBoost and robust one-bit compressed sensing ⋮ Information theory and recovery algorithms for data fusion in Earth observation ⋮ Quadratic Convergence of Smoothing Newton's Method for 0/1 Loss Optimization ⋮ Adaptive iterative hard thresholding for least absolute deviation problems with sparsity constraints ⋮ Covariance estimation under one-bit quantization ⋮ A Theoretical Perspective on Hyperdimensional Computing ⋮ Iteratively consistent one-bit phase retrieval
This page was built for publication: Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors
