When our sources are graph signals, a more efficient algorithm for Blind Source Separation (BSS) can be provided by using structural graph information along with statistical independence and/or non-Gaussianity. To the best of our knowledge, the GraphJADE and GraDe algorithms are the only BSS methods addressing this issue in the case of known underlying graphs. However, in many real-world applications, these graphs are not necessarily a priori known. In this paper, we propose a method called GraphJADE-GL (GraphJADE with Graph Learning) that jointly separates the graph signal sources and learns the graphs related to them accurately, in an alternating style.
30 January 2023 in IEEE Transactions on Signal and Information Processing over Networks
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.
16 June 2022 in IEEE Transactions on Signal and Information Processing over Networks
Blind separation of the sources supported by graphs, i.e., graph signals, is a nascent and challenging Blind Source Separation (BSS) problem. In these cases, along with the statistical independence of the sources, additional dependency information can be interpreted from their graph structure, which provides exploiting different Graph Signal Processing (GSP) tools to improve the separation performance. To the best of our knowledge, in these cases, only GraDe and GraphJADE methods have been proposed to exploit the graph dependencies and/or GSP techniques to improve the separation quality rather than the conventional BSS methods. Despite the significant advantages of these graph-based methods, assuming that the underlying graphs are known is a serious drawback, especially in many real-world applications. To address this issue, in this paper, we propose a Unified objective function for GraphJADE with Graph Learning, namely U-GraphJADE-GL, and use the Block Coordinate Descent (BCD) to optimize it. In our proposed method, along with the separation task, the underlying graphs are learned simultaneously in an efficient manner. We compare the performance of the U-GraphJADE-GL with that of the GraDe with Graph Learning (U-GraDe-GL) and the conventional BSS methods in the BSS task and also analyze the GL performance. Besides, as well as the theoretical and experimental convergence analysis, we derive/state the Cramér-Rao bound (CRB) on the estimation of the mixing and unmixing matrices and also on the attainable Interference-to-Source Ratio (ISR) and compare the asymptotic performance of the proposed method with that of the optimal CRB estimators. To investigate the applicability in real applications, the performance of the proposed method is also compared with that of the abovementioned algorithms for denoising the epileptic Electroencephalogram (EEG) signals and also for the audio speech source separation task. The results show the superiority of the proposed algorithm compared to the other methods in the case of BSS of graph signals with unknown graphs.