Blind source separation using monochannel overcomplete dictionaries
We propose a new approach to underdetermined blind source separation (BSS) using sparse decomposition over monochannel dictionary atoms and compare it to multichannel dictionary approaches. We show that the new approach is easily extended to any single channel decomposition method and allows for faster computation of algorithms such as the bounded error subset selection (BESS) because of the reduced dimension of the search space. Experimental results on matching pursuit (MP) and BESS algorithms show that our method can give better signal to interference ratio performance than pursuit methods based on multichannel dictionary atoms.