Tensor decomposition meets blind source separation

doi:10.1016/j.sigpro.2024.109483

Tensor decomposition meets blind source separation

2024-08-01

3

PRE

AI

DOI：10.1016/j.sigpro.2024.109483

Original

Original request for help

Save

Abstract

En 中文

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.

Keywords:

Blind source separation

Tensor decomposition

Block term decomposition

Second-order statistics

INDSCAL decomposition

ADMM

Tensor decomposition meets blind source separation

Abstract

Journal

Organization