• The Journal of the Acoustical Society of Korea
• /
• v.20 no.4E
• /
• pp.31-38
• /
• 2001

A large-scale synthesis database for a unit selection based synthesis method usually retains redundant synthesis unit instances, which are useless to the synthetic speech quality. In this paper, to eliminate those instances from the synthesis database, we proposed a new pruning method called weighted vector quantization (WVQ). The WVQ reflects relative importance of each synthesis unit instance when clustering the similar instances using vector quantization (VQ) technique. The proposed method was compared with two conventional pruning methods through the objective and subjective evaluations of the synthetic speech quality: one to simply limit maximum number of instance, and the other based on normal VQ-based clustering. The proposed method showed the best performance under 50% reduction rates. Over 50% of reduction rates, the synthetic speech quality is not seriously but perceptibly degraded. Using the proposed method, the synthesis database can be efficiently reduced without serious degradation of the synthetic speech quality.

• Advances in aircraft and spacecraft science
• /
• v.10 no.6
• /
• pp.545-554
• /
• 2023

The widespread introduction of unmanned aircrafts has led to the understanding of the need to organize a common information space for manned and unmanned aircrafts, which is reflected in the Russian Unmanned aircraft system Traffic Management (RUTM) project. The present article deals with the issues of spatial information database (DB) organization, which is the core of RUTM and provides storage of various data types (spatial, aeronautical, topographical, meteorological, vector, etc.) required for flight safety management. Based on the analysis of functional capabilities and types of work which it needs to ensure, the architecture of spatial information DB, including the base of source information, base of display settings, base of vector objects, base of tile packages and also a number of special software packages was proposed. The issues of organization of these DB, types and formats of data and ways of their display are considered in detail. Based on the analysis it was concluded that the optimal construction of the spatial DB for RUTM system requires a combination of different model variants and ways of organizing data structures.

• Proceedings of the Acoustical Society of Korea Conference
• /
• autumn
• /
• pp.57-60
• /
• 2001

This paper reports on speaker-Recognition of context independence-speaker recognition in the field of the speech recognition. It is important to select the parameter reflecting the characteristic of each single person because speaker-recognition is to identify who speaks in the database. We used Mel Frequency Cesptrum Coefficient and Vector Quantization to identify in this paper. Specially, it considered to find characteristic-vector of the speaker in different from known method; this paper used the characteristic-vector which is selected in MFCC Parameter Space. Also, this paper compared the recognition rate according to size of codebook from this database and the time needed for operation with the existing one. The results is more improved $3\sim4\%$ for recognition rate than established Vector Quantization Algorithm.

• Proceedings of the Korean Society for Emotion and Sensibility Conference
• /
• 2000.04a
• /
• pp.120-125
• /
• 2000

We propose a semi-automatic and dynamic indexing algorithm for multi-media database(e.g. movie files, audio files), which are difficult to create indexes expressing their emotional or abstract contents, according to user's sensitivity by using user's histories of access to database. In this algorithm, we simply categorize data at first, create a vector space of each user's interest(user model) from the history of which categories the data belong to, and create vector space of each data(title model) from the history of which users the data had been accessed from. By continuing the above method, we could create suitable indexes, which show emotional content of each data. In this paper, we define the recurrence formulas based on the proposed algorithm. We also show the effectiveness of the algorithm by simulation result.

• The Journal of the Acoustical Society of Korea
• /
• v.30 no.2
• /
• pp.100-106
• /
• 2011

Music recordings have been digitalized such that huge size of music database is available to the public. Thus, the automatic classification system of music genres is required to effectively manage the growing music database. Mel-Frequency Cepstral Coefficient (MFCC) is a popular feature vector for genre classification. In this paper, the combined super-vector with Decorrelated Filter Bank (DFB) and Octave-based Spectral Contrast (OSC) using texture windows is processed by Support Vector Machine (SVM) for genre classification. Even with the lower order of the feature vector, the proposed super-vector produces 4.2 % improved classification accuracy compared with the conventional Marsyas system.

