• Journal of KIISE:Software and Applications
• /
• v.31 no.1
• /
• pp.1-7
• /
• 2004

For the handwritten digit recognition, this paper Proposes a hierarchical Gator features extraction method and a Bayesian network for them. Proposed Gator features are able to represent hierarchically different level information and Bayesian network is constructed to represent hierarchically structured dependencies among these Gator features. In order to extract such features, we define Gabor filters level by level and choose optimal Gabor filters by using Fisher's Linear Discriminant measure. Hierarchical Gator features are extracted by optimal Gabor filters and represent more localized information in the lower level. Proposed methods were successfully applied to handwritten digit recognition with well-known naive Bayesian classifier, k-nearest neighbor classifier. and backpropagation neural network and showed good performance.

• Journal of Korea Multimedia Society
• /
• v.9 no.3
• /
• pp.287-295
• /
• 2006

This paper compares two different approaches based on wavelet and Gabor decomposition towards representing the texture of an arbitrary region. The Gabor-domain mean and standard deviation combination is considered to be best in representing the texture of rectangular regions. However, texture representation of arbitrary regions would enable generalized object-based image retrieval and other applications in the future. In this study, we have found that the wavelet features perform better than the Gabor features in representing the texture of arbitrary regions. Particularly, the wavelet-domain standard deviation and entropy combination results in the best retrieval accuracy. Based on our experiment with texture image sets, we present and compare tile retrieval accuracy of multiple wavelet and Gabor feature combinations.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.2
• /
• pp.87-94
• /
• 2008

In this paper, an extraction method of objects of interest in the color images is proposed. It is possible to extract objects of interest from a complex background without any prior-knowledge based on the proposed method. For object extraction, Gator images that contain information of object location, are created by using Gator filter. Based on the images the initial location of attention windows is determined, from which image features are selected to extract objects. To extract object, I modify the previous method partially and apply the modified method. To evaluate the performance of propsed method, precision, recall and F-measure are calculated between the extraction results from propsed method and manually extracted results. I verify the performance of the proposed methods based on these accuracies. Also through comparison of the results with the existing method, I verily the superiority of the proposed method over the existing method.

• Proceedings of the KIEE Conference
• /
• 2002.11c
• /
• pp.321-324
• /
• 2002

In this paper, we introduce a new approach to fingerprint classification based on both singular points and gabor features. We find singular points of fingerprint image by using squared direction field and Poincare index. Then, the input fingerprint image can be classified into one of 5 classes using the number of singular points and their location. However, it is often impossible to classify the fingerprint image because the numbers and the position of the singular points are not correct due to noise. In this case Gabor features are extracted from unclassified images using Gator filter and they are classified by using k-NN classifier. This method has been tested on the NIST-4 database. The experimental results show that the proposed method is reliable.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.45 no.6
• /
• pp.67-76
• /
• 2008

Reliable face recognition under various illumination environments is essential for successful commercialization. Feature-based face recognition relies on a good choice of feature vectors. Gabor feature vectors are known to be more robust to variations of pose and illumination than any other feature vectors so that they are popularly adopted for face recognition. However, they are not completely independent of illuminations. In this paper, we propose an illumination-robust face recognition method based on the Gabor feature vector illumination PCA model. We first construct the Gabor feature vector illumination PCA model where Gator feature vector space is rendered to be decomposed into two orthogonal illumination subspace and face identity subspace. Since the Gabor feature vectors obtained by projection into the face identity subspace are separated from illumination, the face recognition utilizing them becomes more robust to illumination. Through experiments, it is shown that the proposed face recognition based on Gabor feature vector illumination PCA model performs more reliably under various illumination and Pose environments.

• 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 Institute of Electronics Engineers of Korea SP
• /
• v.40 no.6
• /
• pp.20-30
• /
• 2003

In a conventional method based on quadrature 2D Gator wavelets to extract iris features, the iris recognition is performed by a 256-byte iris code, which is computed by applying the Gabor wavelets to a given area of the iris. However, there is a code redundancy because the iris code is generated by basis functions without considering the characteristics of the iris texture. Therefore, the size of the iris code is increased unnecessarily. In this paper, we propose a new feature extraction algorithm based on the ICA (Independent Component Analysis) for a compact iris code. We implemented the ICA to generate optimal basis functions which could represent iris signals efficiently. In practice the coefficients of the ICA expansions are used as feature vectors. Then iris feature vectors are encoded into the iris code for storing and comparing an individual's iris patterns. Additionally, we introduce two methods to enhance the recognition performance of the ICA. The first is to reorganize the ICA bases and the second is to use a different ICA bases set. Experimental results show that our proposed method has a similar EER (Equal Error Rate) as a conventional method based on the Gator wavelets, and the iris code size of our proposed methods is four times smaller than that of the Gabor wavelets.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.1
• /
• pp.70-76
• /
• 2002

In this paper, we proposed a personal identification algorithm using the iris region which has discriminant features. First, we acquired the eye image with the black and white CCD camera and extracted the iris region by using a circular edge detector which minimizes the search space for real center and radius of the iris. And then, we localized the iris region into several circles and extracted the features by filtering signals on the perimeters of circles with one dimensional Gabor filter We identified a person by comparing ,correlation values of input signals with the registered signals. We also decided threshold value minimizing average error rate for FRR(Type I)error rate and FAR(Type II)error rate. Experimental results show that proposed algorithm has average error rate less than 5.2%.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.8 no.1
• /
• pp.42-51
• /
• 2008

We believe that smart spaces, offering pervasive services, will proliferate. However, at present, those islands of smart spaces should be joined seamlessly with each other. As users move about, they will have to roam from one autonomous smart space to another. When they move into the new island of smart space, they should setup their devices and service manually or not have access to the services available in their home spaces. Sometimes, there will conflicts between users when they try to occupy the same space or use a specific device at the same time. It will also be critical to elder people who suffer from Alzheimer or other cognitive impairments when they travel from their smart space to other visited spaces (e.g., grocery stores, museums). Furthermore our experience in building the Gator Tech Smart House reveals to us that home residents generally do not want to lose or be denied all the features or services they have come to expect simply because they move to a new smart space. The seamless inter-space interaction requirements and issues are raised automatically when the ubiquitous pervasive computing system tries to establish the user's service environment by allocating relevant resources after the user moves to a new location where there are no prior settings for the new environment. In this paper, we raise and present several critical inter-space interactions issues impacting middleware architecture design of ubiquitous pervasive computing. We propose requirements for resolving these issues on seamless inter-space operation. We also illustrate our approach and ideas via a service scenario moving around two smart spaces.

• The Journal of the Korea Contents Association
• /
• v.7 no.1
• /
• pp.48-57
• /
• 2007

Eye localization is necessary for face recognition and related application areas. Most of eye localization algorithms reported thus far still need to be improved about precision and computational time for successful applications. In this paper, we propose an improved eye localization method based on multi-scale Gator feature vector models. The proposed method first tries to locate eyes in the downscaled face image by utilizing Gabor Jet similarity between Gabor feature vector at an initial eye coordinates and the eye model bunch of the corresponding scale. The proposed method finally locates eyes in the original input face image after it processes in the same way recursively in each scaled face image by using the eye coordinates localized in the downscaled image as initial eye coordinates. Experiments verify that our proposed method improves the precision rate without causing much computational overhead compared with other eye localization methods reported in the previous researches.