Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Gonzales, R.C., Woods, R.E., Eddins, S.L.: Digital Image Processing Using MATLAB, pp. 282–333. Prentice Hall, Englewood Cliffs (2004)
Li, W., Salari, E.: Successive elimination algorithm for motion estimation. IEEE Trans. Image Processing 4(1), 105–107 (1995)
Gao, X.Q., Duanmu, C.J., Zou, C.R.: A Multilevel Successive Elimination Algorithm for Block Matching Motion Estimation. IEEE Trans. Image Processing 9(3), 501–505 (2000)
Michalel, B., Wolfgang, N.: Fast Full Search Block Matching. IEEE Trans. Circuit and System for Video Technology 11(2), 241–247 (2001)
Musmann, H.G., Pirsch, P., Grallert, H.J.: Advanced in Picture Coding. Proc. IEEE 73(4), 523–548 (1995)
Zhu, S., Ma, K.: A New Diamond Search Algorithm for Fast Block Matching Motion Estimation. IEEE Trans. Image Processing 9, 287–290 (2000)
ITU-T: Video Coding for Low Bitrate Communication, Draft Recommendation H.263 (1995)
Jeong, Y.H., Kim, J.H.: The FASCO Block Matching Algorithm Based on Motion Vector Prediction Using Spatio-temporal Correlations. Korean Institute of Communication Sciences 26(11A), 1925–1937 (2002)
Kim, J.N., Byun, S.C., Kim, Y.H., Ahn, B.H.: Fast full search motion estimation algorithm using early detection of impossible candidate vectors. IEEE Trans. Signal Processing 50(9), 2355–2365 (2002)
Ayala Ramirez, V., Devy, M., Parra, C.: Active Tracking Based on Hausdorff Matching. Proc. Pattern Recognition 15th International Conf. 4, 706–709 (2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Cho, HM., Lee, JH., Yang, MK., Cho, SB. (2007). Design of Advanced Block Matching Algorithm by Using RAVR. In: Huang, DS., Heutte, L., Loog, M. (eds) Advanced Intelligent Computing Theories and Applications. With Aspects of Theoretical and Methodological Issues. ICIC 2007. Lecture Notes in Computer Science, vol 4681. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74171-8_75
Download citation
DOI: https://doi.org/10.1007/978-3-540-74171-8_75
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74170-1
Online ISBN: 978-3-540-74171-8
eBook Packages: Computer ScienceComputer Science (R0)