New Parallel Technics for GPU, Fast SURF Algorithm

  • et al.
N/ACitations
Citations of this article
2Readers
Mendeley users who have this article in their library.

Abstract

Computer vision algorithms, especially real-time tasks, require intensive computation and reduced time. That’s why many algorithms are developed for interest point detection and description. For instance, SURF (Speeded Up Robust Feature) is extensively adopted in tracking or detecting forms and objects. SURF algorithm remains complex and massive in term of computation. So, it’s a challenge for real time usage on CPU. In this paper we propose a fast SURF parallel computation algorithm designed for Graphics-Processing-Unit (GPU). We describe different states of the algorithm in detail, using several optimizations. Our method can improve significantly the original application by reducing the computation time. Thus, it presents a good performance for real-time processing.

Cite

CITATION STYLE

APA

Hassnaoui*, H., Sahel, A., & Badri, A. (2020). New Parallel Technics for GPU, Fast SURF Algorithm. International Journal of Innovative Technology and Exploring Engineering, 9(8), 389–393. https://doi.org/10.35940/ijitee.g5855.069820

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free