%0 Conference Paper
%F Oral
%T Independent Component Analysis Based on Non-polynomial Approximation of Negentropy Application to MRS Source Separation
%+ Laboratoire Traitement du Signal et de l'Image (LTSI)
%A Saleh, M.
%A Karfoul, Ahmad
%A Kachenoura, A.
%A Albera, Laurent
%A Senhadji, Lotfi
%< avec comité de lecture
%B 52nd Asilomar Conference on Signals, Systems and Computers, ACSSC 2018
%C Pacific Grove, United States
%Y Matthews M.B.
%I IEEE Computer Society
%V 2018-October
%P 2179-2183
%8 2018-10-28
%D 2018
%R 10.1109/ACSSC.2018.8645115
%K Approximation algorithms
%K Cost functions
%K Independent component analysis
%K Iterative methods
%K Magnetic resonance
%K Magnetic resonance spectroscopy
%K Polynomial approximation
%K Probability density function
%K Separation
%K Asymmetric probability densities
%K FastICA algorithms
%K Gradient ascent
%K ICA algorithms
%K Nonlinear objective functions
%K Number of iterations
%K Numerical results
%K Quasi-optimal
%K Source separation
%Z Life Sciences [q-bio]/BioengineeringConference papers
%X In this paper, a new ICA algorithm based on non-polynomial approximation of negentropy that captures both the asymmetry of the sources' PDF and the sub/super-Gaussianity of this latter is proposed. A gradient-ascent iteration with quasi-optimal stepsize is used to maximize the considered cost function. With this quasi-optimal computation in the case of highly non-linear objective function, the main advantages of the proposed algorithm are 1) its robustness to outliers compared to kurtosis-based ICA method especially for situations of small data size, and 2) its ability to capture sources' asymmetric probability density functions which is a property that can't be fulfilled in classic ICA algorithms like FastICA. Numerical results reported in the context of source separation of brain magnetic resonance spectroscopy show the superiority of the proposed algorithm over the FastICA algorithm in terms of both source separation accuracy and the number of iterations required for convergence. © 2018 IEEE.
%G English
%L hal-02088220
%U https://univ-rennes.hal.science/hal-02088220
%~ UNIV-RENNES1
%~ LTSI
%~ STATS-UR1
%~ UR1-HAL
%~ UR1-MATH-STIC
%~ TEST-UR-CSS
%~ UNIV-RENNES
%~ UR1-MATH-NUM
%~ UR1-BIO-SA