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

An improvement of fast search algorithm for vector quantization

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)
Ming-Chieh Chung ; Dept. of Electron. Eng., Southern Taiwan Univ. of Technol., Taiwan ; Shung-Chih Chen ; Chao-Tang Yu ; Pei-Yin Chen

One of the major issues of vector quantization encoding is to reduce the computational complexity from searching the best-matched codevector, so as to shorten the search time. In this paper, we extended the partial-sum algorithm to exclude much more codevectors from doing the complex Euclidean distance computation. An optimal trade-off has been found between the computational complexity and the search space. According to the experimental results, our algorithms can significantly reduce the number of redundant codevectors, which do not need to do the distance computation, while obtaining the same encoding quality as that of full search algorithm.

Published in:

Intelligent Signal Processing and Communication Systems, 2005. ISPACS 2005. Proceedings of 2005 International Symposium on

Date of Conference:

13-16 Dec. 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.