A concealment scheme for H.263 coded video transported over the Internet using the RTPUDPIP protocol
Bibliographic record
Abstract
Packet video with real-time constraints, limited bandwidth, multicast distribution, and using the RTPUDPIP protocol must take into account packet losses (with a large payload size) due to network congestion. An effective solution for packet loss is to perform concealment at the receiver. In this paper, we propose a concealment scheme for the 'I' frame missing odd or even slices that address the above problems. The proposed concealment scheme uses the previous frame macroblock (MB) or the MB motion vector (MV) with a fast motion estimation algorithm, located at the same spatial location as the missing MB. The decision between the MB or MB MV with a fast motion estimation algorithm is determined by the amount of motion between the decoded upper and lower 1 pixel wide boundary (if available) of the missing MB and the MB located in same spatial location in the previous frame. The proposed scheme produced similar peak signal to noise ratio (PSNR) results while the Central Processing Unit (CPU) time is reduced by a factor of 30 when compared to the full search concealment technique.
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.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 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.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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 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".