An automatic clustering algorithm based on the density-peak framework and Chameleon method

2021 ◽  
Author(s):  
Zhou Liang ◽  
Pei Chen
Keyword(s):  
Clustering Algorithm ◽  
Density Peak ◽  
Automatic Clustering

Segmentation of SAR Image using Fuzzy C-Means and Filters

2020 ◽  
Vol 8 (1) ◽  
pp. 84-90
Author(s):  
R. Lalchhanhima ◽  
◽  
Debdatta Kandar ◽  
R. Chawngsangpuii ◽  
Vanlalmuansangi Khenglawt ◽  
...  
Keyword(s):  
Clustering Algorithm ◽  
State Of The Art ◽  
Speckle Noise ◽  
Synthetic Aperture Radar Image ◽  
Synthetic Aperture ◽  
Sar Image ◽  
Spatial Filters ◽  
Fuzzy C Means ◽  
Automatic Clustering ◽  
Intensity Information

Fuzzy C-Means is an unsupervised clustering algorithm for the automatic clustering of data. Synthetic Aperture Radar Image Segmentation has been a challenging task because of the presence of speckle noise. Therefore the segmentation process can not directly rely on the intensity information alone but must consider several derived features in order to get satisfactory segmentation results. In this paper, it is attempted to use the fuzzy nature of classification for the purpose of unsupervised region segmentation in which FCM is employed. Different features are obtained by filtering of the image by using different spatial filters and are selected for segmentation criteria. The segmentation performance is determined by the accuracy compared with a different state of the art techniques proposed recently.

A population-based automatic clustering algorithm for image segmentation

2021 ◽  
Author(s):  
Seyed Jalaleddin Mousavirad ◽  
Gerald Schaefer ◽  
Mahshid Helali Moghadam ◽  
Mehrdad Saadatmand ◽  
Mahdi Pedram
Keyword(s):  
Image Segmentation ◽  
Clustering Algorithm ◽  
Population Based ◽  
Automatic Clustering

scholarly journals A Fast Density Peak Clustering Algorithm Optimized by Uncertain Number Neighbors for Breast MR Image

2019 ◽  
Vol 1229 ◽  
pp. 012024 ◽  
Author(s):  
Fan Hong ◽  
Yang Jing ◽  
Hou Cun-cun ◽  
Zhang Ke-zhen ◽  
Yao Ruo-xia
Keyword(s):  
Clustering Algorithm ◽  
Mr Image ◽  
Density Peak ◽  
Breast Mr ◽  
Density Peak Clustering

scholarly journals Nearest-Neighbour-Induced Isolation Similarity and Its Impact on Density-Based Clustering

2019 ◽  
Vol 33 ◽  
pp. 4755-4762 ◽  
Author(s):  
Xiaoyu Qin ◽  
Kai Ming Ting ◽  
Ye Zhu ◽  
Vincent CS Lee
Keyword(s):  
Clustering Algorithm ◽  
Distance Measure ◽  
Nearest Neighbour ◽  
Density Peak ◽  
Density Based Clustering ◽  
New Type ◽  
Density Peak Clustering ◽  
The Impact ◽  
First Time ◽  
Tree Method

A recent proposal of data dependent similarity called Isolation Kernel/Similarity has enabled SVM to produce better classification accuracy. We identify shortcomings of using a tree method to implement Isolation Similarity; and propose a nearest neighbour method instead. We formally prove the characteristic of Isolation Similarity with the use of the proposed method. The impact of Isolation Similarity on densitybased clustering is studied here. We show for the first time that the clustering performance of the classic density-based clustering algorithm DBSCAN can be significantly uplifted to surpass that of the recent density-peak clustering algorithm DP. This is achieved by simply replacing the distance measure with the proposed nearest-neighbour-induced Isolation Similarity in DBSCAN, leaving the rest of the procedure unchanged. A new type of clusters called mass-connected clusters is formally defined. We show that DBSCAN, which detects density-connected clusters, becomes one which detects mass-connected clusters, when the distance measure is replaced with the proposed similarity. We also provide the condition under which mass-connected clusters can be detected, while density-connected clusters cannot.

scholarly journals Deep Learning for Fingerprint Localization in Indoor and Outdoor Environments

