Consensus Learning with Deep Sets for Essential Matrix Estimation
Not on the map. Why?
Abstract (arXiv)
Robust estimation of the essential matrix, which encodes the relative position and orientation of two cameras, is a fundamental step in structure from motion pipelines. Recent deep-based methods achieved accurate estimation by using complex network architectures that involve graphs, attention layers, and hard pruning steps. Here, we propose a simpler network architecture based on Deep Sets. Given a collection of point matches extracted from two images, our method identifies outlier point matches and models the displacement noise in inlier matches. A weighted DLT module uses these predictions to regress the essential matrix. Our network achieves accurate recovery that is superior to existing networks with significantly more complex architectures.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 29 of its 59 references that are in the map. First posted on arXiv 25 Jun 2024.
Builds on
29 of 59 references.
References · 29
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2017PointNet++: Deep Hierarchical Feature Learning on Point Sets in a Metric Spacecited by 4,384
- 2019SuperGlue: Learning Feature Matching with Graph Neural Networkscited by 1,437
- 2017Deep Setscited by 1,394
- 2017SuperPoint: Self-Supervised Interest Point Detection and Descriptioncited by 1,313
- 2015ORB-SLAM: a Versatile and Accurate Monocular SLAM Systemcited by 983
- 2020ORB-SLAM3: An Accurate Open-Source Library for Visual, Visual-Inertial and Multi-Map SLAMcited by 862
- 2023LightGlue: Local Feature Matching at Light Speedcited by 583
- 2016LIFT: Learned Invariant Feature Transformcited by 305
- 2019Kornia: an Open Source Differentiable Computer Vision Library for PyTorchcited by 231
- 2020Image Matching across Wide Baselines: From Paper to Practicecited by 224
- 2021Pixel-Perfect Structure-from-Motion with Featuremetric Refinementcited by 199
17 more
- 2017Learning to Find Good Correspondencescited by 176
- 2019MAGSAC++, a fast, reliable and accurate robust estimatorcited by 160
- 2019Learning Two-View Correspondences and Geometry Using Order-Aware Networkcited by 148
- 2017Graph-Cut RANSACcited by 133
- 2018MAGSAC: marginalizing sample consensuscited by 122
- 2021Universal Approximation of Functions on Setscited by 62
- 2023DeDoDe: Detect, Don't Describe -- Describe, Don't Detect for Local Feature Matchingcited by 62
- 2021Progressive Correspondence Pruning by Consensus Learningcited by 46
- 2024DeDoDe v2: Analyzing and Improving the DeDoDe Keypoint Detectorcited by 38
- 2020Multi-View Optimization of Local Feature Geometrycited by 24
- 2020Learnable Motion Coherence for Correspondence Pruningcited by 20
- 2019Algebraic Characterization of Essential Matrices and Their Averaging in Multiview Settingscited by 18
- 2019Neural Outlier Rejection for Self-Supervised Keypoint Learningcited by 16
- 2021Deep Permutation Equivariant Structure from Motioncited by 15
- 2024BCLNet: Bilateral Consensus Learning for Two-View Correspondence Pruningcited by 12
- 2024MGNet: Learning Correspondences via Multiple Graphscited by 10
- 2019Optimal Multi-view Correction of Local Affine Framescited by 3
Built on by
Citing papers per year: 2026: 1.
1 paper.