Abstract
In this paper we investigate how to establish a hypergraph model for characterizing object structures and how to embed this model into a low-dimensional pattern space. Each hyperedge of the hypergraph model is derived from a seed feature point of the object and embodies those neighbouring feature points that satisfy a similarity constraint. We show how to construct the Laplacian matrix of the hypergraph. We adopt the spectral method to construct pattern vectors from the hypergraph Laplacian. We apply principal component analysis (PCA) to the pattern vectors to embed them into a low-dimensional space. Experimental results show that the proposed scheme yields good clusters of distinct objects viewed from different directions.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
IEEE TPAMI: Special Section on Graph Algorithms and Computer Vision, 23 10401151.1 (2001)
Agarwal, S., Branson, K., Belongie, S.: Higher-Order Learning with Graphs. In: ICML, pp. 17–23 (2006)
Agarwal, S., Lim, J., Zelnik-Manor, L., Perona, P., Kriegman, D., Belongie, S.: Beyond pairwise clustering. CVPR 2, 838–845 (2005)
Bretto, A., Cherifi, H., Aboutajdine, D.: Hypergraph imaging: an overview. Pattern Recognition 35(3), 651–658 (2002)
Chung, F.K.: The Laplacian of a Hypergraph. AMS DIMACS Series in Discrete Mathematics and Theoretical Computer Science 10, 21–36 (1993)
Gibson, D., Kleinberg, J., Raghavan, P.: Clustering categorical data: An approach based on dynamical systems. The VLDB Journal 8(3-4), 222–236 (2000)
Hagen, L., Kahng, A.B.: New spectral methods for ratio cut partitioning and clustering. IEEE TCAD 11(9), 1074–1085 (1992)
Harris, C.G., Stephens, M.J.: A combined corner and edge detector. In: Proceedings of Fourth Alvey Vision Conference, pp. 147–151 (1994)
Li, W., Sole, P.: Spectra of Regular Graphs and Hypergraphs and Orthogonal Polynomials. European Journal of Combinatorics 17, 461–477 (1996)
Luo, B., Wilson, R.C., Hancock, E.R.: Higher-Order Learning with Graphs. Pattern Recognition 36(10), 2213–2223 (2003)
Rodriguez, J.A.: On The Laplacian Eigenvalues and Metric Parameters of Hypergraphs. Linear and Multilinear Algebra 51, 285–297 (2003)
Storm, C.K.: The Zeta Function of a Hypergraph. EJCÂ 13 (2006)
Wilson, R.C., Hancock, E.R., Luo, B.: Pattern Vectors from Algebraic Graph Theory. IEEE TPAMI 27(7), 1112–1124 (2005)
Zhou, D., Huang, J., Scholkopf, B.: Learning with Hypergraphs: Clustering, Classification, and Embedding. NIPS 19, 17–24 (2007)
Zhu, P., Wilson, R.C.: A Study of Graph Spectra for Comparing Graphs and Trees. Pattern Recognition (to appear, 2008)
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
Ren, P., Wilson, R.C., Hancock, E.R. (2008). Spectral Embedding of Feature Hypergraphs. 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_35
Download citation
DOI: https://doi.org/10.1007/978-3-540-89689-0_35
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)