Hybrid greedy pursuit
2011 (English)In: 19th European Signal Processing Conference (EUSIPCO 2011), 2011, 343-347 p.Conference paper (Refereed)
For constructing the support set of a sparse vector in the standardcompressive sensing framework, we develop a hybridgreedy pursuit algorithm that combines the advantages ofserial and parallel atom selection strategies. In an iterativeframework, the hybrid algorithm uses a joint sparsity informationextracted from the independent use of serial and parallelgreedy pursuit algorithms. Through experimental evaluations,the hybrid algorithm is shown to provide a significantimprovement for the support set recovery performance.
Place, publisher, year, edition, pages
2011. 343-347 p.
IdentifiersURN: urn:nbn:se:kth:diva-67704ScopusID: 2-s2.0-84863746365OAI: oai:DiVA.org:kth-67704DiVA: diva2:485080
19th European Signal Processing Conference (EUSIPCO 2011). Barcelona, Spain, August 29 - September 2, 2011
QC 201204162012-01-272012-01-272012-04-16Bibliographically approved