Robust one-bit compressed sensing with partial circulant matrices
The Annals of Applied Probability · 01.06.2023 · 33 (3) · 1874-1903
DOI: 10.1214/22-aap1855 ↗Kurz gefasst
Fachartikel in der Zeitschrift The Annals of Applied Probability, erschienen am 01.06.2023. Verfasst von Sjoerd Dirksen und 1 weiteren Autor:innen. Die Arbeit wurde bisher 7-mal zitiert (Crossref) und nennt 22 Literaturangaben.
Abstract (Originalsprache)
We present optimal sample complexity estimates for one-bit compressed sensing problems in a realistic scenario: the procedure uses a structured matrix (a randomly subsampled circulant matrix) and is robust to analog prequantization noise as well as to adversarial bit corruptions in the quantization process. Our results imply that quantization is not a statistically expensive procedure in the presence of nontrivial analog noise: recovery requires the same sample size one would have needed had the measurement matrix been Gaussian and the noisy analog measurements been given as data.
Zitieren
APA
Dirksen, S., & Mendelson, S. (2023). Robust one-bit compressed sensing with partial circulant matrices. The Annals of Applied Probability, 33(3), 1874-1903. https://doi.org/10.1214/22-aap1855
Vancouver
Dirksen S, Mendelson S. Robust one-bit compressed sensing with partial circulant matrices. The Annals of Applied Probability. 2023;33(3):1874-1903. doi:10.1214/22-aap1855
BibTeX
@article{Dirksen2023,
author = {Dirksen, Sjoerd and Mendelson, Shahar},
title = {Robust one-bit compressed sensing with partial circulant matrices},
journal = {The Annals of Applied Probability},
year = {2023},
volume = {33},
number = {3},
pages = {1874--1903},
doi = {10.1214/22-aap1855}
}
EUVIMED