Abstract
In this paper we describe a method to correct the sign of eigenvectors of the proximity matrix for the problem of correspondence matching. The signs of the eigenvectors of a proximity matrix are not unique and play an important role in computing the correspondences between a set of feature points. We use the coefficients of the elementary symmetric polynomials to make the direction of the eigenvectors of the two proximity matrices consistent with each other for the problem correspondence matching. We compare our method to other methods presented in the literature. The empirical results show that using the coefficients of the elementary symmetric polynomials for eigenvectors sign correction is a better choice to solve the problem.
Chapter PDF
Similar content being viewed by others
Keywords
References
Caelli, T., Kosinov, S.: An Eigenspace Projection Clustering Method for Inexact Graph Matching. IEEE Transactions on Pattern Analysis and Machine Intelligence 26, 515–519 (2004)
Carcassoni, M., Hancock, E.R.: Spectral Correspondence for Point Pattern Matching. Pattern Recognition 36(1), 193–204 (2003)
Chui, H., Rangarajan, A.: A New Algorithm for Non-Rigid Point Matching. In: IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 44–51 (2000)
Ling, H., Jacobs, D.W.: Shape Classification using the Inner-Distance. IEEE Transactions on Pattern Analysis and Machine Intelligence 29, 286–299 (2007)
Mateus, D., Horaud, R.P., Knossow, D., Cuzzolin, F., Boyer, E.: Articulated Shape Matching using Laplacian Eigenfunctions and Unsupervised Point Registration. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, CVPR (June 2008)
Park, S.H., Lee, K.M., Lee, S.U.: A Line Feature Matching Technique Based on an Eigenvector Approach. Computer Vision and Image Understanding 77(3), 263–283 (2000)
Scott, G.L., Longuet-Higgins, H.C.: An Algorithm for Associating the Features of Two Images. Proceedings of the The Royal Society London B(224), 21–26 (1991)
Shapairo, L.S.: Towards a Vision-based Motion Framework. First Year Report, Department of Engineering Science, Oxford University (1991)
Shapairo, L.S., Brady, J.M.: Feature-based Correspondence: An Eigenvector Approach. Image and Vision Computing 10(5), 283–288 (1992)
Sun, J., Ovsjanikov, M., Guibas, L.: A Concise and Provably Informative Multi-scale Signature Based on Heat Diffusion. In: Proceedings of the Symposium on Geometry Processing, SGP 2009, pp. 1383–1392. Eurographics Association, Aire-la-Ville (2009), http://dl.acm.org/citation.cfm?id=1735603.1735621
Umeyama, S.: An Eigendecomposition Approach to Weighted Graph Matching Problems. IEEE Transactions on Pattern Analysis and Machine Intelligence 10(5), 695–703 (1988), http://dx.doi.org/10.1109/34.6778
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Haseeb, M., Hancock, E.R. (2013). Eigenvector Sign Correction for Spectral Correspondence Matching. In: Petrosino, A. (eds) Image Analysis and Processing – ICIAP 2013. ICIAP 2013. Lecture Notes in Computer Science, vol 8157. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41184-7_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-41184-7_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41183-0
Online ISBN: 978-3-642-41184-7
eBook Packages: Computer ScienceComputer Science (R0)