RSKDD-Net: Random Sample-based Keypoint Detector and Descriptor

• URL: http://arxiv.org/abs/2010.12394v1
• Date: Fri, 23 Oct 2020 13:29:29 GMT
• Title: RSKDD-Net: Random Sample-based Keypoint Detector and Descriptor
• Authors: Fan Lu and Guang Chen and Yinlong Liu and Zhongnan Qu and Alois Knoll
• Abstract summary: This paper proposes Random Sample-based Keypoint Detector and Descriptor Network (RSKDD-Net) for large scale point cloud registration. The key idea is using random sampling to efficiently select candidate points and using a learning-based method to jointly generate keypoints and descriptors. Experiments on two large scale outdoor LiDAR datasets show that the proposed RSKDD-Net achieves state-of-the-art performance with more than 15 times faster than existing methods.
• Score: 11.393546826269372
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Keypoint detector and descriptor are two main components of point cloud registration. Previous learning-based keypoint detectors rely on saliency estimation for each point or farthest point sample (FPS) for candidate points selection, which are inefficient and not applicable in large scale scenes. This paper proposes Random Sample-based Keypoint Detector and Descriptor Network (RSKDD-Net) for large scale point cloud registration. The key idea is using random sampling to efficiently select candidate points and using a learning-based method to jointly generate keypoints and descriptors. To tackle the information loss of random sampling, we exploit a novel random dilation cluster strategy to enlarge the receptive field of each sampled point and an attention mechanism to aggregate the positions and features of neighbor points. Furthermore, we propose a matching loss to train the descriptor in a weakly supervised manner. Extensive experiments on two large scale outdoor LiDAR datasets show that the proposed RSKDD-Net achieves state-of-the-art performance with more than 15 times faster than existing methods. Our code is available at https://github.com/ispc-lab/RSKDD-Net.

Related papers

• DeDoDe: Detect, Don't Describe -- Describe, Don't Detect for Local Feature Matching [14.837075102089]
  Keypoint detection is a pivotal step in 3D reconstruction, whereby sets of (up to) K points are detected in each view of a scene. Previous learning-based methods typically learn descriptors with keypoints, and treat the keypoint detection as a binary classification task on mutual nearest neighbours. In this work, we learn keypoints directly from 3D consistency. To this end, we derive a semi-supervised two-view detection objective to expand this set to a desired number of detections. Results show that our approach, DeDoDe, achieves significant gains on multiple geometry benchmarks.
  arXiv  Detail & Related papers  (2023-08-16T16:37:02Z)
• Attention-based Point Cloud Edge Sampling [0.0]
  Point cloud sampling is a less explored research topic for this data representation. This paper proposes a non-generative Attention-based Point cloud Edge Sampling method (APES) Both qualitative and quantitative experimental results show the superior performance of our sampling method on common benchmark tasks.
  arXiv  Detail & Related papers  (2023-02-28T15:36:17Z)
• AU-PD: An Arbitrary-size and Uniform Downsampling Framework for Point Clouds [6.786701761788659]
  We introduce the AU-PD, a novel task-aware sampling framework that directly downsamples point cloud to any smaller size. We refine the pre-sampled set to make it task-aware, driven by downstream task losses. With the attention mechanism and proper training scheme, the framework learns to adaptively refine the pre-sampled set of different sizes.
  arXiv  Detail & Related papers  (2022-11-02T13:37:16Z)
• Centroid Distance Keypoint Detector for Colored Point Clouds [32.74803728070627]
  Keypoint detection serves as the basis for many computer vision and robotics applications. We propose an efficient multi-modal keypoint detector that can extract both geometry-salient and color-salient keypoints in colored point clouds.
  arXiv  Detail & Related papers  (2022-10-04T00:55:51Z)
• Point-to-Box Network for Accurate Object Detection via Single Point Supervision [51.95993495703855]
  We introduce a lightweight alternative to the off-the-shelf proposal (OTSP) method. P2BNet can construct an inter-objects balanced proposal bag by generating proposals in an anchor-like way. The code will be released at COCO.com/ucas-vg/P2BNet.
  arXiv  Detail & Related papers  (2022-07-14T11:32:00Z)
• Stratified Transformer for 3D Point Cloud Segmentation [89.9698499437732]
  Stratified Transformer is able to capture long-range contexts and demonstrates strong generalization ability and high performance. To combat the challenges posed by irregular point arrangements, we propose first-layer point embedding to aggregate local information. Experiments demonstrate the effectiveness and superiority of our method on S3DIS, ScanNetv2 and ShapeNetPart datasets.
  arXiv  Detail & Related papers  (2022-03-28T05:35:16Z)
• Beyond Farthest Point Sampling in Point-Wise Analysis [52.218037492342546]
  We propose a novel data-driven sampler learning strategy for point-wise analysis tasks. We learn sampling and downstream applications jointly. Our experiments show that jointly learning of the sampler and task brings remarkable improvement over previous baseline methods.
  arXiv  Detail & Related papers  (2021-07-09T08:08:44Z)
• Learning Semantic Segmentation of Large-Scale Point Clouds with Random Sampling [52.464516118826765]
  We introduce RandLA-Net, an efficient and lightweight neural architecture to infer per-point semantics for large-scale point clouds. The key to our approach is to use random point sampling instead of more complex point selection approaches. Our RandLA-Net can process 1 million points in a single pass up to 200x faster than existing approaches.
  arXiv  Detail & Related papers  (2021-07-06T05:08:34Z)
• A Self-Training Approach for Point-Supervised Object Detection and Counting in Crowds [54.73161039445703]
  We propose a novel self-training approach that enables a typical object detector trained only with point-level annotations. During training, we utilize the available point annotations to supervise the estimation of the center points of objects. Experimental results show that our approach significantly outperforms state-of-the-art point-supervised methods under both detection and counting tasks.
  arXiv  Detail & Related papers  (2020-07-25T02:14:42Z)
• Key Points Estimation and Point Instance Segmentation Approach for Lane Detection [65.37887088194022]
  We propose a traffic line detection method called Point Instance Network (PINet) The PINet includes several stacked hourglass networks that are trained simultaneously. The PINet achieves competitive accuracy and false positive on the TuSimple and Culane datasets.
  arXiv  Detail & Related papers  (2020-02-16T15:51:30Z)

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.