MétaCan
Menu
Back to cohort
Record W2130580269 · doi:10.1109/3dpvt.2006.16

A Perceptually Driven Model for Transmission of Arbitrary 3D Models over Unreliable Networks

2006· article· en· W2130580269 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
TopicComputer Graphics and Visualization Techniques
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsPolygon meshComputer scienceNetwork packetVertex (graph theory)Transmission (telecommunications)Mesh networkingAlgorithmTheoretical computer scienceTopology (electrical circuits)Computer networkMathematicsComputer graphics (images)Telecommunications

Abstract

fetched live from OpenAlex

3D transmission over unreliable networks needs to take into account the possibility of packet loss. In this work we describe a perceptually motivated strategy for joint transmission of texture and mesh over unreliable networks. The approach is described initially considering regular mesh structure, to show the utility of optimizing the texture-mesh tradeoff. In order to generalize our approach to arbitrary meshes we consider stripification of the mesh, combined with a strategy that does not need texture or vertex packets to be re-transmitted. Only the valence (connectivity) packets need to be re-transmitted; however, storage of valence information requires only 10% space compared to vertices and even less compared to photo-realistic texture. Thus, only less than 5% of the packets may need to be re-transmitted in the worst case to allow our algorithm to successfully reconstruct an acceptable object under severe packet loss. Results showing the implementation of the proposed approach are described.

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: Methods
Teacher disagreement score0.579
Threshold uncertainty score0.460

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.0010.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.020
GPT teacher head0.263
Teacher spread0.243 · 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