Combining distributed video coding with super-resolution to achieve H.264/AVC performance
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
Distributed video coding (DVC) is an emerging video coding paradigm for systems that require low-complexity encoders that are supported by high-complexity decoders as required, for example, in real-time video capture and streaming from one mobile phone to another. Under the assumption of an error-free transmission channel, the coding efficiency of current DVC systems is still below that of the latest video codecs, such as H.264/AVC. In order to increase the coding efficiency, we propose that every Wyner-Ziv frame be downsampled by a factor of two prior to encoding and the subsequent transmission. However, this would necessitate upsampling in conjunction with interpolation at the decoder. Simple interpolation (e.g., a bilinear or bicubic filter) would be insufficient because the high-frequency (HF) spatial image content would be missing. Instead, we propose the incorporation of a super-resolution (SR) technique based upon the example-based scene-specific method to allow this HF content to be recovered. The SR technique will add computational complexity to the decoder side of the DVC system, which is allowable within the DVC framework. Rate-distortion curves show that this novel combination of SR and DVC improves the system's peak signal-to-noise ratio (PSNR) performance by up to several decibels and can actually exceed the performance of the H.264/AVC codec when GOP = IP for some video sequences.
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.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.004 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| 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