Complexity management for video encoders

ABSTRACT

Computational complexity is an important performance constraint for software-only video CODECs. The aim of this research is to develop a video coding system with variable, controllable computational complexity. Adaptive algorithms for DCT and motion estimation are proposed separately to reduce complexity of each function and maintain it at target level. An integrated approach to video CODEC complexity management is also addressed. This work will have potential benefit for a wide range of computation-constrained or power-constrained multimedia applications.

REFERENCES

• 1: Daby Sow and Alexandros Eleftheriadis, "Complexity Distortion Theory", ISIT, June 1997, Ulm Germany
• 2: Iain E G Richardson and Yafan Zhao, "Video CODEC Complexity Management", Proc. Picture Coding Symposium, April 2001
• 3: Iain E G Richardson and Yafan Zhao, "Adaptive Algorithms for Variable-complexity Video Coding", Proc. ICIP01, September 2001
• 4: Iain E G Richardson and Yafan Zhao, "Adaptive management of Video Encoder complexity", Journal of Real-time Imaging (accepted in 2001)
• 5: I-M Pao and M-T Sun, "Modelling DCT Coefficients for Fast Video Encoding", IEEE Trans. Circuits and Systems for Video Technology, June 1999
• 6: M Gallant, G Côté and F Kossentini, "An Efficient Computation-Constrained Block-Based Motion Estimation Algorithm for Low Bit Rate Video Coding", IEEE Trans. Image Processing 8(12), December 1999
• 7: Video Coding Experts Group, ITU, "Video Codec Test Model, Version 8 (TMN8)", June 1997
• 8: Y. Zhao , I. Richardson, Computational Complexity Management of Motion Estimation in Video Encoders, Proceedings of the Data Compression Conference (DCC '02), p.483, April 02-04, 2002