TurboReg estimates 3D transformations from fixed-size three-match cliques in a tightly constrained compatibility graph, found by a linear-time pivot-guided search, matching or beating maximal clique methods at far higher speed.
Learning Two-View Correspondences and Geometry Using Order-Aware Network
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Establishing correspondences between two images requires both local and global spatial context. Given putative correspondences of feature points in two views, in this paper, we propose Order-Aware Network, which infers the probabilities of correspondences being inliers and regresses the relative pose encoded by the essential matrix. Specifically, this proposed network is built hierarchically and comprises three novel operations. First, to capture the local context of sparse correspondences, the network clusters unordered input correspondences by learning a soft assignment matrix. These clusters are in a canonical order and invariant to input permutations. Next, the clusters are spatially correlated to form the global context of correspondences. After that, the context-encoded clusters are recovered back to the original size through a proposed upsampling operator. We intensively experiment on both outdoor and indoor datasets. The accuracy of the two-view geometry and correspondences are significantly improved over the state-of-the-arts. Code will be available at https://github.com/zjhthu/OANet.git.
citation-role summary
citation-polarity summary
fields
cs.CV 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
TurboReg: TurboClique for Robust and Efficient Point Cloud Registration
TurboReg estimates 3D transformations from fixed-size three-match cliques in a tightly constrained compatibility graph, found by a linear-time pivot-guided search, matching or beating maximal clique methods at far higher speed.