The majority of existing Independent Component Analysis (ICA) algorithms are based on maximizing or minimizing a certain objective function with the help of gradient learning methods. However, it is rather difficult to prove whether there is no spurious solution in ICA under any objective function as well as the gradient learning algorithm to optimize it. In this paper, we present an analysis on the kurtosis-sum objective function, i.e., the sum of the absolute kurtosis values of all the estimated components, with a kurtosis switching algorithm to maximize it. In two-source case, it is proved that any local maximum of this kurtosis-sum objective function corresponds to a feasible solution of the ICA problem in the asymptotic sense. The simulation results further show that the kurtosis switching algorithm always leads to a feasible solution of the ICA problem for various types of sources. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Ge, F., & Ma, J. (2008). Analysis of the kurtosis-sum objective function for ICA. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5263 LNCS, pp. 579–588). Springer Verlag. https://doi.org/10.1007/978-3-540-87732-5_65
Mendeley helps you to discover research relevant for your work.