Designing Asymmetric Shift Operators for Decentralized Subspace Projection
arXiv:2002.08689 · doi:10.1109/TSP.2021.3066787
Abstract
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.
References in corpus (11)
- The Emerging Field of Signal Processing on Graphs: Extending High-Dimensional Data Analysis to Networks and Other Irregular Domains
- Discrete Signal Processing on Graphs
- Discrete Signal Processing on Graphs: Sampling Theory
- Distributed Learning in Wireless Sensor Networks
- Autoregressive Moving Average Graph Filtering
- Advances in Distributed Graph Filtering
- Learning Power Spectrum Maps from Quantized Power Measurements
- Reconstruction of Graph Signals through Percolation from Seeding Nodes
- Distributed Autoregressive Moving Average Graph Filters
- In-network Sparsity-regularized Rank Minimization: Algorithms and Applications
- Adaptation and learning over networks under subspace constraints -- Part I: Stability Analysis