An Improved Scale Invariant Feature Transform Algorithm Based on Rounded Projection
The scale-invariant feature transform algorithm proposed by Lowe has a low efficiency which can not meet the need of real-time. The algorithm based on rounded projection proposed in our paper applies Fast Fourier Transform algorithm (FFT) on the projection local area to compute the first harmonic components which are used to prescreen the feature points that extracted by SIFT algorithm. We carry on the image to match according to the prescreened feature points to calculate the local area descriptors. The experiments show that new algorithm has a less number of feature points than the original, so it improves the efficiency and has a better performance.
Rounded projection Prescreening SIFT Registration
YinCheng Liang ChanJuan Liu HaiLin Zou
School of Information & Electric Engineering Ludong University YanTai China School of Mechanical Electronic & Information Engineering University of Mining & Technology Beijing
国际会议
哈尔滨
英文
2645-2648
2011-12-24（万方平台首次上网日期，不代表论文的发表时间）