By Topic

A comparison of EM and GMVQ in estimating Gauss mixtures: application to probabilistic image retrieval

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

2 Author(s)
Sangoh Jeong ; Dept. of Electr. Eng., Stanford Univ., CA, USA ; Gray, R.M.

Expectation-maximization (EM) is the dominant algorithm for estimating the parameters of a Gauss mixture (GM). Recently, Gauss mixture vector quantization (GMVQ) based on the Lloyd algorithm has been applied successfully as an alternative for both compression and classification. We investigate the performance of the two algorithms for GMs in image retrieval. The asymptotic likelihood approximation is used as a similarity criterion to compare GMs directly. The two algorithms result in very close retrieval performance. We demonstrate that the closeness comes from the close mutual approximation of the GM estimated parameter values and that the two algorithms have similar convergence speed. Our analysis shows that GMVQ has roughly half the computational complexity of EM.

Published in:

Acoustics, Speech, and Signal Processing, 2005. Proceedings. (ICASSP '05). IEEE International Conference on  (Volume:5 )

Date of Conference:

18-23 March 2005