DSets-DBSCAN: A Parameter-Free Clustering Algorithm

被引:183
作者
Hou, Jian [1 ,2 ]
Gao, Huijun [3 ]
Li, Xuelong [4 ]
机构
[1] Bohai Univ, Coll Engn, Jinzhou 121013, Peoples R China
[2] Univ Ca Foscari Venezia, European Ctr Living Technol, I-30124 Venice, Italy
[3] Harbin Inst Technol, Res Inst Intelligent Control & Syst, Harbin 150001, Peoples R China
[4] Chinese Acad Sci, Ctr Opt IMagery Anal & Learning OPTIMAL, State Key Lab Transient Opt & Photon, Xian Inst Opt & Precis Mech, Xian 710119, Peoples R China
基金
中国国家自然科学基金;
关键词
Clustering; similarity matrix; histogram equalization; dominant sets; parameter-free; DOMINANT SETS; NUMBER;
D O I
10.1109/TIP.2016.2559803
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Clustering image pixels is an important image segmentation technique. While a large amount of clustering algorithms have been published and some of them generate impressive clustering results, their performance often depends heavily on user-specified parameters. This may be a problem in the practical tasks of data clustering and image segmentation. In order to remove the dependence of clustering results on user-specified parameters, we investigate the characteristics of existing clustering algorithms and present a parameter-free algorithm based on the DSets (dominant sets) and DBSCAN (Density-Based Spatial Clustering of Applications with Noise) algorithms. First, we apply histogram equalization to the pairwise similarity matrix of input data and make DSets clustering results independent of user-specified parameters. Then, we extend the clusters from DSets with DBSCAN, where the input parameters are determined based on the clusters from DSets automatically. By merging the merits of DSets and DBSCAN, our algorithm is able to generate the clusters of arbitrary shapes without any parameter input. In both the data clustering and image segmentation experiments, our parameter-free algorithm performs better than or comparably with other algorithms with careful parameter tuning.
引用
收藏
页码:3182 / 3193
页数:12
相关论文
共 28 条
[1]  
Acharya T, 2005, IMAGE PROCESSING: PRINCIPLES AND APPLICATIONS, P1, DOI 10.1002/0471745790
[2]  
[Anonymous], P INT C PATT REC
[3]  
[Anonymous], 2008, Introduction to information retrieval
[4]  
[Anonymous], 2007, ACM Transactions on Knowledge Discovery from Data, DOI [DOI 10.1145/1217299.1217303, 10.1145/1217299.1217303]
[5]   Graph-based quadratic optimization: A fast evolutionary approach [J].
Bulo, Samuel Rota ;
Pelillo, Marcello ;
Bomze, Immanuel M. .
COMPUTER VISION AND IMAGE UNDERSTANDING, 2011, 115 (07) :984-995
[6]   Robust path-based spectral clustering [J].
Chang, Hong ;
Yeung, Dit-Yan .
PATTERN RECOGNITION, 2008, 41 (01) :191-203
[7]   Power watersheds: A new image segmentation framework extending graph cuts, random walker and optimal spanning forest [J].
Couprie, Camille ;
Grady, Leo ;
Najman, Laurent ;
Talbot, Hugues .
2009 IEEE 12TH INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV), 2009, :731-738
[8]   Looking for natural patterns in data - Part 1. Density-based approach [J].
Daszykowski, M ;
Walczak, B ;
Massart, DL .
CHEMOMETRICS AND INTELLIGENT LABORATORY SYSTEMS, 2001, 56 (02) :83-92
[9]  
Ester M., 1996, KDD-96 Proceedings. Second International Conference on Knowledge Discovery and Data Mining, P226
[10]   Detecting the number of clusters of individuals using the software STRUCTURE: a simulation study [J].
Evanno, G ;
Regnaut, S ;
Goudet, J .
MOLECULAR ECOLOGY, 2005, 14 (08) :2611-2620