Paper
17 April 1995 Pyramid decompositions and hierarchical motion compensation
David Houlding, Jacques Vaisey
Author Affiliations +
Proceedings Volume 2419, Digital Video Compression: Algorithms and Technologies 1995; (1995) https://doi.org/10.1117/12.206358
Event: IS&T/SPIE's Symposium on Electronic Imaging: Science and Technology, 1995, San Jose, CA, United States
Abstract
Block-based motion compensation (MC) is a fundamental component of most video compression algorithms; however, the `optimal' full search is computationally expensive and, as a result, fast search methods are preferred. This paper investigates the use of Gaussian and Laplacian pyramids in fast hierarchical MC algorithms. We compare the two types of pyramids as a function of different decimation and interpolation filters. In addition, the algorithm performance is compared to that of the full search and other `state of the art' fast methods. It is shown that the Gaussian pyramid is superior to the Laplacian, and that the hierarchical techniques outperform the other fast methods by approximately 7% at the same complexity.
© (1995) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
David Houlding and Jacques Vaisey "Pyramid decompositions and hierarchical motion compensation", Proc. SPIE 2419, Digital Video Compression: Algorithms and Technologies 1995, (17 April 1995); https://doi.org/10.1117/12.206358
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Image filtering

Video

Optical filters

Gaussian filters

Motion estimation

Spatial frequencies

Digital filtering

Back to Top