Point Pattern Matching Via Spectral Geometry
In this paper, we describe the use of Riemannian geometry, and in particular the relationship between the Laplace-Beltrami operator and the graph Laplacian, for the purposes of embedding a graph onto a Riemannian manifold. Using the properties of Jacobi fields, we show how to compute an edge-weight matrix in which the elements reflect the sectional curvatures associated with the geodesic paths between nodes on the manifold. We use the resulting edge-weight matrix to embed the nodes of the graph onto a Riemannian manifold of constant sectional curvature. With the set of embedding coordinates at hand, the graph matching problem is cast as that of aligning pairs of manifolds subject to a geometric transformation. We illustrate the utility of the method on image matching using the COIL database.
KeywordsRiemannian Manifold Sectional Curvature Curvature Tensor Riemannian Geometry Graph Match
- 1.Belkin, M., Niyogi, P.: Laplacian eigenmaps and spectral techniques for embedding and clustering. Neural Information Processing Systems 14, 634–640 (2002)Google Scholar
- 2.Caelli, T.M., Kosinov, S.: An eigenspace projection clustering method for inexact graph matching. PAMI 26(4), 515–519 (2004)Google Scholar
- 5.Chung, F.R.K.: Spectral Graph Theory. American Mathematical Society (1997)Google Scholar
- 6.Gold, S., Rangarajan, A.: A graduated assignment algorithm for graph matching. PAMI 18(4), 377–388 (1996)Google Scholar
- 7.Harris, C.J., Stephens, M.: A combined corner and edge detector. In: Proc. 4th Alvey Vision Conference, pp. 147–151 (1988)Google Scholar