메뉴 건너뛰기




Volumn 2415 LNCS, Issue , 2002, Pages 1119-1124

Beyond comon's identifiability theorem for Independent Component Analysis

Author keywords

[No Author keywords available]

Indexed keywords

GAUSSIAN DISTRIBUTION; GAUSSIAN NOISE (ELECTRONIC); INDEPENDENT COMPONENT ANALYSIS; MIXTURES; NEURAL NETWORKS;

EID: 31344465605     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46084-5_181     Document Type: Conference Paper
Times cited : (4)

References (8)
  • 1
    • 0028416938 scopus 로고
    • Independent component analysis, a new concept?
    • Comon, P.: Independent component analysis, a new concept? Signal Processing 36 (1994) 287-314
    • (1994) Signal Processing , vol.36 , pp. 287-314
    • Comon, P.1
  • 2
    • 0000946335 scopus 로고    scopus 로고
    • An iterative inversion approach to blind source separation
    • Cruces, S., Cichocki, A., Castedo, L.: An iterative inversion approach to blind source separation. IEEE Trans. Neural Networks 11 (2000) 1423-1437
    • (2000) IEEE Trans. Neural Networks , vol.11 , pp. 1423-1437
    • Cruces, S.1    Cichocki, A.2    Castedo, L.3
  • 3
    • 84902169824 scopus 로고    scopus 로고
    • The minimum entropy and cumulant based contrast functions for blind source extraction
    • Mira, J., Prieto, A., eds. Springer-Verlag. [6th International Work-Conference on Artificial and Natural Neural Networks (IWANN'2001)]. Granada, Spain
    • Cruces, S., Cichocki, A., Amari, S.: The minimum entropy and cumulant based contrast functions for blind source extraction. In Mira, J., Prieto, A., eds.: Bio-Inspired Applications of Connectionism, Lecture Notes in Computer Science, Springer-Verlag. [6th International Work-Conference on Artificial and Natural Neural Networks (IWANN'2001)]. Volume IL, Granada, Spain (2001) 786-793
    • (2001) Bio-Inspired Applications of Connectionism, Lecture Notes in Computer Science , vol.49 , pp. 786-793
    • Cruces, S.1    Cichocki, A.2    Amari, S.3
  • 6
    • 0032216898 scopus 로고    scopus 로고
    • The geometry of algorithms with orthogonality constraints
    • Edelman, A., Arias, T.A., Smith, S.T.: The geometry of algorithms with orthogonality constraints. SIAM J. Matrix Anal. Appi. 20 (1999) 303-353
    • (1999) SIAM J. Matrix Anal. Appi , vol.20 , pp. 303-353
    • Edelman, A.1    Arias, T.A.2    Smith, S.T.3
  • 7
    • 0032533057 scopus 로고    scopus 로고
    • Information maximization and independent component analysis: Is there a difference?
    • Obradovic, D., Deco, G.: Information maximization and independent component analysis: Is there a difference? Neural Computation 10 (1998) 2085-2101
    • (1998) Neural Computation , vol.10 , pp. 2085-2101
    • Obradovic, D.1    Deco, G.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.