Learnable Motion Coherence for Correspondence Pruning
Yuan Liu, Lingjie Liu, Cheng Lin, Zhen Dong, Wenping Wang
Abstract
Motion coherence is an important clue for distinguishing true correspondences from false ones. Modeling motion coherence on sparse putative correspondences is challenging due to their sparsity and uneven distributions. Existing works on motion coherence are sensitive to parameter settings and have difficulty in dealing with complex motion patterns. In this paper, we introduce a network called Laplacian Motion Coherence Network (LMCNet) to learn motion coherence property for correspondence pruning. We propose a novel formulation of fitting coherent motions with a smooth function on a graph of correspondences and show that this formulation allows a closed-form solution by graph Laplacian. This closed-form solution enables us to design a differentiable layer in a learning framework to capture global motion coherence from putative correspondences. The global motion coherence is further combined with local coherence extracted by another local layer to robustly detect inlier correspondences. Experiments demonstrate that LMCNet has superior performances to the state of the art in relative camera pose estimation and correspondences pruning of dynamic scenes 1 .
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.
Cited by top-tier papers18
- PF-LRM: Pose-Free Large Reconstruction Model for Joint Pose and Shape PredictionPeng Wang, Hao Tan, Sai Bi, Yinghao Xu et al.ICLR 2024 · 170 citations
- SC2-PCR: A Second Order Spatial Compatibility for Efficient and Robust Point Cloud RegistrationZhi Chen, Kun Sun, Fan Yang, Wenbing TaoCVPR 2022 · 158 citations
- MS2DG-Net: Progressive Correspondence Learning via Multiple Sparse Semantics Dynamic GraphLuanyuan Dai, Yizhang Liu, Jiayi Ma, Lifang Wei et al.CVPR 2022 · 73 citations
- ConvMatch: Rethinking Network Design for Two-View Correspondence LearningShihua Zhang, Jiayi MaAAAI 2023 · 57 citations
- Topology-Aware Network Pruning using Multi-stage Graph Embedding and Reinforcement LearningSixing Yu, Arya Mazaheri, Ali JannesariICML 2022 · 54 citations
Builds on6
- Learning Two-View Correspondences and Geometry Using Order-Aware NetworkJiahui Zhang, Dawei Sun, Zixin Luo, Anbang Yao et al.ICCV 2019 · 362 citations
- Neural-Guided RANSAC: Learning Where to Sample Model HypothesesEric Brachmann, Carsten RotherICCV 2019 · 282 citations
- Dual-Resolution Correspondence NetworksXinghui Li, Kai Han, Shuda Li, Victor PrisacariuNeurIPS 2020 · 207 citations
- SuperGlue: Learning Feature Matching With Graph Neural NetworksPaul-Edouard Sarlin, Daniel DeTone, Tomasz Malisiewicz, Andrew RabinovichCVPR 2020
- ACNe: Attentive Context Normalization for Robust Permutation-Equivariant LearningWeiwei Sun, Wei Jiang, Eduard Trulls, Andrea Tagliasacchi et al.CVPR 2020
Related papers
- Progressive Neighbor Consistency Mining for Correspondence PruningXin Liu, Jufeng YangCVPR 2023
- Graph Context Transformation Learning for Progressive Correspondence PruningJunwen Guo, Guobao Xiao, Shiping Wang, Jun YuAAAI 2024 · 10 citations
- DeMo: Deep Motion Field Consensus with Learnable Kernels for Two-view Correspondence LearningYifan Lu, Jiajun Le, Zizhuo Li, Yixuan Yuan et al.AAAI 2025 · 7 citations
- BCLNet: Bilateral Consensus Learning for Two-View Correspondence PruningXiangyang Miao, Guobao Xiao, Shiping Wang, Jun YuAAAI 2024 · 23 citations
- Progressive Correspondence Pruning by Consensus LearningChen Zhao, Yixiao Ge, Feng Zhu, Rui Zhao et al.ICCV 2021 · 101 citations
