By Topic

Cluster Guide Particle Swarm Optimization (CGPSO) for Underdetermined Blind Source Separation With Advanced Conditions

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
$33 $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

5 Author(s)
Tsung-Ying Sun ; Department of Electrical Engineering, National Dong Hwa University, Hualien, Taiwan ; Chan-Cheng Liu ; Shang-Jeng Tsai ; Sheng-Ta Hsieh
more authors

The underdetermined blind source separation (BSS), which based on sparse representation, is discussed in this paper; moreover, some difficulties (or real assumptions) that were left out of consideration before are aimed. For instance, the number of sources, , is unknown, large-scale, or time-variant; the mixing matrix is ill-conditioned. For the proposed algorithm, in order to detect a time-variant mixing matrix, short-time Fourier transform is employed to segment received mixtures. Because is unknown, our algorithm use more estimates to find out the mixing vectors by particle swarm optimizer (PSO); and then, surplus estimates are removed by two proposed processes. However, the estimated accuracy of PSO will affect the correctness of extracting mixing vectors. Consequently, an improved PSO version called the cluster guide PSO (CGPSO) is further proposed according to the character of sparse representation. In simulations, several real assumptions that were less discussed before will be tested. Some representative BSS algorithms and PSO versions are compared with the CGPSO-based algorithm. The advantages of the proposed algorithm are demonstrated by simulation results.

Published in:

IEEE Transactions on Evolutionary Computation  (Volume:15 ,  Issue: 6 )