Fast Approximated SIFT [chapter]

Michael Grabner, Helmut Grabner, Horst Bischof
2006 Lecture Notes in Computer Science  
We propose a considerably faster approximation of the well known SIFT method. The main idea is to use efficient data structures for both, the detector and the descriptor. The detection of interest regions is considerably speed-up by using an integral image for scale space computation. The descriptor which is based on orientation histograms, is accelerated by the use of an integral orientation histogram. We present an analysis of the computational costs comparing both parts of our approach to
more » ... conventional method. Extensive experiments show a speed-up by a factor of eight while the matching and repeatability performance is decreased only slightly.
doi:10.1007/11612032_92 fatcat:s6qqy7bbxnenxfc5k7iykmk7ji