DISK: Learning local features with policy gradient

By M. Tyszkiewicz, Pascal Fua, Eduard Trulls. Neural Information Processing Systems, 2020

600 citations recorded by the source corpus.

Local feature frameworks are difficult to learn in an end-to-end fashion, due to the discreteness inherent to the selection and matching of sparse keypoints. We introduce DISK (DIScrete Keypoints), a novel method that overcomes these obstacles by leveraging principles from Reinforcement Learning (RL), optimizing end-to-end for a high number of correct feature matches. Our simple yet expressive probabilistic model lets us keep the training and inference regimes close, while maintaining good enough convergence properties to reliably train from scratch. Our features can be extracted very densely while remaining discriminative, challenging commonly held assumptions about what constitutes a good keypoint, as showcased in Fig. 1, and deliver state-of-the-art results on three public benchmarks.

Subfields: Computer Vision and Pattern Recognition, Geography, Planning and Development

View Paper: https://www.semanticscholar.org/paper/80bc689b89da77f5b749e5ee17a363d7575ae936

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Vision and Pattern Recognition

  1. Ming-Hsuan Yang
  2. Luc Van Gool
  3. Dacheng Tao
  4. Jitendra Malik
  5. Varun Jampani
  6. Andrea Vedaldi
  7. Cordelia Schmid
  8. Xiaogang Wang

Citations in the corpus