MétaCan
Menu
Back to cohort
Record W2058594225 · doi:10.1109/ccece.2008.4564784

Dynamic programming approach to high frame-rate stereo correspondence: A pipelined architecture implemented on a field programmable gate array

2008· article· en· W2058594225 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.
venuePublished in a venue whose home country is Canada.

Bibliographic record

VenueConference proceedings - Canadian Conference on Electrical and Computer Engineering · 2008
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Vision and Imaging
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsField-programmable gate arrayFrame rateGate arrayComputer scienceFrame (networking)ArchitectureSoftwareComputer hardwareDynamic programmingField (mathematics)Hardware architectureParallel computingComputer architectureComputational scienceArtificial intelligenceAlgorithmMathematicsProgramming language

Abstract

fetched live from OpenAlex

Estimation of depth within an imaged scene can be formulated as a stereo correspondence problem. Typical software solutions tend to be too slow for high frame rate (i.e. ges 30 fps) performance. Equivalent hardware solutions, however, can result in marked improvements. This paper explores one such pipelined hardware implementation that generates dense binocular disparity (depth) estimates at frame rates of up to 200 fps or more. The architecture is based on a dynamic programming maximum likelihood (DPML) formulation developed by Cox et al. [1996]. A field programmable gate array (FPGA) implementation of this architecture demonstrates equivalent accuracy while executing at significantly higher frame rates. It is noted that the architecture holds potential for more generalized hardware implementations of dynamic programming solutions [W. James et al.].

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: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.986
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0000.000
Scholarly communication0.0010.000
Open science0.0010.000
Research integrity0.0000.001
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.013
GPT teacher head0.225
Teacher spread0.212 · 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