Random Filters for Compressive Sampling and Reconstruction


We propose and study a new technique for efficiently acquiring and reconstructing signals based on convolution with a fixed FIR filter having random taps. The method is designed for sparse and compressible signals, i.e., ones that are well approximated by a short linear combination of vectors from an orthonormal basis. Signal reconstruction involves a non-linear Orthogonal Matching Pursuit algorithm that we implement efficiently by exploiting the nonadaptive, time-invariant structure of the measurement process. While simpler and more efficient than other random acquisition techniques like Compressed Sensing, random filtering is sufficiently generic to summarize many types of compressible signals and generalizes to streaming and continuous-time signals. Extensive numerical experiments demonstrate its efficacy for acquiring and reconstructing signals sparse in the time, frequency, and wavelet domains, as well as piecewise smooth signals and Poisson processes.

Conference Paper
Conference paper
Orthogonal Matching Pursuit algorithm

R. G. Baraniuk, M. Wakin, M. F. Duarte, J. A. Tropp and D. Baron, "Random Filters for Compressive Sampling and Reconstruction," vol. 3, 2006.

Forms part of
Link to license
Citable link to this page