• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.35 no.6
• /
• pp.485-494
• /
• 2017

This study focuses on automatic image registration between multiple IR images using simple preprocessing method and modified local feature extraction algorithm. The input images were preprocessed by using the median and absolute value after histogram equalization, and it could be effectively applied to reduce the brightness difference value between images by applying the similarity of extracted features to the concept of angle instead of distance. The results were evaluated using visual and inverse RMSE methods. The features that could not be achieved by the existing local feature extraction technique showed high image matching reliability and application convenience. It is expected that this method can be used as one of the automatic registration methods between multi-sensor images under specific conditions.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2007.05a
• /
• pp.389-398
• /
• 2007

Case-based reasoning (CBR) is one of the most popular prediction techniques for medical diagnosis because it is easy to apply, has no possibility of overfitting, and provides a good explanation for the output. However, it has a critical limitation - its prediction performance is generally lower than other artificial intelligence techniques like artificial neural networks (ANNs). In order to obtain accurate results from CBR, effective retrieval and matching of useful prior cases for the problem is essential, but it is still a controversial issue to design a good matching and retrieval mechanism for CBR systems. In this study, we propose a novel approach to enhance the prediction performance of CBR. Our suggestion is the simultaneous optimization of feature weights, instance selection, and the number of neighbors that combine using genetic algorithms (GAs). Our model improves the prediction performance in three ways - (1) measuring similarity between cases more accurately by considering relative importance of each feature, (2) eliminating redundant or erroneous reference cases, and (3) combining several similar cases represent significant patterns. To validate the usefulness of our model, this study applied it to a real-world case for evaluating cytological features derived directly from a digital scan of breast fine needle aspirate (FNA) slides. Experimental results showed that the prediction accuracy of conventional CBR may be improved significantly by using our model. We also found that our proposed model outperformed all the other optimized models for CBR using GA.

• KIPS Transactions on Computer and Communication Systems
• /
• v.3 no.5
• /
• pp.163-172
• /
• 2014

The Scale Invariant Feature Transform (SIFT) has been widely used in a lot of applications for image feature matching. Such a transform allows us to strong matching ability, stability in rotation, and scaling with the variety of different scales. Recently, it has been made one of the most successful algorithms in the research areas of copy-move forgery detections. Though this transform is capable of identifying copy-move forgery, it does not widely address the possibility that counter-forensics operations may be designed and used to hide the evidence of image tampering. In this paper, we propose a targeted counter-forensics method for impeding SIFT-based copy-move forgery detection by applying a semantically admissible distortion in the processing tool. The proposed method allows the attacker to delude a similarity matching process and conceal the traces left by a modification of SIFT keypoints, while maintaining a high fidelity between the processed images and original ones under the semantic constraints. The efficiency of the proposed method is supported by several experiments on the test images with various parameter settings.

• Journal of the Korean Society for information Management
• /
• v.22 no.3 s.57
• /
• pp.261-287
• /
• 2005

The purpose of this paper is to explore the ways to improve the performance of SVM (Support Vector Machines) text classifier using inter-document similarities. SVMs are powerful machine learning systems, which are considered as the state-of-the-art technique for automatic document classification. In this paper text categorization via SVMs approach based on feature representation with document vectors is suggested. In this approach, document vectors instead of index terms are used as features, and vector similarities instead of term weights are used as feature values. Experiments show that SVM classifier with document vector features can improve the document classification performance. For the sake of run-time efficiency, two methods are developed: One is to select document vector features, and the other is to use category centroid vector features instead. Experiments on these two methods show that we can get improved performance with small vector feature set than the performance of conventional methods with index term features.

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

• The Journal of the Acoustical Society of Korea
• /
• v.20 no.7
• /
• pp.83-88
• /
• 2001

