2019
DOI: 10.1111/cgf.13804
|View full text |Cite
|
Sign up to set email alerts
|

SiamesePointNet: A Siamese Point Network Architecture for Learning 3D Shape Descriptor

Abstract: We present a novel deep learning approach to extract point‐wise descriptors directly on 3D shapes by introducing Siamese Point Networks, which contain a global shape constraint module and a feature transformation operator. Such geometric descriptor can be used in a variety of shape analysis problems such as 3D shape dense correspondence, key point matching and shape‐to‐scan matching. The descriptor is produced by a hierarchical encoder–decoder architecture that is trained to map geometrically and semantically … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
4
2
2

Relationship

0
8

Authors

Journals

citations
Cited by 13 publications
(4 citation statements)
references
References 36 publications
(60 reference statements)
0
4
0
Order By: Relevance
“…However, they require a large Graphic Process Unit (GPU) memory and are sensitive to rotation variations. Some representative algorithms in this category are PPFNet [105], SiamesePointNet [106] and deep closest point (DCP) [107]. These methods offer robust and accurate registration using a simple RANdom SAmple Consensus (RANSAC) iterative algorithm.…”
Section: D Point Cloudsmentioning
confidence: 99%
“…However, they require a large Graphic Process Unit (GPU) memory and are sensitive to rotation variations. Some representative algorithms in this category are PPFNet [105], SiamesePointNet [106] and deep closest point (DCP) [107]. These methods offer robust and accurate registration using a simple RANdom SAmple Consensus (RANSAC) iterative algorithm.…”
Section: D Point Cloudsmentioning
confidence: 99%
“…The whole network is optimized by using the difference between the input and output using Chamfer loss. Similarly, SiamesePointNet [118] produces the descriptor of interest points by a hierarchical encoder-decoder architecture.…”
Section: B Learning On Point Cloudmentioning
confidence: 99%
“…Correspondences can also be computed through finding a canonical embedding of the input. This idea has been developed for 2D images [8,54] as well as 3D data [62]. The latter works, as many others in this domain, take advantage of point-based architectures such as PointNet [44] and its extensions [45,2,55] that provide a powerful way to learn signatures for point clouds, and that have been mainly exploited for shape classification but not yet for smooth and consistent dense non-rigid shape correspondence.…”
Section: Functional Mapsmentioning
confidence: 99%