Skip to main navigation Skip to search Skip to main content

GPU-ASIFT: A fast fully affine-invariant feature extraction algorithm

  • Valeriu Codreanu
  • , Feng Dong
  • , Baoquan Liu
  • , Jos B.T.M. Roerdink
  • , David Williams
  • , Po Yang
  • , Burhan Yasar

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

26 Citations (Scopus)

Abstract

This paper presents a method that takes advantage of powerful graphics hardware to obtain fully affine-invariant image feature detection and matching. The chosen approach is the accurate, but also very computationally expensive, ASIFT algorithm. We have created a CUDA version of this algorithm that is up to 70 times faster than the original implementation, while keeping the algorithm's accuracy close to that of ASIFT. It's matching performance is therefore much better than that of other non-fully affine-invariant algorithms. Also, this approach was adapted to fit the multi-GPU paradigm in order to assess the acceleration potential from modern GPU clusters.

Original languageEnglish
Title of host publicationProceedings of the 2013 International Conference on High Performance Computing and Simulation, HPCS 2013
Pages474-481
Number of pages8
DOIs
Publication statusPublished - 21 Oct 2013
Event2013 11th International Conference on High Performance Computing and Simulation, HPCS 2013 - Helsinki, Finland
Duration: 1 Jul 20135 Jul 2013

Publication series

NameProceedings of the 2013 International Conference on High Performance Computing and Simulation, HPCS 2013

Conference

Conference2013 11th International Conference on High Performance Computing and Simulation, HPCS 2013
Country/TerritoryFinland
CityHelsinki
Period1/07/135/07/13

Keywords

  • Computer Vision
  • GPU
  • High performance computing

ASJC Scopus subject areas

  • Applied Mathematics
  • Modeling and Simulation

Fingerprint

Dive into the research topics of 'GPU-ASIFT: A fast fully affine-invariant feature extraction algorithm'. Together they form a unique fingerprint.

Cite this