• Journal of Korea Multimedia Society
• /
• v.13 no.6
• /
• pp.833-840
• /
• 2010

In this paper a method for detecting and extracting the face from the image in YCbCr spaceis proposed. The face region is obtained from the complex original image by using the difference method and the face color information is taken from the reduced face region throughthe Ellipse clustering method. The experimental results showed that the proposed method can efficiently detect and extract the face from the original image under the general light intensity except for low luminance.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.387-388
• /
• 2006

In this paper, we propose an efficient algorithm based on PCA and LDA combining K-means clustering method, which has better accuracy of face recognition than Eigenface and Fisherface. In this algorithm, PCA is firstly used to reduce the dimensionality of original face image. Secondly, a truncated face image data are sub-clustered by K-means clustering method based on Euclidean distances, and all small subclusters are labeled in sequence. Then LDA method project data into low dimension feature space and group data easier to classify. Finally we use nearest neighborhood method to determine the label of test data. To show the recognition accuracy of the proposed algorithm, we performed several simulations using the Yale and ORL (Olivetti Research Laboratory) database. Simulation results show that proposed method achieves better performance in recognition accuracy.

• Korean Journal of Cognitive Science
• /
• v.11 no.2
• /
• pp.53-58
• /
• 2000

This paper reconstructs local region of a facial expression image from extracted feature points of facial expression image using FCM(Fuzzy C-Meang) clustering algorithm with Gabor wavelets. The feature extraction in a face is two steps. In the first step, we accomplish the edge extraction of main components of face using average value of 2-D Gabor wavelets coefficient histogram of image and in the next step, extract final feature points from the extracted edge information using FCM clustering algorithm. This study presents that the principal components of facial expression images can be reconstructed with only a few feature points extracted from FCM clustering algorithm. It can also be applied to objects recognition as well as facial expressions recognition.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2007.11a
• /
• pp.427-428
• /
• 2007

• Korean Journal of Cognitive Science
• /
• v.14 no.1
• /
• pp.11-16
• /
• 2003

This Paper extracts the edge of main components of face with Gator wavelets transformation in facial expression images. FCM(Fuzzy C-Means) clustering algorithm then extracts the representative feature points of low dimensionality from the edge extracted in neutral face. The feature-points of the neutral face is used as a template to extract the feature-points of facial expression images. To match point to Point feature points on an expression face against each feature point on a neutral face, it consists of two steps using a dynamic linking model, which are called the coarse mapping and the fine mapping. This paper presents an automatic extraction of feature-points by dynamic linking model based on Gabor wavelets and fuzzy C-means(FCM) algorithm. The result of this study was applied to extract features automatically in facial expression recognition based on dimension[1].

• Journal of the Korean Data and Information Science Society
• /
• v.15 no.3
• /
• pp.555-563
• /
• 2004

In classification and discrimination, we often face with incomplete group variable arising typically from many missing values and/or incredible cases. This paper suggests the use of K-means clustering for pre-adjusting incompleteness and in turn classification based on generalized statistical distance is performed. For illustrating the proposed procedure, simulation study is conducted comparatively with CART in data mining and traditional techniques which are ignoring incompleteness of group variable. Simulation study manifests that our methodology out-performs.

• 전자공학회논문지 IE
• /
• v.43 no.2
• /
• pp.39-48
• /
• 2006

This paper is proposed the wavelet morphology algorithm with the spatial auto-object segmentation concept and the clustering concept. When it is segmented the color face by using the proposed algorithm, it is made to the simple image. Also, it is used the spatial quality in order to segment and detect the image as a real time without the user's manufacturing. This removed a small part that is regarded as a noise in image by HSV color model and applied the wavelet morphology to remove a part excepting for the face image. In this paper, it is made a comparison between the wavelet morphology algorithm and the morphology algorithm. And It is showed to accurately detect the face object parts in the image appled to HSV color space model.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.2
• /
• pp.785-804
• /
• 2017

Due to various factors such as postures, facial expressions and illuminations, face recognition by videos often suffer from poor recognition accuracy and generalization ability, since the within-class scatter might even be higher than the between-class one. Herein we address this problem by proposing a hierarchical cascaded classifier for video face recognition, which is a multi-layer algorithm and accounts for the misclassified samples plus their similar samples. Specifically, it can be decomposed into single classifier construction and multi-layer classifier design stages. In single classifier construction stage, classifier is created by clustering and the number of classes is computed by analyzing distance tree. In multi-layer classifier design stage, the next layer is created for the misclassified samples and similar ones, then cascaded to a hierarchical classifier. The experiments on the database collected by ourselves show that the recognition accuracy of the proposed classifier outperforms the compared recognition algorithms, such as neural network and sparse representation.

• Journal of Haehwa Medicine
• /
• v.23 no.1
• /
• pp.115-124
• /
• 2014

Objectives : There are plenty of medical record of acupuncture & moxibustion in Traditional East Asian medicine(TEAM). We performed this study to find out the hidden criteria lies on this record to choose proper acupoints. Methods : "Zhenjiuzishengjing", ancient TEAM book was analysed using document clustering techniques. Corpus was made from this book. It contained 196 texts driven from each symptoms. Each texts converted to vector representing frequency of 349 acupoints. Distance of vectors calculated by weighted Euclidean distance method. According to this distances, hierarchical clustering of symptoms was builded. Results : The cluster consisted of five large groups. they had high corelation with body part; head and face, chest, abdomen, upper extremity, lower extremity, back. Conclusions : It assumes that body part of symptom is the most importance criteria of acupoints selecting. some high similar symptom vectors consolidated this result. the other criteria is cause and pathway of illness. some symptoms bound together which had common cause and pathway.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.5
• /
• pp.871-876
• /
• 2006

In this thesis, to accurately measure 3D face information using the spatial encoding patterns, the new algorithm to segment the pattern images from initial face pattern image is proposed. If the obtained images is non-homogeneous texture and ambiguous boundary pattern, the pattern segmentation is very difficult. Furthermore. the non-encoded areas by accumulated error are occurred. In this thesis, the FCM(fuzzy c-means) clustering method is proposed to enhance the robust encoding and segmentation rate under non-homogeneous texture and ambiguous boundary pattern. The initial parameters for experiment such as clustering class number, maximum repetition number, and error tolerance are set with 2, 100, 0.0001 respectively. The proposed pattern segmentation method increased 8-20% segmentation rate with conventional binary segmentation methods.