In this paper, matched field processing algorithm robust to environmental mismatches in an ocean waveguide based on feature extraction is summarized. However, in applying this processor to localize a source there are two preliminary issues to be resolved. One is the number of eigenvectors to be extracted and the other is the number of environmental samples to be used. To determine these issues, the relation between the number of dominant modes propagating in a given ocean waveguide and that of eigenvectors to be extracted is analyzed. Then, the analysis results are confirmed by the subspace analysis. This analysis quantifies the similarity between the subspace spanned by the signal vectors and that spanned by the eigenvectors to be extracted. The error index is defined as a relative difference between the location estimated by the current processor and the real source location. It is identified that in the case of extracting the largest eigenvectors equal to the number of dominant modes in a given environment, the processor localizes the source successfully. From the numerical simulations, it is shown that use of at least 30 environmental samples guarantee stable performance of the proposed processor.

• The Journal of the Korea Contents Association
• /
• v.8 no.1
• /
• pp.236-245
• /
• 2008

Robust face recognition under various illumination environments is very difficult and needs to be accomplished for successful commercialization. In this paper, we propose an efficient illumination preprocessing method for face recognition. illumination preprocessing algorithm based on anisotropic smoothing is well known to be effective among illumination normalization methods but deteriorates the intensity contrast of the original image, and incurs less sharp edges. The proposed method in this paper improves the previous anisotropic smoothing based illumination normalization method so that it increases the intensity contrast and enhances the edges while diminishing effects of illumination. Due to the result of these improvements, face images preprocessed by the proposed illumination preprocessing method becomes to have more distinctive feature vectors(Gabor feature vectors). Through experiments of face recognition using Gabor jet similarity, the effectiveness of the proposed illumination preprocessing method is verified.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.8
• /
• pp.83-93
• /
• 2014

Research into recommendation systems for wellness content has focused on representative research on the convergence of wellness and information technology, as interest in wellness has recently increased. But existing research is not suitable because it uses only one or two of the five wellness areas: physical, emotional, social, intellectual, and spiritual. And It cause decline of reliability and satisfaction for recommendation. Thus, a wellness areal feature analysis and integration management technique is needed. In this paper, suggest meta-data configuration and feature analysis technique of content. Also Cosine similarity of wellness areal features of the content was analyzed by applying a wellness areal score calculated in this way and by suggested wellness areal detailed properties and a measurement system to verify the efficiency of this research. This allows the wellness features of contents analyzed, and even will be able to personalized recommendations service for wellness.

• Journal of Korea Multimedia Society
• /
• v.9 no.11
• /
• pp.1465-1473
• /
• 2006

In this paper, we present an approach for facial expression recognition using Active Shape Models(ASM) and a state-based model in image sequences. Given an image frame, we use ASM to obtain the shape parameter vector of the model while we locate facial feature points. Then, we can obtain the shape parameter vector set for all the frames of an image sequence. This vector set is converted into a state vector which is one of the three states by the state-based model. In the classification step, we use the k-NN with the proposed similarity measure that is motivated on the observation that the variation-regions of an expression sequence are different from those of other expression sequences. In the experiment with the public database KCFD, we demonstrate that the proposed measure slightly outperforms the binary measure in which the recognition performance of the k-NN with the proposed measure and the existing binary measure show 89.1% and 86.2% respectively when k is 1.

• Journal of KIISE
• /
• v.44 no.7
• /
• pp.692-702
• /
• 2017

Face detection using the LBP based feature descriptor has issues in that it can not represent spatial information between facial shape and facial components such as eyes, nose and mouth. To address these issues, in previous research, a facial image was divided into a number of square sub-regions. However, since the sub-regions are divided into different numbers and sizes, the division criteria of the sub-region suitable for the database used in the experiment is ambiguous, the dimension of the LBP histogram increases in proportion to the number of sub-regions and as the number of sub-regions increases, the sensitivity to facial orientation rotation increases significantly. In this paper, we present a novel facial region segmentation method that can solve in-plane rotation issues associated with LBP based feature descriptors and the number of dimensions of feature descriptors. As a result, the proposed method showed detection accuracy of 99.0278% from a single facial image rotated in orientation.