Abstract
The aim in this paper is to develop a method for clustering together image views of the same object class. Local invariant feature methods, such as SIFT, have been proven effective for image clustering. However, they have made either relatively little use or too complex use of geometric constraints and are confounded when the detected features are superabundant. Here we make two contributions aimed at overcoming these problems. First, we rank the SIFT points (R-SIFT) using visual saliency. Second, we use the reduced set of R-SIFT features to construct a specific hyper graph (CSHG) model of holistic-structure. Based on the CSHG model, a two stage clustering method is proposed. In which, images are clustered according to the pairwise similarity of the graphs, which is a combination of the traditional similarity of local invariant feature vectors and the geometric similarity between two graphs. This method comprehensively utilizes both SIFT and geometric constraints, and hence combines both global and local information. Experiments reveal that the method gives excellent clustering performance.
Supported by ATR Key Lab Foundation project 91408001020603.
Chapter PDF
References
Xia, S.P., Hancock, E.R.: 3D Object Recognition Using Hyper-Graphs and Ranked Local Invariant Features. In: S+SSPR 2008 (to appear, 2008)
Bosch, A., Zisserman, A., Muoz, X.: Scene Classification Using a Hybrid Generative/Discriminative Approach. IEEE Trans. PAMI 30(4), 1–16 (2008)
Lowe, D.G.: Distinctive image features from scale-invariant key points. IJCV 60(2), 91–110 (2004)
Elazary, L., Itti, L.: Interesting objects are visually salient. Journal of Vision 8(3), 1–15 (2008)
Li, F.F., Perona, P.: A Bayesian hierarchical model for learning natural scene categories. CVPR 2, 524–531 (2005)
Bay, H., Tuytelaars, T., Gool, L.V.: SURF: Speeded Up Robust Features. In: Leonardis, A., Bischof, H., Pinz, A. (eds.) ECCV 2006, Part I. LNCS, vol. 3951, pp. 404–417. Springer, Heidelberg (2006)
Zhang, J., Marszablek, M., Lazebnik, S., Schmid, C.: Local Features and Kernels for Classification of Texture and Object Categories. IJCV 73(2), 213–238 (2007)
Yan, K., Sukthankar, R.: PCA-SIFT: A more distinctive representation for local image descriptors. CVPR 2, 506–513 (2004)
Sivic, J., Zisserman, A.: VideoGoogle: A text retrieval approach to object matching in videos. ICCV 2, 1470–1477 (2003)
Nigam, K., Lafferty, J., Mccallum, A.: Using maximum entropy for text classification. In: IJCAI Workshop on Machine Learning for Information Filtering, pp. 61–67 (1999)
Sudderth, E.B., Torralba, A., Freeman, W.T., Willsky, A.S.: Describing Visual Scenes Using Transformed Objects and Parts. Int. J. Comput. Vis. 77, 291–330 (2008)
Torsello, A., Hancock, E.R.: Graph Embedding using Tree Edit Union. Pattern Recognition 40, 1393–1405 (2007)
Bonev, B., Escolano, F., Lozano, M.A., Suau, P., Cazorla, M.A., Aguilar, W.: Constellations and the Unsupervised Learning of Graphs. In: Escolano, F., Vento, M. (eds.) GbRPR 2007. LNCS, vol. 4538, pp. 340–350. Springer, Heidelberg (2007)
Rizzi, S.: Genetic operators for hierarchical graph clustering. Pattern Recognition Letters 19, 1293–1300 (1998)
Segen, J.: Learning graph models of shape. In: Laird, J. (ed.) Proceedings of the Fifth International Conference on Machine Learning, pp. 29–35 (1988)
Torsello, A., Hancock, E.R.: Learning shape-classes using a mixture of tree-unions. IEEE Trans. PAMI 28(6), 954–967 (2006)
Torsello, A., Robles-Kelly, A., Hancock, E.R.: Discovering Shape Classes using Tree Edit Distance and Pairwise Clustering. International Journal of Computer Vision 72, 259–285 (2007)
Garey, M., Johnson, D.: Computers and intractability: A guide to the theory of NP-completeness. W.H. Freeman and Company, New York (1979)
Günter, S., Bunke, H.: Self-organizing map for clustering in the graph domain. Pattern Recognition Letters 23, 401–417 (2002)
Lozano, M.A., Escolano, F.: Em algorithm for clustering an ensemble of graphs with comb matching. In: Rangarajan, A., Figueiredo, M.A.T., Zerubia, J. (eds.) EMMCVPR 2003. LNCS, vol. 2683, pp. 52–67. Springer, Heidelberg (2003)
Luo, B., Wilson, R.C., Hancock, E.R.: Spectral embedding of graphs. Pattern Recognition 36(10), 2213–2223 (2003)
Jain, B.J., Wysotzki, F.: Central Clustering of Attributed Graphs. Machine Learning 56, 169–207 (2004)
Hofmann, T., Buhmann, J.M.: Pairwise data clustering by deterministic annealing. IEEE Transactions on Pattern Analysis and Machine Intelligence 19(1), 1–14 (1997)
Xia, S.P., Liu, J.J., Yuan, Z.T., Yu, H., Zhang, L.F., Yu, W.X.: Theory and Algorithm of Machine Learning Based on RSOM Tree Model. ACTA Electronica sinica 33(5), 937–944 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xia, S., Hancock, E.R. (2008). Clustering Using Class Specific Hyper Graphs. In: da Vitoria Lobo, N., et al. Structural, Syntactic, and Statistical Pattern Recognition. SSPR /SPR 2008. Lecture Notes in Computer Science, vol 5342. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89689-0_36
Download citation
DOI: https://doi.org/10.1007/978-3-540-89689-0_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89688-3
Online ISBN: 978-3-540-89689-0
eBook Packages: Computer ScienceComputer Science (R0)