A Fast Algorithm for Image Vector Quantization
碩士 === 國立中山大學 === 應用數學研究所 === 84 === Vector quantization (VQ) is an effective method of data compression. Its decoding process is very simple and a high compression ratio can be obtained. So, VQ has been extensively used in image and speech...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
1996
|
Online Access: | http://ndltd.ncl.edu.tw/handle/95315322105605127177 |
id |
ndltd-TW-084NSYSU507028 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-084NSYSU5070282015-10-13T14:34:59Z http://ndltd.ncl.edu.tw/handle/95315322105605127177 A Fast Algorithm for Image Vector Quantization 影像向量量化之快速演算法 Huang, Mon Ching 黃盟欽 碩士 國立中山大學 應用數學研究所 84 Vector quantization (VQ) is an effective method of data compression. Its decoding process is very simple and a high compression ratio can be obtained. So, VQ has been extensively used in image and speech compression. However, VQ has some difficulties such as the efficiency of codebook design process and the degradation of edges. In the codebook design and encoding phases, searching for the closest codeword is a highly computational process, especially for high dimensional vectors. So, the Linde-Buzo-Gray (LBG) algorithm, the earliest and the most famous algorithm of vector quantization, is a time consuming algorithm. In this thesis, our efforts are to design an algorithm to generate a better codebook and to reduce the computation time compared with the previous algorithms in vector quantization. Yang, Chang Biau 楊昌彪 1996 學位論文 ; thesis 56 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立中山大學 === 應用數學研究所 === 84 === Vector quantization (VQ) is an effective method of data
compression. Its decoding process is very simple and a high
compression ratio can be obtained. So, VQ has been extensively
used in image and speech compression. However, VQ has some
difficulties such as the efficiency of codebook design process
and the degradation of edges. In the codebook design and
encoding phases, searching for the closest codeword is a highly
computational process, especially for high dimensional vectors.
So, the Linde-Buzo-Gray (LBG) algorithm, the earliest and the
most famous algorithm of vector quantization, is a time
consuming algorithm. In this thesis, our efforts are to design
an algorithm to generate a better codebook and to reduce the
computation time compared with the previous algorithms in
vector quantization.
|
author2 |
Yang, Chang Biau |
author_facet |
Yang, Chang Biau Huang, Mon Ching 黃盟欽 |
author |
Huang, Mon Ching 黃盟欽 |
spellingShingle |
Huang, Mon Ching 黃盟欽 A Fast Algorithm for Image Vector Quantization |
author_sort |
Huang, Mon Ching |
title |
A Fast Algorithm for Image Vector Quantization |
title_short |
A Fast Algorithm for Image Vector Quantization |
title_full |
A Fast Algorithm for Image Vector Quantization |
title_fullStr |
A Fast Algorithm for Image Vector Quantization |
title_full_unstemmed |
A Fast Algorithm for Image Vector Quantization |
title_sort |
fast algorithm for image vector quantization |
publishDate |
1996 |
url |
http://ndltd.ncl.edu.tw/handle/95315322105605127177 |
work_keys_str_mv |
AT huangmonching afastalgorithmforimagevectorquantization AT huángméngqīn afastalgorithmforimagevectorquantization AT huangmonching yǐngxiàngxiàngliàngliànghuàzhīkuàisùyǎnsuànfǎ AT huángméngqīn yǐngxiàngxiàngliàngliànghuàzhīkuàisùyǎnsuànfǎ AT huangmonching fastalgorithmforimagevectorquantization AT huángméngqīn fastalgorithmforimagevectorquantization |
_version_ |
1717754268710076416 |