MétaCan
Menu
Back to cohort

Shadowing Dynamic Scenes with Arbitrary BRDFs

2009· article· en· W2074930180 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

VenueComputer Graphics Forum · 2009
Typearticle
Languageen
FieldComputer Science
TopicComputer Graphics and Visualization Techniques
Canadian institutionsUniversity of Toronto
FundersNational Science Foundation
KeywordsVisibilityBidirectional reflectance distribution functionComputer scienceRepresentation (politics)Computer visionAnimationComputer graphics (images)Artificial intelligenceComputationHeuristicsOn the flyProduct (mathematics)ReflectivityAlgorithmOpticsMathematicsGeometry

Abstract

fetched live from OpenAlex

Abstract We present a real‐time relighting and shadowing method for dynamic scenes with varying lighting, view and BRDFs. Our approach is based on a compact representation of reflectance data that allows for changing the BRDF at run‐time and a data‐driven method for accurately synthesizing self‐shadows on articulated and deformable geometries. Unlike previous self‐shadowing approaches, we do not rely on local blocking heuristics. We do not fit a model to the BRDF‐weighted visibility, but rather only to the visibility that changes during animation. In this manner, our model is more compact than previous techniques and requires less computation both during fitting and at run‐time. Our reflectance product operators can re‐integrate arbitrary low‐frequency view‐dependent BRDF effects on‐the‐fly and are compatible with all previous dynamic visibility generation techniques as well as our own data‐driven visibility model. We apply our reflectance product operators to three different visibility generation models, and our data‐driven model can achieve framerates well over 300Hz.

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 categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.858
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.002
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0020.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.009
GPT teacher head0.253
Teacher spread0.244 · 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