Simultaneous Graph Learning and Blind Separation of Graph Signal Sources

Abstract

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.