2018
DOI: 10.1007/978-3-030-01267-0_31
|View full text |Cite
|
Sign up to set email alerts
|

Learning and Matching Multi-View Descriptors for Registration of Point Clouds

Abstract: Critical to the registration of point clouds is the establishment of a set of accurate correspondences between points in 3D space. The correspondence problem is generally addressed by the design of discriminative 3D local descriptors on the one hand, and the development of robust matching strategies on the other hand. In this work, we first propose a multi-view local descriptor, which is learned from the images of multiple views, for the description of 3D keypoints. Then, we develop a robust matching approach,… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
27
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
4
3
2

Relationship

4
5

Authors

Journals

citations
Cited by 45 publications
(27 citation statements)
references
References 64 publications
0
27
0
Order By: Relevance
“…This is also a difficulty faced by many tasks on graphs [42]. Instead of defining heuristic neighbors for correspondences as done in previous works [15,45], we exploit Differentiable Pooling [42] to cluster nodes in a learnable manner and capture the local context. However, the original DiffPool Network is not applicable in our case because it does not give a full size prediction.…”
Section: Geometric Deep Learningmentioning
confidence: 99%
See 1 more Smart Citation
“…This is also a difficulty faced by many tasks on graphs [42]. Instead of defining heuristic neighbors for correspondences as done in previous works [15,45], we exploit Differentiable Pooling [42] to cluster nodes in a learnable manner and capture the local context. However, the original DiffPool Network is not applicable in our case because it does not give a full size prediction.…”
Section: Geometric Deep Learningmentioning
confidence: 99%
“…One of the challenges in mitigating the above limitations is exploiting neighbors to encoding local context. Unlike 3D point clouds, sparse matches have no well-defined neighbors, where this issue is previously tackled in bilateral domain [15] (2D spatial domain and 2D motion domain) or by a graphical model [45]. Besides, another challenge is modeling the relation between correspondences since they are unordered and have no stable relations to be captured.…”
Section: Introductionmentioning
confidence: 99%
“…Such problems become more obvious in 3D point cloud registration since the description ability of 3D descriptors is generally weaker than those in 2D domain [42,6,44,43,45] due to the irregular density and the lack of useful texture [11]. Thus, geometric consistency, such as length constraint under rigid transformation, becomes important and is commonly utilized by traditional outlier rejection algorithms and analyzed through spectral techniques [38,20], voting schemes [26,74,61], maximum clique [54,12,64], random walk [14], belief propagation [81] or game theory [59]. Meanwhile, some algorithms based on BnB [11] or SDP [37] are accurate but usually have high time complexity.…”
Section: Related Workmentioning
confidence: 99%
“…Huang et al [13] learn local features from 3D multiview projected images and fuse multiview features into local shape descriptors. Zhou et al [14] conduct similar work and create multiview fused features. Burges et al [15] train CNNs to map high-dimensional features into a lowdimensional embedding space and make features more discriminative.…”
Section: A Local Feature Extraction For 3d Shapesmentioning
confidence: 99%