high performance computing on graphics processing units: hgpu.org

In this work we present a parallelization technique, together with its GPU implementation, for the full-search block-matching algorithm. This problem consists in finding the block that best matches a given reference template in terms of some photometric measure within a predefined search area. Block matching is a fundamental processing step for many signal-processing applications. Its high computational burden and relative easy definition naturally demand for efficient and possibly parallel implementations. We compare the execution time of a GPU and CPU implementation; experimental results prove the effectiveness of executing the block-matching algorithm on GPU.