pith. sign in

arxiv: 1206.2496 · v1 · pith:GNXODICTnew · submitted 2012-06-12 · 🧮 math.ST · stat.TH

Dynamic Iterative Pursuit

classification 🧮 math.ST stat.TH
keywords algorithmdynamiccompressiveconditionsiterativeperformancepursuitsensing
0
0 comments X
read the original abstract

For compressive sensing of dynamic sparse signals, we develop an iterative pursuit algorithm. A dynamic sparse signal process is characterized by varying sparsity patterns over time/space. For such signals, the developed algorithm is able to incorporate sequential predictions, thereby providing better compressive sensing recovery performance, but not at the cost of high complexity. Through experimental evaluations, we observe that the new algorithm exhibits a graceful degradation at deteriorating signal conditions while capable of yielding substantial performance gains as conditions improve.

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.