SPARSE SOURCE SEPARATION FROM ORTHOGONAL MIXTURES

This paper addresses source separation from a linear mixture under two assumptions: source sparsity and orthogonality of the mixing matrix. We propose efficient sparse separation via a two-stage process. In the first stage we attempt to recover the sparsity pattern of the sources by exploiting the orthogonality prior. In the second stage, the support is used to reformulate the recovery task as an optimization problem. We then suggest a solution based on alternating minimization. Random simulations are performed to analyze the behavior of the resulting algorithm. The simulations demonstrate convergence of our approach as well as superior recovery rate in comparison with alternative source separation methods and K-SVD, a leading algorithm in dictionary learning.