Cart (Loading....) | Create Account
Close category search window

Fast search algorithm for vector quantisation without extra look-up table using declustered subcodebooks

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 $31
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

2 Author(s)
Chang, C.-C. ; Dept. of Comput. Sci. & Inf. Eng., Chung Cheng Univ., Chaiyi, Taiwan ; Lin, I.-C.

A fast search routine is presented to be used in the encoding phase of vector quantisation (VQ). The routine applies the technique of declustering to split a codebook into several subcodebooks. Then, the appropriate codeword can be found by using the constructed subcodebooks. According to the experimental results, the method can indeed provide good image quality and an efficient coding process. Furthermore, the extra memory space used in the search routine is not needed in the method. Thus, this method provides a practical solution for implementing the search routine in VQ.

Published in:

Vision, Image and Signal Processing, IEE Proceedings -  (Volume:152 ,  Issue: 5 )

Date of Publication:

7 Oct. 2005

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.