Learning Dense Features for Point Cloud Registration Using a Graph Attention Network
Quoc Vinh Lai Dang, Sarvar Hussain Nengroo, Hojun Jin

TL;DR
This paper presents a novel graph attention network framework for efficient dense feature extraction in point cloud registration, achieving high accuracy and success rates on the KITTI dataset.
Contribution
It introduces a new method combining keypoint detection, density feature description, and graph attention for improved point cloud registration.
Findings
Achieves 99.88% registration success rate on KITTI dataset.
Outperforms existing state-of-the-art methods in registration accuracy.
Efficiently extracts dense features with reduced computational cost.
Abstract
Point cloud registration is a fundamental task in many applications such as localization, mapping, tracking, and reconstruction. Successful registration relies on extracting robust and discriminative geometric features. Though existing learning based methods require high computing capacity for processing a large number of raw points at the same time, computational capacity limitation is not an issue thanks to the powerful parallel computing process using GPU. In this paper, we introduce a framework that efficiently and economically extracts dense features using a graph attention network for point cloud matching and registration (DFGAT). The detector of the DFGAT is responsible for finding highly reliable key points in large raw data sets. The descriptor of the DFGAT takes these keypoints combined with their neighbors to extract invariant density features in preparation for the matching.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
