A robust blind sparse source separation algorithm using genetic algorithm to identify mixing matrix

  • Authors:
  • Tsung-Ying Sun;Chan-Cheng Liu;Sheng-Ta Hsieh;Shang-Jeng Tsai;Kan-Yuan Li

  • Affiliations:
  • National Dong Hwa University., Shoufeng, Hualien, Taiwan, R.O.C.;National Dong Hwa University., Shoufeng, Hualien, Taiwan, R.O.C.;National Dong Hwa University., Shoufeng, Hualien, Taiwan, R.O.C.;National Dong Hwa University., Shoufeng, Hualien, Taiwan, R.O.C.;National Dong Hwa University., Shoufeng, Hualien, Taiwan, R.O.C.

  • Venue:
  • SPPRA '07 Proceedings of the Fourth IASTED International Conference on Signal Processing, Pattern Recognition, and Applications
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, a novel identification of mixing matrix using genetic algorithm (GA) is proposed to deal with the blind sparse source separation (BSS) problem. A preprocessing filters the most of minor mixtures at first, and then represents the remainder in angle. Further, we regard a probable set of angle of mixing vectors as a chromosome of GA, and iterate the evolutionary loop to minimize the fitness function which summarizes the angle difference between mixtures and estimated mixing vector. In computer simulations, mixing matrixes with well-condition and ill-condition are considered for testing, meantime several algorithms are carried them out also. It was demonstrated by simulation results that the proposed GA-based algorithm is superior in validation and effectualness than others.