PMatch: Paired Masked Image Modeling for Dense Geometric Matching

Shengjie Zhu, Xiaoming Liu
2/14/2026

No official code found. Best implementation: ShngJZ/PMatch (24 stars, last commit 2025-06-20).

Abstract

Dense geometric matching determines the dense pixel-wise correspondence between a source and support image corresponding to the same 3D structure. Prior works employ an encoder of transformer blocks to correlate the two-frame features. However, existing monocular pretraining tasks, e.g., image classification, and masked image modeling (MIM), can not pretrain the cross-frame module, yielding less optimal performance. To resolve this, we reformulate the MIM from reconstructing a single masked image to reconstructing a pair of masked images, enabling the pretraining of transformer module. Additionally, we incorporate a decoder into pretraining for improved upsampling results. Further, to be robust to the textureless area, we propose a novel cross-frame global matching module (CFGM). Since the most textureless area is planar surfaces, we propose a homography loss to further regularize its learning. Combined together, we achieve the State-of-The-Art (SoTA) performance on geometric matching. Codes and models are available at https://github.com/ShngJZ/PMatch.

View on arXivView PDF

Code Implementations(1)

ShngJZ/PMatchCommunity100%
241Shell, PythonMar 16, 20231 years ago

Similar Papers

Cite this paper

@article{zhu2026pmatch,
  title  = {PMatch: Paired Masked Image Modeling for Dense Geometric Matching},
  author = {Shengjie Zhu and Xiaoming Liu},
  year   = {2026},
  eprint = {2303.17342},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/pdf/2303.17342},
  journal = {CVPR 2023 2023}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2303.17342.svg)](https://codeofpaper.com/paper/2303.17342)

Discussion