An image community detection method for hierarchical visualisation

Better ways of representing the results of image search can be found rather than regular lists of thumbnails. For this purpose, we propose a hierarchical visualisation scheme with two stages. We utilise the notion of image community and aim to detect communities within a large set of images by means of a novel deterministic community detection method. After image communities are detected, the representative key images of these communities are presented to the user in an intuitive and expressive layout. The layout is determined according to the detected community structure. As a result, the user is presented a distinctive set of images at the first stage. If similar images are desired, the members of the communities can be explored at the second stage. We experimentally show that the proposed community detection algorithm significantly outperforms generic community detection methods. Furthermore, we believe that the proposed hierarchical visualisation can be preferred by many of the users.

[1]  Réka Albert,et al.  Near linear time algorithm to detect community structures in large-scale networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[2]  J. Reichardt,et al.  Statistical mechanics of community detection. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  M. Newman,et al.  Finding community structure in very large networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[4]  Yiannis Kompatsiaris,et al.  Image clustering through community detection on hybrid image similarity graphs , 2010, 2010 IEEE International Conference on Image Processing.

[5]  Andrew Zisserman,et al.  Video Google: a text retrieval approach to object matching in videos , 2003, Proceedings Ninth IEEE International Conference on Computer Vision.

[6]  Shumeet Baluja,et al.  VisualRank: Applying PageRank to Large-Scale Image Search , 2008, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[7]  Chris A. Glasbey,et al.  An Analysis of Histogram-Based Thresholding Algorithms , 1993, CVGIP Graph. Model. Image Process..

[8]  T. Vicsek,et al.  Uncovering the overlapping community structure of complex networks in nature and society , 2005, Nature.

[9]  J. MacQueen.  Some methods for classification and analysis of multivariate observations , 1967 .

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

[11]  M. Newman,et al.  Finding community structure in networks using the eigenvectors of matrices. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[12]  Frédéric Jurie,et al.  Finding Groups of Duplicate Images In Very Large Dataset , 2012, BMVC.

[13]  Matthieu Latapy,et al.  Computing Communities in Large Networks Using Random Walks , 2004, J. Graph Algorithms Appl..

[14]  Koen E. A. van de Sande,et al.  Evaluating Color Descriptors for Object and Scene Recognition , 2010, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[15]  U. Brandes.  A faster algorithm for betweenness centrality , 2001 .

[16]  Trevor Hastie,et al.  The Elements of Statistical Learning , 2001 .

[17]  D. Spielman,et al.  Spectral partitioning works: planar graphs and finite element meshes , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[18]  Cordelia Schmid,et al.  Hamming Embedding and Weak Geometric Consistency for Large Scale Image Search , 2008, ECCV.

[19]  Santo Fortunato,et al.  Community detection in graphs , 2009, ArXiv.

[20]  Leon Danon,et al.  Comparing community structure identification , 2005, cond-mat/0505245.