Abstract
Clustering is one of the most popular methods of machine learning. The process of clustering involves the division of a set of abstract objects into a certain number of groups which integrated with objects of similar characteristics. Therefore, a cluster integrates objects which are similar to them, but dissimilar to the elements that belong to the rest of the clusters. Several clustering methods have proposed in the literature with different performance levels. All these techniques use as similarity criterion the Euclidean distance among cluster elements. However, there exist diverse scenarios where the Euclidean distance cannot be utilized appropriately to separate the elements in groups. Under such conditions, traditional cluster methods cannot directly apply. On the other hand, the operations of dilate and erode are a set of non-linear operators that modify the shape of a data group in the feature space, to obtain a monolithic object. Although morphological operations have demonstrated its importance in several engineering fields as image processing, its use as a clustering technique has been practically overlooked. In this work, an alternative clustering algorithm is proposed to group elements without considering the distance as a similarity criterion. In our approach, the data were separated into different groups by considering morphological operations. Under this scheme, the procedure allows the integration of data points, which present a spatial connection. Since the proposed algorithm does not use the distance in its functioning, it solves complex clustering problems which traditional clustering algorithms cannot.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
K. Bailey, Numerical taxonomy and cluster analysis, in Typologies and Taxonomies (1994)
V. Cohen-Addad, V. Kanade, F. Mallmann-Trenn, C. Mathieu, Hierarchical clustering: objective functions and algorithms. J. ACM 66(4), 26 (2019)
Y. Tarabalka, J.A. Benediktsson, J. Chanussot, Spectral–spatial classification of hyperspectral imagery based on partitional clustering techniques. IEEE Trans. Geosci. Remote Sens. 47(8), 2973–2987 (2009)
M. Girolami, C. He, Probability density estimation from optimally condensed data samples. IEEE Trans. pattern Anal. (2003)
T. Liu, C. Rosenberg, H.A. Rowley, Clustering billions of images with large scale nearest neighbor search, in Proceedings—IEEE Workshop on Applications of Computer Vision, WACV 2007 (2007)
M. Ester, H. Kriegel, J. Sander, X. Xu, A density-based algorithm for discovering clusters in large spatial databases with noise, in KDD (1996)
C.C. Aggarwal, Data Mining (Springer, New York, 2015)
X. Wu et al., Top 10 algorithms in data mining. Knowl. Inf. Syst. 14(1), 1–37 (2008)
J.E. Gentle, L. Kaufman, P.J. Rousseuw, Finding groups in data: an introduction to cluster analysis. Biometrics 47(2), 788 (1991)
S. Harikumar, P.V. Surya, K-medoid clustering for heterogeneous datasets. Procedia Comput. Sci. 70, 226–237 (2015)
U. Maulik, S. Bandyopadhyay, Genetic algorithm-based clustering technique. Pattern Recognit. 33(9), 1455–1465 (2000)
G.H. Ball, D.J. Hall, ISODATA, a novel Method of data analysis and pattern classification (1965)
S. Lloyd, Least squares quantization in PCM. IEEE Trans. Inf. Theory 28(2), 129–137 (1982)
J. MacQueen, Some methods for classification and analysis of multivariate observations, in Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability (1967)
R.M. Gray, D.L. Neuhoff, Quantization. IEEE Trans. Inf. Theory 44(6) (1998)
S.Z. Selim, M.A. Ismail, K-means-type algorithms: a Generalized convergence theorem and characterization of local optimality. IEEE Trans. Pattern Anal. Mach. Intell. PAMI-6(1), 81–87 (1984)
H. Xiong, J. Wu, J. Chen, K-means clustering versus validation measures: a data-distribution perspective. IEEE Trans. Syst. Man, Cybern. Part B 39(2), 318–331 (2009)
S. Bandyopadhyay, S.K. Pal, B. Aruna, Multiobjective GAs, quantitative indices, and pattern classification. IEEE Trans. Syst. Man Cybern. Part B 34(5), 2088–2099 (2004)
S. Bandyopadhyay, U. Maulik, Nonparametric genetic clustering: comparison of validity indices. IEEE Trans. Syst. Man Cybern. Part C (Applications Rev.) 31(1), 120–125 (2001)
D.E. Goldberg, J.H. Holland, Genetic algorithms and machine learning. Mach. Learn. 3(2/3), 95–99 (1988)
L. Davis, Handbook of genetic algorithms (1991)
Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs (Springer, Berlin, Heidelberg, 1996)
W. Song, S.C. Park, Genetic Algorithm-Based Text Clustering Technique (Springer, Berlin, Heidelberg, 2006), pp. 779–782
W. Song, J.Z. Liang, S.C. Park, Fuzzy control GA with a novel hybrid semantic similarity strategy for text clustering. Inf. Sci. (Ny) 273, 156–170 (2014)
J.C. Dunn†, Well-separated clusters and optimal fuzzy partitions. J. Cybern. 4(1), 95–104 (1974)
D.L. Davies, D.W. Bouldin, A cluster separation measure. IEEE Trans. Pattern Anal. Mach. Intell. PAMI-1(2), 224–227 (1979)
A. Banerjee, R.N. Dave, Validating clusters using the Hopkins statistic, in 2004 IEEE International Conference on Fuzzy Systems (IEEE Cat. No. 04CH37542), vol. 1, pp. 149–153
W.S. Sarle, A.K. Jain, R.C. Dubes, Algorithms for clustering data. Technometrics 32(2), 227 (1990)
A.F. Famili, G. Liu, Z. Liu, Evaluation and optimization of clustering in gene expression data analysis. Bioinformatics 20(10), 1535–1545 (2004)
M. Halkidi, Y. Batistakis, M. Vazirgiannis, Cluster validity methods : part I
M. Halkidi, Y. Batistakis, M. Vazirgiannis, Clustering validity checking methods: part II
M. Kim, R.S. Ramakrishna, New indices for cluster validity assessment (2005)
R.M. Haralick, L.G. Shapiro, Computer and robot vision, vol. 1 (Addison-Wesley Reading, 1992)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Ortega-Sánchez, N., Cuevas, E., Pérez, M.A., Osuna-Enciso, V. (2020). Clustering Data Using Techniques of Image Processing Erode and Dilate to Avoid the Use of Euclidean Distance. In: Oliva, D., Hinojosa, S. (eds) Applications of Hybrid Metaheuristic Algorithms for Image Processing. Studies in Computational Intelligence, vol 890. Springer, Cham. https://doi.org/10.1007/978-3-030-40977-7_9
Download citation
DOI: https://doi.org/10.1007/978-3-030-40977-7_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-40976-0
Online ISBN: 978-3-030-40977-7
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)