Optimal video coding for bit-rate switching applications: a game-theoretic approach

In this work we discuss a game theoretic approach to bitstream switching in video coding. Fast and bit-saving video bitstream switching is an important issue in video communication system on time varying channels. The most recent video coding standard, namely H. 264, support the seamless switching among bitstreams coded at different bitrates by means of suitably coded frames, named Switching Pictures. Since the rate-distortion characteristics of switchingframes differ from those of I and P frames, their location affect both the bit-rate and the quality of the coded sequence. In this work, we address the optimization of the SP frames location under an assigned bitrate budget. At this aim we restor to a game theoretic approach and we show that the optimal solution is met when the SP frames are assigned to the frame with the smallest innovation. Experimental results show the advantage in terms of both rate and distortion achieved by the optimized Switching frame insertion with respect to basic H.264 coding. © 2007 IEEE.