Paper Info
Title
A GPU accelerated Fast Directional Chamfer Matching algorithm and a detailed comparison with a highly optimized CPU implementation.
Abstract
In this work we present an efficient GPU implementation of the Fast Directional Chamfer Matching (FDCM) algorithm [10]. We propose some extensions to the original FDCM algorithm. In particular, we extend the algorithm to handle templates with variable size, to account for perspective effects. To the best of our knowledge, our work is the first to present a full implementation of a shape based matching algorithm on a GPU. Further contributions of our work consist of implementing a highly optimized CPU version of the algorithm (via multi-threading and SSE2), as well as a thorough comparison between pure GPU, pure CPU, and a hybrid version. The hybrid CPU-GPU version which turns out to be the fastest, achieves run-time of 44 fps on PAL resolution images.
Year
DOI
Venue
2012
10.1109/CVPRW.2012.6238897
CVPR Workshops
Keywords
Field
DocType
multi threading,sse2,computational modeling,instruction sets,image segmentation,tensile stress,multithreading,image resolution,shape
SSE2,Multithreading,Instruction set,Computer science,Parallel computing,Algorithm,Image segmentation,Template,Graphics processing unit,Image resolution,Blossom algorithm
Conference
Volume
Issue
ISSN
2012
1
2160-7508
Citations 
PageRank 
References 
4
0.44
10
Authors
2
Name
Order
Citations
PageRank
Michael Rauter1172.56
David Schreiber2515.78