We make a case that taking the number of bits to code each motion vector into account when estimating motion for video compression results in significantly better performance at low bit rates, using simulation studies on established benchmark videos. First, by modifying a `vanilla' implementation of the H.261 standard, we show that choosing motion vectors explicitly to minimize rate (in a greedy manner), subject to implicit constraints on distortion, yields better rate-distortion tradeoffs than minimizing notions of prediction error. Locally minimizing a linear combination of rate and distortion results in further improvements. Using a heuristic function of the prediction error and the motion vector code-length results in compression performance comparable to the more computationally intensive coders while requiring a practically small amount of computation. We also show that making coding control decisions to minimize rate yields further improvements.
[1]
Yair Shoham,et al.
Efficient bit allocation for an arbitrary set of quantizers [speech coding]
,
1988,
IEEE Trans. Acoust. Speech Signal Process..
[2]
Didier Le Gall,et al.
MPEG: a video compression standard for multimedia applications
,
1991,
CACM.
[3]
Ming Lei Liou,et al.
Overview of the p×64 kbit/s video coding standard
,
1991,
CACM.
[4]
Philip M. Long,et al.
Explicit bit minimization for motion-compensated video coding
,
1994,
Proceedings of IEEE Data Compression Conference (DCC'94).
[5]
Wilson C. Chung,et al.
A new approach to scalable video coding
,
1995,
Proceedings DCC '95 Data Compression Conference.