Joint Graph Learning and Blind Separation of Smooth Graph Signals Using Minimization of Mutual Information and Laplacian Quadratic Forms
- 30 January 2023
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal and Information Processing over Networks
- Vol. 9, 35-47
Abstract
The smoothness of graph signals has found desirable real applications for processing irregular (graph-based) signals. When the latent sources of the mixtures provided to us as observations are smooth graph signals, it is more efficient to use graph signal smoothness terms along with the classic independence criteria in Blind Source Separation (BSS) approaches. In the case of underlying graphs being known, Graph Signal Processing (GSP) provides valuable tools; however, in many real applications, these graphs can not be well-defined a priori and need to be learned from data. In this paper, a GSP-based approach for joint Graph Learning (GL) and BSS of smooth graph signal sources is proposed, which, to the best of our knowledge, has not been addressed. The minimization of Mutual Information (MI) is exploited in our work because of its desirable advantages, such as having no local minimum and exact (not approximative) modeling of statistical independence. As well as investigating the convergence analysis and identifiability conditions and deriving Cramér-Rao Lower Bound (CRLB), comprehensive experiments of generating (cyclostationary) graph signal mixtures are provided to show the superiority over classic and also GSP-based BSS approaches in the case of the latent sources being smooth on unknown underlying graphs. Based on the provided experimental results, our proposed method performs quite robustly in even high noise levels in both terms of source separation and recovery of underlying graphs.Keywords
Funding Information
- Smart University of Medical Sciences, Research Project
This publication has 36 references indexed in Scilit:
- Laplacian matrix learning for smooth graph signal representation2015
- A general approach for mutual information minimization and its application to blind source separationSignal Processing, 2005
- Differential of the Mutual InformationIEEE Signal Processing Letters, 2004
- Mutual information approach to blind separation of stationary sourcesIEEE Transactions on Information Theory, 2002
- Fast and robust fixed-point algorithms for independent component analysisIEEE Transactions on Neural Networks, 1999
- An Information-Maximization Approach to Blind Separation and Blind DeconvolutionNeural Computation, 1995
- Independent component analysis, A new concept?Signal Processing, 1994
- Blind beamforming for non-gaussian signalsIEE Proceedings F Radar and Signal Processing, 1993
- Remark AS R74: A Least Squares Version of Algorithm AS 211: The F-G Diagonalization AlgorithmJournal of the Royal Statistical Society Series C: Applied Statistics, 1988
- The Differentiation of Pseudo-Inverses and Nonlinear Least Squares Problems Whose Variables SeparateSIAM Journal on Numerical Analysis, 1973