Title :
An adaptive fast full search motion estimation algorithm for H.264
Author :
Lin, Chen-Fu ; Leou, Jin-Jang
Author_Institution :
Dept. of Comput. Sci. & Inf. Eng., Nat. Chung Cheng Univ., Chiayi, Taiwan
Abstract :
In this study, an adaptive fast full search (FFS) motion estimation (ME) algorithm for H.264 is proposed. In the proposed algorithm, first, a proposed modified data reusing (MDR) technique is used to speed up the ME processing time by reducing sum of absolute differences (SAD) computations. in the proposed rood search order (RSO), the search order can be determined in such a way that the distribution of MV_COST values is "linearly-related" with the search order, i.e., MV_COST is a monotonically nondecreasing function of the search order so that the number of MV_COST computations can be greatly reduced. Second, the proposed adaptive search order (ASO) technique is used to speed up the ME processing time by reducing MV_COST computations and adaptively switching the ME search order between the spiral search order and the proposed rood search order (RSO). Based on the simulation results obtained in this study, the performance (the average processing time) of the proposed mixed algorithm (MDR+ASO) is better than that of five comparison FFS algorithms.
Keywords :
adaptive estimation; code standards; motion estimation; search problems; video coding; H.264; MDR+ASO; MV_COST; adaptive fast full search; adaptive search order; mixed algorithm; modified data reusing; monotonically nondecreasing function; motion estimation algorithm; rood search order; speed up; spiral search order; sum of absolute differences; Computational modeling; Computer science; Degradation; Distributed computing; Electronic mail; Error correction; Motion estimation; Spirals; Switches; Video coding;
Conference_Titel :
Circuits and Systems, 2005. ISCAS 2005. IEEE International Symposium on
Print_ISBN :
0-7803-8834-8
DOI :
10.1109/ISCAS.2005.1464882