Reinforced Feature Points: Optimizing Feature Detection and Description for a High-Level Task
Aritra Bhowmik, Stefan Gumhold, Carsten Rother, Eric Brachmann
Abstract
We address a core problem of computer vision: Detection and description of 2D feature points for image matching. For a long time, hand-crafted designs, like the seminal SIFT algorithm, were unsurpassed in accuracy and efficiency. Recently, learned feature detectors emerged that implement detection and description using neural networks. Training these networks usually resorts to optimizing low-level matching scores, often pre-defining sets of image patches which should or should not match, or which should or should not contain key points. Unfortunately, increased accuracy for these low-level matching scores does not necessarily translate to better performance in high-level vision tasks. We propose a new training methodology which embeds the feature detector in a complete vision pipeline, and where the learnable parameters are trained in an endto-end fashion. We overcome the discrete nature of key point selection and descriptor matching using principles from reinforcement learning. As an example, we address the task of relative pose estimation between a pair of images. We demonstrate that the accuracy of a state-of-theart learning-based feature detector can be increased when trained for the task it is supposed to solve at test time. Our training methodology poses little restrictions on the task to learn, and works for any architecture which predicts key point heat maps, and descriptors for key point locations.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 012e9fc8-5b84-41ca-b922-62c664ee392dCited by top-tier papers19
- DISK: Learning local features with policy gradientMichal J. Tyszkiewicz, Pascal Fua, Eduard TrullsNeurIPS 2020 · 652 citations
- COTR: Correspondence Transformer for Matching Across ImagesWei Jiang, Eduard Trulls, Jan Hosang, Andrea Tagliasacchi et al.ICCV 2021 · 318 citations
- Dual-Resolution Correspondence NetworksXinghui Li, Kai Han, Shuda Li, Victor PrisacariuNeurIPS 2020 · 207 citations
- TopicFM: Robust and Interpretable Topic-Assisted Feature MatchingKhang Truong Giang, Soohwan Song, Sungho JoAAAI 2023 · 73 citations
- Decoupling Makes Weakly Supervised Local Feature BetterKunhong Li, Longguang Wang, Li Liu, Qing Ran et al.CVPR 2022 · 58 citations
Builds on2
Related papers
- Collaborative Feature Matching with Progressive Correspondence LearningXin Liu, Yanbing Han, Rong Qin, Bing Wang et al.AAAI 2026
- From Pairs to Sequences: Track-Aware Policy Gradients for Keypoint DetectionYepeng Liu, Hao Li, Liwen Yang, Fangzhen Li et al.CVPR 2026
- Learning Affine Correspondences by Integrating Geometric ConstraintsPengju Sun, Banglei Guan, Zhenbao Yu, Yang Shang et al.CVPR 2025
- SiLK: Simple Learned KeypointsPierre Gleize, Weiyao Wang, Matt FeiszliICCV 2023 · 87 citations
- S-TREK: Sequential Translation and Rotation Equivariant Keypoints for local feature extractionEmanuele Santellani, Christian Sormann, Mattia Rossi, Andreas Kuhn et al.ICCV 2023 · 17 citations
