• The Journal of the Acoustical Society of Korea
• /
• v.14 no.1
• /
• pp.5-12
• /
• 1995

In the case where the set of training vectors constitute clusters, the codevectors of the codebook which is used to compression for speech and images in the vector quantization are regarded as the central vectors of the clusters constituted by given training vectors. In this work, we consider the distribution of Euclidean distance obtaining in the process of searching for the minimum distance between vectors, and propose the method searching for the proper number of and the central vectors of clusters. And then, the proposed method shows more than the about 4[dB] SNR than the LBG algorithm and the competitive learning algorithm

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.49 no.5
• /
• pp.7-14
• /
• 2012

The quantized beamforming systems always need the channel state information, which must be quantized into a finite set of vectors (named codebook), and feedback only sends the index representing the desired vector. Thereby it minimized the impact of feedback errors, caused by feedback overhead and delay. In this regard, index assignment (IA) methods, an exhaustive-search and group-based schemes, have been presented for minimizes the performance degradation without additional feedback bits. In this paper, we proposed enhanced group-based IA method, which used the optimal codebook design with chordal distance, having the adaptive properties in application of the existing IA methods. When the number of transmit antennas is 4 and LTE codebook is used, Monte-Carlo simulations verify that the proposed scheme has a power advantage of 0.5~1dB to obtain the same bit error rate than methods without IA, and it has 0.1~0.2 dB better performance compared with the existing IA methods over same environment.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09b
• /
• pp.162-165
• /
• 2003

본 논문에서는 웨이블렛 계수와 Hidden Markov Model(HMM)이용한 얼굴인식 알고리즘을 제안한다. 입력 영상은 이산웨이블렛을 기반으로 한 다해상도 분석기법을 사용하여 데이터 수를 압축한 후, 각각의 해상도에서 얻어진 웨이블렛 계수를 특징벡터로 사용하여 HMM의 모델을 생성한다. 인식단계 에서는 웨이블렛 변환에 의해 생성된 개별대역의 인식값을 더하여 상호 보완함으로써 인식률을 높일 수 있었다. 제안된 알고리즘의 타당성을 검증하기 위하여 기본적 알고리즘인 벡터 양자화(VQ) 기법을 적용한 경우와 기존 얼굴인식에 제안된 DCT-HMM을 이용한 기법과의 인식률 비교를 한 결과, 제안된 방법이 우수한 성능을 보임을 알 수 있었다.

• Journal of Biomedical Engineering Research
• /
• v.10 no.2
• /
• pp.173-178
• /
• 1989

A vector quantization technique using a variable block size was applied to image compression of digitized X -ray films. Whether the size of VQ block should be subdivided or not is determined experimentally by the threshold value. The simulation result shows that the performance of the proposed vector quantizer is suitable for the medical image coding, which is applicable to PACS( Picture Archiving and Communication System).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.2
• /
• pp.344-352
• /
• 1997

This paper proposes an efficient lossless coding scheme for tree structured vector quantization (TSVQ) system which efficiently exploits inter-block correlation. The TSVQ index of the current block is adaptively arithmeticencoded depending on the indices of the previous blocks. This paper also presents a reductio method, which effectively resolve the memory problem which usually arises in many conditional entropy coding schemes. Simulation results show that the proposed scheme provides remarkable bitrate reduction by effectively exploiting not only linear but also non-linear inter-block correlation.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.369-372
• /
• 2003

In this paper, we propose impr oved binary tree vector quantization based on spatial sensitivity which is one of the human visual properties. We combine the weights based on spatial masking effect according to changes of three primary colors in blocks of images with the process of splitting nodes using eigenvector in binary tree vector quantization. The test results show that the proposed method generates the quantized images with fine color and performs better than the conventional method in terms of clustering the similar regions. Also the proposed method can get the better result in subjective qualify test and PSNR.

• Speech Sciences
• /
• v.8 no.3
• /
• pp.143-148
• /
• 2001

We propose a new scheme for VQ codebook search. The procedure is in between the binary-tree-search and full-search and thus might be called N-ary search of a codebook. Through the experiment performed on 7200 frames spoken by 25 speakers, we confirmed that the best codewords as good as by the full-search were obtained at moderate time consumption comparable to the binary-tree-search. In application to speech recognition by HMM/VQ with Bakis model, where appearance of a specific codeword is essential in the parameter training phase, the method proposed here is expected to provide an efficient training procedure.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.9B
• /
• pp.1721-1730
• /
• 1999

In this thesis, an error resilient video coding algorithm, under the error-prone environment such as wireless communication, is suggested. The suggested algorithm adapts the Classified VQ method for intra imagers that reduces some load by searching similar vectors. The Duplicate Vector Position Code is proposed for the higher compression efficiency and the robust decoding in error environment. As a result, the bitstream encoded by the proposed method is in a CBR(Constant Bit Rate) preventing from error propagation. The experiment that adds practical error to the encoded bitsrteam shows the error-robustness superior to H.263.

• Journal of Broadcast Engineering
• /
• v.19 no.3
• /
• pp.329-341
• /
• 2014

Kernel-based mean-shift object tracking has gained more interests nowadays, with the aid of its feasibility of reliable real-time implementation of object tracking. This algorithm calculates the best mean-shift vector based on the color histogram similarity between target model and target candidate models, where the color histograms are usually produced after uniform color-space quantization for the implementation of real-time tracker. However, when the image of target model has a reduced contrast, such uniform quantization produces the histogram model having large values only for a few histogram bins, resulting in a reduced accuracy of similarity comparison. To solve this problem, a non-uniform quantization algorithm has been proposed, but it is hard to apply to real-time tracking applications due to its high complexity. Therefore, this paper proposes a fast non-uniform color-space quantization method using the histogram equalization, providing an adjusted histogram distribution such that the bins of target model histogram have as many meaningful values as possible. Using the proposed method, the number of bins involved in similarity comparison has been increased, resulting in an enhanced accuracy of the proposed mean-shift tracker. Simulations with various test videos demonstrate the proposed algorithm provides similar or better tracking results to the previous non-uniform quantization scheme with significantly reduced computation complexity.

• Proceedings of the Korea Multimedia Society Conference
• /
• 1998.10a
• /
• pp.266-271
• /
• 1998

본 논문에서는 칼라지도영상으로부터 GIS의 벡터링 과정에 사용할 벡터링 영역(도로, 해안선, 등고선 등)을 추출하는 방법에 대해 연구하였다. 입력영상으로는 트루칼라영상을 사용할 경우 추출 영역의 칼라가 비교적 균일하게 분포되지만 데이터량이 방대하여 처리에 어려움이 있어 현실적이지 못하므로 이를 양자화하여 256칼라 영상으로 변환한 후 사용할 수 있도록 하였다. 추출 단계에서는 Lab칼라공간에서 mahalanobis 거리 및 방향성 마스크를 사용하여 다양한 칼라 분포를 흡수할 수 있도록 하여 배경 영역을 배제하면서 연결성이 있는 추출결과를 얻을수 있도록 하였다. 그리고 추출된 결과를 원영상과 중첩해 보면서 기호, 문자 등의 요소로 인해 끊어진 영역이나 추출시 발생되는 피할 수 없는 잡영을 편집하여 제거할 수 있는 기능을 제공하였다. 추출된 결과는 벡터링 작업에 직접 사용 가능한 형태로 추출되도록 하였는데 실제 벡터링 작업에 다양한 추출영역을 사용해 봄으로써 이를 검증하였다.