Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Bulletin of the Polish Academy of Sciences: Technical Sciences
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
