By Topic

Blind source separation using monochannel overcomplete dictionaries

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Gowreesunker, B.V. ; Dept. of Electr. & Comput. Eng., Minnesota Univ., Minneapolis, MN ; Tewfik, A.H.

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.

Published in:

Acoustics, Speech and Signal Processing, 2008. ICASSP 2008. IEEE International Conference on

Date of Conference:

March 31 2008-April 4 2008