mlsanityData to 14 Oct 2026

ForestVO: Enhancing Visual Odometry in Forest Environments through ForestGlue

arXiv 2504.01261 ↗First posted 2 Apr 2025cs.RO cs.CVcited by 3

Not on the map. Why?

Abstract (arXiv)

Recent advancements in visual odometry systems have improved autonomous navigation; however, challenges persist in complex environments like forests, where dense foliage, variable lighting, and repetitive textures compromise feature correspondence accuracy. To address these challenges, we introduce ForestGlue, enhancing the SuperPoint feature detector through four configurations - grayscale, RGB, RGB-D, and stereo-vision - optimised for various sensing modalities. For feature matching, we employ LightGlue or SuperGlue, retrained with synthetic forest data. ForestGlue achieves comparable pose estimation accuracy to baseline models but requires only 512 keypoints - just 25% of the baseline's 2048 - to reach an LO-RANSAC AUC score of 0.745 at a 10deg threshold. With only a quarter of keypoints needed, ForestGlue significantly reduces computational overhead, demonstrating effectiveness in dynamic forest environments, and making it suitable for real-time deployment on resource-constrained platforms. By combining ForestGlue with a transformer-based pose estimation model, we propose ForestVO, which estimates relative camera poses using matched 2D pixel coordinates between frames. On challenging TartanAir forest sequences, ForestVO achieves an average relative pose error (RPE) of 1.09 m and a kittiscore of 2.33%, outperforming direct-based methods like DSO by 40% in dynamic scenes. Despite using only 10% of the dataset for training, ForestVO maintains competitive performance with TartanVO while being a significantly lighter model. This work establishes an end-to-end deep learning pipeline specifically tailored for visual odometry in forested environments, leveraging forest-specific training data to optimise feature correspondence and pose estimation, thereby enhancing the accuracy and robustness of autonomous navigation systems.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 20 of its 50 references that are in the map. First posted on arXiv 2 Apr 2025.

Builds on

20 of 50 references.

References · 20

  1. 2019SuperGlue: Learning Feature Matching with Graph Neural Networkscited by 1,443
  2. 2017SuperPoint: Self-Supervised Interest Point Detection and Descriptioncited by 1,320
  3. 2018On the Continuity of Rotation Representations in Neural Networkscited by 1,214
  4. 2015ORB-SLAM: a Versatile and Accurate Monocular SLAM Systemcited by 988
  5. 2021LoFTR: Detector-Free Local Feature Matching with Transformerscited by 984
  6. 2018MegaDepth: Learning Single-View Depth Prediction from Internet Photoscited by 737
  7. 2023LightGlue: Local Feature Matching at Light Speedcited by 590
  8. 2020TartanAir: A Dataset to Push the Limits of Visual SLAMcited by 506
  9. 2016Direct Sparse Odometrycited by 485
  10. 2020DISK: Learning local features with policy gradientcited by 312
  11. 2018Revisiting Oxford and Paris: Large-Scale Image Retrieval Benchmarkingcited by 191
  12. 2017DeepVO: Towards End-to-End Visual Odometry with Deep Recurrent Convolutional Neural Networkscited by 175
8 more
  1. 2020TartanVO: A Generalizable Learning-based VOcited by 108
  2. 2024AirSLAM: An Efficient and Illumination-Robust Point-Line Visual SLAM Systemcited by 26
  3. 2019Search and Rescue under the Forest Canopy using Multiple UAVscited by 7
  4. 2023LiDAR Odometry Survey: Recent Advancements and Remaining Challengescited by 7
  5. 2025Image as an IMU: Estimating Camera Motion from a Single Motion-Blurred Imagecited by 5
  6. 2024Aerial Tensile Perching and Disentangling Mechanism for Long-Term Environmental Monitoringcited by 4
  7. 2024Scalable Outdoors Autonomous Drone Flight with Visual-Inertial SLAM and Dense Submaps Built without LiDARcited by 3
  8. 2019Visual Appearance Analysis of Forest Scenes for Monocular SLAMcited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 2; 2026: 1.

3 papers.