Rate-distortion optimization for full-reference image quality metrics via stochastic Hessian estimates
Samuel Fernández-Menduiña, Eduardo Pavez, Antonio Ortega
University of Southern California
Published September 24, 2026 · on the feed September 25, 2026 · ▲ 4 · arXiv 2609.30077
The abstract
Block-based video codecs select coding parameters based on the input by optimizing a rate-distortion trade-off. The conventional distortion choice, the sum of squared errors (SSE), simplifies parameter selection: the SSE is the sum of block-wise SSEs, so rate-distortion optimization (RDO) can treat blocks independently. Alternatively, full-reference image quality assessment (FR-IQA) metrics such as MS-SSIM or LPIPS often align better with the human visual system than SSE, but they cannot be used in-loop: they do not decompose block-wise and typically require the fully decoded image as input. Building on existing results in metric quadratization, we approximate a broad class of FR-IQA metrics by an input-dependent quadratic distortion (IDQD), whose quadratic form matrix is derived from the Hessian of the metric evaluated at the source video. To make the distortion computable block-wise, we propose two approximations of the Hessian matrix: 1) keeping the block-diagonal, and 2) keeping only its diagonal. We propose estimators for both that require only matrix-vector products with the Hessian obtained by automatic differentiation. Across five metrics for Kodak and CLIC in VVC, IDQD-RDO achieves 14.2-36.7 % BD-rate savings under the target metric with no decoder changes and incurs 10-30 % encoding complexity overhead.
The Brief
2:24A short podcast summary of the paper. Written and voiced by AI.
Transcript
Rate-distortion optimization for full-reference image quality metrics via stochastic Hessian estimates. By Samuel Fernández-Menduiña and two others, from the University of Southern California. Published on the twenty-fourth of September. Its code repository is public and real: about thirty-five source files.
A block-based video codec chooses its coding parameters by optimizing a trade-off between rate and distortion. The usual distortion is the sum of squared errors, and its appeal is structural. The error for a whole frame is simply the sum of the errors for each block, so rate-distortion optimization can treat every block independently. Full-reference image quality metrics, such as MS-SSIM or LPIPS, often agree better with the human visual system. But they cannot be used inside the coding loop. They do not break apart block by block, and they typically need the fully decoded image as input. A better yardstick exists, and the encoder cannot hold it.
The authors build on existing results in metric quadratization. A broad class of these metrics is approximated by an input-dependent quadratic distortion, called IDQD. Its quadratic form matrix comes from the Hessian of the metric, evaluated at the source video. The target metric is replaced, near the source, by a quadratic stand-in that is shaped to match it.
A quadratic form over the whole image still does not split into blocks, so the Hessian itself has to be simplified. Two approximations are proposed. The first keeps the block-diagonal part of the matrix. The second keeps only its diagonal. For both, the authors propose estimators that need nothing more than matrix-vector products with the Hessian, and those products come from automatic differentiation. The title calls these stochastic Hessian estimates.
Testing spans five metrics, on Kodak and on CLIC, inside VVC. Under the target metric, IDQD-RDO achieves bit-rate savings, measured as BD-rate, between fourteen point two percent and thirty-six point seven percent. The decoder is unchanged. The cost falls on the encoder, as an added encoding complexity of ten to thirty percent.
The contribution is a translation. A perceptual metric that a codec could not use becomes a distortion it can, because the quadratic approximation, trimmed to the block-diagonal or the diagonal, restores the one property the encoder depends on: each block can be scored on its own. The savings are paid for at the encoder and nowhere else.
Paper Quest · 7 chapters · about 39 min
Play this paper
Learn it by doing: make the calls the authors made, guess the result before you see it, and defend it in a viva graded on your own words. Chapter 1 is right here.
Chapter 1 🧩 · The problem
A better yardstick exists, and the encoder cannot hold it.
You tune a block-based video encoder. For every block it picks coding settings by trading bits against error, and the error is the sum of squared differences.
The road ahead
- 1 · The problem ~6 min An encoder decides each block alone because squared error adds up block by block, but better perceptual metrics need the whole decoded image.
- 2 · What came before ~3 min
- 3 · The key idea ~8 min Near the source image, replace the metric with a quadratic built from its Hessian, trimmed so it splits by block and estimated with random probes.
- 4 · Choose your own research ~3 min
- 5 · Build the method ~8 min Build a quadratic from the metric's Hessian, probe the Hessian by automatic differentiation, estimate its blocks or diagonal, and use that in place of squared error.
- 6 · The experiment ~6 min You’ll guess: Optimizing video coding for perceptual metrics saved bit rate. What did it cost?
- 7 · The viva ~5 min Three questions from the examiners, answered in your own words. Win it for the paper’s trophy.
Free, with Google or an email address. Your stars and progress are kept.