• ETRI Journal
• /
• 제30권5호
• /
• pp.738-740
• /
• 2008

In this paper, block constrained trellis coded vector quantization (BC-TCVQ) is presented for quantizing the line spectrum frequency parameters of the wideband speech codec. Both a predictive structure and a safety-net concept are combined into BC-TCVQ to develop the predictive BC-TCVQ. The performance of this quantization is compared with that of the linear predictive coding vector quantizer used in the AMRWB codec, demonstrating reductions in spectral distortion.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1987년도 전기.전자공학 학술대회 논문집(II)
• /
• pp.1347-1351
• /
• 1987

This thesis aims at studying laplacian pyramid vector quantization which keeps a simple compression algorithm and stability against various kinds of image data. To this end, images are devied into two groups according to their statistical characteristics. At 0.860 bits/pixel and 0.360 bits/pixel respectively, laplacian pyramid vector quantization is compared to the existing spatial domain vector quantization and transform coding under the same condition in both objective and subjective value. The laplacian pyramid vector quantization is much more stable against the statistical characteristics of images than the existing vector quantization and transform coding.

• 전자공학회논문지B
• /
• 제33B권8호
• /
• pp.42-49
• /
• 1996

In this paper, we propose a satellite multispectral image data compression method using classified vector quantization. This method classifies each pixel vector considering band characteristics of multispectral images. For each class, we perform both intraband and interband vector quantization to romove spatial and spectral redundancy, respectively. And residual vector quantization for error images is performed to reduce error of interband vector quantization. Thus, this method improves compression efficiency because of removing both intraband(spatial) and interband (spectral) redundancy in multispectral images, effectively. Experiments on landsat TM multispectral image show that compression efficiency of proposed method is better than that of conventional method.

• The Journal of the Acoustical Society of Korea
• /
• 제17권4E호
• /
• pp.35-40
• /
• 1998

In this paper, an efficient quantization method of line spectrum pairs(LSP) with cascaded structure of vector quantizer and scalar quantizer is proposed. First, input LSP parameters is vector-quantized using a codebook a with a moderate number of entries. In the second stage of quantization, the components of residual vector are individually quantized by the scalar quantizer. The utilization of ordering property of LSP parameters and the inclusion of interframe prediction improve the quantizer performance and remove the stability check routine after quantization procedure. The new vector-scalar hybrid quantizer using 26 bits/frame shows a transparent quality of speech that an average spectral distortion is 1 dB and the frame proportion with above 2 dB spectral distortion is less than 2%. The performances of proposed quantization method is evaluated in the transmission errors.

• 한국컴퓨터정보학회:학술대회논문집
• /
• 한국컴퓨터정보학회 2018년도 제58차 하계학술대회논문집 26권2호
• /
• pp.207-208
• /
• 2018

본 논문에서는 기계학습의 하나인 Learning Vector Quantization 알고리즘을 이용하여 컨트롤러 순서를 정하는 모델을 제안하였다. 제안한 모델은 모든 컨트롤러 정보를 수집하여 Learning Vector Quantization의 LVQ1와 LVQ2 기법을 이용하여 컨트롤러의 순서를 정한다. 이를 통해, 효율적인 컨트롤러 동기화가 이뤄질 것으로 기대된다.

• The Journal of the Acoustical Society of Korea
• /
• 제17권3E호
• /
• pp.53-57
• /
• 1998

Spectral information at a speech coder should be quantized with sufficient accuracy to keep perceptually transparent output speech. Spectral information at a low bit rate speech coder is usually transformed into corresponding line spectrum pair parameters and is often quantized with a vector quantization algorithm. As the vector quantization algorithm generally has high complexity in the optimal code vector searching routine, the complexity reduction in that routine is investigated using the ordering property of the line spectrum pair. When the proposed complexity reduction algorithm is applied to the well-known split vector quantization algorithm, the 46% complexity reduction is achieved in the distortion measure compu-tation.

• 한국음향학회지
• /
• 제20권7호
• /
• pp.47-54
• /
• 2001

