DocumentCode
1562891
Title
On the Proof of 1-Bit-Matching Conjecture for ICA
Author
Hu, Dewen
Author_Institution
Dept. of Autom. Control, Nat. Univ. of Defense Technol., Changsha
Volume
1
fYear
2005
Lastpage
4
Abstract
This paper is to prove a widely believed \´1-bit-matching\´ conjecture in independent component analysis (ICA) community, which is stated as "all the sources can be separated as long as there is 1-to-1 same-sign-correspondence between the kurtosis signs of all source probability density functions (pdf\´s) and the kurtosis signs of all model pdf\´s"
Keywords
independent component analysis; probability; 1-bit-matching conjecture; ICA; independent component analysis; kurtosis signs; probability density functions; Independent component analysis;
fLanguage
English
Publisher
ieee
Conference_Titel
Neural Networks and Brain, 2005. ICNN&B '05. International Conference on
Conference_Location
Beijing
Print_ISBN
0-7803-9422-4
Type
conf
DOI
10.1109/ICNNB.2005.1614555
Filename
1614555
Link To Document