MétaCan
Menu
Back to cohort
Record W2145992751 · doi:10.1109/iscas.2000.858848

Least-squares trilinear interpolation for digital video coding

2002· article· en· W2145992751 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
TopicDigital Filter Design and Implementation
Canadian institutionsUniversity of Calgary
Fundersnot available
KeywordsInterpolation (computer graphics)Stairstep interpolationComputer scienceTrilinear interpolationMultivariate interpolationBilinear interpolationVideo post-processingAlgorithmNearest-neighbor interpolationDemosaicingComputer visionCoding (social sciences)Bicubic interpolationGridArtificial intelligenceMathematicsImage processingMultiview Video CodingImage (mathematics)Video processingVideo trackingStatisticsBinary image

Abstract

fetched live from OpenAlex

When using digital images or video, the amount of storage space or transmission bandwidth required can be quite large when the media is in its raw form. An adaptive sampling and interpolation video coding method, employing least-squares trilinear interpolation is introduced. A recursive splitting method that creates an adaptive sampling grid, is described, along with a discussion concerning the interpolation of these samples for the reconstruction of the image sequence. An error-minimizing step that reduces the interpolation error during coding of the sequence is introduced and results are presented.

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.976
Threshold uncertainty score0.673

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.0010.002
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.063
GPT teacher head0.276
Teacher spread0.213 · 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

Quick stats

Citations1
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicDigital Filter Design and ImplementationFrench-language works237,207