A Greedy Pursuit Algorithm for Distributed Compressed Sensing
2012 (English)In: Acoustics, Speech and Signal Processing (ICASSP), 2012 IEEE International Conference on, IEEE , 2012, 2729-2732 p.Conference paper (Refereed)
We develop a greedy pursuit algorithm for solving the distributed compressed sensing problem in a connected network. This algorithm is based on subspace pursuit and uses the mixed support-setsignal model. Through experimental evaluation, we show that the distributed algorithm performs significantly better than the standalone (disconnected) solution and close to a centralized (fully connected to a central point) solution.
Place, publisher, year, edition, pages
IEEE , 2012. 2729-2732 p.
, IEEE International Conference on Acoustics, Speech and Signal Processing. Proceedings, ISSN 1520-6149
Distributed compressed sensing, greedy pursuit
IdentifiersURN: urn:nbn:se:kth:diva-60019DOI: 10.1109/ICASSP.2012.6288481ISI: 000312381402203ScopusID: 2-s2.0-84867594533ISBN: 978-146730046-9OAI: oai:DiVA.org:kth-60019DiVA: diva2:477125
2012 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2012; Kyoto; 25 March 2012 through 30 March 2012
FunderICT - The Next Generation
QC 201211142012-01-122012-01-122013-04-15Bibliographically approved