A comparative study of parallel software SURF implementations. (11th October 2013)

• Record Type: Journal Article
• Authors: Hidalgo‐Paniagua, Alejandro; Vega‐Rodríguez, Miguel A.; Pavón, Nieves; Ferruz, Joaquín
• Is Part Of: Concurrency and computation. Volume 26:Number 17(2014:Dec.)
• Page Start: 2758
• Page End: 2771
• Publication Date: 2013-10-11
• Subjects: Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.3163
• Languages: English
• ISSNs: 1532-0626

Abstract

<abstract abstract-type="main" id="cpe3163-abs-0001"> <title>SUMMARY</title> <p id="cpe3163-para-0001">Nowadays, it is common to find problems that require recognizing objects in an image, tracking them along time, or recognizing a complete real‐world scene. One of the most known and used algorithms to solve these problems is the <italic>Speeded Up Robust Features (SURF) algorithm</italic>. <italic>SURF</italic> is a fast and robust local, scale and rotation invariant, features detector. This means that it can be used for detecting and describing a set of <italic>points of interest</italic> (<italic>keypoints</italic>) from an image. Because of the importance of this algorithm and the rise of the parallelism‐based technologies, in the last years, diverse parallel implementations of SURF have been proposed. These parallel implementations are based on very different techniques: Compute Unified Device Architecture, OpenMp, OpenCL, and so on. In conclusion, we think valuable a comparative study of all of them highlighting the advantages and disadvantages of each parallel implementation. To our best knowledge, this article is the first attempt to do this comparative study. In order to make this study, we have used the standard metrics and image collection in this field, as well as other important metrics in parallelism as speedup and efficiency. Copyright © 2013 John Wiley &amp; Sons, Ltd.</p> </abstract>