Hybrid greedy pursuit

Saikat Chatterjee, Dennis Sundman, Mikko Vehkaperä, Mikael Skoglund

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review

1 Citation (Scopus)

Abstract

For constructing the support set of a sparse vector in the standard compressive sensing framework, we develop a hybrid greedy pursuit algorithm that combines the advantages of serial and parallel atom selection strategies. In an iterative framework, the hybrid algorithm uses a joint sparsity information extracted from the independent use of serial and parallel greedy pursuit algorithms. Through experimental evaluations, the hybrid algorithm is shown to provide a significant improvement for the support set recovery performance.

Original languageEnglish
Title of host publication19th European Signal Processing Conference, EUSIPCO 2011
PublisherIEEE Institute of Electrical and Electronic Engineers
Pages343-347
Number of pages5
Publication statusPublished - 1 Dec 2011
MoE publication typeA4 Article in a conference publication
Event19th European Signal Processing Conference, EUSIPCO 2011 - Barcelona, Spain
Duration: 29 Aug 20112 Sep 2011

Publication series

SeriesEuropean Signal Processing Conference
Volume19
ISSN2219-5491

Conference

Conference19th European Signal Processing Conference, EUSIPCO 2011
CountrySpain
CityBarcelona
Period29/08/112/09/11

Fingerprint

Recovery
Atoms

Cite this

Chatterjee, S., Sundman, D., Vehkaperä, M., & Skoglund, M. (2011). Hybrid greedy pursuit. In 19th European Signal Processing Conference, EUSIPCO 2011 (pp. 343-347). IEEE Institute of Electrical and Electronic Engineers . European Signal Processing Conference, Vol.. 19
Chatterjee, Saikat ; Sundman, Dennis ; Vehkaperä, Mikko ; Skoglund, Mikael. / Hybrid greedy pursuit. 19th European Signal Processing Conference, EUSIPCO 2011. IEEE Institute of Electrical and Electronic Engineers , 2011. pp. 343-347 (European Signal Processing Conference, Vol. 19).
@inproceedings{ccbc40ce5c0d43198a9f20a502b85a65,
title = "Hybrid greedy pursuit",
abstract = "For constructing the support set of a sparse vector in the standard compressive sensing framework, we develop a hybrid greedy pursuit algorithm that combines the advantages of serial and parallel atom selection strategies. In an iterative framework, the hybrid algorithm uses a joint sparsity information extracted from the independent use of serial and parallel greedy pursuit algorithms. Through experimental evaluations, the hybrid algorithm is shown to provide a significant improvement for the support set recovery performance.",
author = "Saikat Chatterjee and Dennis Sundman and Mikko Vehkaper{\"a} and Mikael Skoglund",
year = "2011",
month = "12",
day = "1",
language = "English",
series = "European Signal Processing Conference",
publisher = "IEEE Institute of Electrical and Electronic Engineers",
pages = "343--347",
booktitle = "19th European Signal Processing Conference, EUSIPCO 2011",
address = "United States",

}

Chatterjee, S, Sundman, D, Vehkaperä, M & Skoglund, M 2011, Hybrid greedy pursuit. in 19th European Signal Processing Conference, EUSIPCO 2011. IEEE Institute of Electrical and Electronic Engineers , European Signal Processing Conference, vol. 19, pp. 343-347, 19th European Signal Processing Conference, EUSIPCO 2011, Barcelona, Spain, 29/08/11.

Hybrid greedy pursuit. / Chatterjee, Saikat; Sundman, Dennis; Vehkaperä, Mikko; Skoglund, Mikael.

19th European Signal Processing Conference, EUSIPCO 2011. IEEE Institute of Electrical and Electronic Engineers , 2011. p. 343-347 (European Signal Processing Conference, Vol. 19).

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review

TY - GEN

T1 - Hybrid greedy pursuit

AU - Chatterjee, Saikat

AU - Sundman, Dennis

AU - Vehkaperä, Mikko

AU - Skoglund, Mikael

PY - 2011/12/1

Y1 - 2011/12/1

N2 - For constructing the support set of a sparse vector in the standard compressive sensing framework, we develop a hybrid greedy pursuit algorithm that combines the advantages of serial and parallel atom selection strategies. In an iterative framework, the hybrid algorithm uses a joint sparsity information extracted from the independent use of serial and parallel greedy pursuit algorithms. Through experimental evaluations, the hybrid algorithm is shown to provide a significant improvement for the support set recovery performance.

AB - For constructing the support set of a sparse vector in the standard compressive sensing framework, we develop a hybrid greedy pursuit algorithm that combines the advantages of serial and parallel atom selection strategies. In an iterative framework, the hybrid algorithm uses a joint sparsity information extracted from the independent use of serial and parallel greedy pursuit algorithms. Through experimental evaluations, the hybrid algorithm is shown to provide a significant improvement for the support set recovery performance.

UR - http://www.scopus.com/inward/record.url?scp=84863746365&partnerID=8YFLogxK

M3 - Conference article in proceedings

AN - SCOPUS:84863746365

T3 - European Signal Processing Conference

SP - 343

EP - 347

BT - 19th European Signal Processing Conference, EUSIPCO 2011

PB - IEEE Institute of Electrical and Electronic Engineers

ER -

Chatterjee S, Sundman D, Vehkaperä M, Skoglund M. Hybrid greedy pursuit. In 19th European Signal Processing Conference, EUSIPCO 2011. IEEE Institute of Electrical and Electronic Engineers . 2011. p. 343-347. (European Signal Processing Conference, Vol. 19).