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.
Using GPU for fast block-matching
EUSIPCO 2006, 14th European Signal Processing Conference, September 4-8, 2006, Florence, Italy
Type:
Conference
City:
Florence
Date:
2006-09-04
Department:
Digital Security
Eurecom Ref:
1972
Copyright:
© 2006 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
See also:
PERMALINK : https://www.eurecom.fr/publication/1972
