• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.1
• /
• pp.81-86
• /
• 2012

In this paper, we proposed a new design methodology of a pattern classification rule based on the local linear discriminant analysis expanded from the generic linear discriminant analysis which is used in the local area divided from the whole input space. There are two ways such as k-Means clustering method and the differential evolutionary algorithm to partition the whole input space into the several local areas. K-Means clustering method is the one of the unsupervised clustering methods and the differential evolutionary algorithm is the one of the optimization algorithms. In addition, the experimental application covers a comparative analysis including several previously commonly encountered methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.11
• /
• pp.4502-4518
• /
• 2015

Fisher linear discriminant analysis (LDA) is one of the most popular projection techniques for feature extraction and has been widely applied in face recognition. However, it cannot be used when encountering the single sample per person problem (SSPP) because the intra-class variations cannot be evaluated. In this paper, we propose a novel method called local similarity based linear discriminant analysis (LS_LDA) to solve this problem. Motivated by the "divide-conquer" strategy, we first divide the face into local blocks, and classify each local block, and then integrate all the classification results to make final decision. To make LDA feasible for SSPP problem, we further divide each block into overlapped patches and assume that these patches are from the same class. To improve the robustness of LS_LDA to outliers, we further propose local similarity based median discriminant analysis (LS_MDA), which uses class median vector to estimate the class population mean in LDA modeling. Experimental results on three popular databases show that our methods not only generalize well SSPP problem but also have strong robustness to expression, illumination, occlusion and time variation.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.20 no.1
• /
• pp.101-108
• /
• 2010

In this paper, we proposed a new lazy classifier with fuzzy k-nearest neighbors approach and feature selection which is based on reconstruction error. Reconstruction error is the performance index for locally linear reconstruction. When a new query point is given, fuzzy k-nearest neighbors approach defines the local area where the local classifier is available and assigns the weighting values to the data patterns which are involved within the local area. After defining the local area and assigning the weighting value, the feature selection is carried out to reduce the dimension of the feature space. When some features are selected in terms of the reconstruction error, the local classifier which is a sort of polynomial is developed using weighted least square estimation. In addition, the experimental application covers a comparative analysis including several previously commonly encountered methods such as standard neural networks, support vector machine, linear discriminant analysis, and C4.5 trees.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.3
• /
• pp.1390-1403
• /
• 2016

Facial expression recognition (FER) plays a very significant role in computer vision, pattern recognition, and image processing applications such as human computer interaction as it provides sufficient information about emotions of people. For video-based facial expression recognition, depth cameras can be better candidates over RGB cameras as a person's face cannot be easily recognized from distance-based depth videos hence depth cameras also resolve some privacy issues that can arise using RGB faces. A good FER system is very much reliant on the extraction of robust features as well as recognition engine. In this work, an efficient novel approach is proposed to recognize some facial expressions from time-sequential depth videos. First of all, efficient Local Binary Pattern (LBP) features are obtained from the time-sequential depth faces that are further classified by Generalized Discriminant Analysis (GDA) to make the features more robust and finally, the LBP-GDA features are fed into Hidden Markov Models (HMMs) to train and recognize different facial expressions successfully. The depth information-based proposed facial expression recognition approach is compared to the conventional approaches such as Principal Component Analysis (PCA), Independent Component Analysis (ICA), and Linear Discriminant Analysis (LDA) where the proposed one outperforms others by obtaining better recognition rates.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.2
• /
• pp.832-854
• /
• 2019

Action recognition has been studied in computer vision field for years. We present an effective approach to recognize actions using a dimension reduction method, which is applied as a crucial step to reduce the dimensionality of feature descriptors after extracting features. We propose to use sparse matrix and randomized kd-tree to modify it and then propose modified Local Fisher Discriminant Analysis (mLFDA) method which greatly reduces the required memory and accelerate the standard Local Fisher Discriminant Analysis. For feature encoding, we propose a useful encoding method called mix encoding which combines Fisher vector encoding and locality-constrained linear coding to get the final video representations. In order to add more meaningful features to the process of action recognition, the convolutional neural network is utilized and combined with mix encoding to produce the deep network feature. Experimental results show that our algorithm is a competitive method on KTH dataset, HMDB51 dataset and UCF101 dataset when combining all these methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.3
• /
• pp.794-814
• /
• 2012

