• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2010.10a
• /
• pp.543-543
• /
• 2010

The objective of this research is estimating the location of interested sound source by using the similarity between a beamformer output in time domain and the candidate signal. The waveform of beamformer output at the location of sound source is similar with the waveform emitted by that source. To estimate the location of sound source by using this feature, we define quantified similarity between candidate signal and beamformer output. The candidate signal describes the signal which is generated by interested source. In this paper, similarity is defined by four methods. The two methods use time vector comparison, and the other two methods use time-frequency map or linear prediction coefficients. To figure out the results and performance of localization by using similarities, we demonstrate two conditions. The one is when two pure tone sources exist and the other condition is when several bird sounds exist. As a consequence, inner product with two time-vectors and structural similarity with spectrograms can estimate the locations of interest sound source.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.3
• /
• pp.129-137
• /
• 2004

This paper presents a signature verification method that uses Gabor filter in computing similarity between signatures. In computing similarity to compare two on-line signatures, the temporal relationship between two signatures should be computed in advance. However, conventional point matching method using DP(dynamic programming) matching consumes much computation. In this paper, we propose a fast method for computing the temporal relationship between two on-line signatures by using the phase output of Gabor Inter applied on the on-line signature signals. Two similarity measures are defined in the method: Temporal Similarity and Temporally Arranged Feature Profile Similarity. With the proposed method, Ive could compare signatures 30 times faster than conventional method using DP matching.

• Journal of Korea Multimedia Society
• /
• v.7 no.5
• /
• pp.617-632
• /
• 2004

Video Data includes moving objects which change spatial positions as time goes by. In this paper, we propose a new modeling method for a moving object contained in the video data. In order to effectively retrieve moving objects, the proposed modeling method represents the spatial position and the size of a moving object. It also represents the visual features and the trajectory by considering direction, distance and speed or moving objects as time goes by. Therefore, It allows various types of retrieval such as visual feature based similarity retrieval, distance based similarity retrieval and trajectory based similarity retrieval and their mixed type of weighted retrieval.

• ETRI Journal
• /
• v.35 no.1
• /
• pp.100-108
• /
• 2013

In this paper, a feature extraction (FE) method is proposed that is comparable to the traditional FE methods used in automatic speech recognition systems. Unlike the conventional spectral-based FE methods, the proposed method evaluates the similarities between an embedded speech signal and a set of predefined speech attractor models in the reconstructed phase space (RPS) domain. In the first step, a set of Gaussian mixture models is trained to represent the speech attractors in the RPS. Next, for a new input speech frame, a posterior-probability-based feature vector is evaluated, which represents the similarity between the embedded frame and the learned speech attractors. We conduct experiments for a speech recognition task utilizing a toolkit based on hidden Markov models, over FARSDAT, a well-known Persian speech corpus. Through the proposed FE method, we gain 3.11% absolute phoneme error rate improvement in comparison to the baseline system, which exploits the mel-frequency cepstral coefficient FE method.

• Journal of Institute of Control, Robotics and Systems
• /
• v.8 no.4
• /
• pp.327-332
• /
• 2002

The main problems of computational complexity in object tracking are definition of objects, segmentations and identifications in non-structured environments with erratic movements and collisions of objects. The object's information as a region that corresponds to objects without discriminating among objects are considered. This paper describes the algorithm that, automatically and efficiently, recognizes and keeps tracks of interest-regions selected by users in video or camera image sequences. The block-based feature matching method is used for the region tracking. This matching process considers only dominant feature points such as corners and curved-edges without requiring a pre-defined model of objects. Experimental results show that the proposed method provides above 96% precision for correct region matching and real-time process even when the objects undergo scaling and 3-dimen-sional movements In successive image sequences.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.581-584
• /
• 1999

In order to retrieve the rotated image within database by the content based image retrieval system, the algorithms with rotation robustness is usually applied in the procedure of the feature extraction. In that case, it requires much calculation time for feature extraction and much indexed data for feature indexing. Thus. in this paper. we propose the rotation robust algorithm using the block variance of the projected vector. The algorithm does not require additional calculation for feature extraction and is executed within query time by comparing the extracted data. Proposed method can be processed through database including various size of images with shape information and executed with fast response time in implementation.

• Speech Sciences
• /
• v.13 no.4
• /
• pp.177-186
• /
• 2006

In an effort to enhance the quality of feature vector classification and thereby reduce the recognition error rate of the speaker-independent speech recognition, we employ the Mahalanobis distance in the calculation of the similarity measure between feature vectors. It is assumed that the metric matrix of the Mahalanobis distance be diagonal for the sake of cost reduction in memory and time of calculation. We propose that the diagonal elements be given in terms of the variations of the feature vector components. Geometrically, this prescription tends to redistribute the set of data in the shape of a hypersphere in the feature vector space. The idea is applied to the speech recognition by hidden Markov model with fuzzy vector quantization. The result shows that the recognition is improved by an appropriate choice of the relevant adjustable parameter. The Viterbi score difference of the two winners in the recognition test shows that the general behavior is in accord with that of the recognition error rate.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.3
• /
• pp.821-831
• /
• 1999

Recognition of three-dimensional objects with convexities and concavities is a hard and challenging problem. This paper presents a feature extraction method out of three-dimensional objects for the purpose of classification. This new method not only provides invariance to scale, translation, and rotation $R^3$ but also distinguishes any three-dimensional model objects with concavities and convexities by measuring a relative similarity in the information space where a set of characteristics features of objects is mapped.

• Journal of Information Processing Systems
• /
• v.13 no.4
• /
• pp.852-862
• /
• 2017

In this work a Discrete Cosine Transform (DCT)-based feature dimensionality reduced approach for fingerprint matching is proposed. The DCT is applied on a small region around the core point of fingerprint image. The performance of our proposed method is evaluated on a small database of Bologna University and two large databases of FVC2000. A dimensionally reduced feature vector is formed using only approximately 19%, 7%, and 6% DCT coefficients for the three databases from Bologna University and FVC2000, respectively. We compared the results of our proposed method with the discrete wavelet transform (DWT) method, the rotated wavelet filters (RWFs) method, and a combination of DWT+RWF and DWT+(HL+LH) subbands of RWF. The proposed method reduces the false acceptance rate from approximately 18% to 4% on DB1 (Database of Bologna University), approximately 29% to 16% on DB2 (FVC2000), and approximately 26% to 17% on DB3 (FVC2000) over the DWT based feature extraction method.

• Journal of Korea Multimedia Society
• /
• v.7 no.12
• /
• pp.1671-1679
• /
• 2004

This study has proposed visual-feature extraction methods for each band in wavelet domain with both spatial frequency features and multi resolution features. In addition, it has brought forward similarity measurement method using fuzzy theory and new color feature expression method taking advantage of the frequency of the same color after color quantization for reducing quantization error, a disadvantage of the existing color histogram intersection method. Experiments are performed on a database containing 1,000 color images. The proposed method gives better performance than the conventional method in both objective and subjective performance evaluation.