• Journal of the Korea Society of Computer and Information
• /
• v.12 no.6
• /
• pp.147-152
• /
• 2007

Face detection is a crucial part of the face recognition system. It determines the performance of the whole recognition system. Hausdorff distance metric has been used in face detection and recognition with good results. It defines the distance metric based only on the geometric similarity between two sets or points. However, not only the geometry but also the local patterns around the points are available in most cases. In this paper a new Hausdorff distance measure is proposed that makes hybrid use of the similarity of the geometry and the local patterns around the points. Several experiments shows that the new method outperforms the conventional method.

• Journal of Digital Convergence
• /
• v.11 no.10
• /
• pp.453-458
• /
• 2013

HMM Speech recognition systems have a few weaknesses, including failure to recognize speech due to the mixing of environment noise other voices. In this paper, we propose a speech feature extraction methode using CHMM for extracting selected target voice from mixture of voices and noises. we make use of channel similarity and correlate relation for the selective speech extraction composes. This proposed method was validated by showing that the average distortion of separation of the technique decreased by 0.430 dB. It was shown that the performance of the selective feature extraction is better than another system.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.6
• /
• pp.759-764
• /
• 2005

In this paper we describe a face recognition using EBGM(Elastic Bunch Graph Matching) method. Usally, the PCA and LDA based face recognition method with the low-dimensional subspace representation use holistic image of faces, but this study uses local features such as a set of convolution coefficients for Gabor kernels of different orientations and frequencies at fiducial points including the eyes, nose and mouth. At pre-recognition step, all images are represented with same size face graphs and they are used to recognize a face comparing with each similarity for all images. The proposed algorithm has less computation time due to simplified face graph than conventional EBGM method and the fuzzy matching method for calculating the similarity of face graphs renders more face recognition results.

• Journal of Intelligence and Information Systems
• /
• v.29 no.3
• /
• pp.267-286
• /
• 2023

The conversational agents such as AI speakers utilize voice conversation for human-computer interaction. Voice recognition errors often occur in conversational situations. Recognition errors in user utterance records can be categorized into two types. The first type is misrecognition errors, where the agent fails to recognize the user's speech entirely. The second type is misinterpretation errors, where the user's speech is recognized and services are provided, but the interpretation differs from the user's intention. Among these, misinterpretation errors require separate error detection as they are recorded as successful service interactions. In this study, various text separation methods were applied to detect misinterpretation. For each of these text separation methods, the similarity of consecutive speech pairs using word embedding and document embedding techniques, which convert words and documents into vectors. This approach goes beyond simple word-based similarity calculation to explore a new method for detecting misinterpretation errors. The research method involved utilizing real user utterance records to train and develop a detection model by applying patterns of misinterpretation error causes. The results revealed that the most significant analysis result was obtained through initial consonant extraction for detecting misinterpretation errors caused by the use of unregistered neologisms. Through comparison with other separation methods, different error types could be observed. This study has two main implications. First, for misinterpretation errors that are difficult to detect due to lack of recognition, the study proposed diverse text separation methods and found a novel method that improved performance remarkably. Second, if this is applied to conversational agents or voice recognition services requiring neologism detection, patterns of errors occurring from the voice recognition stage can be specified. The study proposed and verified that even if not categorized as errors, services can be provided according to user-desired results.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.6
• /
• pp.10-19
• /
• 2003

As the technical demand for biometrics is increasing, users expect that fingerprint recognition systems are operable with various fingerprint readers. However, current commercial off-the-shelf fingerprint recognition systems are no interoperable due to the lack of standardization in application program interfaces for fingerprint readers. A cross-matching fingerprint recognition system is a person authentication system based on fingerprints and utilizing different types of fingerprint readers. It should be able to overcome variations in fingerprint images acquired by different readers, such as the size, resolution, contrast of images. The purpose of this research is to develop across-matching fingerprint recognition system for fingerprint research of different sensing mechanism. The fingerprint readers tested in this study are optical, semiconductor and thermal sensor modules, and the prpoposed cross-matching system utilizes both a minutiae-based similarity and a ridge count-based similarity in matching fingerprint images acquired by different sensors.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.12
• /
• pp.5464-5484
• /
• 2016

Few samples face recognition has become a highly challenging task due to the limitation of available labeled samples. As two popular paradigms in face image representation, sparse component analysis is highly robust while parts-based paradigm is particularly flexible. In this paper, we propose a probabilistic generative model to incorporate the strengths of the two paradigms for face representation. This model finds a common spatial partition for given images and simultaneously learns a sparse component analysis model for each part of the partition. The two procedures are built into a probabilistic generative model. Then we derive the score function (i.e. feature mapping) from the generative score space. A similarity measure is defined over the derived score function for few samples face recognition. This model is driven by data and specifically good at representing face images. The derived generative score function and similarity measure encode information hidden in the data distribution. To validate the effectiveness of the proposed method, we perform few samples face recognition on two face datasets. The results show its advantages.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.20 no.4
• /
• pp.548-553
• /
• 2010

This paper presents an effective shape image recognition method using the correlation based on 4-dimensional histogram. The histogram-based correlation is accurately applied to express the similarity by comparing the positions of a corresponding dimension between the images, which is calculated by considering 4 directions of the shape image. The correlation measure by using the normalized cross-correlation is also applied to obtain the robust recognition to the geometrical variations such as shape, position, size, and rotation. The proposed method has been applied to the problem for recognizing the 8 shape images of 64*64 pixels and the 30 shape images of 256*256 pixels. The experimental results show that the proposed method has a superior recognition performance that appears the image characters well.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.1123-1127
• /
• 2005

The Conventional methods of color separation in computer-based machine vision offer only weak performance because of environmental factors such as light source, camera sensitivity, and others. In this paper, we propose an improved color separation method using RGB, HLS, color coordination space, and fuzzy similarity measure. RGB consists of red, green and blue, the three primary colors of light. HLS includes hue, light and saturation, the human recognition elements of co]or. A fuzzy similarity measure was employed for evaluate the similarity among fuzzy colors with the six features of RGB and HLS.

• Journal of applied mathematics & informatics
• /
• v.40 no.5_6
• /
• pp.897-914
• /
• 2022

Pythagorean fuzzy sets (PFSs) are capable of modelling information with more uncertainties in decision-making problems. The essential feature of PFSs is that they are described by three parameters: membership function, non-membership function and hesitant margin, with the total of the squares of each parameter equal to one. The purpose of this article is to suggest some new similarity measures and weighted similarity measures for PFSs. Numerical computations have been carried out to validate our proposed measures. Applications of these measures have been applied to some real-life decision-making problems of pattern detection and medicinal investigations. Moreover, a descriptive illustration is employed to compare the results of the proposed measures with the existing analogous similarity measures to show their effectiveness.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.8
• /
• pp.1099-1109
• /
• 1995

By using a concept of interrelation quadruplet between line segments, a new method for recognition of object families is introduced. The interrelation quadruplet, which is invariant under similarity transform of a pair of line segments, is used as a feature information for polygonal shape recognition. Several useful propertes of the interrelation quadruplet are derived in relation to efficient recognition of object families. Compared with the previous methods, the proposed method requires only small space of storage and is shown to be computationally simple and efficient.