• Journal of Korean Society for Geospatial Information Science
• /
• v.4 no.1 s.6
• /
• pp.23-29
• /
• 1996

The purpose of this study is to develope an Object-Oriented Graphic database management system to handle geographic data of geographic information systems. As the result of this study, unstructured vector model was developed to handle geographic data and graphic database management was implemented by object-oriented programming. This study was focused on liking function between graphic data and attribute data, and not focused on network analysis function.

• Journal of Institute of Control, Robotics and Systems
• /
• v.8 no.6
• /
• pp.455-461
• /
• 2002

Object-based image retrieval method is addressed. A new image segmentation algorithm and image comparing method between segmented objects are proposed. For image segmentation, color and texture features are extracted from each pixel in the image. These features we used as inputs into VQ (Vector Quantization) clustering method, which yields homogeneous objects in terns of color and texture. In this procedure, colors are quantized into a few dominant colors for simple representation and efficient retrieval. In retrieval case, two comparing schemes are proposed. Comparing between one query object and multi objects of a database image and comparing between multi query objects and multi objects of a database image are proposed. For fast retrieval, dominant object colors are key-indexed into database.

• Journal of Information Processing Systems
• /
• v.12 no.3
• /
• pp.381-391
• /
• 2016

The Joint Bayesian (JB) method has been used in most state-of-the-art methods for face verification. However, since the publication of the original JB method in 2012, no improved verification method has been proposed. A lot of studies on face verification have been focused on extracting good features to improve the performance in the challenging Labeled Faces in the Wild (LFW) database. In this paper, we propose an improved version of the JB method, called the two-dimensional Joint Bayesian (2D-JB) method. It is very simple but effective in both the training and test phases. We separated two symmetric terms from the three terms of the JB log likelihood ratio function. Using the two terms as a two-dimensional vector, we learned a decision line to classify same and not-same cases. Our experimental results show that the proposed 2D-JB method significantly outperforms the original JB method by more than 1% in the LFW database.

• ETRI Journal
• /
• v.23 no.4
• /
• pp.168-176
• /
• 2001

This paper discusses two important issues of corpus-based synthesis: synthesis unit generation based on phrase break strength information and pruning redundant synthesis unit instances. First, the new sentence set for recording was designed to make an efficient synthesis database, reflecting the characteristics of the Korean language. To obtain prosodic context sensitive units, we graded major prosodic phrases into 5 distinctive levels according to pause length and then discriminated intra-word triphones using the levels. Using the synthesis unit with phrase break strength information, synthetic speech was generated and evaluated subjectively. Second, a new pruning method based on weighted vector quantization (WVQ) was proposed to eliminate redundant synthesis unit instances from the synthesis database. WVQ takes the relative importance of each instance into account when clustering similar instances using vector quantization (VQ) technique. The proposed method was compared with two conventional pruning methods through objective and subjective evaluations of synthetic speech quality: one to simply limit the maximum number of instances, and the other based on normal VQ-based clustering. For the same reduction rate of instance number, the proposed method showed the best performance. The synthetic speech with reduction rate 45% had almost no perceptible degradation as compared to the synthetic speech without instance reduction.

• Smart Structures and Systems
• /
• v.14 no.3
• /
• pp.397-418
• /
• 2014

In this paper, a simple two-step method for structural vibration-based health monitoring for beam-like structures have been extended to plate-like structures with though-thickness cracks. Crack locations and severities of plate-like structures are detected using a hybrid approach. The interval wavelet transform is employed to extract crack singularity locations from mode shape and support vector regression (SVR) is applied to predict crack serviettes form crack severity detection database (the relationship of natural frequencies and crack serviettes) using several natural frequencies as inputs. Of particular interest is the natural frequencies estimation for cracked plate-like structures using Rayleigh quotient. Only the natural frequencies and mode shapes of intact structures are needed to calculate the natural frequencies of cracked plate-like structures using a simple formula. The crack severity detection database can be easily obtained with this formula. The hybrid method is investigated using numerical simulation and its validity of the usage of interval wavelet transform and SVR are addressed.

• The Journal of the Acoustical Society of Korea
• /
• v.20 no.2E
• /
• pp.17-24
• /
• 2001

