Research on the Algorithm of Image Matching Based on Improved SIFT

Article Preview

Abstract:

The paper analyze and improve the SIFT optimized algorithm, and proposes an image matching method for SIFT algorithm based on quasi Euclidean distance and KD-tree. Experiments show that this algorithm has matching more points, high matching accuracy, no repeated points and higher advantage of matching efficiency based on keeping the basic characteristics of SIFT algorithm unchanged, and provides precise matching point to generate precise image stitching and other related fields of the follow-up product. At the same time, this method was applied to the layout optimization and achieved good results.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

348-353

Citation:

Online since:

October 2014

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Jiann-Shu Lee, Yung-Ming Kuo, Pau-Chung. The Adult Image Identification Baseed on Online Sampling[C]. 2006 International Joint Conference on Neural Networks. Canada. 2006, 2566-2571.

DOI: 10.1109/ijcnn.2006.247111

Google Scholar

[2] TUYTELAARST, VAN G00L L. Wide baseline stereo Matching based on local, affinely in variant regions[C]. British Machine Vision Conference BMVC20002000: 412-425.

DOI: 10.5244/c.14.38

Google Scholar

[3] DING X M, WANG W Y, HUANG X D. New method for detecting and tracking of moving Target Based on Difference and invariant[J]. Optics and precision engineering, 2007, 15 (4): 570-576.

Google Scholar

[4] Mana Saedan, Chee Wang Lim, Marcelo Hang Jr. Omnidirectional image matching for vision based robot localization[C]. IEEE 3rd International Conference on Mechatronics. 2006, 17-22.

DOI: 10.1109/icmech.2006.252489

Google Scholar

[5] Lowe D G. Distinctive Image Features from Scale invariant Keypoints[J]. International Journal of Computer Vision. 2004,60(2). 91-110.

DOI: 10.1023/b:visi.0000029664.99615.94

Google Scholar

[6] T. Kawannishi, T. Kurozumi, S. Takagi. A Fast Template Matching Using Bounded Partial Correlation[J]. Pattern Recongnition Letters. 2005, 26, 2129-2134.

DOI: 10.1016/j.patrec.2005.03.022

Google Scholar