Adaptive Attribute and Structure Subspace Clustering Network
arXiv:2109.13742 · doi:10.1109/TIP.2022.3171421
Abstract
Deep self-expressiveness-based subspace clustering methods have demonstrated effectiveness. However, existing works only consider the attribute information to conduct the self-expressiveness, which may limit the clustering performance. In this paper, we propose a novel adaptive attribute and structure subspace clustering network (AASSC-Net) to simultaneously consider the attribute and structure information in an adaptive graph fusion manner. Specifically, we first exploit an auto-encoder to represent input data samples with latent features for the construction of an attribute matrix. We also construct a mixed signed and symmetric structure matrix to capture the local geometric structure underlying data samples. Then, we perform self-expressiveness on the constructed attribute and structure matrices to learn their affinity graphs separately. Finally, we design a novel attention-based fusion module to adaptively leverage these two affinity graphs to construct a more discriminative affinity graph. Extensive experimental results on commonly used benchmark datasets demonstrate that our AASSC-Net significantly outperforms state-of-the-art methods. In addition, we conduct comprehensive ablation studies to discuss the effectiveness of the designed modules. The code will be publicly available at https://github.com/ZhihaoPENG-CityU.
This paper has been accepted by IEEE Transactions on Image Processing
References in corpus (8)
- Adam: A Method for Stochastic Optimization
- Robust Recovery of Subspace Structures by Low-Rank Representation
- Deep Representation Learning with Part Loss for Person Re-Identification
- Pseudo-supervised Deep Subspace Clustering
- Latent Complete Row Space Recovery for Multi-view Subspace Clustering
- Robust Subspace Clustering with Compressed Data
- Maximum Entropy Subspace Clustering Network
- Towards Clustering-friendly Representations: Subspace Clustering via Graph Filtering