Redirigiendo al acceso original de articulo en 19 segundos...
Inicio  /  Algorithms  /  Vol: 13 Par: 12 (2020)  /  Artículo
ARTÍCULO
TITULO

Unsupervised Clustering of Neighborhood Associations and Image Segmentation Applications

Zhenggang Wang    
Xuantong Li    
Jin Jin    
Zhong Liu and Wei Liu    

Resumen

Irregular shape clustering is always a difficult problem in clustering analysis. In this paper, by analyzing the advantages and disadvantages of existing clustering analysis algorithms, a new neighborhood density correlation clustering (NDCC) algorithm for quickly discovering arbitrary shaped clusters. Because the density of the center region of any cluster sample dataset is greater than that of the edge region, the data points can be divided into core, edge, and noise data points, and then the density correlation of the core data points in their neighborhood can be used to form a cluster. Further more, by constructing an objective function and optimizing the parameters automatically, a locally optimal result that is close to the globally optimal solution can be obtained. This algorithm avoids the clustering errors caused by iso-density points between clusters. We compare this algorithm with other five clustering algorithms and verify it on two common remote sensing image datasets. The results show that it can cluster the same ground objects in remote sensing images into one class and distinguish different ground objects. NDCC has strong robustness to irregular scattering dataset and can solve the clustering problem of remote sensing image.

 Artículos similares

       
 
Zhimeng Li, Wen Zhong, Weiwen Liao, Yiqun Cai, Jian Zhao and Guofeng Wang    
Real-time tool condition monitoring (TCM) is becoming more and more important to meet the increased requirement of reducing downtime and ensuring the machining quality of manufacturing systems. However, it is difficult to satisfy both robustness and effe... ver más
Revista: Applied Sciences

 
Feng Peng and Kai Li    
Most existing deep image clustering methods use only class-level representations for clustering. However, the class-level representation alone is not sufficient to describe the differences between images belonging to the same cluster. This may lead to hi... ver más
Revista: Applied Sciences

 
Deepesh Chugh, Himanshu Mittal, Amit Saxena, Ritu Chauhan, Eiad Yafi and Mukesh Prasad    
Determining the optimal feature set is a challenging problem, especially in an unsupervised domain. To mitigate the same, this paper presents a new unsupervised feature selection method, termed as densest feature graph augmentation with disjoint feature ... ver más
Revista: Algorithms

 
Libero Nigro and Pasi Fränti    
This paper proposes two algorithms for clustering data, which are variable-sized sets of elementary items. An example of such data occurs in the analysis of a medical diagnosis, where the goal is to detect human subjects who share common diseases to poss... ver más
Revista: Algorithms

 
Saharsh Barve, Jody M. Webster and Rohitash Chandra    
Environmental damage has been of much concern, particularly in coastal areas and the oceans, given climate change and the drastic effects of pollution and extreme climate events. Our present-day analytical capabilities, along with advancements in informa... ver más
Revista: Information