Robust 1-bit Compressive Sensing Using Adaptive Outlier Pursuit
From MaRDI portal
Cited in
(19)- Characterization of \(\ell_1\) minimizer in one-bit compressed sensing
- Distributed Decoding From Heterogeneous 1-Bit Compressive Measurements
- Optimality conditions and gradient descent Newton pursuit for 0/1-loss and sparsity constrained optimization
- 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
- One-bit compressed sensing via \(\ell_p\) \((0<p<1)\)-minimization method
- Just least squares: binary compressive sampling with low generative intrinsic dimension
- A splitting method for orthogonality constrained problems
- On the atomic decomposition of coorbit spaces with non-integrable kernel
- Noisy 1-bit compressive sensing: models and algorithms
- 1-bit compressive sensing: reformulation and RRSP-based sign recovery theory
- Robust one-bit compressed sensing via continuous sign approximation and hybrid ordinary-Welsch function
- Quadratic Convergence of Smoothing Newton's Method for 0/1 Loss Optimization
- Robust Decoding from 1-Bit Compressive Sampling with Ordinary and Regularized Least Squares
- Exact low-rank matrix completion from sparsely corrupted entries via adaptive outlier pursuit
- Computing one-bit compressive sensing via zero-norm regularized DC loss model and its surrogate
- Robust decoding from binary measurements with cardinality constraint least squares
- Classification scheme for binary data with extensions
- Simple classification using binary data
This page was built for publication: Robust 1-bit Compressive Sensing Using Adaptive Outlier Pursuit
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4573889)
