Zheng Qin, Hao Yu, Kai Xu, Changjian Wang, Yuxing Peng, Inlier Outlier
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
We study the problem of outlier correspondence pruning for non-rigid point cloud registration. In rigid registration, spatial consistency has been a commonly used criterion to discriminate outliers from inliers. It measures the compatibility of two correspondences by the discrepancy between the respective distances in two point clouds. However, spatial consistency no longer holds in non-rigid cases and outlier rejection for non-rigid registration has not been well studied. In this work, we propose Graph-based Spatial Consistency Network (GraphSCNet) to filter outliers for nonrigid registration. Our method is based on the fact that nonrigid deformations are usually locally rigid, or local shape preserving. We first design a local spatial consistency measure over the deformation graph of the point cloud, which evaluates the spatial compatibility only between the correspondences in the vicinity of a graph node. An attentionbased non-rigid correspondence embedding module is then devised to learn a robust representation of non-rigid correspondences from local spatial consistency. Despite its simplicity, GraphSCNet effectively improves the quality of the putative correspondences and attains state-of-the-art performance on three challenging benchmarks. Our code and models are available at https://github.com/ qinzheng93/GraphSCNet.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2303.09950")
get_code_for_paper("2303.09950")
have("2303.09950")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2303.09950.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2303.09950)
Connect an agent — have() is free.