4.6 Article

Image segmentation using spectral clustering of Gaussian mixture models

Journal

NEUROCOMPUTING
Volume 144, Issue -, Pages 346-356

Publisher

ELSEVIER SCIENCE BV
DOI: 10.1016/j.neucom.2014.04.037

Keywords

Image segmentation; GMMs; EM algorithm; KL divergence; Floyd's algorithm; Spectral clustering

Funding

  1. National Natural Science Foundation of China [61303116, 61105014, 61179032]

Ask authors/readers for more resources

A novel image segmentation method that combines spectral clustering and Gaussian mixture models is presented in this paper. The new method contains three phases. First, the image is partitioned into small regions modeled by a Gaussian Mixture Model (GMM), and the GMM is solved by an Expectation-Maximization (EM) algorithm with a newly proposed Image Reconstruction Criterion, named EM-IRC. Second, the distances among the GMM components are measured using Kullbacic-Leibler (KL) divergence, and a revised Floyd's algorithm developed from Zadeh's operations is used to build the similarity matrix based on those distances. Finally, spectral clustering is applied to this improved similarity matrix to merge the GMM components, i.e., the corresponding small image regions, to obtain the final segmentation result. Our contributions include the new EM-IRC algorithm, the revised Floyd's algorithm, and the novel overall framework. The experimental evaluation on the IRIS dataset and the real-world image segmentation problem demonstrates the effectiveness of our proposed approach. (C) 2014 Elsevier B.V. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available