Robust image clustering via context-aware contrastive graph learning

被引:23
作者
Fang, Uno [1 ]
Li, Jianxin [2 ]
Lu, Xuequan [2 ]
Mian, Ajmal [3 ]
Gu, Zhaoquan [4 ]
机构
[1] Deakin Univ, Deakin Univ Southwest Univ Joint Res Ctr Big Data, Burwood, Vic 3125, Australia
[2] Deakin Univ, Fac Sci Engn & Built Environm, Sch IT, Geelong, Vic 3220, Australia
[3] Univ Western Australia, Comp Sci & Software Engn, Crawley, WA 6009, Australia
[4] Guangzhou Univ, Cyberspace Inst Adv Technol, Guangdong, Guangzhou 510006, Peoples R China
基金
澳大利亚研究理事会;
关键词
Supervised clustering; Graph convolution network; Contrastive graph learning; Graph view generation; FACES;
D O I
10.1016/j.patcog.2023.109340
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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 rea-soning on the cluster boundaries. To address this challenge, we propose a supervised image clustering ap-proach 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 view-points. 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). (c) 2023 Elsevier Ltd. All rights reserved.
引用
收藏
页数:11
相关论文
共 40 条
[1]  
Anguita D., 2013, Esann, P437
[2]  
[Anonymous], 2004, P 10 ACM SIGKDD INT, DOI [DOI 10.1145/1014052.101411, 10.1145/1014052.1014118]
[3]  
Arthur D, 2007, PROCEEDINGS OF THE EIGHTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, P1027
[4]  
Bravo-Hermsdorff G, 2019, ADV NEUR IN, V32
[5]  
Chen T, 2020, PR MACH LEARN RES, V119
[6]   Exploiting the structure of furthest neighbor search for fast approximate results [J].
Curtin, Ryan R. ;
Echauz, Javier ;
Gardner, Andrew B. .
INFORMATION SYSTEMS, 2019, 80 :124-135
[7]  
Defferrard M, 2016, ADV NEUR IN, V29
[8]   ArcFace: Additive Angular Margin Loss for Deep Face Recognition [J].
Deng, Jiankang ;
Guo, Jia ;
Xue, Niannan ;
Zafeiriou, Stefanos .
2019 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR 2019), 2019, :4685-4694
[9]  
Ester Martin, 1996, P 2 INT C KNOWLEDGE, DOI DOI 10.5555/3001460.3001507
[10]  
Fang U., 2022, GOMIC MULTIVIEW IMAG