MétaCan
Menu
Back to cohort
Record W2145536383 · doi:10.2312/hpg.20141093

A Fast and Stable Feature-Aware Motion Blur Filter

2014· article· en· W2145536383 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

VenueEurographics · 2014
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Vision and Imaging
Canadian institutionsUniversité de Montréal
Fundersnot available
KeywordsComputer scienceMotion blurComputer visionArtificial intelligenceRendering (computer graphics)AnimationAliasingMotion interpolationComputer graphics (images)Filter (signal processing)Block-matching algorithmImage (mathematics)Video processingVideo tracking

Abstract

fetched live from OpenAlex

High-quality motion blur is an increasingly important effect in interactive graphics however, even in the context of offline rendering, it is often approximated as a post process. Recent motion blur post-processes (e.g., [MHBO12, Sou13]) generate plausible results with interactive performance, however distracting artifacts still remain in the presence of e.g. overlapping motion or large- and fine-scale motion features.We address these artifacts with a more robust sampling and filtering scheme with only a small additional runtime cost. We render plausible, temporallycoherent motion blur on several complex animation sequences, all in under 2ms at a resolution 1280 x 720. Moreover, our filter is designed to integrate seamlessly with post-process anti-aliasing and depth of field.

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: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.929
Threshold uncertainty score0.337

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.010
GPT teacher head0.235
Teacher spread0.225 · 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