Share Email Print

Proceedings Paper

Generalized Mixture Likelihood Clustering
Author(s): Fernand S. Cohen; Zhigang Fan
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

This paper is concerned with the problem of clustering a set of independently drawn unlabbled samples into homogeneous clusters. Each sample is a data vector drawn from a class with a probability distribution with known structure, and parametrized by a parameter vector a. No priori knowledge is assumed of the parameter set, or the number of available classes. For large data records the MLE is approximately Gaussian. We exploit this asymptotic property, and regard the the MLE set as the unlabelled samples. The clustering problem becomes then that of the identification of a mixture of Gaussian clusteries. We use the generalized mixture likelihood as the clustering metric. This metric was found to perform very close to the Bayes classifier while avoiding the computational burdens associated with the mixture likelihood maximization. The paper also addresses the problem of sparse data and deviation from normality assumption. The method is illustrated for the textured image segmentation.

Paper Details

Date Published: 27 March 1987
PDF: 7 pages
Proc. SPIE 0726, Intelligent Robots and Computer Vision V, (27 March 1987); doi: 10.1117/12.937712
Show Author Affiliations
Fernand S. Cohen, University of Rhode Island (United States)
Zhigang Fan, University of Rhode Island (United States)

Published in SPIE Proceedings Vol. 0726:
Intelligent Robots and Computer Vision V
David P. Casasent, Editor(s)

© SPIE. Terms of Use
Back to Top