Robust 1-bit Compressive Sensing Using Adaptive Outlier Pursuit

DOI10.1109/TSP.2012.2193397zbMath1393.94723OpenAlexW2150991625MaRDI QIDQ4573889

Ming Yan, Yi Yang, Stanley J. Osher

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.2012.2193397

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Sampling theory in information and communication theory (94A20)

Related Items

Robust Decoding from 1-Bit Compressive Sampling with Ordinary and Regularized Least Squares, 1-bit compressive sensing: reformulation and RRSP-based sign recovery theory, Exact low-rank matrix completion from sparsely corrupted entries via adaptive outlier pursuit, Distributed Decoding From Heterogeneous 1-Bit Compressive Measurements, Noisy 1-bit compressive sensing: models and algorithms, Just least squares: binary compressive sampling with low generative intrinsic dimension, A splitting method for orthogonality constrained problems, Classification Scheme for Binary Data with Extensions, Simple Classification using Binary Data, On the Atomic Decomposition of Coorbit Spaces with Non-integrable Kernel, 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