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...

Full description

Bibliographic Details
Main Authors: Tzu-Meng Haung, 黃姿夢
Other Authors: Yeou-Jiunn Chen
Format: Others
Language:zh-TW
Published: 102
Online Access:http://ndltd.ncl.edu.tw/handle/05082657207157742694
Description
Summary:碩士 === 南台科技大學 === 生物醫學工程研究所 === 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