• Journal of Korea Society of Industrial Information Systems
• /
• v.5 no.2
• /
• pp.16-21
• /
• 2000

Vector quantization(VQ) is widely used in many high-quality and high-rate data compression applications such as speech coding, audio coding, image coding and video coding. When the size of a VQ codebook is large, the computational complexity for the full codeword search method is a significant problem for many applications. A number of complexity reduction algorithms have been proposed and investigated using such properties of the codebook as the triangle inequality. This paper proposes a new fast VQ search algorithm that is based on a multi-stage structure for searching for the best codeword. Even using only two stages, a significant complexity reduction can be obtained without any loss of quality.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.6 no.1
• /
• pp.34-42
• /
• 2011

In an effort to the practical realization of phonetic typewriter, we concentrate on the classification of consonants in this paper. Since many of consonants do not show periodic behavior in time domain and thus the validity for Fourier analysis of them are not convincing, vector quantization (VQ) via LBG clustering is first performed to check if the feature vectors of MFCC and LPCC are ever meaningful for consonants. Experimental results of VQ showed that it's not easy to draw a clear-cut conclusion as to the validity of Fourier analysis for consonants. For classification purpose, two kinds of neural networks are employed in our study: self organizing map (SOM) and learning vector quantization (LVQ). Results from SOM revealed that some pairs of phonemes are not resolved. Though LVQ is free from this difficulty inherently, the classification accuracy was found to be low. This suggests that, as long as consonant classification by LVQ is concerned, other types of feature vectors than MFCC should be deployed in parallel. However, the combination of MFCC/LVQ was not found to be inferior to the classification of phonemes by language-moded based approach. In all of our work, LPCC worked worse than MFCC.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.6 no.3
• /
• pp.87-94
• /
• 2007

In this paper, the performance of the speech recognition and speaker adaptation methods are studied. The speech recognition using energy state and VQ(Vector Quantization) is suggested and the speaker adaptation methods(Maximum a posteriori probability estimation, linear specrum estimation) are considered. The experimental results show that recognition ration using energy state is 2-3 % better than that of general VQ.

• Journal of Internet Computing and Services
• /
• v.5 no.3
• /
• pp.57-62
• /
• 2004

In this paper, an efficient speaker identification based on robust vector quantizationprincipal component analysis (VQ-PCA) is proposed to solve the problems from outliers and high dimensionality of training feature vectors in speaker identification, Firstly, the proposed method partitions the data space into several disjoint regions by roust VQ based on M-estimation. Secondly, the robust PCA is obtained from the covariance matrix in each region. Finally, our method obtains the Gaussian Mixture model (GMM) for speaker from the transformed feature vectors with reduced dimension by the robust PCA in each region, Compared to the conventional GMM with diagonal covariance matrix, under the same performance, the proposed method gives faster results with less storage and, moreover, shows robust performance to outliers.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.12B
• /
• pp.2382-2390
• /
• 1999

In this paper, we employed a new quantization scheme called sample-adaptive product quantizer (SAPQ) to quantize image data based on the differential pulse code modulation (DPCM) coder, which has fixed length outputs and high bit rates. In order to improve the performance of traditional DPCM coders, the scalar quantizer should be replaced by the vector quantizer (VQ). As the bit rate increases, it will be nearly impossible to implement a conventional VQ or modified VQ, such as the tree-structured VQ, even if the modified VQ can significantly reduce the encoding complexity. SAPQ has a form of the feed-forward adaptive scalar quantizer having a short adaptation period. However, since SAPQ is a structurally constrained VQ, SAPQ can achieve VQ-level performance with a low encoding complexity. Since SAPQ has a scalar quantizer structure, by using the traditional scalar value predictors, we can easily apply SAPQ to DPCM coders. For synthetic data and real images, by employing SAPQ as the quantizer part of DPCM coders, we obtained a 2~3 dB improvement over the DPCM coders, which are based on the Lloyd-Max scalar quantizers, for data rates above 4 b/point.

• Speech Sciences
• /
• v.12 no.2
• /
• pp.171-182
• /
• 2005

An efficient GMM (Gaussian mixture modeling) method based on LPCA (local principal component analysis) with VQ (vector quantization) for speaker identification is proposed. To reduce the dimension and correlation of the feature vector, this paper proposes a speaker identification method based on principal component analysis. The proposed method firstly partitions the data space into several disjoint regions by VQ, and then performs PCA in each region. Finally, the GMM for the speaker is obtained from the transformed feature vectors in each region. Compared to the conventional GMM method with diagonal covariance matrix, the proposed method requires less storage and complexity while maintaining the same performance requires less storage and shows faster results.

• Proceedings of the KOSOMBE Conference
• /
• v.1992 no.11
• /
• pp.29-33
• /
• 1992

We examine the compression performance of two irreversible (lossy) compression techniques, ADCT-VQ (Adaptive Discrete Cosine Trandform - Vector Quantization) and JPEG (Joint Photographic Experts group) which are basis of medical image information systems. Under the same compression ratio, MSE(Mean Square Error) is 0.578 lower in JPEG than in ADCT-VQ while SNR(Signal to Noise Ratio) is 1.236 dB higher in JPEG than in ADCT-VQ.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.10b
• /
• pp.903-906
• /
• 2000

웨이브렛 영역에서 벡터 양자화(vector quantization)를 수행하여 생성된 VQ 인덱스들을 엔트로피 부호화(entropy coding)하면 영상의 코딩 효율을 높일 수 있다. 본 논문에서는 벡터 양자화 이전에 VQ 인덱스들의 중복성을 높이기 위해 다중해상도 코드북의 코드 워드들을 에너지 크기 순으로 재정렬하는 기법을 제안한다. 코드 워드들의 평균과 편차를 이용한 재정렬 방법과 제안된 기법을 벡터 양자화 후 생성되는 VQ 인덱스에 DPCM/Huffman 기법을 적용하여 각각에 대한 코딩 효율을 비교한다.

• Proceedings of the KIEE Conference
• /
• 2005.10a
• /
• pp.176-179
• /
• 2005

In this paper, we propose the new method that separate the existing common VQ code book into two parts, one is the common VQ code book which is the half of existing common VQ code book, another is the personal speaker VQ code book which accommodate the personal speaker characteristic, variation to improve the performance of the text-dependent speaker verification system using discrete HMM. We apply the propose method m this paper to the text-dependent speaker verification system using discrete HMM and have the improvement performance of about 0.24% compared to existing method

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1998.06c
• /
• pp.197-200
• /
• 1998

본 논문에서는 유전자 알고리즘(genetic Algorithm)을 사용하여 벡터 양자화(vector quantization : VQ)를 수행하는 방법을 제안하고자 한다. 벡터 양자화를 수행하여 코드북(codebook)을 생성할 때 생성된 코드북과 학습벡터(training vector)사이에는 반드시 양자화 오차(quantization error)가 발생하는데 기존의 K-means 알고리듬을 사용하여 코드북을 생성했을 경우 양자화 오차를 줄이는데 한계가 있었다. 본 논문에서 제안하는 유전자 알고리즘을 이용한 벡터 양자화는 이 양자화 오차를 감소시키기 위해서 연구되었다. 제안한 방법의 성능을 평가하기 위해 음성데이터를 기존의 K-means 알고리즘에서 클러스터의 중심을 선택하는 방법중의 하나인 Minimax방법으로 코드북을 생성하여 제안한 방법과 양자화 오차를 비교한 결과 양자화 오차가 감소됨을 알 수 있었다.