Abstract
In this paper, we investigate the problem of blind source separation (BSS) through the lens of tensor decomposition (TD). Two fundamental connections between TD and BSS are established, forming the basis for two novel tensor-based BSS methods, namely TenSOFO and TCBSS. The former is designed for a joint individual differences in scaling (INDSCAL) decomposition, addressing instantaneous (linear) BSS tasks; while the latter efficiently performs a constrained block term decomposition (BTD), aligning with the design of convolutive BSS. Leveraging the benefits of the alternating direction method of multipliers and the strengths of tensor representations, both TenSOFO and TCBSS prove to be effective in BSS. Our experimental results demonstrate the effectiveness of these two proposed methods in addressing both TD and BSS tasks, particularly when compared to state-of-the-art algorithms.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
