A Novel Underdetermined Source Recovery Algorithm Based on K-Sparse Component Analysis Publisher



Eqlimi E^{1, 2, 3} ; Makkiabadi B^{1, 3} ; Samadzadehaghdam N^{1, 3} ; Khajehpour H^{1, 3} ; Mohagheghian F⁴ ; Sanei S⁵ Show Affiliations
Source: Circuits# Systems# and Signal Processing Published:2019

Abstract

Sparse component analysis (SCA) is a popular method for addressing underdetermined blind source separation in array signal processing applications. We are motivated by problems that arise in the applications where the sources are densely sparse (i.e. the number of active sources is high and very close to the number of sensors). The separation performance of current underdetermined source recovery (USR) solutions, including the relaxation and greedy families, reduces with decreasing the mixing system dimension and increasing the sparsity level (k). In this paper, we present a k-SCA-based algorithm that is suitable for USR in low-dimensional mixing systems. Assuming the sources is at most (m- 1) sparse where m is the number of mixtures; the proposed method is capable of recovering the sources from the mixtures given the mixing matrix using a subspace detection framework. Simulation results show that the proposed algorithm achieves better separation performance in k-SCA conditions compared to state-of-the-art USR algorithms such as basis pursuit, minimizing norm-L1, smoothed L0, focal underdetermined system solver and orthogonal matching pursuit. © 2018, Springer Science+Business Media, LLC, part of Springer Nature.