Deep density-based image clustering

被引:67
作者
Ren, Yazhou [1 ,2 ]
Wang, Ni [1 ]
Li, Mingxia [1 ]
Xu, Zenglin [3 ]
机构
[1] Univ Elect Sci & Technol China, Sch Comp Sci & Engn, Chengdu 611731, Peoples R China
[2] UESTC Guangdong, Inst Elect & Informat Engn, Dongguan 523808, Peoples R China
[3] Harbin Inst Technol, Sch Comp Sci & Technol, Shenzhen, Peoples R China
基金
中国博士后科学基金; 中国国家自然科学基金;
关键词
Deep clustering; Density-based clustering; Feature learning; FAST SEARCH; REPRESENTATIONS; ALGORITHM;
D O I
10.1016/j.knosys.2020.105841
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Recently, deep clustering, which is able to perform feature learning that favors clustering tasks via deep neural networks, has achieved remarkable performance in image clustering applications. However, the existing deep clustering algorithms generally need the number of clusters in advance, which is usually unknown in real-world tasks. In addition, the initial cluster centers in the learned feature space are generated by k-means. This only works well on spherical clusters and probably leads to unstable clustering results. In this paper, we propose a two-stage deep density-based image clustering (DDC) framework to address these issues. The first stage is to train a deep convolutional autoencoder (CAE) to extract low-dimensional feature representations from high-dimensional image data, and then apply t-SNE to further reduce the data to a 2-dimensional space favoring density-based clustering algorithms. In the second stage, we propose a novel density-based clustering technique for the 2-dimensional embedded data to automatically recognize an appropriate number of clusters with arbitrary shapes. Concretely, a number of local clusters are generated to capture the local structures of clusters, and then are merged via their density relationship to form the final clustering result. Experiments demonstrate that the proposed DDC achieves comparable or even better clustering performance than state-of-the-art deep clustering methods, even though the number of clusters is not given. (C) 2020 Elsevier B.V. All rights reserved.
引用
收藏
页数:8
相关论文
共 54 条
[1]  
Angiulli F, 2004, LECT NOTES COMPUT SC, V3177, P203
[2]  
Ankerst M, 1999, SIGMOD RECORD, VOL 28, NO 2 - JUNE 1999, P49
[3]  
[Anonymous], ARXIV180610069
[4]  
[Anonymous], 2008, P 25 INT C MACHINE L
[5]  
[Anonymous], ARXIV150103084
[6]   Representation Learning: A Review and New Perspectives [J].
Bengio, Yoshua ;
Courville, Aaron ;
Vincent, Pascal .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2013, 35 (08) :1798-1828
[7]   Learning Deep Architectures for AI [J].
Bengio, Yoshua .
FOUNDATIONS AND TRENDS IN MACHINE LEARNING, 2009, 2 (01) :1-127
[8]  
Bishop C.M., 2006, PATTERN RECOGN, V1st ed., P430, DOI DOI 10.2514/1.59844
[9]  
Chang JL, 2017, IEEE I CONF COMP VIS, P5880, DOI [10.1109/ICCV.2017.626, 10.1109/ICCV.2017.627]
[10]   CLUE: Cluster-based retrieval of images by unsupervised learning [J].
Chen, YX ;
Wang, JZ ;
Krovetz, R .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2005, 14 (08) :1187-1201