19 August 1998 Adaptive partial matching using fast spatial transformation
Author Affiliations +
Abstract
In this paper, we examine new motion compensation methods based on the affine or bilinear transformation and derive fast algorithms for affine and bilinear transformation using vector relationship. We also develop a more effective motion estimation method than the conventional image warping method in terms of computational complexity, reconstructed image quality, and the number of coding bits. The performance of the proposed motion compensation method, which combines the affine or the bilinear transformation with the proposed adaptive partial matching, is evaluated experimentally. We simulate our proposed motion compensation method in a DCT- based coder by encoding CIF (Common Intermediate Format) images at bitrates of below 64 kb/s. The proposed adaptive partial matching method can reduce the computational complexity below about 50% of the hexagonal matching method, while maintaining the image quality comparable to the hexagonal method.
© (1998) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Dong-Keun Lim, Dong-Keun Lim, Yo-Sung Ho, Yo-Sung Ho, "Adaptive partial matching using fast spatial transformation", Proc. SPIE 3561, Electronic Imaging and Multimedia Systems II, (19 August 1998); doi: 10.1117/12.319739; https://doi.org/10.1117/12.319739
PROCEEDINGS
12 PAGES


SHARE
RELATED CONTENT

Fast intra-mode decision algorithm of H.264/AVC
Proceedings of SPIE (January 18 2006)
Study On Non Real Time Motion Picture Coding For Read...
Proceedings of SPIE (October 31 1989)
Very low bit rate (VLBR) coding schemes a new...
Proceedings of SPIE (September 15 1994)
Elimination of blocky artifacts in predictive video coding
Proceedings of SPIE (January 08 1998)

Back to Top