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.
QC 20120416