TY - JOUR
T1 - Robust image clustering via context-aware contrastive graph learning
AU - Fang, Uno
AU - Li, Jianxin
AU - Lu, Xuequan
AU - Mian, Ajmal
AU - Gu, Zhaoquan
PY - 2023/6
Y1 - 2023/6
N2 - Graph convolution networks (GCN) have recently become popular for image clustering. However, existing GCN-based image clustering techniques focus on learning image neighbourhoods which leads to poor reasoning on the cluster boundaries. To address this challenge, we propose a supervised image clustering approach based on contrastive graph learning (CGL). Our method generates an influential graph view (IGV) and a topological graph view (TGV) for each class to represent its global context from different viewpoints. These generated graph views are used to reason the inter-cluster relationships and intra-cluster boundaries from the local context of each node in a contrastive manner. Our method considers each class as a fully connected graph to explore its characteristics and strategically generate directional graph views. This enhances the transferability of the proposed approach to handle data with a similar structure. We conduct extensive experiments on open datasets such as LFW, CASIA-WebFace, and CIFAR-10 and show that our method outperforms state-of-the-art including deep GRAph Contrastive rEpresentation learning (GRACE), GraphCL, and Graph Contrastive Clustering (GCC).
AB - Graph convolution networks (GCN) have recently become popular for image clustering. However, existing GCN-based image clustering techniques focus on learning image neighbourhoods which leads to poor reasoning on the cluster boundaries. To address this challenge, we propose a supervised image clustering approach based on contrastive graph learning (CGL). Our method generates an influential graph view (IGV) and a topological graph view (TGV) for each class to represent its global context from different viewpoints. These generated graph views are used to reason the inter-cluster relationships and intra-cluster boundaries from the local context of each node in a contrastive manner. Our method considers each class as a fully connected graph to explore its characteristics and strategically generate directional graph views. This enhances the transferability of the proposed approach to handle data with a similar structure. We conduct extensive experiments on open datasets such as LFW, CASIA-WebFace, and CIFAR-10 and show that our method outperforms state-of-the-art including deep GRAph Contrastive rEpresentation learning (GRACE), GraphCL, and Graph Contrastive Clustering (GCC).
KW - Contrastive graph learning
KW - Graph convolution network
KW - Graph view generation
KW - Supervised clustering
UR - http://www.scopus.com/inward/record.url?scp=85146688940&partnerID=8YFLogxK
U2 - 10.1016/j.patcog.2023.109340
DO - 10.1016/j.patcog.2023.109340
M3 - Article
AN - SCOPUS:85146688940
SN - 0031-3203
VL - 138
JO - Pattern Recognition
JF - Pattern Recognition
M1 - 109340
ER -