IVCVOct 23, 2024

Predicting total time to compress a video corpus using online inference systems

arXiv:2410.18260v1h-index: 1VCIP
Originality Incremental advance
AI Analysis

This work addresses resource management for cloud video services and VOD providers by providing more accurate cost predictions for users, though it is incremental as it builds on prior per-clip prediction approaches.

The paper tackled the problem of predicting the total computational cost for compressing an entire video corpus, rather than per-clip estimates, and achieved a prediction error of less than 5%, which is approximately two times better than previous methods.

Predicting the computational cost of compressing/transcoding clips in a video corpus is important for resource management of cloud services and VOD (Video On Demand) providers. Currently, customers of cloud video services are unaware of the cost of transcoding their files until the task is completed. Previous work concentrated on predicting perclip compression time, and thus estimating the cost of video compression. In this work, we propose new Machine Learning (ML) systems which predict cost for the entire corpus instead. This is a more appropriate goal since users are not interested in per-clip cost but instead the cost for the whole corpus. In this work, we evaluate our systems with respect to two video codecs (x264, x265) and a novel high-quality video corpus. We find that the accuracy of aggregate time prediction for a video corpus more than two times better than using per-clip predictions. Furthermore, we present an online inference framework in which we update the ML models as files are processed. A consideration of video compute overhead and appropriate choice of ML predictor for each fraction of corpus completed yields a prediction error of less than 5%. This is approximately two times better than previous work which proposed generalised predictors.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes