Paper
4 September 2009 Compressed sensing of autoregressive processes
Author Affiliations +
Abstract
Suppose the signal x ∈ Rn is realized by driving a d-sparse signal z ∈ Rn through an arbitrary unknown stable discrete-linear time invariant system H, namely, x(t) = (h * z)(t), where h(·) is the impulse response of the operator H. Is x(·) compressible in the conventional sense of compressed sensing? Namely, can x(t) be reconstructed from sparse set of measurements. For the case when the unknown system H is auto-regressive (i.e. all pole) of a known order it turns out that x can indeed be reconstructed from O(k log(n)) measurements. The main idea is to pass x through a linear time invariant system G and collect O(k log(n)) sequential measurements. The filter G is chosen suitably, namely, its associated Toeplitz matrix satisfies the RIP property. We develop a novel LP optimization algorithm and show that both the unknown filter H and the sparse input z can be reliably estimated. These types of processes arise naturally in Reflection Seismology.
© (2009) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Venkatesh Saligrama and Manqi Zhao "Compressed sensing of autoregressive processes", Proc. SPIE 7446, Wavelets XIII, 744609 (4 September 2009); https://doi.org/10.1117/12.826830
Lens.org Logo
CITATIONS
Cited by 2 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Autoregressive models

Compressed sensing

Algorithm development

Radon

Signal processing

Linear filtering

Convex optimization

RELATED CONTENT


Back to Top