By Topic

A Modified Fast Vector Quantization Algorithm Based on Nearest Partition Set Search

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Tantawy, M.M. ; Nat. Telecommun. Inst., Cairo ; El-Yazeed, M.F.A. ; Abdel, N.S. ; El-Henawy, M.M.

In this paper we propose a modification to a fast vector quantization algorithm based on nearest partition set search. The fast algorithm searches the codebook to find the nearest set of codevectors for each codevector in the codebook. The nearest set of codevectors is called nearest set partition (NPS) which calculated each iteration. During each iteration the fast algorithm searches the NPS instead of searching the codebook which save training time. The NPS algorithm does well but with large codebook the saved timed consumed in calculating the NPS. So we proposed a modified algorithm to overcome this problem. The experimental results indicate that variation of NPS is slow with iteration. According to our results the calculation of NPS in each iteration is not necessary which save more training time without affecting the codebook quality.

Published in:

Signal Processing and Information Technology, 2007 IEEE International Symposium on

Date of Conference:

15-18 Dec. 2007