Image and feature co-clustering

The visual appearance of an image is closely associated with its low-level features. Identifying the set of features that best characterizes the image is useful for tasks such as content-based image indexing and retrieval. In this paper, we present a method which simultaneously models and clusters large sets of images and their low-level visual features. A computational energy function suited for co-clustering images and their features is first constructed and a Hopfield model based stochastic algorithm is then developed for its optimization. We apply the method to cluster digital color photographs and present results to demonstrate its usefulness and effectiveness.

[1]  G. Qiu Indexing chromatic and achromatic patterns for content-based colour image retrieval , 2002, Pattern Recognit..

[2]  Jitendra Malik,et al.  Normalized Cut and Image Segmentation , 1997 .

[3]  Marcel Worring,et al.  Content-Based Image Retrieval at the End of the Early Years , 2000, IEEE Trans. Pattern Anal. Mach. Intell..

[4]  Guoping Qiu,et al.  Appearance indexing , 2003, 2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03)..

[5]  Anders Krogh,et al.  Introduction to the theory of neural computation , 1994, The advanced book program.

[6]  R. Palmer,et al.  Introduction to the theory of neural computation , 1994, The advanced book program.

[7]  Chris H. Q. Ding,et al.  A min-max cut algorithm for graph partitioning and data clustering , 2001, Proceedings 2001 IEEE International Conference on Data Mining.

[8]  Yair Weiss,et al.  Segmentation using eigenvectors: a unifying view , 1999, Proceedings of the Seventh IEEE International Conference on Computer Vision.

[9]  Inderjit S. Dhillon,et al.  Co-clustering documents and words using bipartite spectral graph partitioning , 2001, KDD '01.