论文标题
为分散子空间投影设计不对称换档操作员
Designing Asymmetric Shift Operators for Decentralized Subspace Projection
论文作者
论文摘要
无线传感器网络中的大量应用程序包括将嘈杂的观测值向量投影到由先前有关正在监视的字段的信息决定的子空间。通常，以集中式的方式完成这样的任务，需要大量的功耗，某些节点的拥堵，并且遭受了可能的节点失败的鲁棒性问题。以分散的方式计算此类预测是解决这些问题的替代解决方案。最近的工作表明，可以通过所谓的图形过滤器完成此任务，在这些图形过滤器中，只使用图形移动运算符以分布式方式执行本地节点通信。现有方法为对称拓扑设计了图形过滤器。但是，在本文中，研究了图形移位运算符的设计，以对不对称拓扑进行分散的子空间投影。
A large number of applications in wireless sensor networks include projecting a vector of noisy observations onto a subspace dictated by prior information about the field being monitored. In general, accomplishing such a task in a centralized fashion, entails a large power consumption, congestion at certain nodes, and suffers from robustness issues against possible node failures. Computing such projections in a decentralized fashion is an alternative solution that solves these issues. Recent works have shown that this task can be done via the so-called graph filters where only local inter-node communication is performed in a distributed manner using a graph shift operator. Existing methods designed the graph filters for symmetric topologies. However, in this paper, the design of the graph shift operators to perform decentralized subspace projection for asymmetric topologies is studied.
