An Improved SIFT Matching Algorithm

Article Preview

Abstract:

The high dimension and complexity of feature descriptor of Scale Invariant Feature Transform (SIFT), not only occupy the memory spaces, but also influence the speed of feature matching. We adopt the statistic feature point’s neighbor gradient method, the local statistic area is constructed by 8 concentric square ring feature of points-centered, compute gradient of these pixels, and statistic gradient accumulated value of 8 directions, and then descending sort them, at last normalize them. The new feature descriptor descend dimension of feature from 128 to 64, the proposed method can improve matching speed and keep matching precision at the same time.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1232-1237

Citation:

Online since:

December 2012

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Lowe D G. International Journal of Computer Vision, Vol. 60 (2004), p.91.

Google Scholar

[2] KE Y,SUKTHANKAR R.PCA-SIFT: A more distinctive representation for local image descriptors[C]. Proceeding Conference Computer Vision and Pattern Recognition, 2004: 511-517.

DOI: 10.1109/cvpr.2004.1315206

Google Scholar

[3] GRABNER M, GRABNER H, BISCHOF H. Fast approximated SIFT[C]//Proceedings Asian Conference on Computer Vision, 2006, 1: 918-927.

DOI: 10.1007/11612032_92

Google Scholar

[4] Elisabetta Delponte, Francesco Isgrò, Francesca Odone, et al. Graphical Models. Vol.68(2006).

Google Scholar

[5] Mikolajczyk K, Schmid C. IEEE Transactions on Pattern Analysis and Machine Intelligence. Vol.27(2005), p.1615.

Google Scholar

[6] Kenan Wu, Liping Wang. Gansu Science and Technology. Vol. 25(2009).

Google Scholar