Block-matching criterion for efficient VLSI implementation of motion estimation

1996 ◽  
Vol 32 (13) ◽  
pp. 1184 ◽  
Author(s):  
Yunju Baek ◽  
Hwang-Seok Oh ◽  
Heung-Kyu Lee
1995 ◽  
Vol 5 (3) ◽  
pp. 231-236 ◽  
Author(s):  
Mei-Juan Chen ◽  
Liang-Gee Chen ◽  
Tzi-Dar Chiueh ◽  
Yung-Pin Lee

2013 ◽  
Vol 22 (02) ◽  
pp. 1250084
Author(s):  
R. K. PURWAR ◽  
NAVIN RAJPAL

Motion estimation is used to remove interpixel redundancy in video data and block based motion estimation algorithms are widely used for it. Computation in these algorithms is reduced by limiting the number of candidate search points within the search window or simplifying the distortion measurement criterion. In literature, there are integral frame based block motion estimation algorithms which drastically reduce computation cost. However, these algorithms have a serious drawback of spurious block matching possibility, leading to poor quality results. In this manuscript, a multilevel block matching criterion based on integral frame concept is proposed to minimize this drawback. Experimental results show that an increase up to 12% in terms of PSNR (dB) has been achieved than integral frame based sum of absolute difference block sum criterion (SAD_BS) with almost same execution time. Further, in terms of [Formula: see text] ratio, proposed method has 25–26% gain over SAD_BS.


2011 ◽  
Vol 145 ◽  
pp. 277-281
Author(s):  
Vaci Istanda ◽  
Tsong Yi Chen ◽  
Wan Chun Lee ◽  
Yuan Chen Liu ◽  
Wen Yen Chen

As the development of network learning, video compression is important for both data transmission and storage, especially in a digit channel. In this paper, we present the return prediction search (RPS) algorithm for block motion estimation. The proposed algorithm exploits the temporal correlation and characteristic of returning origin to obtain one or two predictive motion vector and selects one motion vector, which presents better result, to be the initial search center. In addition, we utilize the center-biased block matching algorithms to refine the final motion vector. Moreover, we used adaptive threshold technique to reduce the computational complexity in motion estimation. Experimental results show that RPS algorithm combined with 4SS, BBGDS, and UCBDS effectively improves the performance in terms of mean-square error measure with less average searching points. On the other hand, accelerated RPS (ARPS) algorithm takes only 38% of the searching computations than 3SS algorithm, and the reconstruction image quality of the ARPS algorithm is superior to 3SS algorithm about 0.30dB in average overall test sequences. In addition, we create an asynchronous learning environment which provides students and instructors flexibility in learning and teaching activities. The purpose of this web site is to teach and display our researchable results. Therefore, we believe this web site is one of the keys to help the modern student achieve mastery of complex Motion Estimation.


Sign in / Sign up

Export Citation Format

Share Document