Widely-Linear MMSE Estimation of Complex-Valued Graph Signals

Abstract

In this paper, we consider the problem of recovering random graph signals with complex values. For general Bayesian estimation of complex-valued vectors, it is known that the widely-linear minimum mean-squared-error (WLMMSE) estimator can achieve a lower mean-squared-error (MSE) than that of the linear minimum MSE (LMMSE) estimator. Inspired by the WLMMSE estimator, in this paper we develop the graph signal processing (GSP)-WLMMSE estimator, which minimizes the MSE among estimators that are represented as a two-channel output of a graph filter, i.e. widely-linear GSP estimators. We discuss the properties of the proposed GSP-WLMMSE estimator. In particular, we show that the MSE of the GSP-WLMMSE estimator is always equal to or lower than the MSE of the GSP-LMMSE estimator. The GSP-WLMMSE estimator is based on diagonal covariance matrices in the graph frequency domain, and thus has reduced complexity compared with the WLMMSE estimator. This property is especially important when using the sample-mean versions of these estimators that are based on a training dataset. We then state conditions under which the low-complexity GSP-WLMMSE estimator coincides with the WLMMSE estimator. In the simulations, we investigate two synthetic estimation problems (with linear and nonlinear models) and the problem of state estimation in power systems. For these problems, it is shown that the GSP-WLMMSE estimator outperforms the GSP-LMMSE estimator and achieves similar performance to that of the WLMMSE estimator.

arXiv commentThis work has been submitted to the IEEE for possible publication

References in corpus (18)

• The Emerging Field of Signal Processing on Graphs: Extending High-Dimensional Data Analysis to Networks and Other Irregular Domains
• Shrinkage Algorithms for MMSE Covariance Estimation
• Signal Recovery on Graphs: Variation Minimization
• Autoregressive Moving Average Graph Filtering
• Stationary signal processing on graphs
• Monitoring and Optimization for Power Grids: A Signal Processing Perspective
• Signal Processing on Graphs: Causal Modeling of Unstructured Data
• Graphs, Convolutions, and Neural Networks: From Graph Filters to Graph Neural Networks
• Complex Random Vectors and ICA Models: Identifiability, Uniqueness and Separability
• Sampling Signals on Graphs: From Theory to Applications
• Grid-Graph Signal Processing (Grid-GSP): A Graph Signal Processing Framework for the Power Grid
• Power Systems Topology and State Estimation by Graph Blind Source Separation
• Localized Spectral Graph Filter Frames: A Unifying Framework, Survey of Design Considerations, and Numerical Comparison (Extended Cut)
• Bayesian Estimation of Graph Signals
• Complex-Valued Kernel Methods for Regression
• Structural-constrained Methods for the Identification of Unobservable False Data Injection Attacks in Power Systems
• Non-Bayesian Estimation Framework for Signal Recovery on Graphs
• Fast Singular Value Shrinkage with Chebyshev Polynomial Approximation Based on Signal Sparsity