mlsanityData to 7 Oct 2026

Learnable Motion Coherence for Correspondence Pruning

arXiv 2011.14563 ↗First posted 30 Nov 2020cs.CVcited by 20

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 20 papers in the map (data through 7 Oct 2026). First posted on arXiv 30 Nov 2020.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 3; 2022: 1; 2023: 6; 2024: 5; 2025: 5.

20 papers.

Sort:

By area:

  1. 2023PF-LRM: Pose-Free Large Reconstruction Model for Joint Pose and Shape Predictioncited by 165
  2. 2022SC^2-PCR: A Second Order Spatial Compatibility for Efficient and Robust Point Cloud Registrationcited by 62
  3. 2021Topology-Aware Network Pruning using Multi-stage Graph Embedding and Reinforcement Learningcited by 30
  4. 2021DetarNet: Decoupling Translation and Rotation by Siamese Network for Point Cloud Registrationcited by 12
  5. 2021SPATL: Salient Parameter Aggregation and Transfer Learning for Heterogeneous Clients in Federated Learningcited by 11
  6. 2023IMP: Iterative Matching and Pose Estimation with Adaptive Poolingcited by 10
  7. 2024MGNet: Learning Correspondences via Multiple Graphscited by 10
  8. 2023VSFormer: Visual-Spatial Fusion Transformer for Correspondence Pruningcited by 8
  9. 2025Deep Learning Reforms Image Matching: A Survey and Outlookcited by 7
  10. 2023Learning Second-Order Attentive Context for Efficient Correspondence Pruningcited by 5
  11. 2023Learning Feature Matching via Matchable Keypoint-Assisted Graph Neural Networkcited by 5
  12. 2024Scalable and Generalizable Correspondence Pruning via Geometry-Consistent Pre-trainingcited by 2
8 more
  1. 2023ResMatch: Residual Attention Learning for Local Feature Matchingcited by 1
  2. 2024Consensus Learning with Deep Sets for Essential Matrix Estimationcited by 1
  3. 2024CorrAdaptor: Adaptive Local Context Learning for Correspondence Pruningcited by 1
  4. 2025Selecting and Pruning: A Differentiable Causal Sequentialized State-Space Model for Two-View Correspondence Learningcited by 1
  5. 2024Geometry Depth Consistency in RGBD Relative Pose Estimationcited by 0
  6. 2025GeoMoE: Divide-and-Conquer Motion Field Modeling with Mixture-of-Experts for Two-View Geometrycited by 0
  7. 2025LeCoT: revisiting network architecture for two-view correspondence pruningcited by 0
  8. 2025LLHA-Net: A Hierarchical Attention Network for Two-View Correspondence Learningcited by 0