• Journal of Digital Contents Society
• /
• v.13 no.3
• /
• pp.309-315
• /
• 2012

Active data are the input data which are changed its membership as Vector Quantization codebook generation algorithm is processed. In the process of VQ codebook generation algorithm performed, the actual active data out of the entire input data will be less presented as the process is performed. Therefore, if we can accurately find the active data and only if we are going to do VQ codebook generation on the active data, then we can significantly reduce the overall generation time. In this paper, we presented the triangle inequality based algorithm to select the active data. Experimental results show that our algorithm is superior to other methods in terms of the VQ codebook generation time.

• Journal of Digital Contents Society
• /
• v.16 no.3
• /
• pp.373-379
• /
• 2015

In this paper, we propose an online VQ Codebook generation method for updating an existing VQ Codebook in real-time and adding to an existing cluster with newly created text data which are news paper, web pages, blogs, tweets and IoT data like sensor, machine. Without degrading the performance of the batch VQ Codebook to the existing data, it was able to take advantage of the newly added data by using a triangle inequality which modifying the VQ Codebook progressively show a high degree of accuracy and speed. The result of applying to test data showed that the performance is similar to the batch method.

• Proceedings of the KSPS conference
• /
• 2006.05a
• /
• pp.37-40
• /
• 2006

In this paper, we propose a VQ codebook design of speech recognition feature parameters in order to improve the performance of a distributed speech recognition system. For the context-dependent HMMs, a VQ codebook should be correlated with phonetic distributions in the training data for HMMs. Thus, we focus on a selection method of training data based on phonetic distribution instead of using all the training data for an efficient VQ codebook design. From the speech recognition experiments using the Aurora 4 database, the distributed speech recognition system employing a VQ codebook designed by the proposed method reduced the word error rate (WER) by 10% when compared with that using a VQ codebook trained with the whole training data.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2023.05a
• /
• pp.225-226
• /
• 2023

선박의 애플리케이션 간에 표준화 되지 않은 데이터를 교환하고 처리를 용이하기 위하여 데이터 구조를 통일화하는 통합 규칙이 필요하다. 이에 ISO 19848 표준안은 선박 내 데이터 교환 및 향후 선상 장비가 인터넷에 직접 연결될 수 있는 사항까지 고려하여 데이터 채널 ID를 Codebook에 따라 지정하도록 제안하고 있다. 우리나라는 '자율운항선박 기술개발'을 통하여 자율운항 시험선을 대상으로 데이터 분류 규칙과 표준화된 Codebook 개발을 진행하고 있으며 이를 한국산업표준 제정하기 위하여 표준화 작업을 진행하고 있다.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1994.06c
• /
• pp.199-204
• /
• 1994

In this paper, we researched abut CELP speech coding algorithm using efficlent pseudo-stochastic block codes, adaptive-codebook and improved fixed-gain codebook. The pseudo-stochastic block codes refer to stochastically populated block codes in which the adjacent codewords in an innovation codebook are non-independent. The adaptive-codebook was made with previous prediction speech data by storage-shift register. This CELP coding algorithm enables the coding of toll quality speech at bit rates from 4.8kbits/s to 9.6 kbits/s. This algorithm was realized TMS320C30 microprocessor in realtime.

• The Journal of the Acoustical Society of Korea
• /
• v.16 no.3E
• /
• pp.3-6
• /
• 1997

This paper reports on the optimal design of the excitation codebook in the 13 kbps variable rate QCELP coder of Korean speech. We present two optimal excitation codebooks which consist of 128 and 556 samples, respectively. For the design and test of the improved codebook, a data base of Korean speech is used. A quasi-Newton optimization algorithm was developed to design the codebook. The optimized codebook which remains sparse, can produce an average gain of 0.84 and 0.45 dB in SNR and SEGSNR respectively. Informal listening tests confirm the improvement in speech quality.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1995.06a
• /
• pp.141-145
• /
• 1995

Code excited linear prediction speech coders exhibit good performance at data rates as low as 4800 bps. The major drawback to CELP type coders is their large computational requirements. In this paper, we propose a new codebook search method that preserves the quality of the CELP vocoder with reduced complexity. The basic idea is to restrict the searching range of the random codebook by using a searching technique of the regular pulse excitation. Applying the proposed method to the CELP vocoder, we can get approximately 48% complexity reduction in the codebook search.

• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.979-982
• /
• 2002

Compressing image data by using Vector Quantization (VQ)［1］-［3］will compare Training Vectors with Codebook. The result is an index of position with minimum distortion. The implementing Random Codebook will reduce the image quality. This research presents the Splitting solution ［4］,［5］to implement the Codebook, which improves the image quality［6］by the average Training Vectors, then splits the average result to Codebook that has minimum distortion. The result from this presentation will give the better quality of the image than using Random Codebook.

• The Journal of the Acoustical Society of Korea
• /
• v.15 no.2
• /
• pp.5-11
• /
• 1996

The purpose of this paper is to propose a method improving the performance of a semi-continuous hidden Markov model(SCHMM) speaker adaptation system which uses Bayesian Parameter reestimation approach. The performance of Bayesian speaker adaptation could be degraded in case that the features of a new speaker are severely different from those of a reference codebook. The excessive codewords of the reference codebook still remain after adaptation proess. which cause confusion in recognition process. To solve such problems, the proposed method uses formant information which is extracted from the cepstral coefficients of the reference codebook and adaptation data. The reference codebook is adapted to represent the formant distribution of a new speaker and it is used for Bayesian speaker adaptation as an initial codebook. The proposed method provides accurate correspondence between reference codebook and adaptation data. It was observed that the excessive codewords were not selected during recognition process. The experimental results showed that the proposed method improved the recognition performance.

• Journal of Digital Contents Society
• /
• v.15 no.3
• /
• pp.365-371
• /
• 2014

In the era of big data, algorithms for the existing IT environment cannot accept on a distributed architecture such as hadoop. Thus, new distributed algorithms which apply a distributed framework such as MapReduce are needed. Lloyd's algorithm commonly used for vector quantization is developed using MapReduce recently. In this paper, we proposed a decombined distributed VQ codebook generation algorithm based on a distributed VQ codebook generation algorithm using MapReduce to get a result more fast. The result of applying the proposed algorithm to big data showed higher performance than the conventional method.