next up previous
Next: Dictionary Selection using Partial Up: DATA COMPRESSION Previous: Arithmetic Coding for Data

Explicit Bit Minimization for Motion-Compensated Video Coding

D. T. Hoang, P. M. Long, and J. S. Vitter, ``Explicit Bit Minimization for Motion-Compensated Video Coding,'' Proceedings of the 1994 IEEE Data Compression Conference (DCC '94), Snowbird, UT, March 1994, 175-184.

Full text (gzip-compressed postscript)

Full text (Adobe pdf format)

We compare methods for choosing motion vectors for motion-compensated video compression. Our primary focus is on videophone and videoconferencing applications, where very low bit rates are necessary, where the motion is usually limited, and where the frames must be coded in the order they are generated. We provide evidence, using established benchmark videos of this type, that choosing motion vectors to minimize codelength subject to (implicit) constraints on quality yields substantially better rate-distortion tradeoffs than minimizing notions of prediction error. We illustrate this point using an algorithm within the $p \times 64$ standard. We show that using quadtrees to code the motion vectors in conjunction with explicit codelength minimization yields further improvement. We describe a dynamic-programming algorithm for choosing a quadtree to minimize the codelength.


next up previous
Next: Dictionary Selection using Partial Up: DATA COMPRESSION Previous: Arithmetic Coding for Data
Jeff Vitter
2009-11-09