mlsanityData to 14 Oct 2026

RLSAC: Reinforcement Learning enhanced Sample Consensus for End-to-End Robust Estimation

arXiv 2308.05318 ↗First posted 10 Aug 2023cs.CVcited by 3

Not on the map. Why?

Abstract (arXiv)

Robust estimation is a crucial and still challenging task, which involves estimating model parameters in noisy environments. Although conventional sampling consensus-based algorithms sample several times to achieve robustness, these algorithms cannot use data features and historical information effectively. In this paper, we propose RLSAC, a novel Reinforcement Learning enhanced SAmple Consensus framework for end-to-end robust estimation. RLSAC employs a graph neural network to utilize both data and memory features to guide exploring directions for sampling the next minimum set. The feedback of downstream tasks serves as the reward for unsupervised training. Therefore, RLSAC can avoid differentiating to learn the features and the feedback of downstream tasks for end-to-end robust estimation. In addition, RLSAC integrates a state transition module that encodes both data and memory features. Our experimental results demonstrate that RLSAC can learn from features to gradually explore a better hypothesis. Through analysis, it is apparent that RLSAC can be easily transferred to other sampling consensus-based robust estimation tasks. To the best of our knowledge, RLSAC is also the first method that uses reinforcement learning to sample consensus for end-to-end robust estimation. We release our codes at https://github.com/IRMVLab/RLSAC.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 19 of its 38 references that are in the map. First posted on arXiv 10 Aug 2023.

Builds on

19 of 38 references.

References · 19

  1. 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,885
  2. 2018Dynamic Graph CNN for Learning on Point Cloudscited by 2,223
  3. 2016DSAC - Differentiable RANSAC for Camera Localizationcited by 266
  4. 2017Learning to Find Good Correspondencescited by 176
  5. 2019Soft Actor-Critic for Discrete Action Settingscited by 174
  6. 2019Learning Two-View Correspondences and Geometry Using Order-Aware Networkcited by 149
  7. 2017Graph-Cut RANSACcited by 133
  8. 2019Neural-Guided RANSAC: Learning Where to Sample Model Hypothesescited by 129
  9. 2019Reinforced Feature Points: Optimizing Feature Detection and Description for a High-Level Taskcited by 39
  10. 2020PWCLO-Net: Deep LiDAR Odometry in 3D Point Clouds Using Hierarchical Embedding Mask Optimizationcited by 35
  11. 2015MODS: Fast and Robust Method for Two-View Matchingcited by 26
  12. 2021Efficient 3D Deep LiDAR Odometrycited by 25
7 more
  1. 2019Progressive NAPSAC: sampling from gradually growing neighborhoodscited by 16
  2. 2018Deep Fundamental Matrix Estimation without Correspondencescited by 15
  3. 20213D Hierarchical Refinement and Augmentation for Unsupervised Learning of Depth and Pose from Monocular Videocited by 11
  4. 2022NeFSAC: Neurally Filtered Minimal Samplescited by 9
  5. 2022Unsupervised Learning of 3D Scene Flow from Monocular Cameracited by 7
  6. 20223D Scene Flow Estimation on Pseudo-LiDAR: Bridging the Gap on Estimating Point Motioncited by 7
  7. 2021NccFlow: Unsupervised Learning of Optical Flow With Non-occlusion from Geometrycited by 3

Built on by

Cited by year

Citing papers per year: 2024: 1; 2025: 2.

3 papers.