2020 ◽  
Vol 9 (4) ◽  
pp. 267 ◽  
Author(s):  
Da Li ◽  
Yingke Lei ◽  
Xin Li ◽  
Haichuan Zhang
Keyword(s):  
Magnetic Field ◽  
Deep Learning ◽  
Clustering Algorithm ◽  
Fingerprint Image ◽  
Density Peak ◽  
Localization Accuracy ◽  
Localization System ◽  
Outdoor Environments ◽  
Indoor And Outdoor Environments ◽  
Indoor And Outdoor

Wi-Fi and magnetic field fingerprinting-based localization have gained increased attention owing to their satisfactory accuracy and global availability. The common signal-based fingerprint localization deteriorates due to well-known signal fluctuations. In this paper, we proposed a Wi-Fi and magnetic field-based localization system based on deep learning. Owing to the low discernibility of magnetic field strength (MFS) in large areas, the unsupervised learning density peak clustering algorithm based on the comparison distance (CDPC) algorithm is first used to pick up several center points of MFS as the geotagged features to assist localization. Considering the state-of-the-art application of deep learning in image classification, we design a location fingerprint image using Wi-Fi and magnetic field fingerprints for localization. Localization is casted in a proposed deep residual network (Resnet) that is capable of learning key features from a massive fingerprint image database. To further enhance localization accuracy, by leveraging the prior information of the pre-trained Resnet coarse localizer, an MLP-based transfer learning fine localizer is introduced to fine-tune the coarse localizer. Additionally, we dynamically adjusted the learning rate (LR) and adopted several data enhancement methods to increase the robustness of our localization system. Experimental results show that the proposed system leads to satisfactory localization performance both in indoor and outdoor environments.

A privacy‐preserving density peak clustering algorithm in cloud computing

2020 ◽  
Vol 32 (11) ◽  
Author(s):  
Liping Sun ◽  
Shang Ci ◽  
Xiaoqing Liu ◽  
Xiaoyao Zheng ◽  
Qingying Yu ◽  
...  
Keyword(s):  
Cloud Computing ◽  
Clustering Algorithm ◽  
Privacy Preserving ◽  
Density Peak ◽  
Density Peak Clustering

scholarly journals An Adaptive Ellipse Distance Density Peak Fuzzy Clustering Algorithm Based on the Multi-target Traffic Radar

Sensors ◽  
2020 ◽  
Vol 20 (17) ◽  
pp. 4920
Author(s):  
Lin Cao ◽  
Xinyi Zhang ◽  
Tao Wang ◽  
Kangning Du ◽  
Chong Fu
Keyword(s):  
Euclidean Distance ◽  
Clustering Algorithm ◽  
Spatial Clustering ◽  
Search Algorithm ◽  
Measurement Data ◽  
Data Sets ◽  
Density Peak ◽  
Close Range ◽  
Decision Graph ◽  
Membership Matrix

In the multi-target traffic radar scene, the clustering accuracy between vehicles with close driving distance is relatively low. In response to this problem, this paper proposes a new clustering algorithm, namely an adaptive ellipse distance density peak fuzzy (AEDDPF) clustering algorithm. Firstly, the Euclidean distance is replaced by adaptive ellipse distance, which can more accurately describe the structure of data obtained by radar measurement vehicles. Secondly, the adaptive exponential function curve is introduced in the decision graph of the fast density peak search algorithm to accurately select the density peak point, and the initialization of the AEDDPF algorithm is completed. Finally, the membership matrix and the clustering center are calculated through successive iterations to obtain the clustering result.The time complexity of the AEDDPF algorithm is analyzed. Compared with the density-based spatial clustering of applications with noise (DBSCAN), k-means, fuzzy c-means (FCM), Gustafson-Kessel (GK), and adaptive Euclidean distance density peak fuzzy (Euclid-ADDPF) algorithms, the AEDDPF algorithm has higher clustering accuracy for real measurement data sets in certain scenarios. The experimental results also prove that the proposed algorithm has a better clustering effect in some close-range vehicle scene applications. The generalization ability of the proposed AEDDPF algorithm applied to other types of data is also analyzed.

Sign in / Sign up

Export Citation Format

Share Document