I-HS4PCS: Object 6D Pose Estimation Method Based on Harris3D-ikdTree Optimization

被引:0
作者
Zhang, Ziang [1 ]
Li, Hongsheng [1 ]
机构
[1] Nanjing Inst Technol, Sch Automat, Nanjing 211167, Peoples R China
关键词
Point cloud compression; Pose estimation; Feature extraction; Three-dimensional displays; Accuracy; Mathematical models; Vectors; 3D point cloud; Harris; 3D; Super4PCS; ikd-tree; ICP; REGISTRATION;
D O I
10.1109/ACCESS.2024.3462756
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Object 6D pose estimation is a critical task in image processing and various other fields. It involves determining both the three-degree-of-freedom translation and the three-degree-of-freedom rotation information of the target object within the camera coordinate system. I-HS4PCS algorithm is introduced to address the issue of extended execution times in the current pose estimation algorithm. Initially, adapted Harris3D is employed to identify and filter feature points that effectively encapsulate point cloud feature information from the original point cloud dataset. These feature points are subsequently utilized as input data for Super4PCS coarse pose estimation step. Additionally, ikd-Tree data structure and point-wise deletion strategy are leveraged to enhance the ICP fine pose estimation procedure, significantly accelerating the search for the closest points. By maintaining the accuracy of pose estimation while simultaneously boosting algorithmic efficiency, I-HS4PCS have achieved notable improvements. The experimental validation, conducted using the Stanford University dataset and ShapeNet dataset, demonstrates significant advancements in comparison to other algorithms that employ Super4PCS for coarse pose estimation. Specifically, when compared to ICP, AA-ICP, and Sparse ICP, I-HS4PCS showcased a remarkable improvement in execution time by 80%, 66.8% and 88.3%.
引用
收藏
页码:138018 / 138026
页数:9
相关论文
共 32 条
[1]   4-points congruent sets for robust pairwise surface registration [J].
Aiger, Dror ;
Mitra, Niloy J. ;
Cohen-Or, Daniel .
ACM TRANSACTIONS ON GRAPHICS, 2008, 27 (03)
[2]   MULTIDIMENSIONAL BINARY SEARCH TREES USED FOR ASSOCIATIVE SEARCHING [J].
BENTLEY, JL .
COMMUNICATIONS OF THE ACM, 1975, 18 (09) :509-517
[3]   A METHOD FOR REGISTRATION OF 3-D SHAPES [J].
BESL, PJ ;
MCKAY, ND .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1992, 14 (02) :239-256
[4]   Sparse Iterative Closest Point [J].
Bouaziz, Sofien ;
Tagliasacchi, Andrea ;
Pauly, Mark .
COMPUTER GRAPHICS FORUM, 2013, 32 (05) :113-123
[5]  
Cai Y., 2021, arXiv, DOI DOI 10.48550/ARXIV.2102.10808
[6]   Optimal Grasping Strategy for Robots With a Parallel Gripper Based on Feature Sensing of 3D Object Model [J].
Chiang, Hsin-Han ;
You, Jiun-Kai ;
Hsu, Chen-Chien James ;
Jo, Jun .
IEEE ACCESS, 2022, 10 :24056-24066
[7]   The MOPED framework: Object recognition and pose estimation for manipulation [J].
Collet, Alvaro ;
Martinez, Manuel ;
Srinivasa, Siddhartha S. .
INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH, 2011, 30 (10) :1284-1306
[8]   Vision-based robotic grasping from object localization, object pose estimation to grasp estimation for parallel grippers: a review [J].
Du, Guoguang ;
Wang, Kai ;
Lian, Shiguo ;
Zhao, Kaiyong .
ARTIFICIAL INTELLIGENCE REVIEW, 2021, 54 (03) :1677-1734
[9]  
[范强 Fan Qiang], 2020, [图学学报, Journal of Graphics], V41, P567
[10]  
Friedman J. H., 1977, ACM Transactions on Mathematical Software, V3, P209, DOI 10.1145/355744.355745