Look Ahead Parallel Pursuit
2011 (English)In: 2011 IEEE Swedish Communication Technologies Workshop, Swe-CTW 2011, 2011, 114-117 p.Conference paper (Refereed)
We endeavor to improve compressed sensing reconstruction performance of parallel pursuit algorithms. In an iteration, standard parallel pursuit algorithms use a support-set expansion by a fixed number of coefficients, leading to restricted performance. To achive a better performance, we develop a look ahead strategy that adaptively chooses the best number of coefficients. We develop a new algorithm which we call look ahead parallel pursuit, where a look ahead strategy is invoked on a minimal residual norm criterion. The new algorithm provides a trade-off between performance and complexity.
Place, publisher, year, edition, pages
2011. 114-117 p.
compressed sensing, greedy pursuit algorithms
IdentifiersURN: urn:nbn:se:kth:diva-60017DOI: 10.1109/Swe-CTW.2011.6082477ScopusID: 2-s2.0-83755172588ISBN: 978-145771878-6OAI: oai:DiVA.org:kth-60017DiVA: diva2:477121
2011 IEEE Swedish Communication Technologies Workshop, Swe-CTW 2011. Stockholm. 19 October 2011 - 21 October 2011
QC 201201132012-01-122012-01-122012-02-29Bibliographically approved