MétaCan
Menu
Back to cohort
Record W4402527562 · doi:10.1117/12.3038009

A fast bundle adjustment method based on track selection

2024· article· en· W4402527562 on OpenAlexaff
Changwei Liu, Pingfan Xiong, Luman Yang, Song Chen, Jinquan Hu

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicRobotics and Sensor-Based Localization
Canadian institutionsFuture Earth
Fundersnot available
KeywordsSelection (genetic algorithm)Computer scienceBundleTrack (disk drive)Artificial intelligenceMaterials scienceComposite materialOperating system

Abstract

fetched live from OpenAlex

Bundle adjustment is the core of the Structure from Motion algorithm, and it is also a very time-consuming part, in which redundant observations and initial parameter values with large errors increase the time consumption of the algorithm. In order to improve the efficiency of bundle adjustment, we propose an track selection method based on uniformity, accuracy, coverage and connectivity criteria. Firstly, we divide the space of tracks into several 3D grids. Secondly, we start from the grid with the largest number of tracks, and eliminate the redundant tracks with low connectivity and low accuracy in each grid, while ensuring the connectivity and coverage of tracks. Finally, we use a variety of experimental data to verify this algorithm. The result shows that the algorithm can delete a large number of redundant tracks, and effectively improve the efficiency of the bundle adjustment method on the premise of ensuring the accuracy. When the track retention rate is 0.4, the efficiency of the bundle adjustment method is increased by about 2 times, and the corresponding precision loss value is 0.026.

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.

How this classification was reachedexpand

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.950
Threshold uncertainty score0.412

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.010
GPT teacher head0.246
Teacher spread0.235 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2024
Admission routes1
Has abstractyes

Explore more

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