Decentralized and Collaborative Subspace Pursuit: A Communication-Efficient Algorithm for Joint Sparsity Pattern Recovery With Sensor Networks

In this paper, we consider the problem of joint sparsity pattern recovery in a distributed sensor network. The sparse multiple measurement vector signals (MMVs) observed by all the nodes are assumed to have a common (but unknown) sparsity pattern. To accurately recover the common sparsity pattern in...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on signal processing Ročník 64; číslo 3; s. 556 - 566
Hlavní autoři:	Gang Li, Wimalajeewa, Thakshila, Varshney, Pramod K.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	IEEE 01.02.2016
Témata:	Algorithm design and analysis Algorithms Collaboration compressive sensing Decentralized Estimates information fusion Joint sparsity pattern recovery Matching pursuit algorithms Mathematical analysis Networks Recovery Signal processing algorithms Sparse representation subspace pursuit Subspaces Vectors (mathematics)
ISSN:	1053-587X, 1941-0476
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!