Distributed Predictive Subspace Pursuit
2013 (English)In: 2013 IEEE International Conference on Acoustics, Speech, and Signal Processing ICASSP 2013, New York: IEEE , 2013, 4633-4637 p.Conference paper (Refereed)
In a compressed sensing setup with jointly sparse, correlated data,we develop a distributed greedy algorithm called distributed predic-tive subspace pursuit. Based on estimates from neighboring sensornodes, this algorithm operates iteratively in two steps: first forminga prediction of the signal and then solving the compressed sensingproblem with an iterative linear minimum mean squared estimator.Through simulations we show that the algorithm provides better per-formance than current state-of-the-art algorithms.
Place, publisher, year, edition, pages
New York: IEEE , 2013. 4633-4637 p.
, ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings, ISSN 1520-6149
Compressed sensing, Greedy algorithms, Predic- tion methods, Distributed compressed sensing
Signal Processing Telecommunications
IdentifiersURN: urn:nbn:se:kth:diva-118836DOI: 10.1109/ICASSP.2013.6638538ISI: 000329611504159ScopusID: 2-s2.0-84890474610ISBN: 978-1-4799-0356-6ISBN: 978-1-4799-0355-9OAI: oai:DiVA.org:kth-118836DiVA: diva2:608747
38th International Conference on Acoustics, Speech, and Signal Processing (ICASSP); Vancouver Convention & Exhibition Centre, Vancouver, Canada, May 26 - 31 2013
QC 201309022013-03-012013-03-012014-02-25Bibliographically approved