mlsanityData to 14 Oct 2026

Probabilistic Spatial Distribution Prior Based Attentional Keypoints Matching Network

arXiv 2111.09006 ↗First posted 17 Nov 2021cs.CVcited by 8

Not on the map. Why?

Abstract (arXiv)

Keypoints matching is a pivotal component for many image-relevant applications such as image stitching, visual simultaneous localization and mapping (SLAM), and so on. Both handcrafted-based and recently emerged deep learning-based keypoints matching methods merely rely on keypoints and local features, while losing sight of other available sensors such as inertial measurement unit (IMU) in the above applications. In this paper, we demonstrate that the motion estimation from IMU integration can be used to exploit the spatial distribution prior of keypoints between images. To this end, a probabilistic perspective of attention formulation is proposed to integrate the spatial distribution prior into the attentional graph neural network naturally. With the assistance of spatial distribution prior, the effort of the network for modeling the hidden features can be reduced. Furthermore, we present a projection loss for the proposed keypoints matching network, which gives a smooth edge between matching and un-matching keypoints. Image matching experiments on visual SLAM datasets indicate the effectiveness and efficiency of the presented method.

Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). Builds on 29 of its 69 references that are in the map. First posted on arXiv 17 Nov 2021.

Builds on

29 of 69 references.

References · 29

  1. 2017Attention Is All You Needcited by 60,361
  2. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  3. 2016PointNet: Deep Learning on Point Sets for 3D Classification and Segmentationcited by 5,248
  4. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
  5. 2017Non-local Neural Networkscited by 2,293
  6. 2019SuperGlue: Learning Feature Matching with Graph Neural Networkscited by 1,443
  7. 2017SuperPoint: Self-Supervised Interest Point Detection and Descriptioncited by 1,320
  8. 2016ORB-SLAM2: an Open-Source SLAM System for Monocular, Stereo and RGB-D Camerascited by 806
  9. 2018Computational Optimal Transportcited by 780
  10. 2017VINS-Mono: A Robust and Versatile Monocular Visual-Inertial State Estimatorcited by 423
  11. 2019D2-Net: A Trainable CNN for Joint Detection and Description of Local Featurescited by 326
  12. 2016LIFT: Learned Invariant Feature Transformcited by 306
17 more
  1. 2017HPatches: A benchmark and evaluation of handcrafted and learned local descriptorscited by 264
  2. 2017Working hard to know your neighbor's margins: Local descriptor learning losscited by 212
  3. 2019R2D2: Repeatable and Reliable Detector and Descriptorcited by 207
  4. 2018Revisiting Oxford and Paris: Large-Scale Image Retrieval Benchmarkingcited by 191
  5. 2017Learning to Find Good Correspondencescited by 176
  6. 2018LF-Net: Learning Local Features from Imagescited by 151
  7. 2019Learning Two-View Correspondences and Geometry Using Order-Aware Networkcited by 149
  8. 2019SOSNet: Second Order Similarity Regularization for Local Descriptor Learningcited by 131
  9. 2019Key.Net: Keypoint Detection by Handcrafted and Learned CNN Filterscited by 118
  10. 2015On-Manifold Preintegration for Real-Time Visual-Inertial Odometrycited by 95
  11. 2018InteriorNet: Mega-scale Multi-sensor Photo-realistic Indoor Scenes Datasetcited by 87
  12. 2014TILDE: A Temporally Invariant Learned DEtectorcited by 55
  13. 2016Quad-networks: unsupervised learning to rank for interest point detectioncited by 36
  14. 2016Visual-Inertial Monocular SLAM with Map Reusecited by 32
  15. 2019NM-Net: Mining Reliable Neighbors for Robust Feature Correspondencescited by 29
  16. 2020Single Image Brightening via Multi-Scale Exposure Fusion with Hybrid Learningcited by 12
  17. 2019Accurate IMU Preintegration Using Switched Linear Systems For Autonomous Systemscited by 2

Built on by

Cited by year

Citing papers per year: 2021: 1; 2022: 2; 2023: 3; 2024: 1; 2025: 1.

8 papers.