mlsanityData to 14 Oct 2026

Normalized Matching Transformer

arXiv 2503.17715 ↗First posted 22 Mar 2025cs.CV cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

We introduce the Normalized Matching Transformer (NMT), a deep learning approach for efficient and accurate sparse semantic keypoint matching between image pairs. NMT consists of a strong visual backbone, geometric feature refinement via SplineCNN, followed by a normalized Transformer for computing matching features. Central to NMT is our hyperspherical normalization strategy: we enforce unit-norm embeddings at every Transformer layer and train with a combined contrastive InfoNCE and hyperspherical uniformity loss to yield more discriminative keypoint representations. This novel architecture/loss combination encourages close alignment of matching image features and large distances between non-matching ones not only at the output level, but for each layer. Despite its architectural simplicity, NMT sets a new state-of-the-art performance on PascalVOC and SPair-71k, outperforming BBGM, ASAR, COMMON and GMTR by 5.1% and 2.2%, respectively, while converging in at least 1.7x fewer epochs compared to other state-of-the-art baselines. These results underscore the power of combining pervasive normalization with hyperspherical learning for matching tasks.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 32 of its 60 references that are in the map. First posted on arXiv 22 Mar 2025.

Builds on

32 of 60 references.

References · 32

  1. 2017Attention Is All You Needcited by 60,361
  2. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  3. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
  4. 2021Swin Transformer: Hierarchical Vision Transformer using Shifted Windowscited by 12,139
  5. 2018Representation Learning with Contrastive Predictive Codingcited by 7,777
  6. 2017mixup: Beyond Empirical Risk Minimizationcited by 5,183
  7. 2019CutMix: Regularization Strategy to Train Strong Classifiers with Localizable Featurescited by 2,884
  8. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
  9. 2019SuperGlue: Learning Feature Matching with Graph Neural Networkscited by 1,443
  10. 2017Random Erasing Data Augmentationcited by 1,239
  11. 2021LoFTR: Detector-Free Local Feature Matching with Transformerscited by 984
  12. 2023LightGlue: Local Feature Matching at Light Speedcited by 590
20 more
  1. 2018Albumentations: fast and flexible image augmentationscited by 560
  2. 2019Differentiation of Blackbox Combinatorial Solverscited by 226
  3. 2017SplineCNN: Fast Geometric Deep Learning with Continuous B-Spline Kernelscited by 161
  4. 2019SPair-71k: A Large-scale Benchmark for Semantic Correspondencecited by 146
  5. 2019Learning Combinatorial Embedding Networks for Deep Graph Matchingcited by 99
  6. 2019Hyperspherical Prototype Networkscited by 86
  7. 2020Deep Graph Matching Consensuscited by 85
  8. 2019Neural Graph Matching Network: Learning Lawler's Quadratic Assignment Problem with Extension to Hypergraph and Multiple-graph Matchingcited by 84
  9. 2020Deep Graph Matching via Blackbox Differentiation of Combinatorial Solverscited by 81
  10. 2024nGPT: Normalized Transformer with Representation Learning on the Hyperspherecited by 70
  11. 2018DGC-Net: Dense Geometric Correspondence Networkcited by 67
  12. 2022Graph Matching with Bi-level Noisy Correspondencecited by 30
  13. 2016A Study of Lagrangean Decompositions and Dual Ascent Solvers for Graph Matchingcited by 26
  14. 2020LayoutGMN: Neural Graph Matching for Structural Layout Similaritycited by 19
  15. 2021Deep Graph Matching under Quadratic Constraintcited by 18
  16. 2021Fusion Moves for Graph Matchingcited by 16
  17. 2022A Comparative Study of Graph Matching Algorithms in Computer Visioncited by 14
  18. 2019GLMNet: Graph Learning-Matching Networks for Feature Matchingcited by 9
  19. 2021Sparse Quadratic Optimisation over the Stiefel Manifold with Application to Permutation Synchronisationcited by 6
  20. 2024Optimizing Incomplete, Large-Scale and Sparse Multi-Graph Matching in Bioimagingcited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.