Three-dimensional lifting schemes for motion compensated video compression
ICASSP '01 Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03
Complete-to-overcomplete discrete wavelet transforms: theory and applications
IEEE Transactions on Signal Processing
Motion-compensated 3-D subband coding of video
IEEE Transactions on Image Processing
Motion estimation using low-band-shift method for wavelet-based moving-picture coding
IEEE Transactions on Image Processing
Overview of the H.264/AVC video coding standard
IEEE Transactions on Circuits and Systems for Video Technology
Complexity scalable motion compensated wavelet video encoding
IEEE Transactions on Circuits and Systems for Video Technology
Hi-index | 0.01 |
Scalable wavelet-based video codecs based on motion-compensated temporal filtering (MCTF) require complexity scalability to cope with the growing heterogeneity of devices on which video has to be processed. The computational and memory complexity of two spatial-domain (SD) MCTF and in-band (IB) MCTF video codec instantiations are examined in this paper. Comparisons in terms of complexity versus performance are presented for both types of codecs. Some of the trade-offs between complexity and coding performance are analyzed and it is indicated how complexity scalability can be achieved in such video-codecs. Furthermore, a new approach is presented to obtain complexity scalability in IBMCTF video coding, by targeting the complexity of the complete-to-overcomplete discrete wavelet transform at the cost of a limited and controllable penalty on the overall coding performance.