Non-Bayesian Estimation Framework for Signal Recovery on Graphs
arXiv:2005.01952 · doi:10.1109/TSP.2021.3054995
Abstract
Graph signals arise from physical networks, such as power and communication systems, or as a result of a convenient representation of data with complex structure, such as social networks. We consider the problem of general graph signal recovery from noisy, corrupted, or incomplete measurements and under structural parametric constraints, such as smoothness in the graph frequency domain. In this paper, we formulate the graph signal recovery as a non-Bayesian estimation problem under a weighted mean-squared-error (WMSE) criterion, which is based on a quadratic form of the Laplacian matrix of the graph and its trace WMSE is the Dirichlet energy of the estimation error w.r.t. the graph. The Laplacian-based WMSE penalizes estimation errors according to their graph spectral content and is a difference-based cost function which accounts for the fact that in many cases signal recovery on graphs can only be achieved up to a constant addend. We develop a new Cramér-Rao bound (CRB) on the Laplacian-based WMSE and present the associated Lehmann unbiasedness condition w.r.t. the graph. We discuss the graph CRB and estimation methods for the fundamental problems of 1) A linear Gaussian model with relative measurements; and 2) Bandlimited graph signal recovery. We develop sampling allocation policies that optimize sensor locations in a network for these problems based on the proposed graph CRB. Numerical simulations on random graphs and on electrical network data are used to validate the performance of the graph CRB and sampling policies.
References in corpus (21)
- 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
- Efficient Sampling Set Selection for Bandlimited Graph Signals Using Graph Spectral Proxies
- Signal Recovery on Graphs: Variation Minimization
- Sampling of graph signals with successive local aggregations
- Monitoring and Optimization for Power Grids: A Signal Processing Perspective
- Eigendecomposition-Free Sampling Set Selection for Graph Signals
- Cramér-Rao bounds for synchronization of rotations
- Power Systems Topology and State Estimation by Graph Blind Source Separation
- Graph-based Semi-Supervised & Active Learning for Edge Flows
- Fast Graph Sampling Set Selection Using Gershgorin Disc Alignment
- Low-complexity Graph Sampling with Noise and Signal Reconstruction via Neumann Series
- Sparse Sampling for Inverse Problems with Tensors
- A Note on Preconditioning by Low-Stretch Spanning Trees
- Cramer-Rao Lower Bound and Information Geometry
- Cramer-Rao Bound for Constrained Parameter Estimation Using Lehmann-Unbiasedness
- Controllability of Bandlimited Graph Processes Over Random Time Varying Graphs
- Estimation after Parameter Selection: Performance Analysis and Estimation Methods
- Estimation and Registration on Graphs
- Closed Form Solutions of Combinatorial Graph Laplacian Estimation under Acyclic Topology Constraints