• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.6
• /
• pp.716-721
• /
• 2003

This paper deals with the iris recognition as one of biometric techniques which are applied to identify a person using his/her behavior or congenital characteristics. The iris of a human eye has a texture that is unique and time invariant for each individual. First, we obtain the feature vector from the 2D iris pattern having a property of size invariant and divide it into 24 sectors which are further through three types of 2D Gabor filters. At the recognition process, we compute the similarity measure based on the correlation values. Here, since we use three different matching values obtained from three different directional Gabor filters and select the maximum value among them, it is possible to minimize the recognition error rate. To show the usefulness of the proposed algorithm, we applied it to a biometric database consisting of 50 iris patterns extracted from 10 subjects and finally get more higher than 90% recognition rate.

• The Journal of Society for e-Business Studies
• /
• v.22 no.2
• /
• pp.61-77
• /
• 2017

Recently, the number of academic conference information on the Internet has rapidly increased, the automatic classification of academic conference information according to research subjects enables researchers to find the related academic conference efficiently. Information provided by most conference listing services is limited to title, date, location, and website URL. However, among these features, the only feature containing topical words is title, which causes information insufficiency problem. Therefore, we propose methods that aim to resolve information insufficiency problem by utilizing web contents. Specifically, the proposed methods the extract main contents from a HTML document collected by using a website URL. Based on the similarity between the title of a conference and its main contents, the topical keywords are selected to enforce the important keywords among the main contents. The experiment results conducted by using a real-world dataset showed that the use of additional information extracted from the conference websites is successful in improving the conference classification performances. We plan to further improve the accuracy of conference classification by considering the structure of websites.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.5C
• /
• pp.496-512
• /
• 2007

In this paper, we propose a novel JPEG-2000 compressed image retrieval system using feature vector extracted through partial entropy decoding. Main idea of the proposed method is to utilize the context information that is generated during entropy encoding/decoding. In the framework of JPEG-2000, the context of a current coefficient is determined depending on the pattern of the significance and/or the sign of its neighbors in three bit-plane coding passes and four coding modes. The contexts provide a model for estimating the probability of each symbol to be coded. And they can efficiently describe texture images which have different pattern because they represent the local property of images. In addition, our system can directly search the images in the JPEG-2000 compressed domain without full decompression. Therefore, our proposed scheme can accelerate the work of retrieving images. We create various distortion and similarity image databases using MIT VisTex texture images for simulation. we evaluate the proposed algorithm comparing with the previous ones. Through simulations, we demonstrate that our method achieves good performance in terms of the retrieval accuracy as well as the computational complexity.

• Journal of Service Research and Studies
• /
• v.5 no.2
• /
• pp.103-110
• /
• 2015

Recently, Classification of characters in a 3D FPS game has emerged as a very significant issue. In this study, We propose the game character Classification method using Image Region Segmentation of the extracting meaningful object in a simple operation. In this method, first used a non-linear RGB color model and octree color quantization scheme. The input image represented a less than 20 quantized color and uses a small number of meaningful color histogram. And then, the image divided into small blocks, calculate the degree of similarity between the color histogram intersection and adjacent block in block units. Because, except for the block boundary according to the texture and to extract only the boundaries of the object block. Set a region by these boundary blocks as a game object and can be used for FPS game play. Through experiment, we obtain accuracy of more than 80% for Classification method using each feature. Thus, using this property, characters could be classified effectively and it draws the game more speed and strategic actions as a result.

• Journal of Korea Society of Industrial Information Systems
• /
• v.4 no.2
• /
• pp.57-61
• /
• 1999

In the field of image compression, Classified Vector Quantization(CVQ) reveals attractive characteristics for preserving perceptual features, such as edges. However, the classification scheme is not generalized to effectively reconstruct different kinds of edge patterns in the original CVQ that predefines several linear-type edge classes: vortical edge horizontal edge diagonal edge classes. In this paper, we propose a new classification scheme, especially for edge blocks based on the similarity measure for edge patterns. An edge block is transformed to a feature vector that describes the detailed shape of the edge pattern The classes for edges are formulated automatically from the training images to result in the generalization of various shapes of edge patterns. The experimental results show the generated linear/nonlinear types of edge classes. The integrity of all the edges is faithfully preserved in the reconstructed image based on the various type of edge codebooks generated at 0.6875bpp.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.7
• /
• pp.956-962
• /
• 2018

As the study of the object feature detection from image, we explain methods to identify the species of the tree in forest using the picture taken from dron. Generally there are three kinds of methods, which are GLCM (Gray Level Co-occurrence Matrix) and Gabor filters, in order to extract the object features. We proposed the object extraction method using the statistical properties of trees in this research because of the similarity of the leaves. After we extract the sample images from the original images, we detect the objects using cross correlation techniques between the original image and sample images. Through this experiment, we realized the mean value and standard deviation of the sample images is very important factor to identify the object. The analysis of the color component of the RGB model and HSV model is also used to identify the object.

• Journal of Biosystems Engineering
• /
• v.27 no.2
• /
• pp.151-160
• /
• 2002

