mlsanityData to 14 Oct 2026

Geometry-Aware Feature Matching for Large-Scale Structure from Motion

arXiv 2409.02310 ↗First posted 3 Sep 2024cs.CVcited by 3

Not on the map. Why?

Abstract (arXiv)

Establishing consistent and dense correspondences across multiple images is crucial for Structure from Motion (SfM) systems. Significant view changes, such as air-to-ground with very sparse view overlap, pose an even greater challenge to the correspondence solvers. We present a novel optimization-based approach that significantly enhances existing feature matching methods by introducing geometry cues in addition to color cues. This helps fill gaps when there is less overlap in large-scale scenarios. Our method formulates geometric verification as an optimization problem, guiding feature matching within detector-free methods and using sparse correspondences from detector-based methods as anchor points. By enforcing geometric constraints via the Sampson Distance, our approach ensures that the denser correspondences from detector-free methods are geometrically consistent and more accurate. This hybrid strategy significantly improves correspondence density and accuracy, mitigates multi-view inconsistencies, and leads to notable advancements in camera pose accuracy and point cloud density. It outperforms state-of-the-art feature matching methods on benchmark datasets and enables feature matching in challenging extreme large-scale settings.

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

Builds on

28 of 50 references.

References · 28

  1. 20233D Gaussian Splatting for Real-Time Radiance Field Renderingcited by 6,226
  2. 2019SuperGlue: Learning Feature Matching with Graph Neural Networkscited by 1,443
  3. 2017SuperPoint: Self-Supervised Interest Point Detection and Descriptioncited by 1,320
  4. 2021LoFTR: Detector-Free Local Feature Matching with Transformerscited by 984
  5. 2018MegaDepth: Learning Single-View Depth Prediction from Internet Photoscited by 737
  6. 2023LightGlue: Local Feature Matching at Light Speedcited by 590
  7. 2016LIFT: Learned Invariant Feature Transformcited by 306
  8. 2023RoMa: Robust Dense Feature Matchingcited by 302
  9. 2017HPatches: A benchmark and evaluation of handcrafted and learned local descriptorscited by 264
  10. 2020Image Matching across Wide Baselines: From Paper to Practicecited by 225
  11. 2021Pixel-Perfect Structure-from-Motion with Featuremetric Refinementcited by 200
  12. 2022DKM: Dense Kernelized Feature Matching for Geometry Estimationcited by 177
16 more
  1. 2018Neighbourhood Consensus Networkscited by 174
  2. 2022ASpanFormer: Detector-Free Image Matching with Adaptive Span Transformercited by 171
  3. 2020Patch2Pix: Epipolar-Guided Pixel-Level Correspondencescited by 129
  4. 2022MatchFormer: Interleaving Attention in Transformers for Feature Matchingcited by 126
  5. 2023ALIKED: A Lighter Keypoint and Descriptor Extraction Network via Deformable Transformationcited by 121
  6. 2024Efficient LoFTR: Semi-Dense Local Feature Matching with Sparse-Like Speedcited by 120
  7. 2022RelPose: Predicting Probabilistic Relative Rotation for Single Objects in the Wildcited by 102
  8. 2020Efficient Neighbourhood Consensus Networks via Submanifold Sparse Convolutionscited by 93
  9. 2018DS-SLAM: A Semantic Visual SLAM towards Dynamic Environmentscited by 91
  10. 2020Dual-Resolution Correspondence Networkscited by 90
  11. 2017SfM-Net: Learning of Structure and Motion from Videocited by 89
  12. 2016Universal Correspondence Networkcited by 82
  13. 2022Adaptive Assignment for Geometry Aware Local Feature Matchingcited by 30
  14. 2022DiffPoseNet: Direct Differentiable Camera Pose Estimationcited by 27
  15. 2021DenseGAP: Graph-Structured Dense Correspondence Learning with Anchor Pointscited by 8
  16. 2018Fast and Accurate Camera Covariance Computation for Large 3D Reconstructioncited by 4

Built on by

Cited by year (2026 to 14 Oct)

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

3 papers.