Advertisement

Abstract

This paper investigates spectral approaches to the problem of point pattern matching. Specifically, kernel principle component analysis (kernel PCA) methods are studied and compared with Shapiro and Brady’s approach and multidimensional scaling methods on both synthetic data and real world data. We demonstrate that kernel methods can be effectively used for solving the point correspondence matching problem with a performance that is comparable with other iterative-based algorithms in the literature under the existing of outliers and random position jitter. We also provide discussion of the theoretical support from kernel PCA to the earlier approach of Shapiro and Brady.

Keywords

Feature Point Point Pattern Polynomial Kernel Kernel Principal Component Analysis Point Correspondence 
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

  1. 1.
    Caelli, T., Kosinov, S.: An eigenspace projection clustering method for inexact graph matching. IEEE Tran. PAMI 26(4) (2004)Google Scholar
  2. 2.
    Carcassoni, M., Hancock, E.R.: Spectral correspondence for point pattern matching. Pattern Recognition 36, 193–204 (2003)zbMATHCrossRefGoogle Scholar
  3. 3.
    Carcassoni, M., Hancock, E.R.: Correspondence matching with modal clusters. IEEE Tran. PAMI 25(12) (2003)Google Scholar
  4. 4.
    Cox, T.F., Cox, M.A.A.: Multidimensional Scaling. Chapman and Hall, London (1994)zbMATHGoogle Scholar
  5. 5.
    Ham, J., Lee, D.D., Mika, S., Schölkopf, B.: A kernel view of the dimensionality reduction of manifolds. Max Planck Institute for Biological Cybernetics, Technical report TR-110 (2003)Google Scholar
  6. 6.
    Luo, B., Hancock, E.R.: Matching Point-sets using Procrustes alignment and the EM algorithm. BMVC (1999)Google Scholar
  7. 7.
    Schölkopf, B., Smola, A.J., Müller, K.R.: Nonlinear component analysis as a kernel eigenvvalue problem. Neural Computation 10, 1299–1319 (1998)CrossRefGoogle Scholar
  8. 8.
    Scott, G.L., Longuet-Higgins, H.C.: An Algorithm for Associating the Features of Two Images. In: Proc. Royal Soc. London. Series B-Biological, vol. 244 (1991)Google Scholar
  9. 9.
    Shapiro, L.S., Brady, J.M.: Feature-Based Correspondence - An Eigenvector Approach. Image and Vision Computing 10, 283–288 (1992)CrossRefGoogle Scholar
  10. 10.
    Vapnik, V.N.: The nature of statistical learning theory. Springer, New York (1995)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Hongfang Wang
    • 1
  • Edwin R. Hancock
    • 1
  1. 1.Dept. of Computer ScienceUniversity of YorkHeslington, YorkUK

Personalised recommendations