Cow image processing technique would be useful not only for recognizing an individual but also for establishing the image database and analyzing the shape of cows. A cow (Holstein) has usually the unique speckle pattern. In this study, the individual recognition of cow was carried out using the speckle pattern and the content-based image retrieval technique. Sixty cow images of 16 heads were captured under outdoor illumination, which were complicated images due to shadow, obstacles and walking posture of cow. Sixteen images were selected as the reference image for each cow and 44 query images were used for evaluating the efficiency of individual recognition by matching to each reference image. Run-lengths and positions of runs across speckle area were calculated from 40 horizontal line profiles for ROI (region of interest) in a cow body image after 3 passes of 5$\times$5 median filtering. A similarity measure for recognizing cow individuals was calculated using Euclidean distance of normalized G-frame histogram (GH). normalized speckle run-length (BRL), normalized x and y positions (BRX, BRY) of speckle runs. This study evaluated the efficiency of individual recognition of cow using Recall(Success rate) and AVRR(Average rank of relevant images). Success rate of individual recognition was 100% when GH, BRL, BRX and BRY were used as image query indices. It was concluded that the histogram as global property and the information of speckle runs as local properties were good image features for individual recognition and the developed system of individual recognition was reliable.

• Journal of Broadcast Engineering
• /
• v.24 no.6
• /
• pp.1024-1034
• /
• 2019

Preference for music is determined by a variety of factors, and identifying characteristics that reflect specific factors is important for music recommendations. In this paper, we propose a method to extract the singing voice related music features reflecting various musical characteristics by using a model learned for singer identification. The model can be trained using a music source containing a background accompaniment, but it may provide degraded singer identification performance. In order to mitigate this problem, this study performs a preliminary work to separate the background accompaniment, and creates a data set composed of separated vocals by using the proven model structure that appeared in SiSEC, Signal Separation and Evaluation Campaign. Finally, we use the separated vocals to discover the singing voice related music features that reflect the singer's voice. We compare the effects of source separation against existing methods that use music source without source separation.

• MALSORI
• /
• no.4
• /
• pp.20-30
• /
• 1982

The aim of this paper is to analyse difficulties of the pronunciation in swedish vowels encountered by Koreans learners and to seek solutions in order to correct the possible errors. In the course of the analysis the swedish and Korean vowels in question are compared with the purpose of describing differences aha similarities between these two systems. This contrastive description is largely based on the students' articulatory speech level ana the writer's auditory , judgement . The following points are discussed : 1 ) Vowel length as a distinctive feature in Swedish compared with that of Korean. 2) A special attention is paid on the Swedish vowel [w:] that is characterized by its peculiar type of lip rounding. 3) The six pairs of Swedish vowels that are phonologically contrastive but difficult for Koreans to distinguish one from the other: [y:] ~ [w:], [i:] ~ [y:], [e:] ~ [${\phi}$:], [w;] ~ [u:] [w:] ~ [$\theta$], [$\theta$] ~ [u] 4) The r-colored vowel in the case of the postvocalic /r/ that is very common in American English is not allowed in English sound sequences. The r-colored vowel in the American English pattern has to be broken up and replaced hi-segmental vowel-consonant sequences . Korean accustomed to the American pronunciation are warned in this respect. For a more distinct articulation of the postvocalic /r/ trill [r] is preferred to fricative [z]. 5) The front vowels [e, $\varepsilon, {\;}{\phi}$) become opener variants (${\ae}, {\;}:{\ae}$] before / r / or supradentals. The results of the analysis show that difficulties of the pronunciation of the target language (Swedish) are mostly due to the interference from the Learner's source language (Korean). However, the Learner sometimes tends to get interference also from the other foreign language with which he or she is already familiar when he or she finds in that language more similarity to the target language than in his or her own mother tongue. Hence this foreign language (American English) in this case functions as a second language for Koreans in Learning Swedish.

• Journal of Korea Multimedia Society
• /
• v.6 no.2
• /
• pp.247-258
• /
• 2003

Principal component analysis (PCA) based algorithms form the basis of numerous algorithms and studies in the face recognition literature. PCA is a statistical technique and its incorporation into a face recognition system requires numerous design decisions. We explicitly take the design decisions by in-troducing a generic modular PCA-algorithm since some of these decision ate not documented in the literature We experiment with different implementations of each module, and evaluate the different im-plementations using the September 1996 FERET evaluation protocol (the do facto standard method for evaluating face recognition algorithms). We experiment with (1) changing the illumination normalization procedure; (2) studying effects on algorithm performance of compressing images using JPEG and wavelet compression algorithms; (3) varying the number of eigenvectors in the representation; and (4) changing the similarity measure in classification process. We perform two experiments. In the first experiment, we report performance results on the standard September 1996 FERET large gallery image sets. The result shows that empirical analysis of preprocessing, feature extraction, and matching performance is extremely important in order to produce optimized performance. In the second experiment, we examine variations in algorithm performance based on 100 randomly generated image sets (galleries) of the same size. The result shows that a reasonable threshold for measuring significant difference in performance for the classifiers is 0.10.