Segmentation of images by color features: A survey

F Garcia-Lamont, J Cervantes, A López, L Rodriguez - Neurocomputing, 2018 - Elsevier
Image segmentation is an important stage for object recognition. Many methods have been
proposed in the last few years for grayscale and color images. In this paper, we present a …

Novel fuzzy clustering algorithm with variable multi-pixel fitting spatial information for image segmentation

H Zhang, H Li, N Chen, S Chen, J Liu - Pattern Recognition, 2022 - Elsevier
Spatial information is often used to enhance the robustness of traditional fuzzy c-means
(FCM) clustering algorithms. Although some recently emerged improvements are …

A fast clustering algorithm based on pruning unnecessary distance computations in DBSCAN for high-dimensional data

Y Chen, S Tang, N Bouguila, C Wang, J Du, HL Li - Pattern Recognition, 2018 - Elsevier
Clustering is an important technique to deal with large scale data which are explosively
created in internet. Most data are high-dimensional with a lot of noise, which brings great …

A fast DBSCAN algorithm for big data based on efficient density calculation

N Hanafi, H Saadatfar - Expert Systems with Applications, 2022 - Elsevier
Today, data is being generated with a high speed. Managing large volume of data has
become a challenge in the current age. Clustering is a method to analyze data that is …

Feature trend extraction and adaptive density peaks search for intelligent fault diagnosis of machines

Y Wang, Z Wei, J Yang - IEEE Transactions on Industrial …, 2018 - ieeexplore.ieee.org
Traditional machine fault diagnosis techniques are labor-intensive and hard for nonexperts
to use. In this paper, a novel three-stage intelligent fault diagnosis approach is proposed for …

Speeding up k-means clustering in high dimensions by pruning unnecessary distance computations

H Zhang, J Li, J Zhang, Y Dong - Knowledge-Based Systems, 2024 - Elsevier
Standard k-means clustering necessitates computing pairwise Euclidean distances between
each instance x in a data set D and all cluster centers, resulting in inadequate efficiency …

Density peak clustering using global and local consistency adjustable manifold distance

X Tao, W Guo, C Ren, Q Li, Q He, R Liu, J Zou - Information Sciences, 2021 - Elsevier
A novel density-based clustering algorithm, called Density Peak Clustering (DPC), has
recently received great attention due to its efficiency in clustering performance and simplicity …

Density decay graph-based density peak clustering

Z Zhang, Q Zhu, F Zhu, J Li, D Cheng, Y Liu… - Knowledge-Based …, 2021 - Elsevier
Abstract In 2014, Rodriguez and Laio proposed a famous clustering algorithm based on a
fast search and find density peaks dubbed as DPC (Rodriguez and Laio, 2014). DPC has …

Overcoming weaknesses of density peak clustering using a data-dependent similarity measure

Z Rasool, S Aryal, MR Bouadjenek, R Dazeley - Pattern Recognition, 2023 - Elsevier
Abstract Density Peak Clustering (DPC) is a popular state-of-the-art clustering algorithm,
which requires pairwise (dis) similarity of data objects to detect arbitrary shaped clusters …

Scsp: Spectral clustering filter pruning with soft self-adaption manners

H Zhuo, X Qian, Y Fu, H Yang, X Xue - arxiv preprint arxiv:1806.05320, 2018 - arxiv.org
Deep Convolutional Neural Networks (CNN) has achieved significant success in computer
vision field. However, the high computational cost of the deep complex models prevents the …