Zero-Shot Polygon Matching with Pre-trained Models for Pose Estimation and Polygon Cloud from Challenging Stereo
Not on the map. Why?
Abstract (arXiv)
While stereo matching has achieved maturity for 0D point and 1D line primitives, establishing correspondences for 2D polygons remains largely unexplored due to challenges including disparity discontinuity, scale variation, training dependency, and poor generalization, limiting downstream tasks such as pose estimation and 3D reconstruction. To address these issues, we are the first to propose a Zero-shot Polygon Matching paradigm with Pre-trained Models (i.e., Z(PM)2), which combines learned features and handcrafted geometric constraints through plug-and-play modules, extending matching from 0D/1D primitives to 2D polygons. The pipeline comprises three core stages: Firstly, detector leverages the pre-trained segment anything model to vectorize segmentation masks into graph-structured polygons integrating geometry and texture; Secondly, global matcher uses bidirectional-pyramid and multi-geometric constraints to handle viewpoint variation; Thirdly, local matcher leverages local-holistic bipartite graph optimization to resolve disparity discontinuity and topological inconsistency. Moreover, we develop polygon-matching-guided pose estimation using correspondences to obtain well-distributed, low-redundancy homologous points, and pioneer the polygon cloud concept with an optimal surface generation method, producing structurally complete and semantically rich 3D representations beyond point and line clouds. Since no polygon matching methods from stereo imagery are available for direct comparison, we selected state-of-the-art (SoTA) methods close to this task as baselines. Extensive experiments on five challenging datasets (ISPRS, KITTI, ScanNet, SceneFlow, DTU) show Z(PM)2 achieves a 68.60% matching area score, outperforming MESA by approximately 32% and ranking first in area-level pose estimation, with competitive speed and strong zero-shot generalization without any training requirement.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 19 of its 42 references that are in the map. First posted on arXiv 8 Nov 2025.
Builds on
19 of 42 references.
References · 19
- 2017ScanNet: Richly-annotated 3D Reconstructions of Indoor Scenescited by 3,088
- 2019SuperGlue: Learning Feature Matching with Graph Neural Networkscited by 1,437
- 2017SuperPoint: Self-Supervised Interest Point Detection and Descriptioncited by 1,313
- 2021LoFTR: Detector-Free Local Feature Matching with Transformerscited by 974
- 2015A Large Dataset to Train Convolutional Networks for Disparity, Optical Flow, and Scene Flow Estimationcited by 878
- 2023LightGlue: Local Feature Matching at Light Speedcited by 583
- 2023Segment Everything Everywhere All at Oncecited by 546
- 2019D2-Net: A Trainable CNN for Joint Detection and Description of Local Featurescited by 324
- 2023RoMa: Robust Dense Feature Matchingcited by 296
- 2022DKM: Dense Kernelized Feature Matching for Geometry Estimationcited by 174
- 2019MAGSAC++, a fast, reliable and accurate robust estimatorcited by 160
- 2021Learning to Match Features with Seeded Graph Matching Networkcited by 92
7 more
- 2023GlueStick: Robust Image Matching by Sticking Points and Lines Togethercited by 65
- 2024IGEV++: Iterative Multi-range Geometry Encoding Volumes for Stereo Matchingcited by 55
- 2024Matching Anything by Segmenting Anythingcited by 49
- 2024MESA: Matching Everything by Segmenting Anythingcited by 16
- 2023Searching from Area to Point: A Hierarchical Framework for Semantic-Geometric Combined Feature Matchingcited by 9
- 2025LDPoly: Latent Diffusion for Polygonal Road Outline Extraction in Large-Scale Topographic Mappingcited by 3
- 2023MatchDet: A Collaborative Framework for Image Matching and Object Detectioncited by 1
Built on by
Not cited yet.