Three novel low complexity scanning orders for MPEG-2 full search motion estimation

Complexity localisation in the reference frame is the key process for the derivation of efficient scanning orders for motion estimation. The more localised the complexity is, the more computationally efficient scanning orders can be derived for reduced cost motion estimation algorithms. However, this processes entails serious pre-processing overhead which may render it unsuitable for real time video coding systems. In this paper, we propose three low complexity scanning orders of similar performance that are very competitive in terms of the operation count ratio metric with respect to the MPEG-2 raster scan order, show improvements of 7.14% on the average with respect to the number of examined macroblock rows metric and they also show an increase in the speed-up ratio of 0.12 on the average as compared to the standard. As compared to other work in the literature, the proposed scanning orders require one fourth of the operation count ratio and show an increase in the speed-up ratio of 45 times on the average.