pith. sign in

arxiv: 0912.1628 · v3 · submitted 2009-12-08 · 💻 cs.IT · math.IT· stat.ME

KF-CS: Compressive Sensing on Kalman Filtered Residual

classification 💻 cs.IT math.ITstat.ME
keywords kf-csfilteredkalmanobservationresidualsensingtimeadditive
0
0 comments X
read the original abstract

We consider the problem of recursively reconstructing time sequences of sparse signals (with unknown and time-varying sparsity patterns) from a limited number of linear incoherent measurements with additive noise. The idea of our proposed solution, KF CS-residual (KF-CS) is to replace compressed sensing (CS) on the observation by CS on the Kalman filtered (KF) observation residual computed using the previous estimate of the support. KF-CS error stability over time is studied. Simulation comparisons with CS and LS-CS are shown.

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.