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

Vector quantization codebook generation using simulated annealing

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

5 Author(s)
Flanagan, J.K. ; Dept. of Electr. & Comput. Eng., Brigham Young Univ., Provo, UT, USA ; Morrell, D.R. ; Frost, R.L. ; Read, C.J.
more authors

The authors present an algorithm for the generation of codebooks from a set of training vectors using simulated annealing. Convergence of the algorithm to the globally optimal codebook in finite time is proved, and experimental results comparing simulated annealing with Lloyd algorithms for image quantization are presented. The experimental results indicate that the proposed algorithm obtains the best known codebook for the experimental situation described by R.M. Gray and E.D. Karnin (IEEE Trans. on Inf. Theory, vol.IT-28, no.2, p.256-61, Mar. 1982). It has also been demonstrated that this technique works well for the construction of codebooks from real image data

Published in:

Acoustics, Speech, and Signal Processing, 1989. ICASSP-89., 1989 International Conference on

Date of Conference:

23-26 May 1989

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.