Fast Implementation of Scale Invariant Feature Transform Based on CUDA
College of Information Science and Engineering, Northeastern University, China
Applied Mathematics & Information Sciences, Vol. 7, No. 2L, p.717-722, 2013
@article{lu2013fast,
title={Fast Implementation of Scale Invariant Feature Transform Based on CUDA},
author={Lu, Meng},
journal={Appl. Math},
volume={7},
number={2L},
pages={717–722},
year={2013}
}
Scale-invariant feature transform (SIFT) was an algorithm in computer vision to detect and describe local features in images. Due to its excellent performance, SIFT was widely used in many applications, but the implementation of SIFT was complicated and time-consuming. To solve this problem, this paper presented a novel acceleration algorithm for SIFT implementation based on Compute Unified Device Architecture (CUDA). In the algorithm, all the steps of SIFT were specifically distributed and implemented by CPU or GPU, accroding to the step’s characteristics or demandings, to make full use of computational resources. Experiments showed that compared with the traditional implementation of SIFT, this paper’s acceleration algorithm can greatly increase computation speed and save implementation time. Furthermore, the acceleration ratio had linear relation with the number of SIFT keypoints.
May 6, 2013 by hgpu