Pyramid decompositions and hierarchical motion compensation
David Houlding, Jacques Vaisey · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 1995
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.