Parallel pursuit for distributed compressed sensing
2013 (English)In: 2013 IEEE Global Conference on Signal and Information Processing, GlobalSIP 2013 - Proceedings, IEEE conference proceedings, 2013, 783-786 p.Conference paper (Refereed)
We develop a greedy (pursuit) algorithm for a distributed compressed sensing problem where multiple sensors are connected over a de-centralized network. The algorithm is referred to as distributed parallel pursuit and it solves the distributed compressed sensing problem in two stages; first by a distributed estimation stage and then an information fusion stage. Along with worst case theoretical analysis for the distributed algorithm, we also perform simulation experiments in a controlled manner. We show that the distributed algorithm performs significantly better than the stand-alone (disconnected) solution and close to a centralized (fully connected to a central point) solution.
Place, publisher, year, edition, pages
IEEE conference proceedings, 2013. 783-786 p.
Distributed compressed sensing, Greedy pursuit
Signal Processing Telecommunications Communication Systems Computer Systems
IdentifiersURN: urn:nbn:se:kth:diva-127283DOI: 10.1109/GlobalSIP.2013.6737008ISI: 000350825600212ScopusID: 2-s2.0-84897721847ISBN: 978-147990248-4OAI: oai:DiVA.org:kth-127283DiVA: diva2:643933
2013 1st IEEE Global Conference on Signal and Information Processing, GlobalSIP 2013; Austin, TX; United States; 3 December 2013 through 5 December 2013
QC 201406252013-08-292013-08-292015-12-07Bibliographically approved