Causal video coding is considered from an information theoretic point of view, where video source frames X-1, X-2, ..., X-N are encoded in a frame by frame manner, the encoder for each frame X-k can use all previous f...
详细信息
Causal video coding is considered from an information theoretic point of view, where video source frames X-1, X-2, ..., X-N are encoded in a frame by frame manner, the encoder for each frame X-k can use all previous frames and all previous encoded frames while the corresponding decoder can use only all previous encoded frames, and each frame X-k itself is modeled as a source X-k = {X-k(i)}(i=1)(infinity). A novel computation approach is proposed to analytically characterize, numerically compute, and compare the minimum total rate of causal video coding R-c*(D-1, ..., D-N) required to achieve a given distortion (quality) level D-1, ..., D-N > 0. Among many other things, the computation approach includes an iterative algorithm with global convergence for computing R-c*(D-1, ..., D-N). The global convergence of the algorithm further enables us to demonstrate a somewhat surprising result (dubbed the more and less coding theorem)-under some conditions on source frames and distortion, the more frames need to be encoded and transmitted, the less amount of data after encoding has to be actually sent. With the help of the algorithm, it is also shown by example that R-c*(D-1, ..., D-N) is in general much smaller than the total rate offered by the traditional greedy coding method. As a by-product, an extended Markov lemma is established for correlated ergodic sources.
暂无评论