• DocumentCode
    1647382
  • Title

    An RBF network method for blind signal separation

  • Author

    Tan, Ying ; Wang, Jun

  • Author_Institution
    Dept. of Electron. Eng. & Inf. Sci., Univ. of Sci. & Technol. of China, Hefei, China
  • Volume
    1
  • fYear
    2002
  • fDate
    6/24/1905 12:00:00 AM
  • Firstpage
    665
  • Lastpage
    668
  • Abstract
    A radial basis function (RBF) based approach for blind signal separation in a nonlinear mixture is proposed. A cost function, which consists of the mutual information and partial moments of the outputs of the separation system, is defined to extract the independent signals from their nonlinear mixtures. The minimization of the cost function results in the independence of the outputs with desirable moments such that the original sources are separated properly. A learning algorithm for the parametric RBF network is established by using the stochastic gradient descent method. This approach is characterized by high learning convergence rate of weights, modular structure, as well as feasible hardware implementation. Simulation result demonstrates the feasibility, and validity of the proposed approach
  • Keywords
    gradient methods; learning (artificial intelligence); minimisation; radial basis function networks; signal processing; RBF network method; blind signal separation; cost function; high learning convergence rate; independent signals; learning algorithm; mutual information; nonlinear mixture; parametric network; partial moments; radial basis function based approach; separation system; stochastic gradient descent method; Backpropagation algorithms; Blind source separation; Brain modeling; Data mining; Independent component analysis; Information science; Mutual information; Radial basis function networks; Signal processing algorithms; Vectors;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Neural Networks, 2002. IJCNN '02. Proceedings of the 2002 International Joint Conference on
  • Conference_Location
    Honolulu, HI
  • ISSN
    1098-7576
  • Print_ISBN
    0-7803-7278-6
  • Type

    conf

  • DOI
    10.1109/IJCNN.2002.1005552
  • Filename
    1005552