Novel algorithm for underdetermined blind source separation based on matching pursuit
Weihua Wang, Guangzhong Liu, Weiwei Yu · 2010
In this paper, the blind source separation problem in underdetermined case is researched. The separation of underdetermined BSS usually can be solved by a two-stage method: estimating mixing matrix and reconstructing source signals. The mixing matrix can be estimated if the sources satisfy the sparsity conditions. An algorithm of sparse sources recovery based on matching pursuit (MP) is proposed. MP is an algorithm which can deduce a sparse representation of a signal. Considering its utilization in sparse sources recovery of blind source separation, this paper improves classical MP algorithm and has obtained a better performance. Proposed method works well even the mixing matrix is ill-conditioned by reduce the error when match failed.