Exponential Decay of Reconstruction Error From Binary Measurements of Sparse Signals
Richard G. Baraniuk, Simon Foucart, Deanna Needell, Yaniv Plan, Mary K. Wootters
Rice University Texas A&M University Claremont McKenna College University of British Columbia
阅读操作
确认中在文库中上传 PDF 后可生成中文音频讲解。
摘要与影响
Binary measurements arise naturally in a variety of statistics and engineering applications. They may be inherent to the problem-for example, in determining the relationship between genetics and the presence or absence of a disease-or they may be a result of extreme quantization. A recent influx of literature has suggested that using prior signal information can greatly improve the ability to reconstruct a signal from binary measurements. This is exemplified by one-bit compressed sensing, which takes the compressed sensing model but assumes that only the sign of each measurement is retained. It has recently been shown that the number of one-bit measurements required for signal estimation mirrors that of unquantized compressed sensing. Indeed, s-sparse signals in Rn can be estimated (up to normalization) from Ω(slog (n/s)) one-bit measurements. Nevertheless, controlling the precise accuracy of the error estimate remains an open challenge. In this paper, we focus on optimizing the decay of the error as a function of the oversampling factor λ := m/(s log(n/s)), where m is the number of measurements. It is known that the error in reconstructing sparse signals from standard one-bit measurements is bounded below by Ω(λ-1). Without adjusting the measurement procedure, reducing this polynomial error decay rate is impossible. However, we show that an adaptive choice of the thresholds used for quantization can lower the error rate to e-Ω(λ). This improves upon guarantees for other methods of adaptive thresholding, such as sigma- delta quantization. We develop a general recursive strategy to achieve this exponential decay and two specific polynomial-time algorithms, which fall into this framework, one based on convex programming and one on hard thresholding. Our work bridges the one-bit compressed sensing model, in which the engineer controls the measurement procedure, to sigma-delta and successive approximation quantization. Moreover, the principle is extendable to signal reconstruction problems in a variety of binary statistical models as well as statistical estimation problems like logistic regression.
逐年被引趋势
关键指标
同类平均 = 1
同领域 · 同年份 · 同类型
Google Scholar 与 OpenAlex 的被引统计范围不同,数值存在差异属正常。
AI 辅助阅读
依据:摘要
可就本文提问;依据不足时会说明。
学术脉络
学科主题
工程Sparse and Compressive Sensing Techniques
Distributed Sensor Networks and Detection Algorithms · Analog and Mixed-Signal Circuit Design
参考文献 70
此处列出前 3 条
引用本文 117
按被引量排序,此处列出前 3 条