Research on SIFT Matching Algorithm Based on GPU

Article Preview

Abstract:

Aiming at the shortage of SIFT algorithm in time comsumption and getting less matching points. On the one hand, the paper improves the original SIFT algorithm, it proposes regional growth algorithm based on SIFT, so you can get many matching points which are good for generating the disparity map; on the other hand, the paper uses the CPU and GPU heterogeneous platforms and analyses the CUDA programming model and memory model. This paper analyses the algorithm in detail, so the algorithm can be carried out on CUDA. Experimental results show that, compared with the original algorithm, the algorithm is about 10 times faster, and generate good disparity map.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1652-1656

Citation:

Online since:

August 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Grimson W E L. Computational experiments with a feature based stereo algorithm[J]. Pattern Analysis and Machine Intelligence, IEEE Transactions on, (2010)17-34.

DOI: 10.1109/tpami.1985.4767615

Google Scholar

[2] Medioni G, Nevatia R. Segment-based stereo matching[J]. Computer Vision, Graphics, and Image Processing, (2011) 2-18.

DOI: 10.1016/s0734-189x(85)80073-6

Google Scholar

[3] Sanders J, Kandrot E. CUDA by example: an introduction to general-purpose GPU programming[M]. Addison-Wesley Professional, (2010).

Google Scholar

[4] Cheng L, Caelli T. Bayesian stereo matching[J]. Computer Vision and Image Understanding, (2007)85-96.

DOI: 10.1016/j.cviu.2005.09.009

Google Scholar

[5] Information on http: /vision. middlebury. edu/stereo/eval.

Google Scholar

[6] Cheng L, Caelli T. Bayesian stereo matching[J]. Computer Vision and Image Understanding, (2007)85-96.

DOI: 10.1016/j.cviu.2005.09.009

Google Scholar