Share Email Print
cover

Proceedings Paper

SIFT implementation based on GPU
Author(s): Chao Jiang; Ze-xun Geng; Xiao-feng Wei; Chen Shen
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Abstract—Image matching is the core research topics of digital photogrammetry and computer vision. SIFT(Scale-Invariant Feature Transform) algorithm is a feature matching algorithm based on local invariant features which is proposed by Lowe at 1999, SIFT features are invariant to image rotation and scaling, even partially invariant to change in 3D camera viewpoint and illumination. They are well localized in both the spatial and frequency domains, reducing the probability of disruption by occlusion, clutter, or noise. So the algorithm has a widely used in image matching and 3D reconstruction based on stereo image. Traditional SIFT algorithm's implementation and optimization are generally for CPU. Due to the large numbers of extracted features(even if only several objects can also extract large numbers of SIFT feature), high-dimensional of the feature vector(usually a 128-dimensional SIFT feature vector), and the complexity for the SIFT algorithm, therefore the SIFT algorithm on the CPU processing speed is slow, hard to fulfil the real-time requirements. Programmable Graphic Process United(PGPU) is commonly used by the current computer graphics as a dedicated device for image processing. The development experience of recent years shows that a high-performance GPU, which can be achieved 10 times single-precision floating-point processing performanceone compared with the same time of a high-performance desktop CPU, simultaneity the GPU's memory bandwidth is up to five times compared with the same period desktop platform. Provide the same computing power, the GPU's cost and power consumption should be less than the CPU-based system. At the same time, due to the parallel nature of graphics rendering and image processing, so GPU-accelerated image processing become to an efficient solution for some algorithm which have requirements for real-time. In this paper, we realized the algorithm by OpenGL shader language and compare to the results which realized by CPU. Experiments demonstrate that the efficiency of GPU-based SIFT algorithm are significantly improved.

Paper Details

Date Published: 20 August 2013
PDF: 7 pages
Proc. SPIE 8913, International Symposium on Photoelectronic Detection and Imaging 2013: Optical Storage and Display Technology, 891304 (20 August 2013); doi: 10.1117/12.2031661
Show Author Affiliations
Chao Jiang, Information Engineering Univ. (China)
Ze-xun Geng, Information Engineering Univ. (China)
Xiao-feng Wei, Information Engineering Univ. (China)
Chen Shen, Information Engineering Univ. (China)


Published in SPIE Proceedings Vol. 8913:
International Symposium on Photoelectronic Detection and Imaging 2013: Optical Storage and Display Technology
Changsheng Xie; Yikai Su; Liangcai Cao, Editor(s)

© SPIE. Terms of Use
Back to Top