• Journal of the Korean Data and Information Science Society
• /
• v.14 no.2
• /
• pp.345-354
• /
• 2003

An incremental kernel principal component analysis(IKPCA) is proposed for the nonlinear feature extraction from the data. The problem of batch kernel principal component analysis(KPCA) is that the computation becomes prohibitive when the data set is large. Another problem is that, in order to update the eigenvectors with another data, the whole eigenvectors should be recomputed. IKPCA overcomes this problem by incrementally updating the eigenspace model. IKPCA is more efficient in memory requirement than a batch KPCA and can be easily improved by re-learning the data. In our experiments we show that IKPCA is comparable in performance to a batch KPCA for the classification problem on nonlinear data set.

• International Journal of Advanced Culture Technology
• /
• v.6 no.3
• /
• pp.142-150
• /
• 2018

This paper describes the algorithm that lowers the dimension, maintains the object recognition and significantly reduces the eigenspace configuration time by combining the edge orientation histogram and principle component analysis. By using the detected object region as a recognition input image, in this paper the object recognition method combined with principle component analysis and the multi-layer network which is one of the intelligent classification was suggested and its performance was evaluated. As a pre-processing algorithm of input object image, this method computes the eigenspace through principle component analysis and expresses the training images with it as a fundamental vector. Each image takes the set of weights for the fundamental vector as a feature vector and it reduces the dimension of image at the same time, and then the object recognition is performed by inputting the multi-layer neural network.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.628-631
• /
• 2009

In this paper, we proposed a new authentication method using video that was taken during moving a hand-held camera in front of the face. The proposed method extracted individuality from the obtained image sequences using the parametric eigenspace scheme. Changes of facial appearance through authentication trials draw continuous tracks in the low dimensional igenspace. The similarity between their continuous tracks are calculated by DP-matching to verify their identities. Experimental results confirmed that different motions and persons change the shapes of continuous tracks, so the proposed method could identify the person.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.5
• /
• pp.185-192
• /
• 2004

This paper presents face recognition using vector quantization in the eigenspace of the faces. The existing eigenface method is not enough for representing the variations of faces. For making up for its defects, the proposed method use a clustering of feature vectors by vector quantization in eigenspace of the faces. In the trainning stage, the face images are transformed the points in the eigenspace by eigeface(eigenvetor) and we represent a set of points for each people as the centroids of vector quantizer. In the recognition stage, the vector quantizer finds the centroid having the minimum quantization error between feature vector of input image and centriods of database. The experiments are performed by 600 faces in Faces94 database. The existing eigenface method has minimum 64 miss-recognition and the proposed method has minimum 20 miss-recognition when we use 4 codevectors. In conclusion, the proposed method is a effective method that improves recognition rate through overcoming the variation of faces.

• Structural Engineering and Mechanics
• /
• v.44 no.2
• /
• pp.179-196
• /
• 2012

An eigenspace projection clustering method is proposed for structural damage detection by combining projection algorithm and fuzzy clustering technique. The integrated procedure includes data selection, data normalization, projection, damage feature extraction, and clustering algorithm to structural damage assessment. The frequency response functions (FRFs) of the healthy and the damaged structure are used as initial data, median values of the projections are considered as damage features, and the fuzzy c-means (FCM) algorithm are used to categorize these features. The performance of the proposed method has been validated using a three-story frame structure built and tested by Los Alamos National Laboratory, USA. Two projection algorithms, namely principal component analysis (PCA) and kernel principal component analysis (KPCA), are compared for better extraction of damage features, further six kinds of distances adopted in FCM process are studied and discussed. The illustrated results reveal that the distance selection depends on the distribution of features. For the optimal choice of projections, it is recommended that the Cosine distance is used for the PCA while the Seuclidean distance and the Cityblock distance suitably used for the KPCA. The PCA method is recommended when a large amount of data need to be processed due to its higher correct decisions and less computational costs.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.2
• /
• pp.216-221
• /
• 2003

Emotions recognition is a topic on which little research has been done to date. This paper proposes a new method that can recognize the human s emotion from facial image by using eigenspace. To do so, first, we get the face image by using the skin color from the original color image acquired by CCD color camera. Second, we get the vector image which is projected the obtained face image into eigenspace. And then, we propose the method for finding out each person s identification and emotion from the weight of vector image. Finally, we show the practical application possibility of the proposed method through the experiment.

• Proceedings of the KSME Conference
• /
• 2007.05a
• /
• pp.467-472
• /
• 2007

A modern MEMS resonator is a micro-scale structure operated over a high frequency range. In order to predict its resonant behavior in a design process, High-frequency response analysis (Hi-FRA) is demanded. Algebraic substructuring (AS) is known as a fast numerical technique to construct an eigenspace for FR and frequency sweep (FS) algorithm efficiently solves the frequency response system projected on the eigenspace. However, the existing FS algorithm using AS is developed for low-FRA, say over the range 1Hz-2KHz. In this work, we extend the FS algorithm using AS for FRA over an arbitrary frequency range. Therefore, it can be efficiently applied to systems operated at a high frequency, say over the range 230MHz-250MHz. The success of the proposed method is demonstrated by Hi-FRA of a checkerboard resonator.

• Proceedings of the KOSOMBE Conference
• /
• v.1995 no.11
• /
• pp.117-120
• /
• 1995

The electronencephalogram (EEG) is a complex electrical signal which reflects generalized brain activity. The EEG is utilized in the clinical assesment of many neurological and psychiatric disorders and offers promise for monitoring of patients undergoing operation. This paper describes a technique for quantitative analysis of EEG signals which is based on an eigenspace. Examples of the application approach to simulated and clinical EEG data illustrate the capabilities.

• Journal of Korea Multimedia Society
• /
• v.7 no.12
• /
• pp.1745-1753
• /
• 2004

A method of estimating the pose of a three-dimensional object from a set of two-dimensioal images based on parametric eigenspace method is proposed. A Gaussian blurred edge image is used as an input image instead of the original image itself as has been used previously. The set of input images is compressed using K-L transformation. By comparing the estimation errors for the original, blurred original, edge, and blurred edge images, we show that blurring with the Gaussian function and the use of edge images enhance the data compression ratio and decrease the resulting from smoothing the trajectory in the parametric eigenspace, thereby allowing better pose estimation to be achieved than that obtainable using the original images as it is. The proposed method is shown to have improved efficiency, especially in cases with occlusion, position shift, and illumination variation. The results of the pose angle estimation show that the blurred edge image has the mean absolute errors of the pose angle in the measure of 4.09 degrees less for occlusion and 3.827 degrees less for position shift than that of the original image.

• Journal of Institute of Control, Robotics and Systems
• /
• v.1 no.2
• /
• pp.105-111
• /
• 1995

This paper proposes a segmentation algorithm using gray-level discontinuity and surface reflectance ratio of input images obtained under different illumination conditions. Each image is divided by a certain number of subregions based on the thresholds. The thresholds are determined using the histogram of fusion image which is obtained by ANDing the multiple input images. The subregions of images are projected on the eigenspace where their bases are the major eigenvectors of image matrix. Points in the eigenspace are classified into two clusters. Images associated with the bigger cluster are fused by revised ANDing to form a combined edge image. Missing edges are detected using surface reflectance ration and chain code. The proposed algorithm obtains more accurate edge information and allows to more efficiently recognize the environment under various illumination conditions.