• 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.

• 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.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.2
• /
• pp.25-31
• /
• 2011

Principal component analysis (PCA) is a well-known method for dimensionality reduction and feature extraction. Although PCA has been applied in many areas successfully, it is sensitive to outliers due to the use of sum-square-error. Several variants of PCA have been proposed to resolve the noise sensitivity and, among the variants, improved robust fuzzy PCA (RF-PCA2) demonstrated promising results. RF-PCA2, however, still can fall into a local optimum due to equal initial membership values for all data points. Another reason comes from the fact that RF-PCA2 is based on sum-square-error although fuzzy memberships are incorporated. In this paper, a variant of RF-PCA2 called RF-PCA3 is proposed. The proposed algorithm is based on the objective function of RF-PCA2. RF-PCA3 augments RF-PCA2 with the objective function of PCA and initial membership calculation using data distribution, which make RF-PCA3 to have more chance to converge on a better solution than that of RF-PCA2. RF-PCA3 outperforms RF-PCA2, which is demonstrated by experimental results.

• Journal of Electrical Engineering and Technology
• /
• v.12 no.6
• /
• pp.2388-2398
• /
• 2017

In this study, we propose a robust face recognition system to pose variations based on automatic pose estimation. Radial basis function neural network is applied as one of the functional components of the overall face recognition system. The proposed system consists of preprocessing and recognition modules to provide a solution to pose variation and high-dimensional pattern recognition problems. In the preprocessing part, principal component analysis (PCA) and 2-dimensional 2-directional PCA ($(2D)^2$ PCA) are applied. These functional modules are useful in reducing dimensionality of the feature space. The proposed RBFNNs architecture consists of three functional modules such as condition, conclusion and inference phase realized in terms of fuzzy "if-then" rules. In the condition phase of fuzzy rules, the input space is partitioned with the use of fuzzy clustering realized by the Fuzzy C-Means (FCM) algorithm. In conclusion phase of rules, the connections (weights) are realized through four types of polynomials such as constant, linear, quadratic and modified quadratic. The coefficients of the RBFNNs model are obtained by fuzzy inference method constituting the inference phase of fuzzy rules. The essential design parameters (such as the number of nodes, and fuzzification coefficient) of the networks are optimized with the aid of Particle Swarm Optimization (PSO). Experimental results completed on standard face database -Honda/UCSD, Cambridge Head pose, and IC&CI databases demonstrate the effectiveness and efficiency of face recognition system compared with other studies.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.14 no.3
• /
• pp.162-170
• /
• 2014

Appearance-based subspace models such as eigenfaces have been widely recognized as one of the most successful approaches to face recognition and tracking. The success of eigenfaces mainly has its origins in the benefits offered by principal component analysis (PCA), the representational power of the underlying generative process for high-dimensional noisy facial image data. The sparse extension of PCA (SPCA) has recently received significant attention in the research community. SPCA functions by imposing sparseness constraints on the eigenvectors, a technique that has been shown to yield more robust solutions in many applications. However, when SPCA is applied to facial images, the time and space complexity of PCA learning becomes a critical issue (e.g., real-time tracking). In this paper, we propose a very fast and scalable greedy forward selection algorithm for SPCA. Unlike a recent semidefinite program-relaxation method that suffers from complex optimization, our approach can process several thousands of data dimensions in reasonable time with little accuracy loss. The effectiveness of our proposed method was demonstrated on real-world face recognition and tracking datasets.

• Proceedings of the KIEE Conference
• /
• 2005.10b
• /
• pp.133-137
• /
• 2005

