TY - GEN
T1 - Computationally efficient MCTF for MC-EZBC scalable video coding framework
AU - Karunakar, A. K.
AU - Pai, M. M Manohara
PY - 2007
Y1 - 2007
N2 - The discrete wavelet transforms (DWTs) applied temporally under motion compensation (i.e. Motion Compensation Temporal Filtering (MCTF)) has recently become a very powerful tool in scalable video compression, especially when implemented through lifting. The major bottleneck for speed of the encoder is the computational complexity of the bidirectional motion estimation in MCTF. This paper proposes a novel predictive technique to reduce the computational complexity of MCTF. In the proposed technique the temporal filtering is done without motion compensation. The resultant high frequency frames are used to predict the blocks under motion. Motion estimation is carried out only for the predicted blocks under motion. This significantly reduces the number of blocks that undergoes motion estimation and hence the computationally complexity of MCTF is reduced by 44% to 92% over variety of standard test sequences without compromising the quality of the decoded video. The proposed algorithm is implemented in MC-EZBC, a 3D-subband scalable video coding system.
AB - The discrete wavelet transforms (DWTs) applied temporally under motion compensation (i.e. Motion Compensation Temporal Filtering (MCTF)) has recently become a very powerful tool in scalable video compression, especially when implemented through lifting. The major bottleneck for speed of the encoder is the computational complexity of the bidirectional motion estimation in MCTF. This paper proposes a novel predictive technique to reduce the computational complexity of MCTF. In the proposed technique the temporal filtering is done without motion compensation. The resultant high frequency frames are used to predict the blocks under motion. Motion estimation is carried out only for the predicted blocks under motion. This significantly reduces the number of blocks that undergoes motion estimation and hence the computationally complexity of MCTF is reduced by 44% to 92% over variety of standard test sequences without compromising the quality of the decoded video. The proposed algorithm is implemented in MC-EZBC, a 3D-subband scalable video coding system.
UR - http://www.scopus.com/inward/record.url?scp=38149044936&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=38149044936&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:38149044936
SN - 3540770453
SN - 9783540770459
VL - 4815 LNCS
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 666
EP - 673
BT - Pattern Recognition and Machine Intelligence - Second International Conference, PReMI 2007, Proceedings
T2 - 2nd International Conference on Pattern Recognition and Machine Intelligence, PReMI 2007
Y2 - 18 December 2007 through 22 December 2007
ER -