Share Email Print
cover

Proceedings Paper

Pyramid decompositions and hierarchical motion compensation
Author(s): David Houlding; Jacques Vaisey
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper 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.

Paper Details

Date Published: 17 April 1995
PDF: 9 pages
Proc. SPIE 2419, Digital Video Compression: Algorithms and Technologies 1995, (17 April 1995); doi: 10.1117/12.206358
Show Author Affiliations
David Houlding, Simon Fraser Univ. (Canada)
Jacques Vaisey, Simon Fraser Univ. (Canada)


Published in SPIE Proceedings Vol. 2419:
Digital Video Compression: Algorithms and Technologies 1995
Arturo A. Rodriguez; Robert J. Safranek; Edward J. Delp, Editor(s)

© SPIE. Terms of Use
Back to Top