Comparative Study of Traditional and Deep Learning Feature Detectors and Matchers for Land Vehicle Monocular Visual Odometry
Bibliographic record
Abstract
Visual odometry (VO) enables autonomous navigation for land vehicles by estimating motion through visual data. This paper presents a comparative study of traditional feature detection and matching methods versus deep learning-based approaches in the context of land vehicle visual odometry. In feature detection, we evaluate classical techniques, namely, SIFT and ORB, alongside the state-of-the-art deep learning frameworks SuperPoint and DISK. In feature matching, we compare traditional nearest neighbor matching methods, namely, Fast Library for Approximate Nearest Neighbors (FLANN), Second Nearest Neighbor (SNN), Second Mutual Nearest Neighbor (SMNN), First-to-First Geometrically Inconsistent (FGINN) to the deep learning based Adaptive Locally-Affine Matching(ADALAM), and LightGlue. The study emphasizes performance metrics, including computational efficiency and trajectory estimation accuracy, under varying environmental conditions common in driving scenarios. Our findings highlight the strengths and limitations of each method, demonstrating that while deep learning methods excel in challenging scenarios, traditional techniques remain competitive in specific applications due to their computational simplicity. This work provides valuable insights into selecting and designing feature detection and matching pipelines for robust land vehicle VO systems. Our work provides insights that underscore the importance of tailoring detector-matcher combinations for diverse driving scenarios, balancing accuracy and computational efficiency. We made our implementation open-source at: https://github.com/olaayman/MonocularVisualOdometry.
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 machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.003 | 0.009 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.003 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".