MPEG Bit Rate Improvement Using Adaptive GOP

1 Manuscript received February 5, 2007; Revised June 12, 2007 This work was supported Electronic Research Institute. Department Computers and Systems, Cairo, Egypt. Abstract-MPEG coding algorithm is a full motion compensated DCT. In MPEG coding, the video sequence first divided into groups of picture of frames (GOP), (I,P,B frames). The algorithm for adaptive GOP length as I frame position, depending on the indexing technique, In This paper an algorithm was developed to variable GOP length which was resulted in minimizing the bit rate with average 10% to 15% from the classical MPEG coding technique while keeping the same SNR with respect to the standard MPEG coding algorithm.

[1]  Rui Zhang,et al.  Optimized video streaming over lossy networks with real-time estimation of end-to-end distortion , 2002, Proceedings. IEEE International Conference on Multimedia and Expo.

[2]  Yun Q. Shi,et al.  Image and Video Compression for Multimedia Engineering , 1999 .

[3]  Bernd Freisleben,et al.  Improving cut detection in MPEG videos by GOP-oriented frame difference normalization , 2004, ICPR 2004.

[4]  Yutaka Yokoyama.  Adaptive GOP structure selection for real-time MPEG-2 video encoding , 2000, Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101).

[5]  Rui Zhang,et al.  Scalable video coding with robust mode selection , 2001, Signal Process. Image Commun..