TY - GEN
T1 - An architecture of optimised SIFT feature detection for an FPGA implementation of an image matcher
AU - Yao, Lifan
AU - Feng, Hao
AU - Zhu, Yiqun
AU - Jiang, Zhiguo
AU - Zhao, Danpei
AU - Feng, Wenquan
PY - 2009
Y1 - 2009
N2 - This paper has proposed an architecture of optimised SIFT (Scale Invariant Feature Transform) feature detection for an FPGA implementation of an image matcher. In order for SIFT based image matcher to be implemented on an FPGA efficiently, in terms of speed and hardware resource usage, the original SIFT algorithm has been significantly optimised in the following aspects: 1) Upsampling has been replaced with downsampling to save the interpolation operation. 2) Only four scales with two octaves are needed for our image matcher with moderate degradation of matching performance. 3) The total dimension of the feature descriptor has been reduced to 72 from 128 of the original SIFT, which leads to significantly simplify the image matching operation. With the optimisation above, the proposed FPGA implementation is able to detect the features of a typical image of 640x480 pixels within 31 milliseconds. Therefore, compared with the existing SIFT FPGA implementation, which requires 33 milliseconds for an image of 320x240 pixels, a significant improvement has been achieved for our proposed architecture.
AB - This paper has proposed an architecture of optimised SIFT (Scale Invariant Feature Transform) feature detection for an FPGA implementation of an image matcher. In order for SIFT based image matcher to be implemented on an FPGA efficiently, in terms of speed and hardware resource usage, the original SIFT algorithm has been significantly optimised in the following aspects: 1) Upsampling has been replaced with downsampling to save the interpolation operation. 2) Only four scales with two octaves are needed for our image matcher with moderate degradation of matching performance. 3) The total dimension of the feature descriptor has been reduced to 72 from 128 of the original SIFT, which leads to significantly simplify the image matching operation. With the optimisation above, the proposed FPGA implementation is able to detect the features of a typical image of 640x480 pixels within 31 milliseconds. Therefore, compared with the existing SIFT FPGA implementation, which requires 33 milliseconds for an image of 320x240 pixels, a significant improvement has been achieved for our proposed architecture.
UR - https://www.scopus.com/pages/publications/77949422486
U2 - 10.1109/FPT.2009.5377651
DO - 10.1109/FPT.2009.5377651
M3 - 会议稿件
AN - SCOPUS:77949422486
SN - 9781424443772
T3 - Proceedings of the 2009 International Conference on Field-Programmable Technology, FPT'09
SP - 30
EP - 37
BT - Proceedings of the 2009 International Conference on Field-Programmable Technology, FPT'09
T2 - 2009 International Conference on Field-Programmable Technology, FPT'09
Y2 - 9 December 2009 through 11 December 2009
ER -