PointNetLK: Robust & Efficient Point Cloud Registration using PointNet

Yasuhiro Aoki, Hunter Goforth, Rangaprasad Arun Srivatsan, Simon Lucey
3/13/2019
cs.CV

Official code: hmgoforth/PointNetLK (494 stars, MIT, last commit 2019-06-23).

Abstract

PointNet has revolutionized how we think about representing point clouds. For classification and segmentation tasks, the approach and its subsequent extensions are state-of-the-art. To date, the successful application of PointNet to point cloud registration has remained elusive. In this paper we argue that PointNet itself can be thought of as a learnable "imaging" function. As a consequence, classical vision algorithms for image alignment can be applied on the problem - namely the Lucas & Kanade (LK) algorithm. Our central innovations stem from: (i) how to modify the LK algorithm to accommodate the PointNet imaging function, and (ii) unrolling PointNet and the LK algorithm into a single trainable recurrent deep neural network. We describe the architecture, and compare its performance against state-of-the-art in common registration scenarios. The architecture offers some remarkable properties including: generalization across shape categories and computational efficiency - opening up new paths of exploration for the application of deep learning to point cloud registration. Code and videos are available at https://github.com/hmgoforth/PointNetLK.

View on arXivView PDF

Code Implementations(1)

MIT
49493Shell, PythonMar 13, 20197 years agoMIT

Similar Papers

Cite this paper

@article{aoki2019pointnetlk,
  title  = {PointNetLK: Robust & Efficient Point Cloud Registration using PointNet},
  author = {Yasuhiro Aoki and Hunter Goforth and Rangaprasad Arun Srivatsan and Simon Lucey},
  year   = {2019},
  eprint = {1903.05711},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/1903.05711}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/1903.05711.svg)](https://codeofpaper.com/paper/1903.05711)

Discussion