Blind Source Separation of Graph Signals

With a change of signal notion to graph signal, new means of performing blind source separation (BSS) appear. Particularly, existing independent component analysis (ICA) methods exploit the non-Gaussianity of the signals or other types of prior information. For graph signals, such prior information is present in a graph of dependencies in the signals. We propose BSS of graph signals which uses the prior information presented by the signal graph together with nonGaussianity. We derive the identifiability conditions for the proposed method and compare them to the conditions when only graph or non-Gaussianity approach is used. In simulation studies, we verify that the new method can separate a broader range of graph signals and show that it is also more efficient when both approaches are useful.