Accelerating M-JPEG compression with temporal information

Software implementation of multimedia compression is an enabling technology for the widespread use of computer based multimedia communications. M-JPEG offers reasonable compression at reasonable computational cost. This paper presents modifications to the well-known JPEG compression algorithm to achieve a 60 - 70% speedup of digital video compression. The scheme presented exploits dependencies between frames to predict the DCT coefficients in a frame based on previous frames in the sequence. This knowledge is used to reduce the computational complexity of the DCT transforms. The process-based approach introduces only a mild overhead of about 0.4% into the compression. Performance measurements with real video sequences demonstrate the increased performance of the modified JPEG process for digital video.

[1]  N. Ahmed,et al.  Discrete Cosine Transform , 1996 .

[2]  Wen-Hsiung Chen,et al.  A Fast Computational Algorithm for the Discrete Cosine Transform , 1977, IEEE Trans. Commun..

[3]  F. W. Mounts.  A video encoding system with conditional picture-element replenishment , 1969 .

[4]  Konrad Froitzheim,et al.  Knowledge-based approach to JPEG acceleration , 1995, Electronic Imaging.

[5]  Konrad Froitzheim,et al.  WebVideo. A tool for WWW-based teleoperation , 1997, ISIE '97 Proceeding of the IEEE International Symposium on Industrial Electronics.

[6]  P. W. Jones,et al.  Digital Image Compression Techniques , 1991 .

[7]  Ephraim Feig,et al.  New scaled DCT algorithms for fused multiply/add architectures , 1991, [Proceedings] ICASSP 91: 1991 International Conference on Acoustics, Speech, and Signal Processing.