On the information theoretic performance comparison of causal video coding and predictive video coding

Abstract

Causal video coding is a coding paradigm where video source frames X 1 , X 2 , …, X N are encoded in a frame by frame manner, the encoder for each frame can use all previous frames and all previous encoded frames, and the corresponding decoder can use only all previous encoded frames. In the special case where the encoder for each frame X k is further restricted to enlist help only from all previous encoded frames, causal video coding is reduced to predictive video coding, which all MPEG-series and H-series video coding standards proposed so far are based upon. In this paper, we compare the rate distortion performance of causal video coding with that of predictive video coding from an information theoretic perspective by modeling each frame X k itself as a source X k = {X k (i)}∞ i=1 . Let R∗ c (D 1 , …, D N ) (R∗ p (D 1 , …, D N ), respectively) denote the minimum total rate required to achieve a given distortion level D 1 , …, D N > 0 in causal video coding (predictive video coding, respectively). In the case of TV = 3, we first derive a single-letter characterization of R∗ p (D 1 , D 2 , D 3 ) for an independent and identically distributed (IID) vector source (X 1 , X 2 , X 3 ) where X 1 and X 2 are independent, and then demonstrate that if X 1 , X 2 , X 3 do not form a (first-order) Markov chain, then under some conditions on source frames and distortion, R∗ c (D 1 , D 2 , D 3 ) is strictly less than R∗ p (D 1 , D 2 , D 3 ).