Efficient Region-Wise Packing of Stereoscopic ERP Videos Based on Information Loss Minimization
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Utilizing frame-compatible (FC) formats for packing stereoscopic videos often comes with challenges, as they require higher transmission bandwidth and larger memory buffers on the decoder compared to single-view videos. When it comes to stereoscopic 360° videos, as the primary content consumed by virtual reality (VR) applications, these requirements become even more challenging since they ask for ultra-high-resolution formats with high frame rates (e.g., 6K, 8K, or 12K at 100 frames per second). To address these challenges, sub-sampled versions of the left and right views are usually used to form the spatial FC format, leading to a loss of visual quality. In this paper, we propose an efficient region-wise packing method for equirectangular projection (ERP) videos with minimum information loss by exploiting the uneven sampling characteristic of ERP. Moreover, we propose a content-adaptive (CA) packing method for ERP videos, where the sizes of partitions, each with a particular horizontal downsampling factor, are adaptively determined based on spatial complexity. We then utilize a low-complexity frequency-domain approach to estimate the optimal partition sizes of the CA packing. We use these proposed methods to determine optimal packing of the stereoscopic ERP videos in the FC format. Experimental results, using the VVenC Versatile Video Coding (VVC) encoder, show that compared with the standard side-by-side (SbS) format, with uniform horizontal half-downsampling (UHHDS), the proposed CA packing method provides an average 13.84% and 12.02% Bjøntegaard-Delta bitrate (BD-BR) reduction for Random Access (RA) and Low Delay B (LDB) configurations, respectively, with an average encoding time comparable to SbS. In addition, when the performance is measured based on user attention probability, using the Laplacian Distribution model, the coding performance of our proposed packing methods outperforms the state-of-the-art packing method with significantly lower computational complexity.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it