MétaCan
Menu
Back to cohort

Using RGB Information to Improve NDT Distribution Generation and Registration Convergence

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

VenueProceedings of International Conference on Intelligent Unmanned Systems · 2014
Typearticle
Languageen
FieldEngineering
TopicRobotics and Sensor-Based Localization
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsComputer scienceArtificial intelligenceNondestructive testingComputer visionRange (aeronautics)Convergence (economics)Key (lock)Engineering

Abstract

fetched live from OpenAlex

Unmanned vehicles are becoming an inevitability in our society and with them comes the need for highly robust and accurate algorithms to perform their critical functions, such as localization and mapping. The proliferation of these robots into wide spread use requires a generalized, robust SLAM solution. This paper proposes an improved NDT algorithm, which is capable of performing robust, accurate localization and mapping in an broad spectrum of possible environments and with a multitude of different sensors. The method uses a color greedy cluster approach to cluster points and generate Gaussian distributions and then uses an exhaustive color weighted distribution to distribution cost function to optimize the scan alignment. With the addition of these key features to the NDT framework the method is capable of providing accurate results with minimal computation time. Evaluation is performed on both the Freiburg and Ford datasets to demonstrate a multitude of environments and shows robust registration throughout a wide range of environments and viewpoints.

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: Empirical · Consensus signal: none
Teacher disagreement score0.711
Threshold uncertainty score0.677

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.001
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.040
GPT teacher head0.258
Teacher spread0.217 · 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