By Topic

Global convergence of independent component analysis based on semidefinite programming relaxation

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

2 Author(s)
Akaho, S. ; Nat. Inst. of Adv. Ind. Sci. & Technol., Tsukuba, Japan ; Fujiki, J.

In the independent component analysis, polynomial functions of higher order statistics are often used as cost functions. However, such cost functions usually have many local minima, hence gradient-type and fixed-point-type algorithms tend to be trapped into a nonglobal local minimum. Recently, the polynomial optimization method that guarantees global convergence has been developed, where the optimization problem is relaxed as a semidefinite programming problem. In this paper, we apply the polynomial optimization method to the independent component analysis, and show the global convergence property. From some empirical studies, we further give a conjecture that the algorithm has polynomial time computational complexity.

Published in:

Acoustics, Speech and Signal Processing (ICASSP), 2011 IEEE International Conference on

Date of Conference:

22-27 May 2011