• 沒有找到結果。

An Improved Full-Search Scheme for the Vector Quantization Algorithm Based on Triangle Inequality

N/A
N/A
Protected

Academic year: 2022

Share "An Improved Full-Search Scheme for the Vector Quantization Algorithm Based on Triangle Inequality"

Copied!
1
0
0

加載中.... (立即查看全文)

全文

(1)

題名: An Improved Full-Search Scheme for the Vector Quantization Algorithm Based on Triangle Inequality

作者: Lu, T. C.;Chang, C. C.

關鍵詞: Vector quantization;Euclidean distance;Triangle inequality;Full search

日期: 2008-07

上傳時間: 2009-12-17T06:57:44Z

出版者: Asia University

摘要: In order to speed up the computation time of searching the closest codeword in VQ compression algorithm, Mielikainen proposed an efficient full-search scheme

based upon the law of cosines. However, some computational redundancies still exist in

Mielikainen?s scheme. Hence, Pan et al. developed a scheme based upon triangle projection

to improve Mielikainen?s scheme. In this paper, we introduce a scheme based upon

triangle inequality to speed up the encoding time of the VQ algorithm. The experimental

results show that the proposed method can significantly decrease the computation time

and maintain the same coding quality as the full-search VQ algorithm.

Furthermore, the

memory storage used in the proposed scheme is less than those in Mielikainen?

s and Pan

et al.?s schemes.

參考文獻

相關文件

In this thesis, we have proposed a new and simple feedforward sampling time offset (STO) estimation scheme for an OFDM-based IEEE 802.11a WLAN that uses an interpolator to recover

Soille, “Watershed in Digital Spaces: An Efficient Algorithm Based on Immersion Simulations,” IEEE Transactions on Pattern Analysis and Machine Intelligence,

Furthermore, based on the temperature calculation in the proposed 3D block-level thermal model and the final region, an iterative approach is proposed to reduce

This paper proposes a set of graph algorithm to improve the application of hill-climbing, Tested to speed up the program execution time is about 3.5 times speed up

Zhang, “A flexible new technique for camera calibration,” IEEE Tran- scations on Pattern Analysis and Machine Intelligence,

○ Propose a method to check the connectivity of the graph based on the Warshall algorithm and introduce an improved approach, then apply it to increase the accuracy of the

In Case 1, we first deflate the zero eigenvalues to infinity and then apply the JD method to the deflated system to locate a small group of positive eigenvalues (15-20

For the proposed algorithm, we establish a global convergence estimate in terms of the objective value, and moreover present a dual application to the standard SCLP, which leads to