3D shape clustering is developing into an important research subject with the wide applications of 3D shapes in computer vision and multimedia fields. Since 3D shapes generally take on various modalities, how to comprehensively exploit the multi-modal properties to boost clustering performance has become a key issue for the 3D shape clustering task. Taking into account the advantages of multiple views and point clouds, this paper proposes the first multi-modal 3D shape clustering method, named the dual contrastive learning network (DCL-Net), to discover the clustering partitions of unlabeled 3D shapes. First, by simultaneously performing cross-view contrastive learning within multi-view modality and cross-modal contrastive learning between the point cloud and multi-view modalities in the representation space, a representation-level dual contrastive learning module is developed, which aims to capture discriminative 3D shape features for clustering. Meanwhile, an assignment-level dual contrastive learning module is designed by further ensuring the consistency of clustering assignments within the multi-view modality, as well as between the point cloud and multi-view modalities, thus obtaining more compact clustering partitions. Experiments on two commonly used 3D shape benchmarks demonstrate the effectiveness of the proposed DCL-Net.
Hyperspectral image (HSI) clustering is a challenging task due to the complex spatial-spectral structure and high-dimensional property in HSI data. In this letter, a novel clustering information-constrained 3D U-Net subspace clustering network is proposed for HSI clustering. Considering the spatial-spectral information, the proposed network takes the 3D pixel cubes around the pixels as the input. Based on the 3D pixel cubes, a 3D U-Net subspace clustering network is introduced to extract spatial-spectral features from 3D pixel cubes and learn self-representation subspace property among pixels. In order to learn features more suitable for clustering, a clustering information constraint is introduced to explore useful information gain in the existing clustering result. Experiments conducted on three public HSI datasets illustrate the superior performance of the proposed method.