Efficient 3D object recognition via geometric information preservation

被引:28
作者
Liu, Hongsen [1 ,2 ,3 ,4 ]
Cong, Yang [1 ,2 ,3 ]
Yang, Chenguang [5 ]
Tang, Yandong [1 ,2 ,3 ]
机构
[1] Chinese Acad Sci, Shenyang Inst Automat, State Key Lab Robot, Shenyang 110016, Liaoning, Peoples R China
[2] Chinese Acad Sci, Inst Robot, Shenyang 110016, Liaoning, Peoples R China
[3] Chinese Acad Sci, Inst Intelligent Mfg, Shenyang 110016, Liaoning, Peoples R China
[4] Univ Chinese Acad Sci, Beijing 100049, Peoples R China
[5] Univ West England, Bristol Robot Lab, Bristol BS16 1QY, Avon, England
关键词
Stacked 3D feature encoder; 3D object recognition; 6-DOF pose estimation; Geometric information preservation; FRAMEWORK; FEATURES;
D O I
10.1016/j.patcog.2019.03.025
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Accurate 3D object recognition and 6-DOF pose estimation have been pervasively applied to a variety of applications, such as unmanned warehouse, cooperative robots, and manufacturing industry. How to extract a robust and representative feature from the point clouds is an inevitable and important issue. In this paper, an unsupervised feature learning network is introduced to extract 3D keypoint features from point clouds directly, rather than transforming point clouds to voxel grids or projected RGB images, which saves computational time while preserving the object geometric information as well. Specifically, the proposed network features in a stacked point feature encoder, which can stack the local discriminative features within its neighborhoods to the original point-wise feature counterparts. The main framework consists of both offline training phase and online testing phase. In the offline training phase, the stacked point feature encoder is trained first and then generate feature database of all keypoints, which are sampled from synthetic point clouds of multiple model views. In the online testing phase, each feature extracted from the unknown testing scene is matched among the database by using the K-D tree voting strategy. Afterwards, the matching results are achieved by using the hypothesis & verification strategy. The proposed method is extensively evaluated on four public datasets and the results show that ours deliver comparable or even superior performances than the state-of-the-arts in terms of F1-score, Average of the 3D distance (ADD) and Recognition rate. (C) 2019 Elsevier Ltd. All rights reserved.
引用
收藏
页码:135 / 145
页数:11
相关论文
共 45 条
  • [1] [Anonymous], TRISI DISTINCTIVE LO
  • [2] [Anonymous], CVPR
  • [3] [Anonymous], 2018, CVPR
  • [4] [Anonymous], 2013, PROC ASIAN C COMPUT
  • [5] [Anonymous], BMVC
  • [6] [Anonymous], COMPUT SCI
  • [7] [Anonymous], IEEE T CYBERNET
  • [8] [Anonymous], CVPR
  • [9] [Anonymous], ICRA
  • [10] [Anonymous], P IEEE INT C ROB AUT