arXiv:2503.07347 공식 코드 · Papers with Code

DaD: Distilled Reinforcement Learning for Diverse Keypoint Detection

Johan Edstedt, Georg Bökman, Mårten Wadenbäck, Michael Felsberg

제출 2025-03-10

원문 초록

Keypoints are what enable Structure-from-Motion (SfM) systems to scale to thousands of images. However, designing a keypoint detection objective is a non-trivial task, as SfM is non-differentiable. Typically, an auxiliary objective involving a descriptor is optimized. This however induces a dependency on the descriptor, which is undesirable. In this paper we propose a fully self-supervised and descriptor-free objective for keypoint detection, through reinforcement learning. To ensure training does not degenerate, we leverage a balanced top-K sampling strategy. While this already produces competitive models, we find that two qualitatively different types of detectors emerge, which are only able to detect light and dark keypoints respectively. To remedy this, we train a third detector, DaD, that optimizes the Kullback-Leibler divergence of the pointwise maximum of both light and dark detectors. Our approach significantly improve upon SotA across a range of benchmarks. Code and model weights are publicly available at https:github.com/parskatt/dad

함께 살펴볼 논문

공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.

arXiv:2505.22442v4cs.LG공통 태그 reinforcement-learning, Reinforcement Learning공식 코드 · Papers with Code

Fully Offline Reinforcement Learning

토론

이 논문과 연결된 포럼 글이 아직 없습니다.