MétaCan
Menu
Back to cohort
Record W2165535192 · doi:10.1109/ipccc.2001.918671

Cluster-based smoothing for MPEG-based video-on-demand systems

2002· article· en· W2165535192 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicVideo Coding and Compression Technologies
Canadian institutionsUniversity of Saskatchewan
Fundersnot available
KeywordsComputer scienceSmoothingCluster analysisBandwidth (computing)Real-time computingExploitMPEG-4Frame (networking)Transmission (telecommunications)BitstreamComputer networkComputer visionArtificial intelligenceAlgorithmDecoding methodsTelecommunications

Abstract

fetched live from OpenAlex

This paper proposes a new technique called cluster-based smoothing to reduce the average per-stream effective bandwidth for the transmission of MPEG compressed video streams. By rearranging the transmission order of frames within windows, the technique exploits the periodic structure of an MPEG video stream, and the bit rate fluctuations across scenes. Trace-driven simulation with empirical MPEG video traces is used to demonstrate the performance advantages of the new technique. The results show that clustering based on frame types in an MPEG video can significantly reduce the per-stream effective bandwidth, particularly when clustering is combined with a modest level of inter-frame smoothing at the VOD source. The buffering and delay requirements associated with cluster-based smoothing are also quantified, and found to be reasonable.

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 imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.960
Threshold uncertainty score0.610

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.044
GPT teacher head0.249
Teacher spread0.205 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it