• 沒有找到結果。

Fast Planar-Oriented Ripple Search Algorithm for Hyperspace VQ Codebook

N/A
N/A
Info
下載
Protected

Academic year: 2022

Share "Fast Planar-Oriented Ripple Search Algorithm for Hyperspace VQ Codebook"

Copied!
1
0
0

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

立即下載 ( 1 頁 )

全文

(1)

題名: Fast Planar-Oriented Ripple Search Algorithm for Hyperspace VQ Codebook 作者: Chang, C. C.;Wu, W. C.

關鍵詞: Planar Voronoi diagram;principal component analysis;vector quantization (VQ) codebook search

日期: 2007-06

上傳時間: 2009-12-17T06:58:04Z 出版者: Asia University

摘要: This paper presents a fast codebook search method for improving the quantization complexity of full-search vector quantization (VQ). The proposed method is built on the planar Voronoi diagram to label a ripple search domain. Then, the appropriate codeword can easily be found just by searching the local region instead of global exploration. In order to take a step further and obtain the close result full-search VQ would, we equip the proposed method with a duplication mechanism that helps to bring down the possible quantizing distortion to its lowest level. According to the experimental results, the proposed method is indeed capable of providing better outcome at a faster quantization speed than the existing partial-search methods.

Moreover, the proposed method only requires a little extra storage for duplication.

參考文獻

立即下載 ( DOC - 1 頁 - 32.50 KB )

相關文件

Linear convergence analysis of the use of gradient projection methods on total vari- ation problems

He proposed a fixed point algorithm and a gradient projection method with constant step size based on the dual formulation of total variation.. These two algorithms soon became

and the exponential multiplier method for convex symmetric cone programming

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

1Introduction Anentropy-likeproximalalgorithmandtheexponentialmultipliermethodforsymmetricconeprogramming

For the proposed algorithm, we establish its convergence properties, and also present a dual application to the SCLP, leading to an exponential multiplier method which is shown

Projected Barzilai-Borwein Methods for Non-negative Matrix Factorization

Zdunek and Cichocki (2008, Algorithm 4) used a projected Barzilai-Borwein method to solve m independent problems (15) without line search.. (2009, Section 5) reported that on

Tree Search Chapter4

- Greedy Best-First Search (or Greedy Search) Minimizing estimated cost from the node to reach a goal Expanding the node that appears to be closest to goal - A* Search.. Minimizing

Problems with the Bump-and-Revalue Method

Biases in Pricing Continuously Monitored Options with Monte Carlo (continued).. • If all of the sampled prices are below the barrier, this sample path pays max(S(t n ) −

Dynamic Programming

• For a given set of probabilities, our goal is to construct a binary search tree whose expected search is smallest.. We call such a

行政院國家科學委員會專題研究計畫 成果報告

of each cluster will be used to derive the search range of this cluster. Finally, in order to obtain better results, we take twice the length of