.png){kind=icon}
返回
Distributed greedy pursuit algorithms
.png){kind=icon}
OA
AI
DOI：10.1016/j.sigpro.2014.05.027.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
For compressed sensing over arbitrarily connected networks, we consider the problem of estimating underlying sparse signals in a distributed manner. We introduce a new signal model that helps to describe inter-signal correlation among connected nodes. Based on this signal model along with a brief survey of existing greedy algorithms, we develop distributed greedy algorithms with low communication overhead. Incorporating appropriate modifications, we design two new distributed algorithms where the local algorithms are based on appropriately modified existing orthogonal matching pursuit and subspace pursuit. Further, by combining advantages of these two local algorithms, we design a new greedy algorithm that is well suited for a distributed scenario. By extensive simulations we demonstrate that the new algorithms in a sparsely connected network provide good performance, close to the performance of a centralized greedy solution. (c) 2014 Elsevier B.V. All rights reserved.
Keyword:
Greedy algorithms
Compressed sensing
Distributed compressed sensing
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
10.0K
被引数:
1.7W
机构
引用论文
.png){kind=icon}
Surface enhanced Raman scattering of pyridine at copper electrodes excited with a 514.5 nm line
PREAI
分享收藏
查看更多内容