Application of locality sensitive hashing to realtime loop closure detection
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.
Bibliographic record
Abstract
In this work we present a new approach for detecting loop closures in a real-time online setting. The Loop Closure Detection problem is important in visual SLAM applications and different approaches exist to deal with this problem. Most of these approaches are based on the Bag-of-Words approach, and assume a fixed visual vocabulary can work in different types of environments. However BOW is known to introduce perceptual aliasing. By using Locality Sensitive Hashing (LSH) we are able to compute image similarity and detect loop closures by using visual features directly without vector quantization as in BOW and also LSH does not require a prior visual vocabulary. We show the effectiveness of our approach empirically by comparing it to the Bag of Words (BOW) approach which is the dominant method of selecting candidate loop closing images. Our method is fast enough for realtime applications and its accuracy is significantly better than the BOW approach.
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it