Imagerank : spectral techniques for structural analysis of image database

Drawing on the correspondence between spectral clustering, spectral dimensionality reduction, and the connections to the Markov chain theory, we present a novel unified framework for structural analysis of image database using spectral techniques. The framework provides a computationally efficient approach to both clustering and dimensionality reduction, or 2-D visualization. Within this framework, we can also infer the semantic degrees of the images, i.e. imagerank, which characterize the richness of semantics contained in the images. Some illustrative examples are discussed.

[1]  Fan Chung,et al.  Spectral Graph Theory , 1996 .

[2]  Mikhail Belkin,et al.  Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering , 2001, NIPS.

[3]  Shih-Fu Chang,et al.  Image Retrieval: Current Techniques, Promising Directions, and Open Issues , 1999, J. Vis. Commun. Image Represent..

[4]  F. Chung Spectral Graph Theory, Regional Conference Series in Math. , 1997 .

[5]  Carlo Tomasi,et al.  Perceptual metrics for image database navigation , 1999 .

[6]  Jitendra Malik,et al.  Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[7]  B. S. Manjunath,et al.  NeTra: A toolbox for navigating large image databases , 1997, Proceedings of International Conference on Image Processing.