A comparison of algorithms for separation of synchronous subspaces

Abstract

Independent Subspace Analysis (ISA) consists in separating sets (subspaces) of dependent sources, with different sets being independent of each other. While a few algorithms have been proposed to solve this problem, they are all completely general in the sense that they do not make any assumptions on the intra-subspace dependency. In this paper, we address the ISA problem in the specific context of Separation of Synchronous Sources (SSS), i.e., we aim to solve the ISA problem when the intra-subspace dependency is known to be perfect phase synchrony between all sources in that subspace. We compare multiple algorithmic solutions for this problem, by analyzing their performance on an MEG-like dataset.