{"title":"Efficient Estimation of Unique Components in Independent Component Analysis by Matrix Representation","authors":"Yoshitatsu Matsuda, Kazunori Yamaguch","doi":"arxiv-2408.17118","DOIUrl":null,"url":null,"abstract":"Independent component analysis (ICA) is a widely used method in various\napplications of signal processing and feature extraction. It extends principal\ncomponent analysis (PCA) and can extract important and complicated components\nwith small variances. One of the major problems of ICA is that the uniqueness\nof the solution is not guaranteed, unlike PCA. That is because there are many\nlocal optima in optimizing the objective function of ICA. It has been shown\npreviously that the unique global optimum of ICA can be estimated from many\nrandom initializations by handcrafted thread computation. In this paper, the\nunique estimation of ICA is highly accelerated by reformulating the algorithm\nin matrix representation and reducing redundant calculations. Experimental\nresults on artificial datasets and EEG data verified the efficiency of the\nproposed method.","PeriodicalId":501347,"journal":{"name":"arXiv - CS - Neural and Evolutionary Computing","volume":"393 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Neural and Evolutionary Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2408.17118","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Independent component analysis (ICA) is a widely used method in various
applications of signal processing and feature extraction. It extends principal
component analysis (PCA) and can extract important and complicated components
with small variances. One of the major problems of ICA is that the uniqueness
of the solution is not guaranteed, unlike PCA. That is because there are many
local optima in optimizing the objective function of ICA. It has been shown
previously that the unique global optimum of ICA can be estimated from many
random initializations by handcrafted thread computation. In this paper, the
unique estimation of ICA is highly accelerated by reformulating the algorithm
in matrix representation and reducing redundant calculations. Experimental
results on artificial datasets and EEG data verified the efficiency of the
proposed method.