In this paper, we propose the bootstrap and aggregating (bagging) vector quantization (VQ) classifier to improve the performance of the text-independent speaker recognition system. This method generates multiple training data sets by resampling the original training data set, constructs the corresponding VQ classifiers, and then integrates the multiple VQ classifiers into a single classifier by voting. The bagging method has been proven to greatly improve the performance of unstable classifiers. Through two different experiments, this paper shows that the VQ classifier is unstable. In one of these experiments, the bias and variance of a VQ classifier are computed with a waveform database. The variance of the VQ classifier is compared with that of the classification and regression tree (CART) classifier[1]. The variance of the VQ classifier is shown to be as large as that of the CART classifier. The other experiment involves speaker recognition. The speaker recognition rates vary significantly by the minor changes in the training data set. The speaker recognition experiments involving a closed set, text-independent and speaker identification are performed with the TIMIT database to compare the performance of the bagging VQ classifier with that of the conventional VQ classifier. The bagging VQ classifier yields improved performance over the conventional VQ classifier. It also outperforms the conventional VQ classifier in small training data set problems.

• Journal of Industrial Technology
• /
• v.21 no.A
• /
• pp.167-179
• /
• 2001

This paper discusses an index-based subsequence matching that supports time warping in large sequence databases. Time warping enables finding sequences with similar patterns even when they are of different lengths. In earlier work, we suggested an efficient method for whole matching under time warping. This method constructs a multidimensional index on a set of feature vectors, which are invariant to time warping, from data sequences. For filtering at feature space, it also applies a lower-bound function, which consistently underestimates the time warping distance as well as satisfies the triangular inequality. In this paper, we incorporate the prefix-querying approach based on sliding windows into the earlier approach. For indexing, we extract a feature vector from every subsequence inside a sliding window and construct a multi-dimensional index using a feature vector as indexing attributes. For query precessing, we perform a series of index searches using the feature vectors of qualifying query prefixes. Our approach provides effective and scalable subsequence matching even with a large volume of a database. We also prove that our approach does not incur false dismissal. To verily the superiority of our method, we perform extensive experiments. The results reseal that our method achieves significant speedup with real-world S&P 500 stock data and with very large synthetic data.

• Journal of Korean Society for Geospatial Information Science
• /
• v.18 no.4
• /
• pp.101-107
• /
• 2010

The aim of this paper is to come up with a methodology of constructing an efficient model for multiple representations which can manage and reconcile real-time data about large-scale roads in Vector Domain. In other words, we suggested framework based on a bottom-up approach, which is allowed to integrate data from the network of the lowest level sequentially and perform automated matching in order to produce variable-scale map. Finally, we applied designed multi-LoD model to in-vehicle application.

• The Journal of the Acoustical Society of Korea
• /
• v.16 no.1
• /
• pp.100-103
• /
• 1997

In this paper, we analyze the time delayed effect of speech feature. Here, the time delayed effect means that the current feature vector of speech is under the influence of the previous feature vectors. In this paper, we use a set of LPC driven cepstal coefficients and evaluate the time delayed effect of cepstrum with the performance of the speech recognition system. For the experiments, we used the speech database consisting of 22 words which uttered by 50 male speakers. The speech database uttered by 25 male speakers was used for training, and the other set was used for testing. The experimental results show that the time delayed effect is large in the lower orders of feature vector but small in the higher orders.

• International Journal of Computer Science & Network Security
• /
• v.21 no.12
• /
• pp.65-74
• /
• 2021

Digital image processing and retrieving have increasingly become very popular on the Internet and getting more attention from various multimedia fields. That results in additional privacy requirements placed on efficient image matching techniques in various applications. Hence, several searching methods have been developed when confidential images are used in image matching between pairs of security agencies, most of these search methods either limited by its cost or precision. This study proposes a secure and efficient method that preserves image privacy and confidentially between two communicating parties. To retrieve an image, feature vector is extracted from the given query image, and then the similarities with the stored database images features vector are calculated to retrieve the matched images based on an indexing scheme and matching strategy. We used a secure content-based image retrieval features detector algorithm called Speeded-Up Robust Features (SURF) algorithm over public cloud to extract the features and the Honey Encryption algorithm. The purpose of using the encrypted images database is to provide an accurate searching through encrypted documents without needing decryption. Progress in this area helps protect the privacy of sensitive data stored on the cloud. The experimental results (conducted on a well-known image-set) show that the performance of the proposed methodology achieved a noticeable enhancement level in terms of precision, recall, F-Measure, and execution time.