Spectral Feature Matching Based on Isometric Projection of Matrix

Abstract:

This paper presents a spectral method to matching a pair of feature sets based on isometric projection of matrix. In the proposed method, a graph is constructed to model the structure relationships between features. Then the correspondence is found by minimizing the inner product between two isometric projections of the weighted adjacency matrix of graph. Finally, transformation between the two feature sets is estimated according to correct correspondences. The performance of the proposed approach is better than the state-of-the-art method in terms of correct ratio under position perturbation and computation time. Experiments on a number of simulated data, synthetic and real-world images show the validity of the proposed algorithm.

• Periodical: Applied Mechanics and Materials (Volumes 121-126)
• Pages: 4161-4165
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.121-126.4161
• Online since: October 2011
• Authors: Zhao Yang Zhang, Zheng Tian, Wei Dong Yan
• Keywords: Feature Matching, Graph, Isometric Projection, Spectral Feature

References

[1] D.Conte,P. FoggiA, C. Sansone, and M. Vento, "Thirty years of graph matching in pattern recognition", Int. J. Pattern Recognition and Artificial intelligence, 18(2004), pp.265-298.

DOI: 10.1142/s0218001404003228

[2] S. Umeyama, "An eigen decomposition approach to weighted graph matching problems", IEEE Trans. PAMI,10:695–703, 134,135. (1988).

[3] G. L. Scott and H. C. Longuet-Higgins, "An Algorithm for Associating the Features of Two Images", Proc. Royal Soc. London Series B-Biological, vol.244 (1991).

[4] L. S. Shapiro and J. M. Brady, "Feature-Based Correspondence - An Eigenvector Approach", Image and Vision Computing, vol.10, pp.283-288 (1992).

DOI: 10.1016/0262-8856(92)90043-3

[5] Bai Xiao, Edwin R.Hancock, Richard C.Wilson, "A generative model for graph matching and embedding", Computer Vision and Image Understanding (2009.01).

DOI: 10.1016/j.cviu.2009.01.004

[6] Caelli,T. and Kosinov, S, "An eigenspace projection clustering method for inexact graph matching", IEEE Tran. PAMI Vol.26, No.4 (2004).

DOI: 10.1109/tpami.2004.1265866

[7] H. F. Wang and E.R. Hancock, "A Kernel View of Spectral Point Pattern Matching", SSPR&SPR 2004, LNCS 3138, pp.61-369 ( 2004).

[8] M. Zaslavskiy, F. Bach, and J. P. Vert. "A Path Following Algorithm for Graph Matching", ICISP 2008, LNCS 5099, pp.329-337 (2008).

DOI: 10.1007/978-3-540-69905-7_38

[9] Weidong Yan, Zheng Tian, "Spectral feature matching based on partial least squares", Chinese Optics Letters, Vol.7, No.3, pp.201-205 (2009)

DOI: 10.3788/col20090703.0201

[10] Zhen Xiong and Yun Zhang, "A novel interest point matching algorithm for high resolution satellite images", IEEE Transactions On Geoscience And Remote Sensing, Vol.47, No.12, pp.4189-4200(2009).

DOI: 10.1109/tgrs.2009.2023794

[11] Zhaoyang Zhang and Zheng Tian, "Image registration using isometric projection of graph", IEEE ICIECS2009, pp.1067-1070(2010).