| Summary: | 博士 === 國立臺北科技大學 === 電機工程系所 === 98 === This dissertation presents an efficient quasi-binary search algorithm for vector quantization (VQ). The proposed algorithm adopts a tree-structured VQ with overlapped codewords (TSOC) to reduce computational complexity and enhance quantization quality. This algorithm uses overlapped codewords to expand the scope of the search path to traverse more appropriate codewords. In our speech experiment, compared with the full search VQ (FSVQ), the average computational savings for triangle inequality elimination (TIE), tree-structured VQ (TSVQ) and TSOC are 24.68%, 88.67% and 58.08%, respectively. In this experiment, the average quantization accuracy of TIE, TSVQ and TSOC are 100%, 46.49% and 99.15%, respectively. To further evaluate computations at each stage of the proposed algorithm, both speech and images are considered. With codebook sizes of 256, 512 and 1024, the corresponding optimal computational savings for images are 84.59%, 91.08% and 93.51% respectively, compared with the FSVQ. For speech, the optimal computational savings reached 59.43% for a codebook size of 128. The results indicate that the proposed algorithm can save a significant number of computations, depending on the size of codebook. The TSOC algorithm is a trade-off between TSVQ and TIE, which provides a satisfactory computation quality. Moreover, unlike the TIE method, our algorithm does not depend on the high correlation characteristics of signals to reduce the amount of computation, but the TIE method can be incorporated into our algorithm to dramatically reduce the amount of computation.
|
|---|
