USING GPU FOR FAST BLOCK-MATCHING - Télécom Paris Access content directly
Conference Papers Year : 2006



On the one hand, basic PCs include by default more and more powerful GPU (Graphics Processing Unit) that sometimes even outperforms CPU (Central Processing Unit) for some specific tasks. On the other hand, video processing are more and more useful and required for numerous emerging services and applications but is often too computational expensive to reach real time. Within the context of GPGPU (General Purpose GPU), we propose in this paper a possible implementation of a block-matching algorithm. Some significant results are obtained in terms of acceleration and quality. Based on our experiments on Block-Matching within the context of video compression, we finally underline some existing limitations of using GPUs beyond graphics for image and video processing even if this concept remains attractive.
Fichier principal
Vignette du fichier
1568982026.pdf.pdf (266.44 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02893252 , version 1 (08-07-2020)


  • HAL Id : hal-02893252 , version 1


Sébastien Mazaré, Jean-Luc Dugelay, Renaud Pacalet. USING GPU FOR FAST BLOCK-MATCHING. 14th European Signal Processing Conference / EUSIPCO'06, Sep 2006, Florence, Italy. ⟨hal-02893252⟩
45 View
25 Download


Gmail Facebook X LinkedIn More