Dynamic Iterative Pursuit

DOI10.1109/TSP.2012.2203813MaRDI QIDQ4574022zbMATH OpenDBLPWikidataFDO

Authors Dave Zachariah, Saikat Chatterjee, Magnus Jansson

Publication date 18 July 2018

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1206.2496

Mathematics Subject Classification ID

Sampling theory in information and communication theory (94A20)

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.

Recommendations

• scientific article; zbMATH DE number 1448986
• scientific article; zbMATH DE number 3956331
• Deviated linear cyclic pursuit
• Dynamic Interpolation Search Revisited
• Dynamic interpolation search revisited
• Generalization of nonlinear cyclic pursuit
• Dynamic iteration methods applied to linear DAE systems
• scientific article; zbMATH DE number 6319900
• Dynamics of a higher-order family of iterative methods

Cited in

(1)

• Generalization of nonlinear cyclic pursuit

This page was built for publication: Dynamic Iterative Pursuit

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4574022)