• Journal of Korea Multimedia Society
• /
• v.17 no.12
• /
• pp.1446-1452
• /
• 2014

Existing LDA uses the transform matrix that maximizes distance between classes. So we have to convert from an image to one-dimensional vector as training vector. However, in 2D-LDA, we can directly use two-dimensional image itself as training matrix, so that the classification performance can be enhanced about 20% comparing LDA, since the training matrix preserves the spatial information of two-dimensional image. However 2D-LDA uses same calculation schema for transformation matrix and therefore both LDA and 2D-LDA has the heteroscedastic problem which means that the class classification cannot obtain beneficial information of spatial distances of class clusters since LDA uses only data correlation-based covariance matrix of the training data without any reference to distances between classes. In this paper, we propose a new method to apply training matrix of 2D-LDA by using WPS-LDA idea that calculates the reciprocal of distance between classes and apply this weight to between class scatter matrix. The experimental result shows that the discriminating power of proposed 2D-LDA with weighted between class scatter has been improved up to 2% than original 2D-LDA. This method has good performance, especially when the distance between two classes is very close and the dimension of projection axis is low.

• Journal of Korea Multimedia Society
• /
• v.13 no.6
• /
• pp.817-824
• /
• 2010

Linear Discriminant Analysis (LDA) has been successfully applied for dimension reduction in face recognition. However, LDA requires the transformation of a face image to a one-dimensional vector and this process can cause the correlation information among neighboring pixels to be disregarded. On the other hand, 2D-LDA uses 2D images directly without a transformation process and it has been shown to be superior to the traditional LDA. Nevertheless, there are some problems in 2D-LDA. First, it is difficult to determine the optimal number of feature vectors in a reduced dimensional space. Second, the size of rectangular windows used in 2D-LDA makes strong impacts on classification accuracies but there is no reliable way to determine an optimal window size. In this paper, we propose a new algorithm to overcome those problems in 2D-LDA. We adopt an ensemble approach which combines several classifiers obtained by utilizing various window sizes. And a practical method to determine the number of feature vectors is also presented. Experimental results demonstrate that the proposed method can overcome the difficulties with choosing an optimal window size and the number of feature vectors.

• ETRI Journal
• /
• v.31 no.4
• /
• pp.438-447
• /
• 2009

In this paper, a novel image projection technique for face recognition application is proposed which is based on linear discriminant analysis (LDA) combined with the relevance-weighted (RW) method. The projection is performed through 2-directional and 2-dimensional LDA, or $(2D)^2$LDA, which simultaneously works in row and column directions to solve the small sample size problem. Moreover, a weighted discriminant hyperplane is used in the between-class scatter matrix, and an RW method is used in the within-class scatter matrix to weigh the information to resolve confusable data in these classes. This technique is called the relevance-weighted $(2D)^2$LDA, or RW$(2D)^2$LDA, which is used for a more accurate discriminant decision than that produced by the conventional LDA or 2DLDA. The proposed technique has been successfully tested on four face databases. Experimental results indicate that the proposed RW$(2D)^2$LDA algorithm is more computationally efficient than the conventional algorithms because it has fewer features and faster times. It can also improve performance and has a maximum recognition rate of over 97%.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.10
• /
• pp.35-42
• /
• 2014

It is possible to improve the obstacle avoidance capability by training and recognizing the obstacles which is in certain indoor environment. We propose the technique that use underlying intensity value along with intensity map from RGB-D image which is derived from stereo vision Kinect sensor and recognize an obstacle within constant distance. We test and experiment the accuracy and execution time of the pattern recognition algorithms like PCA, ICA, LDA, SVM to show the recognition possibility of it. From the comparison experiment between RGB-D data and intensity data, RGB-D data got 4.2% better accuracy rate than intensity data but intensity data got 29% and 31% faster than RGB-D in terms of training time and intensity data got 70% and 33% faster than RGB-D in terms of testing time for LDA and SVM, respectively. So, LDA, SVM have good accuracy and better training/testing time to use for obstacle avoidance based on intensity dataset of mobile robot.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.12C
• /
• pp.1162-1166
• /
• 2005

A new low dimensional feature representation technique is presented in this paper. Linear discriminant analysis is a popular feature extraction method. However, in the case of high dimensional data, the computational difficulty and the small sample size problem are often encountered. In order to solve these problems, we propose two dimensional direct LDA algorithm, which directly extracts the image scatter matrix from 2D image and uses Direct LDA algorithm for face recognition. The ORL face database is used to evaluate the performance of the proposed method. The experimental results indicate that the performance of the proposed method is superior to DLDA.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.16 no.6
• /
• pp.759-765
• /
• 2006

In this paper, it is proposed an effective face expression recognition LDA mixed mode using a triangularity membership fuzzy function and wavelet basis. The proposal algorithm gets performs the optimal image, fuzzy wavelet algorithm and Expression recognition is consisted of face characteristic detection step and face Expression recognition step. This paper could applied to the PCA and LDA in using some simple strategies and also compares and analyzes the performance of the LDA mixed model which is combined and the facial expression recognition based on PCA and LDA. The LDA mixed model is represented by the PCA and the LDA approaches. And then we calculate the distance of vectors dPCA, dLDA from all fates in the database. Last, the two vectors are combined according to a given combination rule and the final decision is made by NNPC. In a result, we could showed the superior the LDA mixed model can be than the conventional algorithm.

• Journal of KIISE:Software and Applications
• /
• v.34 no.7
• /
• pp.681-687
• /
• 2007

Face recognition technique is very popular for a personal information security and user identification in recent years. However, the face recognition system is very hard to be implemented due to the difficulty where change in illumination, pose and facial expression. In this paper, we consider that an illumination change causing the variety of face appearance, virtual image data is generated and added to the D-LDA which was selected as the most suitable feature extractor. A less sensitive recognition system in illumination is represented in this paper. This way that consider nature of several illumination directions generate the virtual training image data that considered an illumination effect of the directions and the change of illumination density. As result of experiences, D-LDA has a less sensitive property in an illumination through ORL, Yale University and Pohang University face database.

• Journal of the Korea Convergence Society
• /
• v.11 no.7
• /
• pp.9-18
• /
• 2020

The research objectives investigates main research topics and trends in the information and communication technology(ICT) field, Korea using LDA(Latent Dirichlet Allocation), one of the topic modeling techniques. The experimental dataset of ICT research and development(R&D) project of 5,200 was acquired through matching with the EZone system of IITP after downloading R&D project dataset from NTIS(National Science and Technology Information Service) during recent five years. Consequently, our finding was that the majority research topics were found as intelligent information technologies such as AI, big data, and IoT, and the main research trends was hyper realistic media. Finally, it is expected that the research results of topic modeling on the national R&D foundation dataset become the powerful information about establishment of planning and strategy of future's research and development in the ICT field.

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

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.8
• /
• pp.113-119
• /
• 2013

The requirement of rehabilitation is increasing from the stroke, spinal cord injury. One of the most difficult part is the upper limb rehabilitation because of its nervous complexity. A rehabilitation has effectiveness when a professional therapist treats in work at facility, but it has problems of an accessibility, a constant availability, a self-participation and taking lots of cost and time. In this paper, we test and experiment the accuracy and execution time of the pattern recognition algorithms like PCA, ICA, LDA, SVM to show the recognition possibility of it on the upper limb function from the 3D trajectory information which is gathered from stereo vision sensor(Kinect). From the result, PCA, ICA have low accuracy, but LDA, SVM have good accuracy to use for physical rehabilitation on the upper limb function.