A Hybrid VQ Algorithm Combining Tree Structure and VD
碩士 === 南台科技大學 === 生物醫學工程研究所 === 101 === Abstract Vector quantization (VQ) technique has been used in various application. Because of the time-consuming of traditional codeword search, lots of methods which save computation time of the best codeword search had been proposed. This paper proposes a new...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
102
|
Online Access: | http://ndltd.ncl.edu.tw/handle/05082657207157742694 |
id |
ndltd-TW-101STUT8114007 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-101STUT81140072015-10-13T23:10:32Z http://ndltd.ncl.edu.tw/handle/05082657207157742694 A Hybrid VQ Algorithm Combining Tree Structure and VD 混合樹狀結構與范諾圖之混合式向量量化編碼 Tzu-Meng Haung 黃姿夢 碩士 南台科技大學 生物醫學工程研究所 101 Abstract Vector quantization (VQ) technique has been used in various application. Because of the time-consuming of traditional codeword search, lots of methods which save computation time of the best codeword search had been proposed. This paper proposes a new search method to enhance the performance of the VQ search method. The method use principal component analysis (PCA) to reduce dimension, Voronoi diagram to determine the adjacency-list, and tree structure to raise up the initial codeword search speed. In order to keep more data characteristics, we used high dimensional of PCA. After finding the initial codeword by tree structure VQ, we used the VD to decide neighbors of initial codeword to obtain the closer result. With the experimental results, the proposed method has better results than the other method. Keywords-codebook search; principal component analysis; Voronio diagram; tree structure Yeou-Jiunn Chen 陳有圳 102 學位論文 ; thesis 0 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 南台科技大學 === 生物醫學工程研究所 === 101 === Abstract
Vector quantization (VQ) technique has been used in various application. Because of the time-consuming of traditional codeword search, lots of methods which save computation time of the best codeword search had been proposed. This paper proposes a new search method to enhance the performance of the VQ search method. The method use principal component analysis (PCA) to reduce dimension, Voronoi diagram to determine the adjacency-list, and tree structure to raise up the initial codeword search speed. In order to keep more data characteristics, we used high dimensional of PCA. After finding the initial codeword by tree structure VQ, we used the VD to decide neighbors of initial codeword to obtain the closer result. With the experimental results, the proposed method has better results than the other method.
Keywords-codebook search; principal component analysis; Voronio diagram; tree structure
|
author2 |
Yeou-Jiunn Chen |
author_facet |
Yeou-Jiunn Chen Tzu-Meng Haung 黃姿夢 |
author |
Tzu-Meng Haung 黃姿夢 |
spellingShingle |
Tzu-Meng Haung 黃姿夢 A Hybrid VQ Algorithm Combining Tree Structure and VD |
author_sort |
Tzu-Meng Haung |
title |
A Hybrid VQ Algorithm Combining Tree Structure and VD |
title_short |
A Hybrid VQ Algorithm Combining Tree Structure and VD |
title_full |
A Hybrid VQ Algorithm Combining Tree Structure and VD |
title_fullStr |
A Hybrid VQ Algorithm Combining Tree Structure and VD |
title_full_unstemmed |
A Hybrid VQ Algorithm Combining Tree Structure and VD |
title_sort |
hybrid vq algorithm combining tree structure and vd |
publishDate |
102 |
url |
http://ndltd.ncl.edu.tw/handle/05082657207157742694 |
work_keys_str_mv |
AT tzumenghaung ahybridvqalgorithmcombiningtreestructureandvd AT huángzīmèng ahybridvqalgorithmcombiningtreestructureandvd AT tzumenghaung hùnhéshùzhuàngjiégòuyǔfànnuòtúzhīhùnhéshìxiàngliàngliànghuàbiānmǎ AT huángzīmèng hùnhéshùzhuàngjiégòuyǔfànnuòtúzhīhùnhéshìxiàngliàngliànghuàbiānmǎ AT tzumenghaung hybridvqalgorithmcombiningtreestructureandvd AT huángzīmèng hybridvqalgorithmcombiningtreestructureandvd |
_version_ |
1718084628459290624 |