Metric Learning for 3D Point Clouds Using Optimal Transport
Learning embeddings of any data largely depends on the ability of the target space to capture semantic rela- tions. The widely used Euclidean space, where embed- dings are represented as point vectors, is known to be lack- ing in its potential to exploit complex structures and re- lations. Contrary to standard Euclidean embeddings, in this work, we embed point clouds as discrete probability distributions in Wasserstein space. We build a contrastive learning setup to learn Wasserstein embeddings that can be used as a pre-training method with or without supervision towards any downstream task. We show that the features captured by Wasserstein embeddings are better in preserv- ing the point cloud geometry, including both global and local information, thus resulting in improved quality em- beddings. We perform exhaustive experiments and demon- strate the effectiveness of our method for point cloud classi- fication, transfer learning, segmentation, and interpolation tasks over multiple datasets including synthetic and real- world objects. We also compare against recent methods that use Wasserstein space and show that our method out- performs them in all downstream tasks. Additionally, our study reveals a promising interpretation of capturing criti- cal points of point clouds that makes our proposed method self-explainable.
Code (0)
등록된 구현이 없습니다.
Tasks
Contrastive LearningMetric LearningTransfer LearningMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Point Cloud Classification via Deep Set Linearized Optimal Transport
We introduce Deep Set Linearized Optimal Transport, an algorithm designed for the efficient simultaneous embedding of point clouds into an $L^2-$space. This embedding preserves specific low-dimensional structures within …
ClassificationPoint Cloud ClassificationFLOT: Scene Flow on Point Clouds Guided by Optimal Transport
We propose and study a method called FLOT that estimates scene flow on point clouds. We start the design of FLOT by noticing that scene flow estimation on point clouds reduces to estimating a permutation matrix in a perf…
Graph MatchingScene Flow EstimationCluster-Aware Matching via Laplacian Optimal Transport
In many applications of matching, the point clouds to be matched are not merely unstructured sets of points but rather samples from distributions with an intrinsic cluster structure. In such cases, as individual points a…
Point CloudsNeural varifolds: an aggregate representation for quantifying the geometry of point clouds
Point clouds are popular 3D representations for real-life objects (such as in LiDAR and Kinect) due to their detailed and compact representation of surface-based geometry. Recent approaches characterise the geometry of p…
Optimal Transport Graph Neural Networks
Current graph neural network (GNN) architectures naively average or sum node embeddings into an aggregated graph representation -- potentially losing structural or semantic information. We here introduce OT-GNN, a model …
Drug DiscoveryGraph Neural NetworkGraph RegressionMolecular Property Prediction+1