pith. sign in

arxiv: 1605.02341 · v1 · pith:6THZUD3Vnew · submitted 2016-05-08 · 🧮 math.OC

Accelerated reconstruction of a compressively sampled data stream

classification 🧮 math.OC
keywords methodstreamcompressedconvergencedataonlineproposedrecursive
0
0 comments X
read the original abstract

The traditional compressed sensing approach is naturally offline, in that it amounts to sparsely sampling and reconstructing a given dataset. Recently, an online algorithm for performing compressed sensing on streaming data was proposed: the scheme uses recursive sampling of the input stream and recursive decompression to accurately estimate stream entries from the acquired noisy measurements. In this paper, we develop a novel Newton-type forward-backward proximal method to recursively solve the regularized Least-Squares problem (LASSO) online. We establish global convergence of our method as well as a local quadratic convergence rate. Our simulations show a substantial speed-up over the state of the art which may render the proposed method suitable for applications with stringent real-time constraints.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.