• Journal of the Korean Data and Information Science Society
• /
• v.14 no.3
• /
• pp.545-551
• /
• 2003

Robust design is to identify appropriate settings of control factors that make the system's performance robust to changes in the noise factors that represent the source of variation. In this paper we propose how to simultaneously optimize multiple quality characteristics using the principal component analysis of multivariate statistical analysis. An example is illustrated to compare it with already proposed method.

• Journal of the Korean Data and Information Science Society
• /
• v.7 no.1
• /
• pp.113-118
• /
• 1996

Principal component analysis(PCA) is an essential technique for data compression and feature extraction, and has been widely used in statistical data analysis, communication theory, pattern recognition, and image processing. Oja(1992) found that a linear neuron with constrained Hebbian learning rule can extract the principal component by using stochastic gradient ascent method. In practice real data often contain some outliers. These outliers will significantly deteriorate the performances of the PCA algorithms. In order to make PCA robust, Xu & Yuille(1995) applied statistical physics to the problem of robust principal component analysis(RPCA). Devlin et.al(1981) obtained principal components by using techniques such as M-estimation. The propose of this paper is to investigate from the statistical point of view how Xu & Yuille's(1995) RPCA works under the same simulation condition as in Devlin et.al(1981).

• Journal of the Korean Statistical Society
• /
• v.28 no.3
• /
• pp.337-346
• /
• 1999

Simple correspondence analysis is a technique for giving a joint display of points representing both the rows and columns of an n$\times$p two-way contigency table. In simple correspondence analysis, the singular value decomposition is the main algebraic tool. But, Choi and Huh(1996) pointed out the singular value decomposition is not robust. Instead, they developed a robust singular value decomposition and provided applications in principal component analysis and biplots. In this article, by using the analogous procedures of Choi and Huh(1996), we derive a robust version of simple correspondence analysis.

• Journal of the Korean Data and Information Science Society
• /
• v.15 no.4
• /
• pp.817-823
• /
• 2004

This paper describes a three dimensional motion recognition algorithm and a system which adopts the algorithm for non-contact human-computer interaction. From sequence of stereos images, five feature regions are extracted with simple color segmentation algorithm and then those are used for three dimensional locus calculation precess. However, the result is not so stable, noisy, that we introduce principal component analysis method to get more robust motion recognition results. This method can overcome the weakness of conventional algorithms since it directly uses three dimensional information motion recognition.

• Communications for Statistical Applications and Methods
• /
• v.8 no.3
• /
• pp.625-632
• /
• 2001

Principal component analysis(PCA) is a multivariate technique falling under the general title of factor analysis. The purpose of PCA is to Identify the dependence structure behind a multivariate stochastic observation In order to obtain a compact description of it. In engineering field PCA is utilized mainly (or data compression and restoration. In this paper we propose a new robust Hebbian algorithm for robust PCA. This algorithm is based on a hyperbolic tangent function due to Hampel ef al.(1989) which is known to be robust in Statistics. We do two experiments to investigate the performance of the new robust Hebbian learning algorithm for robust PCA.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.5
• /
• pp.1093-1102
• /
• 2010

Principal component analysis (PCA) is a well-known method for dimension reduction while maintaining most of the variation in data. Although PCA has been applied to many areas successfully, it is sensitive to outliers. Several variants of PCA have been proposed to resolve the problem and, among the variants, robust fuzzy PCA (RF-PCA) demonstrated promising results. RF-PCA uses fuzzy memberships to reduce the noise sensitivity. However, there are also problems in RF-PCA and the convergence property is one of them. RF-PCA uses two different objective functions to update memberships and principal components, which is the main reason of the lack of convergence property. The difference between two functions also slows the convergence and deteriorates the solutions of RF-PCA. In this paper, a variant of RF-PCA, called RF-PCA2, is proposed. RF-PCA2 uses an integrated objective function both for memberships and principal components. By using alternating optimization, RF-PCA2 is guaranteed to converge on a local optimum. Furthermore, RF-PCA2 converges faster than RF-PCA and the solutions found are more similar to the desired solutions than those of RF-PCA. Experimental results also support this.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10b
• /
• pp.739-741
• /
• 2003

Electroencephalogram (EEG)-based brain computer interface (BCI) provides a new communication channel between human brain and computer. EEG is very noisy data and contains artifacts, thus the extraction of features that are robust to noise and artifacts is important. In this paper we present a method with employ both independent component analysis (ICA) and oriented principal component analysis (OPCA) for artifact-robust feature extraction.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.4
• /
• pp.15-22
• /
• 2011

Principal component analysis (PCA) is a well-known method for dimensionality reduction and feature extraction while maintaining most of the variation in data. Although PCA has been applied in many areas successfully, it is sensitive to outliers and only valid for Gaussian distributions. Several variants of PCA have been proposed to resolve noise sensitivity and, among the variants, improved robust fuzzy PCA (RF-PCA2) demonstrated promising results. RF-PCA, however, is still a linear algorithm that cannot accommodate non-Gaussian distributions. In this paper, a non-linear algorithm that combines RF-PCA2 and kernel PCA (K-PCA), called improved robust kernel fuzzy PCA (RKF-PCA2), is introduced. The kernel methods make it to accommodate non-Gaussian distributions. RKF-PCA2 inherits noise robustness from RF-PCA2 and non-linearity from K-PCA. RKF-PCA2 outperforms previous methods in handling non-Gaussian distributions in a noise robust way. Experimental results also support this.

• The Korean Journal of Applied Statistics
• /
• v.35 no.2
• /
• pp.327-333
• /
• 2022

Principal component analysis (PCA) is the most widely used technique in dimension reduction, however, it is very sensitive to outliers. A robust version of PCA, called robust PCA, was suggested by two seminal papers by Candès et al. (2011) and Chandrasekaran et al. (2011). The robust PCA is an essential tool in the artificial intelligence such as background detection, face recognition, ranking, and collaborative filtering. Also, the robust PCA receives a lot of attention in statistics in addition to computer science. In this paper, we introduce recent algorithms for the robust PCA and give some illustrative examples.

• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.3
• /
• pp.205-208
• /
• 2013

Generally, binary pattern transforms have been used in the field of the face recognition and facial expression, since they are robust to illumination. Thus, this paper proposes an illumination-robust face recognition system combining an MLDP, which improves the texture component of the LDP, and a 2D-PCA algorithm. Unlike that binary pattern transforms such as LBP and LDP were used to extract histogram features, the proposed method directly uses the MLDP image for feature extraction by 2D-PCA. The performance evaluation of proposed method was carried out using various algorithms such as PCA, 2D-PCA and Gabor wavelets-based LBP on Yale B and CMU-PIE databases which were constructed under varying lighting condition. From the experimental results, we confirmed that the proposed method showed the best recognition accuracy.