Diffusion maps-based image clustering

2Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In the clustering of large number of images using low-level features, one of the problems encountered is the high dimensional feature space. The high dimensionality of feature spaces leads to unnecessary cost in feature selection and also in the distance measurement during the clustering process. In this paper, we propose an approach to reduce the dimensionality of the feature space based on diffusion maps. In the proposed approach, each image is represented by a set of tiles. A visual keyword-image matrix is derived from classifying these tiles into a set of clusters and counting the occurrence of each cluster in each image of our database. The visual keyword-image matrix is similar to the term-document matrix in information retrieval. We use diffusion maps to reduce the dimensionality of visual keyword matrix. By reducing the dimensionality of the image representation, we can save computation cost significantly. We compare the performance between the proposed approach and the approach that uses the global MPEG-7 color descriptors. The results demonstrate the improvements. Copyright 2007 ACM.

Cite

CITATION STYLE

APA

Agrawal, R., Wu, C. H., Grosky, W. I., & Fotouhi, F. (2007). Diffusion maps-based image clustering. In Proceedings of the International Workshop on Research Issues in Digital Libraries, IWRIDL-2006, in Association with ACM SIGIR. https://doi.org/10.1145/1364742.1364754

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free