In this paper, we investigate visual and quantitative analysis of different tastes in the liquids using multi-array chemical sensor (MACS) based on the ion-selective electrodes (ISEs), which is so called the electronic tongue (E-Tongue) system. We apply the Fuzzy C-means (FCM) algorithm combined with Principal Component Analysis (PCA), which can be used to reduce multi-dimensional data to two- or three-dimensional data, to classify visually data patterns detected by E-Tongue system. The proposed technique can be determined the cluster centers and membership grade of patterns through the unsupervised way. The membership grade of an unknown pattern, which does not shown previously, can be visually and analytically determined. Throughout the experimental trails, the E-tongue system combined with the proposed algorithms is demonstrated robust performance for visual and quantitative analysis for different tastes in the liquids.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.25 no.1
• /
• pp.91-96
• /
• 2015

In this study, we introduce robust face recognition system with illumination variation realized with the aid of CT preprocessing method. As preprocessing algorithm, Census Transform(CT) algorithm is used to extract locally facial features under unilluminated condition. The dimension reduction of the preprocessed data is carried out by using $(2D)^2$PCA which is the extended type of PCA. Feature data extracted through dimension algorithm is used as the inputs of proposed radial basis function neural networks. The hidden layer of the radial basis function neural networks(RBFNN) is built up by fuzzy c-means(FCM) clustering algorithm and the connection weights of the networks are described as the coefficients of linear polynomial function. The essential design parameters (including the number of inputs and fuzzification coefficient) of the proposed networks are optimized by means of artificial bee colony(ABC) algorithm. This study is experimented with both Yale Face database B and CMU PIE database to evaluate the performance of the proposed system.

• Journal of Korea Multimedia Society
• /
• v.13 no.1
• /
• pp.47-57
• /
• 2010

The object detection is essential for identifying objects, location information, and user context-aware in the image. In this paper, we propose a robust object detection system. The System linearly transforms learning data obtained from the background images to Principal components. It organizes the Eigen-background with the selected Principal components which are able to discriminate between foreground and background. The Fuzzy-C-means (FCM) carries out clustering for images with inputs from the Eigen-background information and classifies them into objects and backgrounds. It used various patterns of backgrounds as learning data in order to implement a system applicable even to the changing environments, Our system was able to effectively detect partial movements of a human body, as well as to discriminate between objects and backgrounds removing noises and shadows without anyone frame image for fixed background.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.46 no.4
• /
• pp.199-208
• /
• 2023

Taguchi method is one of the most popular approaches for design optimization such that performance characteristics become robust to uncontrollable noise variables. However, most previous Taguchi method applications have addressed a single-characteristic problem. Problems with multiple characteristics are more common in practice. The multi-criteria decision making(MCDM) problem is to select the optimal one among multiple alternatives by integrating a number of criteria that may conflict with each other. Representative MCDM methods include TOPSIS(Technique for Order of Preference by Similarity to Ideal Solution), GRA(Grey Relational Analysis), PCA(Principal Component Analysis), fuzzy logic system, and so on. Therefore, numerous approaches have been conducted to deal with the multi-characteristic design problem by combining original Taguchi method and MCDM methods. In the MCDM problem, multiple criteria generally have different measurement units, which means that there may be a large difference in the physical value of the criteria and ultimately makes it difficult to integrate the measurements for the criteria. Therefore, the normalization technique is usually utilized to convert different units of criteria into one identical unit. There are four normalization techniques commonly used in MCDM problems, including vector normalization, linear scale transformation(max-min, max, or sum). However, the normalization techniques have several shortcomings and do not adequately incorporate the practical matters. For example, if certain alternative has maximum value of data for certain criterion, this alternative is considered as the solution in original process. However, if the maximum value of data does not satisfy the required degree of fulfillment of designer or customer, the alternative may not be considered as the solution. To solve this problem, this paper employs the desirability function that has been proposed in our previous research. The desirability function uses upper limit and lower limit in normalization process. The threshold points for establishing upper or lower limits let us know what degree of fulfillment of designer or customer is. This paper proposes a new design optimization technique for multi-characteristic design problem by integrating the Taguchi method and our desirability functions. Finally, the proposed technique is able to obtain the optimal solution that is robust to multi-characteristic performances.