Distributed predictive subspace pursuit

Dennis Sundman, Dave Zachariah, Saikat Chatterjee, Mikael SkoglundICASSP 2013 · OpenReview

Abstract

In a compressed sensing setup with jointly sparse, correlated data, we develop a distributed greedy algorithm called distributed predictive subspace pursuit. Based on estimates from neighboring sensor nodes, this algorithm operates iteratively in two steps: first forming a prediction of the signal and then solving the compressed sensing problem with an iterative linear minimum mean squared estimator. Through simulations we show that the algorithm provides better performance than current state-of-the-art algorithms.
BibTeX
@inproceedings{sundman2013distributed,
  author = {Dennis Sundman and Dave Zachariah and Saikat Chatterjee and Mikael Skoglund},
  title = {{Distributed predictive subspace pursuit}},
  booktitle = {IEEE International Conference on Acoustics, Speech and Signal Processing},
  year = {2013},
  url = {https://openreview.net/forum?id=BJnRyvlR2J},
}

Loading related content...

Figure