Distributed video coding without channel codes
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 allows the compression of video frames in a distributed fashion leading to a rather simple computational encoding, but requiring a complex decoding. The main drawback however is the decoding complexity making some practical applications difficult. Nowadays, most distributed video coding schemes are based on efficient channel codes such as LDPC and Turbo codes. This is the main cause of the decoder's high complexity. This paper proposes a new distributed video coding scheme that can avoid the use of such codes. It is based on an adaptive representation of the source frames combined with a DC-guided scheme. This combination can reduce the data that need to be transmitted from the encoder to the decoder. This subsequently allows complex channel coding to be replaced by simple entropic coding methods, such as arithmetic source coding, with little performance degradation. Experimental results show that the proposed scheme can significantly improve the performance compared to conventional distributed video coding schemes, while enabling a much lower computational complex decoder.
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