FPGA-Based Parallel Implementation of SURF Algorithm

SURF (Speeded up robust features) detection is used extensively in object detection, tracking and matching. However, due to its high complexity, it is usually a challenge to perform such detection in real time on a general-purpose processor. This paper proposes a parallel computing algorithm for the...

Full description

Saved in:
Bibliographic Details
Main Authors: Wenjie Chen, Shuaishuai Ding, Zhilei Chai, Daojing He, Weihua Zhang, Guanhua Zhang, Qiwei Peng, Wang Luo
Format: Conference Proceeding
Language:English
Subjects:
Algorithm design and analysis
Feature extraction
Field programmable gate arrays
FPGA
Hardware
High Level Synthesis
Interpolation
parallel computing
Parallel processing
Real-time systems
SURF
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:SURF (Speeded up robust features) detection is used extensively in object detection, tracking and matching. However, due to its high complexity, it is usually a challenge to perform such detection in real time on a general-purpose processor. This paper proposes a parallel computing algorithm for the fast computation of SURF, which is specially designed for FPGAs. By efficiently exploiting the advantages of the architecture of an FPGA, and by appropriately handling the inherent parallelism of the SURF computation, the proposed algorithm is able to significantly reduce the computation time. Our experimental results show that, for an image with a resolution of 640x480, the processing time for computing using SURF is only 0.047 seconds on an FPGA (XC6SLX150T, 66.7 MHz), which is 13 times faster than when performed on a typical i3-3240 CPU (with a 3.4 GHz main frequency) and 249 times faster than when performed on a traditional ARM system (CortexTM-A8, 1 GHz).
ISSN:1521-9097
2690-5965
DOI:10.1109/ICPADS.2016.0049