SOE-Net: A Self-Attention and Orientation Encoding Network for Point Cloud based Place Recognition

• URL: http://arxiv.org/abs/2011.12430v2
• Date: Sun, 23 May 2021 11:37:49 GMT
• Title: SOE-Net: A Self-Attention and Orientation Encoding Network for Point Cloud based Place Recognition
• Authors: Yan Xia, Yusheng Xu, Shuang Li, Rui Wang, Juan Du, Daniel Cremers, Uwe Stilla
• Abstract summary: We tackle the problem of place recognition from point cloud data with a self-attention and orientation encoding network (SOE-Net) SOE-Net fully explores the relationship between points and incorporates long-range context into point-wise local descriptors. Experiments on various benchmark datasets demonstrate superior performance of the proposed network over the current state-of-the-art approaches.
• Score: 50.9889997200743
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We tackle the problem of place recognition from point cloud data and introduce a self-attention and orientation encoding network (SOE-Net) that fully explores the relationship between points and incorporates long-range context into point-wise local descriptors. Local information of each point from eight orientations is captured in a PointOE module, whereas long-range feature dependencies among local descriptors are captured with a self-attention unit. Moreover, we propose a novel loss function called Hard Positive Hard Negative quadruplet loss (HPHN quadruplet), that achieves better performance than the commonly used metric learning loss. Experiments on various benchmark datasets demonstrate superior performance of the proposed network over the current state-of-the-art approaches. Our code is released publicly at https://github.com/Yan-Xia/SOE-Net.

Related papers

• PointJEM: Self-supervised Point Cloud Understanding for Reducing Feature Redundancy via Joint Entropy Maximization [10.53900407467811]
  We propose PointJEM, a self-supervised representation learning method applied to the point cloud field. To reduce redundant information in the features, PointJEM maximizes the joint entropy between the different parts. PointJEM achieves competitive performance in downstream tasks such as classification and segmentation.
  arXiv  Detail & Related papers  (2023-12-06T08:21:42Z)
• Collect-and-Distribute Transformer for 3D Point Cloud Analysis [82.03517861433849]
  We propose a new transformer network equipped with a collect-and-distribute mechanism to communicate short- and long-range contexts of point clouds. Results show the effectiveness of the proposed CDFormer, delivering several new state-of-the-art performances on point cloud classification and segmentation tasks.
  arXiv  Detail & Related papers  (2023-06-02T03:48:45Z)
• GaIA: Graphical Information Gain based Attention Network for Weakly Supervised Point Cloud Semantic Segmentation [2.796057369371464]
  This study aims to reduce the uncertainty measured by the entropy for a precise semantic segmentation. We propose the graphical information gain based attention network called GaIA, which alleviates the entropy of each point based on the reliable information. Experimental results on S3DIS and ScanNet-v2 datasets demonstrate our framework outperforms the existing weakly supervised methods.
  arXiv  Detail & Related papers  (2022-10-02T08:37:16Z)
• Location-Sensitive Visual Recognition with Cross-IOU Loss [177.86369890708457]
  This paper proposes a unified solution named location-sensitive network (LSNet) for object detection, instance segmentation, and pose estimation. Based on a deep neural network as the backbone, LSNet predicts an anchor point and a set of landmarks which together define the shape of the target object.
  arXiv  Detail & Related papers  (2021-04-11T02:17:14Z)
• FatNet: A Feature-attentive Network for 3D Point Cloud Processing [1.502579291513768]
  We introduce a novel feature-attentive neural network layer, a FAT layer, that combines both global point-based features and local edge-based features in order to generate better embeddings. Our architecture achieves state-of-the-art results on the task of point cloud classification, as demonstrated on the ModelNet40 dataset.
  arXiv  Detail & Related papers  (2021-04-07T23:13:56Z)
• PC-RGNN: Point Cloud Completion and Graph Neural Network for 3D Object Detection [57.49788100647103]
  LiDAR-based 3D object detection is an important task for autonomous driving. Current approaches suffer from sparse and partial point clouds of distant and occluded objects. In this paper, we propose a novel two-stage approach, namely PC-RGNN, dealing with such challenges by two specific solutions.
  arXiv  Detail & Related papers  (2020-12-18T18:06:43Z)
• Unsupervised Feedforward Feature (UFF) Learning for Point Cloud Classification and Segmentation [57.62713515497585]
  Unsupervised feedforward feature learning is proposed for joint classification and segmentation of 3D point clouds. The UFF method exploits statistical correlations of points in a point cloud set to learn shape and point features in a one-pass feedforward manner. It learns global shape features through the encoder and local point features through the encoder-decoder architecture.
  arXiv  Detail & Related papers  (2020-09-02T18:25:25Z)
• Dense-Resolution Network for Point Cloud Classification and Segmentation [42.316932316581635]
  DRNet is designed to learn local point features from the point cloud in different resolutions. In addition to validating the network on widely used point cloud segmentation and classification benchmarks, we also test and visualize the performance of the components.
  arXiv  Detail & Related papers  (2020-05-14T06:13:53Z)
• RPM-Net: Robust Point Matching using Learned Features [79.52112840465558]
  RPM-Net is a less sensitive and more robust deep learning-based approach for rigid point cloud registration. Unlike some existing methods, our RPM-Net handles missing correspondences and point clouds with partial visibility.
  arXiv  Detail & Related papers  (2020-03-30T13:45:27Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.