• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 2006.06a
• /
• pp.251-257
• /
• 2006

The performance of face recognition methods using subspace projection is directly related to the characteristics of their basis images, especially in the cases of local distortion or partial occlusion. In order for a subspace projection method to be robust to local distortion and partial occlusion, the basis images generated by the method should exhibit a part-based local representation. We propose an effective part-based local representation method named locally salient ICA (LS-ICA) method for face recognition that is robust to local distortion and partial occlusion. The LS-ICA method only employs locally salient information from important facial parts in order to maximize the benefit of applying the idea of 'recognition by parts.' It creates part-based local basis images by imposing additional localization constraint in the process of computing ICA architecture I basis images. We have contrasted the LS-ICA method with other part-based representations such as LNMF (Localized Non-negative Matrix Factorization)and LFA (Local Feature Analysis). Experimental results show that the LS-ICA method performs better than PCA, ICA architecture I, ICA architecture II, LFA, and LNMF methods, especially in the cases of partial occlusions and local distortion

• 전자공학회논문지 IE
• /
• v.45 no.3
• /
• pp.20-26
• /
• 2008

Two independent component analysis(ICA) algorithms were applied for the recognition of speech signals corrupted by a car engine noise. Speech recognition was performed by hidden markov model(HMM) for the estimated signals and recognition rates were compared with those of orginal speech signals which are not corrupted. Two different ICA methods were applied for the estimation of speech signals, one of which is FastICA algorithm that maximizes negentropy, the other is information-maximization approach that maximizes the mutual information between inputs and outputs to give maximum independence among outputs. Word recognition rate for the Korean news sentences spoken by a male anchor is 87.85%, while there is 1.65% drop of performance on the average for the estimated speech signals by FastICA and 2.02% by information-maximization for the various signal to noise ratio(SNR). There is little difference between the methods.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2000.11a
• /
• pp.305-309
• /
• 2000

In this paper, we presents a new methodology for face recognition after analysing conventional ICA(Independent Component Analysis) based approach. In the literature we found that ICA based methods have followed the same procedure without any exception, first PCA(Principal Component Analysis) has been used for feature extraction, next ICA learning method has been applied for feature enhancement in the reduced dimension. However, it is contradiction that features are extracted using higher order moments depend on variance, the second order statistics. It is not considered that a necessary component can be located in the discarded feature space. In the new methodology, features are extracted using the magnitude of kurtosis(4-th order central moment or cumulant). This corresponds to the PCA based feature extraction using eigenvalue(2nd order central moment or variance). The synergy effect of PCA and ICA can be achieved if PCA is used for noise reduction filter. ICA methodology is analysed using SVD(Singular Value Decomposition). PCA does whitening and noise reduction. ICA performs the feature extraction. Simulation results show the effectiveness of the methodology compared to the conventional ICA approach.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.967-968
• /
• 2008

In this paper we demonstrate the effect of sparse decomposition on various Independent Component Analysis (ICA) algorithms for separating simultaneous linear mixture of independent 2-D signals (images). We will show using simulated results that sparse decomposition before Kernel ICA (Sparse Kernel ICA) algorithm produces the best results as compared to other ICA algorithms.

• ETRI Journal
• /
• v.30 no.6
• /
• pp.868-870
• /
• 2008

The rotation-based transformation (RBT) for privacy preserving data mining is vulnerable to the independent component analysis (ICA) attack. This paper introduces a modified multiple-rotation-based transformation technique for special mining applications, mitigating the ICA attack while maintaining the advantages of the RBT.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.3
• /
• pp.371-376
• /
• 2003

In this paper, we proposes a method for recognizing the facial expressions using ICA(Independent Component Analysis)-factorial representation method. Facial expression recognition consists of two stages. First, a method of Feature extraction transforms the high dimensional face space into a low dimensional feature space using PCA(Principal Component Analysis). And then, the feature vectors are extracted by using ICA-factorial representation method. The second recognition stage is performed by using the Euclidean distance measure based KNN(K-Nearest Neighbor) algorithm. We constructed the facial expression database for six basic expressions(happiness, sadness, angry, surprise, fear, dislike) and obtained a better performance than previous works.

• The Journal of the Acoustical Society of Korea
• /
• v.22 no.6
• /
• pp.452-456
• /
• 2003

We discuss how to reduce the number of inverse matrix and its dimensions requested in MLLR framework for speaker adaptation. To find a smaller set of variables with less redundancy, we adapt PCA (principal component analysis) and ICA (independent component analysis) that would give as good a representation as possible. The amount of additional computation when PCA or ICA is applied is as small as it can be disregarded. 10 components for ICA and 12 components for PCA represent similar performance with 36 components for ordinary MLLR framework. If dimension of SI model parameter is n, the amount of computation of inverse matrix in MLLR is proportioned to O(n⁴). So, compared with ordinary MLLR, the amount of total computation requested in speaker adaptation is reduced by about 1/81 in MLLR with PCA and 1/167 in MLLR with ICA.

• Journal of Electrical Engineering and Technology
• /
• v.12 no.4
• /
• pp.1417-1426
• /
• 2017

Power system analysis, Non-Convex Economic Dispatch (NED) is considered as an open and demanding optimization problem. Despite the fact that realistic ED problems have non-convex cost functions with equality and inequality constraints, conventional search methods have not been able to effectively find the global answers. Considering the great potential of meta-heuristic optimization techniques, many researchers have started applying these techniques in order to solve NED problems. In this paper, a new and efficient approach is proposed based on imperialist competitive algorithm (ICA). The proposed algorithm which is named multi-operator ICA (MuICA) merges three operators with the original ICA in order to simultaneously avoid the premature convergence and achieve the global optimum answer. In this study, the proposed algorithm has been applied to different test systems and the results have been compared with other optimization methods, tending to study the performance of the MuICA. Simulation results are the confirmation of superior performance of MuICA in solving NED problems.

• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.873-876
• /
• 2000

The information-theoretic approach to face recognition is based on the compact coding where face images are decomposed into a small set of basis images. Most popular method for the compact coding may be the principal component analysis (PCA) which eigenface methods are based on. PCA based methods exploit only second-order statistical structure of the data, so higher- order statistical dependencies among pixels are not considered. Independent component analysis (ICA) is a signal processing technique whose goal is to express a set of random variables as linear combinations of statistically independent component variables. ICA exploits high-order statistical structure of the data that contains important information. In this paper we employ the ICA for the efficient feature extraction from face images and show that ICA outperforms the PCA in the task of face recognition. Experimental results using a simple nearest classifier and multi layer perceptron (MLP) are presented to illustrate the performance of the proposed method.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04b
• /
• pp.721-723
• /
• 2004

A trust-region method is a quite attractive optimization technique. It is, in general, faster than the steepest descent method and is free of a learning rate unlike the gradient-based methods. In addition to its convergence property (between linear and quadratic convergence), ifs stability is always guaranteed, in contrast to the Newton's method. In this paper, we present an efficient implementation of the maximum likelihood independent component analysis (ICA) using the trust-region method, which leads to trust-region-based ICA (TR-ICA) algorithms. The useful behavior of our TR-ICA algorithms is confimed through numerical experimental results.