Efficient MPEG-4 to H.264 transcoding exploiting MPEG-4 block modes, motion vectors, and residuals
Bibliographic record
Abstract
In this paper, we present an efficient algorithm to transcode MPEG-4 to H.264. The algorithm exploits the information decoded from the MPEG-4 stream to reduce H.264 encoding complexity. This information includes the MPEG-4 block modes, motion vectors, and residuals. The algorithm proceeds in two steps. First, a small set of most probable H.264 block mode candidates are obtained from an MPEG-4 to H.264 block mode conversion table. Then, motion estimation is performed for the candidate modes where, based on the residual information, the MPEG-4 motion vectors are either reused or refined. Experimental results show that the algorithm can speed-up the transcoding of QCIF and CIF sequences, from MPEG-4 visual simple to H.264 baseline profiles, by a factor of 2 to 3, with an acceptable loss in quality compared to the cascade spatial domain transcoding approach. It also provides significantly improved quality relative to current state-of-the-art methods.
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.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".