Cofinet: Reliable coarse-to-fine correspondences for robust pointcloud registration

H Yu, F Li, M Saleh, B Busam… - Advances in Neural …, 2021 - proceedings.neurips.cc
We study the problem of extracting correspondences between a pair of point clouds for
registration. For correspondence retrieval, existing works benefit from matching sparse …
被引用次数：169 相关文章
[PDF] archive.org

[PDF][PDF] CoFiNet: Reliable Coarse-to-fine Correspondences for Robust Point Cloud Registration

H Yu, F Li, M Saleh, B Busam, S Ilic - scholar.archive.org
We study the problem of extracting correspondences between a pair of point clouds for
registration. For correspondence retrieval, existing works benefit from matching sparse …

CoFiNet: Reliable Coarse-to-fine Correspondences for Robust PointCloud Registration

H Yu, F Li, M Saleh, B Busam… - Advances in Neural …, 2021 - proceedings.neurips.cc
We study the problem of extracting correspondences between a pair of point clouds for
registration. For correspondence retrieval, existing works benefit from matching sparse …

CoFiNet: reliable coarse-to-fine correspondences for robust point cloud registration

H Yu, F Li, M Saleh, B Busam, S Ilic - Proceedings of the 35th …, 2021 - dl.acm.org
We study the problem of extracting correspondences between a pair of point clouds for
registration. For correspondence retrieval, existing works benefit from matching sparse …
[PDF] researchgate.net

[PDF][PDF] CoFiNet: Reliable Coarse-to-fine Correspondences for Robust Point Cloud Registration

H Yu, F Li, M Saleh, B Busam, S Ilic - arXiv preprint arXiv …, 2021 - researchgate.net
We study the problem of extracting correspondences between a pair of point clouds for
registration. For correspondence retrieval, existing works benefit from matching sparse …

CoFiNet: Reliable Coarse-to-fine Correspondences for Robust Point Cloud Registration

H Yu, F Li, M Saleh, B Busam, S Ilic - arXiv preprint arXiv:2110.14076, 2021 - arxiv.org
We study the problem of extracting correspondences between a pair of point clouds for
registration. For correspondence retrieval, existing works benefit from matching sparse …
[PDF] academia.edu

[PDF][PDF] CoFiNet: Reliable Coarse-to-fine Correspondences for Robust Point Cloud Registration

H Yu, F Li, M Saleh, B Busam, S Ilic - arXiv preprint arXiv:2110.14076, 2021 - academia.edu
We study the problem of extracting correspondences between a pair of point clouds for
registration. For correspondence retrieval, existing works benefit from matching sparse …

CoFiNet: Reliable Coarse-to-fine Correspondences for Robust PointCloud Registration

H Yu, F Li, M Saleh, B Busam, S Ilic - Advances in Neural Information … - openreview.net
We study the problem of extracting correspondences between a pair of point clouds for
registration. For correspondence retrieval, existing works benefit from matching sparse …

CoFiNet: Reliable Coarse-to-fine Correspondences for Robust Point Cloud Registration

H Yu, F Li, M Saleh, B Busam, S Ilic - arXiv e-prints, 2021 - ui.adsabs.harvard.edu
We study the problem of extracting correspondences between a pair of point clouds for
registration. For correspondence retrieval, existing works benefit from matching sparse …

CoFiNet: Reliable Coarse-to-fine Correspondences for Robust PointCloud Registration

H Yu, F Li, M Saleh, B Busam… - Advances in Neural …, 2021 - mediatum.ub.tum.de
We study the problem of extracting correspondences between a pair of point clouds for
registration. For correspondence retrieval, existing works benefit from matching sparse …