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 massively parallel 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.
Reference and download information
Stefano Marras, Claudio Mura, Enrico Gobbetti, Riccardo Scateni, and Roberto Scopigno. Two examples of GPGPU acceleration of memory-intensive algorithms. In Eurographics Italian Chapter Conference. Pages 49-56. Eurographics Association, November 2010.
Related multimedia productions
Bibtex citation record
@InProceedings{Marras:2010:TEG, author = {Stefano Marras and Claudio Mura and Enrico Gobbetti and Riccardo Scateni and Roberto Scopigno}, title = {Two examples of GPGPU acceleration of memory-intensive algorithms}, booktitle = {Eurographics Italian Chapter Conference}, pages = {49--56}, publisher = {Eurographics Association}, address = {Conference held in Genoa, Italy}, month = {November}, year = {2010}, 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 massively parallel 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.}, url = {http://vic.crs4.it/vic/cgi-bin/bib-page.cgi?id='Marras:2010:TEG'}, }
The publications listed here are included as a means to ensure timely
dissemination of scholarly and technical work on a non-commercial basis.
Copyright and all rights therein are maintained by the authors or by
other copyright holders, notwithstanding that they have offered their works
here electronically. It is understood that all persons copying this
information will adhere to the terms and constraints invoked by each
author's copyright. These works may not be reposted without the
explicit permission of the copyright holder.
Please contact the authors if you are willing to republish this work in
a book, journal, on the Web or elsewhere. Thank you in advance.
All references in the main publication page are linked to a descriptive page
providing relevant bibliographic data and, possibly, a link to
the related document. Please refer to our main
publication repository page for a
page with direct links to documents.