본 논문은 스펙트럴 크기 파라미터들에 대한 효율적인 가변 차원 양자화 기법을 제안한다. 특히, 하모닉 부호화 기에서의 스펙트럴 크기값 계수들은 가변차원이기 때문에 가변 차원의 양자화를 필요로 한다. 따라서, 본 논문에서는 스펙트럴 크기값 계수들에 대해 가변 이산 코사인 변환(DCT: Discrete Cosine Transform) 및 가변 차원에 적합한 훈련구조를 가지는 비정방형 변환 벡터 양자화 (NSTVQ: Nonsquare Transform Vector Quantization)를 홀수/짝수 구조 및 분할(Split) 구조 그리고 다단계(Multi-stage) 구조 등과 결합시킨 효율적인 양자화 기법을 제안한다. 제안된 양자화 기법의 성능평가는 스펙트럴의 크기값에 대한 주파수 왜곡(SD: Spectral Distortion) 값을 사용하였으며, 다단계 비정방형 변환 벡터 양자화(MSNSTVQ: Multi-Stage Nonsquare Transform Vector Quantization)가 가장 좋은 성능을 나타내었다.

• 한국통신학회논문지
• /
• 제39A권3호
• /
• pp.155-157
• /
• 2014

In this paper, a novel codebook generation strategy is proposed. With the given codebooks, two codeword selection procedures are proposed and analyzed for generating the quantized multiple-input multiple-output (MIMO) channel state information (CSI). Furthermore, three different quantization and normalization strategies are analyzed. The simulation results suggest that the proposed 'quantized channel generation method 2' is the best strategy to reduce the quantization and normalization errors to generate the final quantized MIMO CSI.

• 한국멀티미디어학회논문지
• /
• 제6권3호
• /
• pp.429-435
• /
• 2003

본 논문에서는 인간의 시각 특성의 하나인 공간 지각 특성을 고려하여 고유벡터를 이용한 이진 트리 벡터양자화를 하는 개선된 양자화 기법을 제안한다. 제안 방법은 고유벡터를 이용한 이진 트리 벡터 양자화의 두노드로 분할하는 과정에 영상의 블록 내 칼라 변화에 따른 시각 시스템의 특성을 가중치로 결합하여 양자화를 하였다. 그리고 원영상의 밝기성분과 양자화영상의 밝기성분의 차영상을 이용해 MTF(modulation transfer function)를 고려하여 양자화 영상의 화질을 평가한다. 제안 방법은 적은 레벨의 양자화된 영상을 구할 수 있었으며. 영상이 차지하는 자원을 효과적으로 감소시킬 수 있었다. 이는 기존의 방법보다 색상이 선명해지며 유사한 영역의 분할에 뛰어난 성능을 보여주었다.

• 한국통신학회논문지
• /
• 제22권4호
• /
• pp.662-674
• /
• 1997

In order to post process the vector-quantized images employing the theory of projections onto convex sets or the constrained minimization technique, the the projector onto QCS(quantization constraint set) as well as the filter that smoothes the lock boundaries should be investigated theoretically. The basic idea behind the projection onto QCS is to prevent the processed data from diverging from the original quantization region in order to reduce the blurring artifacts caused by a filtering operation. However, since the Voronoi regions in order to reduce the blurring artifacts caused by a filtering operation. However, since the Voronoi regions in the vector quantization are arbitrarilly shaped unless the vector quantization has a structural code book, the implementation of the projection onto QCS is very complicate. This paper mathematically analyzes the projection onto QCS from the viewpoit of minimizing the mean square error. Through the analysis, it has been revealed that the projection onto a subset of the QCS yields lower distortion than the projection onto QCS does. Searching for an optimal constraint set is not easy and the operation of the projector is complicate, since the shape of optimal constraint set is dependent on the statistical characteristics between the filtered and original images. Therefore, we proposed a hyper-cube as a constraint set that enables a simple projection. It sill be also shown that a proper filtering technique followed by the projection onto the hyper-cube can reduce the quantization distortion by theory and experiment.