Chang Yilin, Li Bingbing, Li Feipeng. BIT-CORRELATION MATCHING FUNCTION FOR SEQUENCE IMAGE CODING[J]. Journal of Electronics & Information Technology, 1996, 18(1): 20-24.
Citation:
Chang Yilin, Li Bingbing, Li Feipeng. BIT-CORRELATION MATCHING FUNCTION FOR SEQUENCE IMAGE CODING[J]. Journal of Electronics & Information Technology, 1996, 18(1): 20-24.
Chang Yilin, Li Bingbing, Li Feipeng. BIT-CORRELATION MATCHING FUNCTION FOR SEQUENCE IMAGE CODING[J]. Journal of Electronics & Information Technology, 1996, 18(1): 20-24.
Citation:
Chang Yilin, Li Bingbing, Li Feipeng. BIT-CORRELATION MATCHING FUNCTION FOR SEQUENCE IMAGE CODING[J]. Journal of Electronics & Information Technology, 1996, 18(1): 20-24.
This paper proposes a new block matching criterion called the bit-correlation matching function for sequence image coding. By using the same fast search algorithm, the bit-correlation matching function not only results in as nearly same a uracy in displacement estimation as mean square error function, but also makes the fast search algorithm low in computation complexity and easy to parallel operation, thus reducing the coding time of sequence image efficiently.
Matsuda K, Ito T, Make S. ICC 1984 Proc. Amsterdam, The Netherlands: 234-237.[2]Netravali A N, Robbins J.Bell Syst. Tech. J., 1979, 58 (3):631-670.[3]Hsing T. Globecom87, Tokyo Japan: 60-64.[4]Plompen R. Globeccom88 Hollywood USA: 997-1004.[5]常义林,李飞鹏,胡征.电子学报,1992, 20(1):61-66.[6]Musmann H G. IEEE Proc., 1985, 73(4): 523-548.[7]Jain J R, Jain K A. IEEE Trans.on COM., 1981, COM-29(12): 1799-1806.[8]Koga T. NTC81. Proc., New Orleans, LA: 1981, G5.3-65.3.5.[9]CCITT Recommend on H.261, Geneva: 1990.
DownLoad: