Key-Grid: Unsupervised 3D Keypoints Detection using Grid Heatmap Features
Chengkai Hou, Zhengrong Xue, Bingyang Zhou, Jinghan Ke, Lin Shao, Huazhe Xu
TL;DR
Key-Grid introduces an unsupervised 3D keypoint detector capable of handling both rigid and deformable objects by integrating a grid heatmap derived from keypoint skeletons into a reconstruction autoencoder. The encoder predicts keypoints and edge weights; the grid heatmap provides a dense geometric prior that guides the decoder during reconstruction. Training uses a Chamfer-based similarity loss together with a farthest-point keypoint loss to promote accurate, well-distributed keypoints, achieving state-of-the-art semantic consistency and localization on ShapeNetCoreV2 and ClothesNet, with demonstrated robustness to noise and downsampling and potential SE(3)-equivariant extensions via USEEK. Overall, Key-Grid advances unsupervised keypoint learning by leveraging a grid-based latent representation that remains effective under large shape variations and deformations, enabling more reliable downstream 3D understanding and manipulation.
Abstract
Detecting 3D keypoints with semantic consistency is widely used in many scenarios such as pose estimation, shape registration and robotics. Currently, most unsupervised 3D keypoint detection methods focus on the rigid-body objects. However, when faced with deformable objects, the keypoints they identify do not preserve semantic consistency well. In this paper, we introduce an innovative unsupervised keypoint detector Key-Grid for both the rigid-body and deformable objects, which is an autoencoder framework. The encoder predicts keypoints and the decoder utilizes the generated keypoints to reconstruct the objects. Unlike previous work, we leverage the identified keypoint in formation to form a 3D grid feature heatmap called grid heatmap, which is used in the decoder section. Grid heatmap is a novel concept that represents the latent variables for grid points sampled uniformly in the 3D cubic space, where these variables are the shortest distance between the grid points and the skeleton connected by keypoint pairs. Meanwhile, we incorporate the information from each layer of the encoder into the decoder section. We conduct an extensive evaluation of Key-Grid on a list of benchmark datasets. Key-Grid achieves the state-of-the-art performance on the semantic consistency and position accuracy of keypoints. Moreover, we demonstrate the robustness of Key-Grid to noise and downsampling. In addition, we achieve SE-(3) invariance of keypoints though generalizing Key-Grid to a SE(3)-invariant backbone.
