This paper presents an efficient parallelization of the Motion Estimation procedure, one of the core parts of Super Resolution techniques. The algorithm considered is the basic version of Block Matching Super Resolution, with a single low-resolution camera and fixed Macro Block dimensions. Two are the implementations provided, with OpenMP and in CUDA on an NVIDIA Kepler GPU. Tests have been conducted on five image sequences and the results show a considerable improvement of the CUDA solution in all cases. Consequently, it can be stated that GPUs can efficiently accelerate computational times assuring the same image quality.

Efficient Parallelization of Motion Estimation for Super-Resolution

MARENZI, ELISA;DANESE, GIOVANNI;LEPORATI, FRANCESCO;
2017-01-01

Abstract

This paper presents an efficient parallelization of the Motion Estimation procedure, one of the core parts of Super Resolution techniques. The algorithm considered is the basic version of Block Matching Super Resolution, with a single low-resolution camera and fixed Macro Block dimensions. Two are the implementations provided, with OpenMP and in CUDA on an NVIDIA Kepler GPU. Tests have been conducted on five image sequences and the results show a considerable improvement of the CUDA solution in all cases. Consequently, it can be stated that GPUs can efficiently accelerate computational times assuring the same image quality.
2017
Proceedings of Euromicro PDP Conference on Parallel and Distributed Processing
978-1-5090-6058-0
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11571/1176404
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 6
  • ???jsp.display-item.citation.isi??? 6
social impact