Title :
A greedy pursuit algorithm for distributed compressed sensing
Author :
Sundman, Dennis ; Chatterjee, Saikat ; Skoglund, Mikael
Author_Institution :
Sch. of Electr. Eng. & ACCESS Linnaeus Centre, KTH-R. Inst. of Technol., Stockholm, Sweden
Abstract :
We develop a greedy pursuit algorithm for solving the distributed compressed sensing problem in a connected network. This algorithm is based on subspace pursuit and uses the mixed support-set signal model. Through experimental evaluation, we show that the distributed algorithm performs significantly better than the standalone (disconnected) solution and close to a centralized (fully connected to a central point) solution.
Keywords :
compressed sensing; distributed algorithms; greedy algorithms; connected network; distributed algorithm; distributed compressed sensing problem; greedy pursuit algorithm; mixed support-set signal model; subspace pursuit; Complexity theory; Compressed sensing; Matching pursuit algorithms; Network topology; Sensors; Standards; Vectors; Distributed compressed sensing; greedy pursuit;
Conference_Titel :
Acoustics, Speech and Signal Processing (ICASSP), 2012 IEEE International Conference on
Conference_Location :
Kyoto
Print_ISBN :
978-1-4673-0045-2
Electronic_ISBN :
1520-6149
DOI :
10.1109/ICASSP.2012.6288481
