MétaCan
Menu
Back to cohort
Record W1606690892 · doi:10.1109/icip.2004.1419465

Concealment of interpolation errors for low bit-rate motion compensated interpolation

2005· article· en· W1606690892 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 institutionsConcordia University
Fundersnot available
KeywordsInterpolation (computer graphics)Computer scienceComputer visionArtificial intelligenceMotion estimationQuarter-pixel motionMotion compensationMotion interpolationMotion vectorBlock (permutation group theory)PixelFrame (networking)Frame rateStairstep interpolationMultivariate interpolationBlock-matching algorithmAlgorithmMotion (physics)MathematicsBilinear interpolationImage (mathematics)Video processingVideo tracking

Abstract

fetched live from OpenAlex

In this paper, we propose a low cost motion-compensated interpolation technique to improve the video quality for the low bit-rate video encoded in conjunction with frame dropping. The proposed approach exploits the block-based motion vector field available to the decoder to avoid the complex motion estimation at the receiver. An iterative refinement technique derived using the finite element method is employed to efficiently conceal the interpolation errors caused by unfilled and overlapped pixels in the predicted frames. Consequently, no pixel classification is needed in the proposed technique, thus substantially reducing the computational complexity. Simulation results show that this technique results in reconstructed frames with good visual quality.

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.841
Threshold uncertainty score0.344

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.0000.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.028
GPT teacher head0.278
Teacher spread0.250 · 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