MétaCan
Menu
Back to cohort
Record W1991172836 · doi:10.1145/1370256.1370287

Multi-view 3D scanned data registration

2008· article· en· W1991172836 on OpenAlex
Sushil Bhakar, Ran Wang, Sudhir P. Mudur

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.
fundA Canadian funder is recorded on the work.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicRobotics and Sensor-Based Localization
Canadian institutionsConcordia University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsImage registrationComputer scienceArtificial intelligenceMinificationComputer visionObject (grammar)AlgorithmMean squared errorPoint (geometry)Noise (video)Image (mathematics)MathematicsStatistics

Abstract

fetched live from OpenAlex

We propose a new algorithm for registering 3D scans obtained from different views of an object. Our work differs from the popular ICP based approach since we minimize error in signed distance function instead of squared distance between sampled surface points themselves. Our experiments show that this yields a fast and robust method of registering 3D scans into a single 3D model, firstly by simplifying point correspondence step, secondly by requiring fewer registration steps and lastly by using nonlinear optimization (the Levenberg-Marquardt algorithm) for error minimization, making the registration converge in fewer iterations. Our approach is also independent of the sampling resolution and works well in the presence of noise. We also believe that the distance-based error formulation lends itself much better for simultaneous registration of multiple overlapping views.

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

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.080
GPT teacher head0.254
Teacher spread0.174 · 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

Quick stats

Citations1
Published2008
Admission routes2
Has abstractyes

Explore more

Same topicRobotics and Sensor-Based LocalizationFrench-language works237,207