We propose a novel method for improving Wi-Fi positioning accuracy while reducing the energy consumption of mobile devices. Our method presents three contributions. First, we jointly and intelligently select the optimal subset of access points for positioning via maximum mutual information criterion. Second, we further propose local discriminant embedding algorithm for nonlinear discriminative feature extraction, a process that cannot be effectively handled by existing linear techniques. Third, to reduce complexity and make input signal space more compact, we incorporate clustering analysis to localize the positioning model. Experiments in realistic environments demonstrate that the proposed method can lower energy consumption while achieving higher accuracy compared with previous methods. The improvement can be attributed to the capability of our method to extract the most discriminative features for positioning as well as require smaller computation cost and shorter sensing time.

• Journal of KIISE:Software and Applications
• /
• v.30 no.3_4
• /
• pp.372-378
• /
• 2003

Limitations on the linear discriminant analysis (LDA) for face rerognition, such as the loss of generalization and the computational infeasibility, are addressed and illustrated for a small number of samples. The principal component analysis (PCA) followed by the LDA mapping may be an alternative that ran overcome these limitations. We also show that any schemes based on either mappings or template matching are vulnerable to image variations due to rotation, translation, facial expressions, or local illumination conditions. This entails the importance of a proper preprocessing that can compensate for such variations. A simple template matching, when combined with the geometrically correlated feature-based detection as a preprocessing, is shown to outperform mapping techniques in terms of both the accuracy and the robustness to image variations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.9
• /
• pp.2991-3007
• /
• 2022

Two dimensional locality preserving projections (2D-LPP) is an improved algorithm of 2D image to solve the small sample size (SSS) problems which locality preserving projections (LPP) meets. It's able to find the low dimension manifold mapping that not only preserves local information but also detects manifold embedded in original data spaces. However, 2D-LPP is simple and elegant. So, inspired by the comparison experiments between two dimensional linear discriminant analysis (2D-LDA) and linear discriminant analysis (LDA) which indicated that matrix based methods don't always perform better even when training samples are limited, we surmise 2D-LPP may meet the same limitation as 2D-LDA and propose a novel matrix exponential method to enhance the performance of 2D-LPP. 2D-MELPP is equivalent to employing distance diffusion mapping to transform original images into a new space, and margins between labels are broadened, which is beneficial for solving classification problems. Nonetheless, the computational time complexity of 2D-MELPP is extremely high. In this paper, we replace some of matrix multiplications with multiple multiplications to save the memory cost and provide an efficient way for solving 2D-MELPP. We test it on public databases: random 3D data set, ORL, AR face database and Polyu Palmprint database and compare it with other 2D methods like 2D-LDA, 2D-LPP and 1D methods like LPP and exponential locality preserving projections (ELPP), finding it outperforms than others in recognition accuracy. We also compare different dimensions of projection vector and record the cost time on the ORL, AR face database and Polyu Palmprint database. The experiment results above proves that our advanced algorithm has a better performance on 3 independent public databases.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.6 no.1
• /
• pp.6-17
• /
• 2013

Recently, the color of vehicle license plate has been changed from green to white. Thus the vehicle plate recognition system used for parking management systems, speed and signal violation detection systems should be robust to the both colors. This paper presents a vehicle license plate recognition system, which works on both of green and white plate at the same time. In the proposed system, the image of license plate is taken from a captured vehicle image by using morphological information. In the next, each character region in the license plate image is extracted based on the vertical and horizontal projection of plate image and the relative position of individual characters. Finally, for the recognition process of extracted characters, PCA(Principal Component Analysis) and LDA(Linear Discriminant Analysis) are sequentially utilized. In the experiment, vehicle license plates of both green background and white background captured under irregular illumination conditions have been tested, and the relatively high extraction and recognition rates are observed.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.10
• /
• pp.1987-1996
• /
• 2009

Recently, the color of vehicle license plate has been changed from green to white. Thus the vehicle plate recognition system used for parking management systems, speed and signal violation detection systems should be robust to the both colors. This paper presents a vehicle license plate recognition system, which works on both of green and white plate at the same time. In the proposed system, the image of license plate is taken from a captured vehicle image by using morphological information. In the next, each character region in the license plate image is extracted based on the vertical and horizontal projection of plate image and the relative position of individual characters. Finally, for the recognition process of extracted characters, PCA(Principal Component Analysis) and LDA(Linear Discriminant Analysis) are sequentially utilized. In the experiment, vehicle license plates of both green background and white background captured under irregular illumination conditions have been tested, and the relatively high extraction and recognition rates are observed.