Computationally efficient MCTF for MC-EZBC scalable video coding framework

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish
Title of host publicationPattern Recognition and Machine Intelligence - Second International Conference, PReMI 2007, Proceedings
Pages666-673
Number of pages8
Volume4815 LNCS
Publication statusPublished - 2007
Event2nd International Conference on Pattern Recognition and Machine Intelligence, PReMI 2007 - Kolkata, India
Duration: 18-12-200722-12-2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4815 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference2nd International Conference on Pattern Recognition and Machine Intelligence, PReMI 2007
CountryIndia
CityKolkata
Period18-12-0722-12-07

Fingerprint

Scalable video coding
Motion Compensation
Motion compensation
Video Coding
Filtering
Motion Estimation
Motion estimation
Computational complexity
Computational Complexity
Video Compression
Motion
Discrete wavelet transforms
Image compression
Encoder
Wavelet Transform
Framework
Predict

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Karunakar, A. K., & Pai, M. M. M. (2007). Computationally efficient MCTF for MC-EZBC scalable video coding framework. In Pattern Recognition and Machine Intelligence - Second International Conference, PReMI 2007, Proceedings (Vol. 4815 LNCS, pp. 666-673). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4815 LNCS).
Karunakar, A. K. ; Pai, M. M Manohara. / Computationally efficient MCTF for MC-EZBC scalable video coding framework. Pattern Recognition and Machine Intelligence - Second International Conference, PReMI 2007, Proceedings. Vol. 4815 LNCS 2007. pp. 666-673 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{5d98a1bfc3004653b48a5e8e8fc87bf0,
title = "Computationally efficient MCTF for MC-EZBC scalable video coding framework",
abstract = "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.",
author = "Karunakar, {A. K.} and Pai, {M. M Manohara}",
year = "2007",
language = "English",
isbn = "3540770453",
volume = "4815 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "666--673",
booktitle = "Pattern Recognition and Machine Intelligence - Second International Conference, PReMI 2007, Proceedings",

}

Karunakar, AK & Pai, MMM 2007, Computationally efficient MCTF for MC-EZBC scalable video coding framework. in Pattern Recognition and Machine Intelligence - Second International Conference, PReMI 2007, Proceedings. vol. 4815 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4815 LNCS, pp. 666-673, 2nd International Conference on Pattern Recognition and Machine Intelligence, PReMI 2007, Kolkata, India, 18-12-07.

Computationally efficient MCTF for MC-EZBC scalable video coding framework. / Karunakar, A. K.; Pai, M. M Manohara.

Pattern Recognition and Machine Intelligence - Second International Conference, PReMI 2007, Proceedings. Vol. 4815 LNCS 2007. p. 666-673 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4815 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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

ER -

Karunakar AK, Pai MMM. Computationally efficient MCTF for MC-EZBC scalable video coding framework. In Pattern Recognition and Machine Intelligence - Second International Conference, PReMI 2007, Proceedings. Vol. 4815 LNCS. 2007. p. 666-673. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).