We present KDFNet, a novel method for 6D object pose estimation from RGB images. To handle occlusion, many recent works have proposed to localize 2D keypoints through pixel-wise voting and solve a Perspective-n-Point (PnP) problem for pose estimation, which achieves leading performance. However, such voting process is direction-based and cannot handle long and thin objects where the direction intersections cannot be robustly found. To address this problem, we propose a novel continuous representation called Keypoint Distance Field (KDF) for projected 2D keypoint locations. Formulated as a 2D array, each element of the KDF stores the 2D Euclidean distance between the corresponding image pixel and a specified projected 2D keypoint. We use a fully convolutional neural network to regress the KDF for each keypoint. Using this KDF encoding of projected object keypoint locations, we propose to use a distance-based voting scheme to localize the keypoints by calculating circle intersections in a RANSAC fashion. We validate the design choices of our framework by extensive ablation experiments. Our proposed method achieves state-of-the-art performance on Occlusion LINEMOD dataset with an average ADD(-S) accuracy of 50.3% and TOD dataset mug subset with an average ADD accuracy of 75.72%. Extensive experiments and visualizations demonstrate that the proposed method is able to robustly estimate the 6D pose in challenging scenarios including occlusion.
翻译:我们为 6D 对象展示了 KDFNet, 这是 6D 对象从 RGB 图像中进行估计的一种新颖方法 。 为了处理隐蔽性, 许多最近的工作都提议通过像素类投票, 将 2D 关键点定位为本地化, 并解决要做出估计的视野- 点( PnP) 问题, 从而实现领先性性能。 但是, 这种投票程序基于方向, 无法在无法找到方向交叉点的地方处理长细对象。 为了解决这个问题, 我们提议为预测 2D 关键点定位定位, 名为 Keypoint 远程字段( KDF) 。 以 2D 矩阵设置, 每一个 KDF 选项的每个元素都通过像素类投票来存储 2D Euclideidean 选项, 在相应的图像像素像素像素像素和特定预测的 2DG 键点之间保持本地化 2D 。 我们使用完全进化的神经网络来重新控制 KDF 。 我们提议的方法是使用远程投票计划,, 通过用 RBC 以 RDDD 平均的精确性 来计算, 和ODDD 显示性数据 显示性 。 我们的方法, 显示的性数据- DDDDDDDDDD 显示的性平比 。