Two Examples of GPGPU Acceleration of Memory-intensive Algorithms
No Thumbnail Available
Date
2010
Journal Title
Journal ISSN
Volume Title
Publisher
The Eurographics Association
Abstract
The advent of GPGPU technologies has allowed for sensible speed-ups in many high-dimension, memory-intensive computational problems. In this paper we demonstrate the e ectiveness of such techniques by describing two applications of GPGPU computing to two di erent subfields of computer graphics, namely computer vision and mesh processing. In the first case, CUDA technology is employed to accelerate the computation of approximation of motion between two images, known also as optical flow. As for mesh processing, we exploit the massivelyparallel architecture of CUDA devices to accelerate the face clustering procedure that is employed in many recent mesh segmentation algorithms. In both cases, the results obtained so far are presented and thoroughly discussed, along with the expected future development of the work.
Description
@inproceedings{:10.2312/LocalChapterEvents/ItalChap/ItalianChapConf2010/049-056,
booktitle = {Eurographics Italian Chapter Conference 2010},
editor = {Enrico Puppo and Andrea Brogni and Leila De Floriani},
title = {{Two Examples of GPGPU Acceleration of Memory-intensive Algorithms}},
author = {Marras, Stefano and Mura, Claudio and Gobbetti, Enrico and Scateni, Riccardo and Scopigno, Roberto},
year = {2010},
publisher = {The Eurographics Association},
ISBN = {978-3-905673-80-7},
DOI = {/10.2312/LocalChapterEvents/ItalChap/ItalianChapConf2010/049-056}
}