FPGA based Speeded Up Robust Features

J. Svab, T. Krajnik, J. Faigl, L. Preucil
Dept. of Cybern., Czech Tech. Univ. in Prague, Prague, Czech Republic
IEEE International Conference on Technologies for Practical Robot Applications, 2009. TePRA 2009


   title={FPGA based Speeded Up Robust Features},

   author={Svab, J. and Krajnik, T. and Faigl, J. and Preucil, L.},

   booktitle={Technologies for Practical Robot Applications, 2009. TePRA 2009. IEEE International Conference on},





Download Download (PDF)   View View   Source Source   



We present an implementation of the Speeded Up Robust Features (SURF) on a Field Programmable Gate Array (FPGA). The SURF algorithm extracts salient points from image and computes descriptors of their surroundings that are invariant to scale, rotation and illumination changes. The interest point detection and feature descriptor extraction algorithm is often used as the first stage in autonomous robot navigation, object recognition and tracking etc. However, detection and extraction are computationally demanding and therefore can’t be used in systems with limited computational power. We took advantage of algorithm’s natural parallelism and implemented it’s most demanding parts in FPGA logic. Several modifications of the original algorithm have been made to increase it’s suitability for FPGA implementation. Experiments show, that the FPGA implementation is comparable in terms of precision, speed and repeatability, but outperforms the CPU and GPU implementation in terms of power consumption. Our implementation is intended to be used in embedded systems which are limited in computational power or as the first stage preprocessing block, which allows the computational resources to focus on higher level algorithms.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2021 hgpu.org

All rights belong to the respective authors

Contact us: