paper-with-me

Papers

A Universal Sampling Method for Reconstructing Signals with Simple Fourier Transforms

2018-12-20 · Haim Avron, Michael Kapralov, Cameron Musco, Christopher Musco, Ameya Velingker, Amir Zandieh

Reconstructing continuous signals from a small number of discrete samples is a fundamental problem across science and engineering. In practice, we are often interested in signals with 'simple' Fourier structure, such as bandlimited, multiband, and Fourier sparse signals. More broadly, any prior knowledge about a signal's Fourier power spectrum can constrain its complexity. Intuitively, signals with more highly constrained Fourier structure require fewer samples to reconstruct. We formalize this intuition by showing that, roughly, a continuous signal from a given class can be approximately reconstructed using a number of samples proportional to the *statistical dimension* of the allowed power spectrum of that class. Further, in nearly all settings, this natural measure tightly characterizes the sample complexity of signal reconstruction. Surprisingly, we also show that, up to logarithmic factors, a universal non-uniform sampling strategy can achieve this optimal complexity for *any class of signals*. We present a simple and efficient algorithm for recovering a signal from the samples taken. For bandlimited and sparse signals, our method matches the state-of-the-art. At the same time, it gives the first computationally and sample efficient solution to a broad range of problems, including multiband signal reconstruction and kriging and Gaussian process regression tasks in one dimension. Our work is based on a novel connection between randomized linear algebra and signal reconstruction with constrained Fourier structure. We extend tools based on statistical leverage score sampling and column-based matrix reconstruction to the approximation of continuous linear operators that arise in signal reconstruction. We believe that these extensions are of independent interest and serve as a foundation for tackling a broad range of continuous time problems using randomized methods.

📄 PDF Abstract BibTeX arXiv:1812.08723

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Sampling of Correlated Bandlimited Continuous Signals by Joint Time-vertex Graph Fourier Transform

2022-10-10 · Zhongyi Ni, Feng Ji, Hang Sheng, Hui Feng 외

When sampling multiple signals, the correlation between the signals can be exploited to reduce the overall number of samples. In this paper, we study the sampling theory of multiple correlated signals, using correlation …

Unlimited Sampling Theorem Based on Fractional Fourier Transform

2021-10-22 · Hui Zhao, Bing-Zhao Li

The recovery of bandlimited signals with high dynamic range is a hot issue in sampling research. The unlimited sampling theory expands the recordable range of traditional analog-to-digital converters (ADCs) arbitrarily, …

Learning to Sample: Data-Driven Sampling and Reconstruction of FRI Signals

2021-06-28 · Satish Mulleti, Haiyang Zhang, Yonina C. Eldar

Finite-rate-of-innovation (FRI) signals are ubiquitous in applications such as radar, ultrasound, and time of flight imaging. Due to their finite degrees of freedom, FRI signals can be sampled at sub-Nyquist rates using …

compressed sensing

Reconstructing Gaussian sources by spatial sampling

2018-03-15 · Vinay Praneeth Boda

Consider a Gaussian memoryless multiple source with $m$ components with joint probability distribution known only to lie in a given class of distributions. A subset of $k \leq m$ components are sampled and compressed wit…

Fast Fourier-Based Generation of the Compression Matrix for Deterministic Compressed Sensing

2018-07-01 · Sai Charan Jajimi

The primary goal of this work is to review the importance of data compression and present a fast Fourier-based method for generating the deterministic compression matrix in the area of deterministic compressed sensing. T…

compressed sensingData Compression