Pith. sign in

REVIEW 1 cited by

Geometric Transformer for Fast and Robust Point Cloud Registration

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2202.06688 v2 pith:OQXTN4OU submitted 2022-02-14 cs.CV

classification cs.CV
keywords geometricregistrationmatchingpointpointsrobustcloudcorrespondences
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

We study the problem of extracting accurate correspondences for point cloud registration. Recent keypoint-free methods bypass the detection of repeatable keypoints which is difficult in low-overlap scenarios, showing great potential in registration. They seek correspondences over downsampled superpoints, which are then propagated to dense points. Superpoints are matched based on whether their neighboring patches overlap. Such sparse and loose matching requires contextual features capturing the geometric structure of the point clouds. We propose Geometric Transformer to learn geometric feature for robust superpoint matching. It encodes pair-wise distances and triplet-wise angles, making it robust in low-overlap cases and invariant to rigid transformation. The simplistic design attains surprisingly high matching accuracy such that no RANSAC is required in the estimation of alignment transformation, leading to $100$ times acceleration. Our method improves the inlier ratio by $17{\sim}30$ percentage points and the registration recall by over $7$ points on the challenging 3DLoMatch benchmark. Our code and models are available at https://github.com/qinzheng93/GeoTransformer.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. TurboReg: TurboClique for Robust and Efficient Point Cloud Registration

    cs.CV 2025-07 conditional novelty 6.0 of 10

    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 hig...

Pith tools