A flexible parallel architecture adapted to block-matching motion-estimation algorithms

1996 ◽  
Vol 6 (1) ◽  
pp. 74-86 ◽  
Author(s):  
S. Dutta ◽  
W. Wolf
2014 ◽  
Vol 610 ◽  
pp. 686-694
Author(s):  
Chang Jiang Liu ◽  
Chao Chen ◽  
A Fei Zhang ◽  
Xiao Lang Yan

The diamond search (DS) algorithm is one of the most efficient block matching motion estimation algorithms by far and has already been applied in MPEG2/4. Through our research, we found that there is still some redundancy in the algorithm. In this paper, an improved new difference based search (DBS) algorithm is proposed. Simulation results demonstrate that the new algorithm outperforms the well-known diamond search (DS) algorithm and four step-searches (4SS). It obtains almost the same Peak Signal to Noise Ratio (PSNR) while requires less computations than the DS algorithm and 4SS algorithm.


2008 ◽  
Vol 54 (3) ◽  
pp. 1430-1438 ◽  
Author(s):  
Gustavo Callico ◽  
Sebastian Lopez ◽  
Oliver Sosa ◽  
Jose Lopez ◽  
Roberto Sarmiento

2021 ◽  
Author(s):  
Randa Khemiri ◽  
Soulef Bouaafia ◽  
Asma Bahba ◽  
Maha Nasr ◽  
Fatma Ezahra Sayadi

In Motion estimation (ME), the block matching algorithms have a great potential of parallelism. This process of the best match is performed by computing the similarity for each block position inside the search area, using a similarity metric, such as Sum of Absolute Differences (SAD). It is used in the various steps of motion estimation algorithms. Moreover, it can be parallelized using Graphics Processing Unit (GPU) since the computation algorithm of each block pixels is similar, thus offering better results. In this work a fixed OpenCL code was performed firstly on several architectures as CPU and GPU, secondly a parallel GPU-implementation was proposed with CUDA and OpenCL for the SAD process using block of sizes from 4x4 to 64x64. A comparative study established between execution time on GPU on the same video sequence. The experimental results indicated that GPU OpenCL execution time was better than that of CUDA times with performance ratio that reached the double.


2013 ◽  
Vol 446-447 ◽  
pp. 997-1001
Author(s):  
Xing Hui Zhang

The efficient motion estimation algorithms are the important research hotspot in the real-time video coding-decoding technology. This paper proposes a novel and simple fast motion estimation algorithm based on adaptive search-pattern. The new algorithm includes three schemes: stationary block prediction, predictive search for non-stationary blocks, choosing a starting point and adaptive refinement search in merging process. Experiments show that the efficient motion estimation algorithm proposed can further reduce the computations of block-matching while improve the compression effect.


Sign in / Sign up

Export Citation Format

Share Document