Efficient Bitrate Ladder Construction using Transfer Learning and Spatio-Temporal Features

Ali Falahati, Mohammad Karim Safavi, Ardavan Elahi, Farhad Pakdaman, Moncef Gabbouj
1/6/2024
cs.MMcs.CVcs.LG

No confident code implementation found for this paper.

Abstract

Providing high-quality video with efficient bitrate is a main challenge in video industry. The traditional one-size-fits-all scheme for bitrate ladders is inefficient and reaching the best content-aware decision computationally impractical due to extensive encodings required. To mitigate this, we propose a bitrate and complexity efficient bitrate ladder prediction method using transfer learning and spatio-temporal features. We propose: (1) using feature maps from well-known pre-trained DNNs to predict rate-quality behavior with limited training data; and (2) improving highest quality rung efficiency by predicting minimum bitrate for top quality and using it for the top rung. The method tested on 102 video scenes demonstrates 94.1% reduction in complexity versus brute-force at 1.71% BD-Rate expense. Additionally, transfer learning was thoroughly studied through four networks and ablation studies.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{falahati2024efficient,
  title  = {Efficient Bitrate Ladder Construction using Transfer Learning and Spatio-Temporal Features},
  author = {Ali Falahati and Mohammad Karim Safavi and Ardavan Elahi and Farhad Pakdaman and Moncef Gabbouj},
  year   = {2024},
  eprint = {2401.03195},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2401.03195v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2401.03195.svg)](https://codeofpaper.com/paper/2401.03195)

Discussion