Linearizing a no-reference quality metric around the uncompressed input yields a block-wise rate-distortion cost that reduces bitrate by more than 30% versus SSE-based RDO on the metric being optimized.
Rate distortion optimization over large scale video corpus with machine learning
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
We present an efficient codec-agnostic method for bitrate allocation over a large scale video corpus with the goal of minimizing the average bitrate subject to constraints on average and minimum quality. Our method clusters the videos in the corpus such that videos within one cluster have similar rate-distortion (R-D) characteristics. We train a support vector machine classifier to predict the R-D cluster of a video using simple video complexity features that are computationally easy to obtain. The model allows us to classify a large sample of the corpus in order to estimate the distribution of the number of videos in each of the clusters. We use this distribution to find the optimal encoder operating point for each R-D cluster. Experiments with AV1 encoder show that our method can achieve the same average quality over the corpus with $22\%$ less average bitrate.
citation-role summary
citation-polarity summary
fields
eess.IV 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Rate-Distortion Optimization with Non-Reference Metrics for UGC Compression
Linearizing a no-reference quality metric around the uncompressed input yields a block-wise rate-distortion cost that reduces bitrate by more than 30% versus SSE-based RDO on the metric being optimized.