Efficient Linear Attention for Fast and Accurate Keypoint Matching
Recently Transformers have provided state-of-the-art performance in sparse matching, crucial to realize high-performance 3D vision applications. Yet, these Transformers lack efficiency due to the quadratic computational complexity of their attention mechanism. To solve this problem, we employ an efficient linear attention for the linear computational complexity. Then, we propose a new attentional aggregation that achieves high accuracy by aggregating both the global and local information from sparse keypoints. To further improve the efficiency, we propose the joint learning of feature matching and description. Our learning enables simpler and faster matching than Sinkhorn, often used in matching the learned descriptors from Transformers. Our method achieves competitive performance with only 0.84M learnable parameters against the bigger SOTAs, SuperGlue (12M parameters) and SGMNet (30M parameters), on three benchmarks, HPatch, ETH, and Aachen Day-Night.
Code (0)
등록된 구현이 없습니다.
Tasks
Image MatchingVisual LocalizationSimilar Papers 제목 키워드 기반
Learning Feature Matching via Matchable Keypoint-Assisted Graph Neural Network
Accurately matching local features between a pair of images is a challenging computer vision task. Previous studies typically use attention based graph neural networks (GNNs) with fully-connected graphs over keypoints wi…
Graph Neural NetworkVisual LocalizationProbabilistic Spatial Distribution Prior Based Attentional Keypoints Matching Network
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 lea…
Graph Neural NetworkImage StitchingMotion EstimationSimultaneous Localization and MappingGraph-Context Attention Networks for Size-Varied Deep Graph Matching
Deep learning for graph matching has received growing interest and developed rapidly in the past decade. Although recent deep graph matching methods have shown excellent performance on matching between graphs of equa…
Graph MatchingMatching Is Not Enough: A Two-Stage Framework for Category-Agnostic Pose Estimation
Category-agnostic pose estimation (CAPE) aims to predict keypoints for arbitrary categories given support images with keypoint annotations. Existing approaches match the keypoints across the image for localization. H…
2D Pose EstimationCategory-Agnostic Pose EstimationDecoderPose EstimationXRefine: Attention-Guided Keypoint Match Refinement
Sparse keypoint matching is crucial for 3D vision tasks, yet current keypoint detectors often produce spatially inaccurate matches. Existing refinement methods mitigate this issue through alignment of matched keypoint lo…