MétaCan
Menu
Back to cohort
Record W3195038451 · doi:10.1109/access.2021.3104526

DRVI: Dual Refinement for Video Interpolation

2021· article· en· W3195038451 on OpenAlexafffund
Xuanyi Wu, Zhenkun Zhou, Anup Basu

Bibliographic record

VenueIEEE Access · 2021
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Image Processing Techniques
Canadian institutionsUniversity of Alberta
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsMotion interpolationComputer scienceInterpolation (computer graphics)Artificial intelligenceComputer visionFrame (networking)Frame rateHaarHaar waveletDiscrete wavelet transformImage scalingProcess (computing)AlgorithmWaveletWavelet transformMotion (physics)Video processingImage (mathematics)Video trackingImage processingBlock-matching algorithm

Abstract

fetched live from OpenAlex

The quality of a video clip is considered to be poor if the resolution or the frame rate is low. Video interpolation is thus introduced to enhance video quality and provide a better viewing experience to users. However, there are still some challenges, like the blur caused by motion changes. In this paper, we introduce a dual refinement technique for video interpolation (DRVI). It has three main steps, namely flow refinement, frame synthesis, and Haar refinement. The flow refinement can generate accurate bi-directional flows, which are more suitable for frame interpolation tasks. The Haar refinement uses the Discrete Wavelet Transform (DWT). It can preserve information in different frequency domains and also speed up the learning process. We also add an arbitrary time approximation module to allow multi-frame generation. The number of learnable parameters in our model is much less than existing methods; still, it has excellent performance. Our method is trained on Vimeo90K (Xue et al., 2019) and tested on three well-known datasets to demonstrate its effectiveness.

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 imitation

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

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.002
Version: metacan-v3-hybrid-931329e0061cValidation 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: Methods
Teacher disagreement score0.006
Threshold uncertainty score0.012

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.001
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0020.001
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0030.003

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.047
GPT teacher head0.369
Teacher spread0.322 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

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

Quick stats

Citations1
Published2021
Admission routes2
Has abstractyes

Explore more

Same venueIEEE AccessSame topicAdvanced Image Processing TechniquesFrench-language works237,207