• The KIPS Transactions:PartD
• /
• v.9D no.5
• /
• pp.819-826
• /
• 2002

The mobile vector map services for mobile devices, specially for PDA, are being popularized with the advent of KVM (Kilobytes Virtual Machine). However, the services for cellular phone have some problems for implementation, which are the restrictions of bandwidth, resource of the phone, etc. Thus, these restrictions force to develop new map database exclusively for cellular phone services. But, this approach needs high costs and could not support multi user view for a same area. Therefore, we suggest new client/server system for mobile vector map services, using existing general map database, and design and implement the system. The suggested system, which has minimized functions at client and processes map simplification works at sever, makes it possible to serve mobile vector map without developing new map database only for cellular phone.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.2C
• /
• pp.181-185
• /
• 2009

When we classify underwater transient signals with frame-by-frame decision, a database design method for reference feature vectors influences on the system performance such as size of database, computational burden and recognition rate. In this paper the LBG vector quantization algorithm is applied to reduction of the number of feature vectors for each reference signal for efficient classification of underwater transient signals. Experimental results have shown that drastic reduction of the database size can be achieved while maintaining the classification performance by using the LBG vector quantization.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.11 no.3
• /
• pp.204-210
• /
• 2011

This paper proposes a fuzzy support vector machine ($FSVM_n$) pattern classifier to classify the arrhythmia patterns of an electrocardiograph (ECG). The $FSVM_n$ is a pattern classifier which combines n-dimensional fuzzy membership functions with a slack variable of SVM. To evaluate the performance of the proposed classifier, the MIT/BIH ECG database, which is a standard database for evaluating arrhythmia detection, was used. The pattern classification experiment showed that, when classifying ECG into four patterns - NSR, VT, VF, and NSR, VT, and VF classification rate resulted in 99.42%, 99.00%, and 99.79%, respectively. As a result, the $FSVM_n$ shows better pattern classification performance than the existing SVM and FSVM algorithms.

• Journal of the Semiconductor & Display Technology
• /
• v.10 no.3
• /
• pp.75-81
• /
• 2011

This paper presents a novel method for image classification based on a hybrid genetic algorithm (GA) and support vector machine (SVM) approach which can significantly improve the classification performance for content-based image retrieval (CBIR). Though SVM has been widely applied to CBIR, it has some problems such as the kernel parameters setting and feature subset selection of SVM which impact the classification accuracy in the learning process. This study aims at simultaneously optimizing the parameters of SVM and feature subset without degrading the classification accuracy of SVM using GA for CBIR. Using the hybrid GA and SVM model, we can classify more images in the database effectively. Experiments were carried out on a large-size database of images and experiment results show that the classification accuracy of conventional SVM may be improved significantly by using the proposed model. We also found that the proposed model outperformed all the other models such as neural network and typical SVM models.

• The Korean Journal of Malacology
• /
• v.26 no.2
• /
• pp.185-188
• /
• 2010

The Web-based the genus Haliotis SNP database was constructed on the basis of Intel Server Platform ZSS130 dual Xeon 3.2 GHz cpu and Linux-based (Cent OS) operating system. Haliotis related sequences (2,830 nucleotide sequences, 9,102 EST sequences) were downloaded through NCBI taxonomy browser. In order to eliminate vector sequences, we conducted vector masking step using cross match software with vector sequence database. In addition, poly-A tails were removed using Trimmest software from EMBOSS package. The processed sequences were clustered and assembled by TGICL package (TIGR tools) equipped with CAP3 software. A web-based interface (Haliotis SNP Database, http://www.haliotis.or.kr) was developed to enable optimal use of the clustered assemblies. The Clustering Res. menu shows the contig sequences from the clustering, the alignment results and sequences from each cluster. And also we can compare any sequences with Haliotis related sequences in BLAST menu. The search menu is equipped with its own search engine so that it is possible to search all of the information in the database using the name of a gene, accession number and/or species name. Taken together, the Web-based SNP database for Haliotis will be valuable to develop SNPs of Haliotis in the future.