Design of advanced block matching algorithm by using RAVR

• Authors: Hyo-Moon Cho;Jong-Hwa Lee;Myung-Kook Yang;Sang-Bock Cho
• Venue: ICIC'07 Proceedings of the intelligent computing 3rd international conference on Advanced intelligent computing theories and applications
• Year: 2007

The block matching algorithm (BMA) is one of the most important processing in the video compression. Since the sub-pixel motion estimation and motion compensation are needed, the computational complexity of the BMA is increased. Recently, the sum of absolute difference (SAD) calculation is widely used for BMA but it accounted for much of the total computation of the video compression. To implement the real-time video compression, the fast algorithm for motion estimation and motion compensation based on SAD computation is needed. The partial distortion elimination (PDE) scheme is one of the most advanced methods to decrease the SAD computational complexity. The basic concept of the PDE is that if the accumulated SAD values are greater than the given accumulated SAD value then the SAD computation is stopped. Where, the given accumulated SAD value is a kind of average value. Therefore, the big problem of the PDE is that the division is needed. And, as initial accumulated SAD value is large, PDE operation becomes efficient. Thus scan order is also important in SAD computation. In this paper, we introduce the new average computation method for PDE operation without division, its mathematical modeling and architecture. The new computational method is named as RAVR (Rough Average). And we propose the advanced scan order for efficient PDE scheme based on ARVR concept. Thus, our proposed algorithm combines above two main concepts and suffers the improving SAD performance and the easy hardware implementation methods.