Abstract
This paper proposes a new block matching criterion called the bit-correlation matching function for image sequence coding. When using the identical fast searching algorithm, the bit-correlation matching function not only results in nearly the same accuracy in displacement estimation as the mean square error function, but also makes the algorithm low in computation complexity and easy to parallel implementation, thus reducing the coding time of image sequence efficiently.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
K. Matsuda, T. Ito, S. Make, ICC 1984 Proc. Amsterdam, The Netherlands: 234–237.
A. N. Netravali, J. Robbins,Bell Syst. Tech. J.,58(1979)3, 631–670.
T. Hsing, Globecom'87 Tokyo Japan: 60–64.
R. Plompen, Globecom'88 Hollywood USA: 997–1004.
Chang Yilin, Li Feipeng, Hu Zheng,Acta Electronica Sinica,20(1992)1, 61–66, (in Chinese).
H. G. Musmann,IEEE Proc.,73(1985)4, 523–548.
J. R. Jain, K. A. Jain,IEEE Trans. on Com. COM-29(1981)12, 1799–1806.
T. Koga, NTC'81 Proc., New Orleans, LA, 1981, G5.3.1–G5.3.5.
CCITT. Recommendation H. 261, Geneva: 1990.
Author information
Authors and Affiliations
Additional information
Supported by the National Natural Science Foundation of China and National Key Lab. on Integrated Services Network
About this article
Cite this article
Yilin, C., Bingbing, L., Xianpu, S. et al. Bit-correlation matching function for image sequence coding. J. of Electron.(China) 13, 134–139 (1996). https://doi.org/10.1007/BF02684754
Issue Date:
DOI: https://doi.org/10.1007/BF02684754