A comparison of algorithms for separation of synchronous subspaces
Almeida, M.
;
Bioucas-Dias, J.
; Vigário, R. V.
; Oja, E. O.
Bulletin of the Polish Academy of Sciences Vol. 0, Nº 0, pp. 0 - 0, January, 2012.
ISSN (print): 0239-7528
ISSN (online):
Scimago Journal Ranking: 0,38 (in 2012)
Digital Object Identifier: 10.2478/v10175-012-0057-y
Download Full text PDF ( 187 KBs)
Downloaded 1 time
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), emph{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.
