arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1108.0443cs.ITcs.NImath.IT
收藏

带图约束的稀疏恢复:基本限制和度量构造

Sparse Recovery with Graph Constraints: Fundamental Limits and Measurement Construction

Meng Wang, Weiyu Xu, Enrique Mallada, Ao Tang

摘要:

本文讨论了稀疏恢复与图形约束的问题,在这个意义上,我们可以采取额外的测量节点,只有当他们诱导一个连通的子图。我们提供了几个特殊的图明确的测量结构。一个通用的测量构造算法也提出和评估。对于任何给定的图$G$与$n$节点,我们推导出的顺序最优的最小数量的测量需要恢复任何$k$ -稀疏向量在$G$($M^G_{k,n}$)。我们的研究表明,$M^G_{k,n}$可以作为一个图的连通性度量。

英文摘要:

This paper addresses the problem of sparse recovery with graph constraints in the sense that we can take additive measurements over nodes only if they induce a connected subgraph. We provide explicit measurement constructions for several special graphs. A general measurement construction algorithm is also proposed and evaluated. For any given graph $G$ with $n$ nodes, we derive order optimal upper bounds of the minimum number of measurements needed to recover any $k$-sparse vector over $G$ ($M^G_{k,n}$). Our study suggests that $M^G_{k,n}$ may serve as a graph connectivity metric.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