A scaled-MST-based clustering algorithm and application on image segmentation
- 24 Downloads
Minimum spanning tree (MST)-based clustering is one of the most important clustering techniques in the field of data mining. Although traditional MST-based clustering algorithm has been researched for decades, it still has some limitations for data sets with different density distribution. After analyzing the advantages and disadvantages of the traditional MST-based clustering algorithm, this paper presents two new methods to improve the traditional clustering algorithm. There are two steps of our first method: compute a scaled-MST with scaled distance to find the longest edges between different density clusters and clustering based on the MST. To improve the performance, our second scaled-MST-clustering works by merging the MST construction and inconsistent edges’ detection into one step. To verify the effectiveness and practicability of the proposed method, we apply our algorithm on image segmentation and integration. The encouraging performance demonstrates the superiority of the proposed method on both small data sets and high dimensional data sets.
KeywordsMinimum spanning tree Clustering Minimum spanning tree-based clustering Image segmentation Image integration
The authors would like to thank the Chinese National Science Foundation for its valuable support of this work under award 61473220 and all the anonymous reviewers and editors for their valuable comments.
- Arya, S., & Mount, D.M. (2016). A fast and simple algorithm for computing approximate euclidean minimum spanning trees. In Twenty-seventh ACM-SIAM symposium on discrete algorithms (pp. 1220–1233).Google Scholar
- Beygelzimer, A.M., Kakade, S., Langford, J. (2000). Cover trees for nearest neighbor. In ICML 2006 - Proceedings of the 23rd international conference on machine learning 2006. https://doi.org/10.1145/1143844.1143857.
- Borůvka, O. (1926). O jistém problému minimálním. Práce moravská přirodovédecké společnosti, 3(1926), 37–58.Google Scholar
- Boser, B., Guyon, I.N., Vapnik, V. (1996). A training algorithm for optimal margin classifier. In Proceedings of the fifth annual ACM workshop on computational learning theory, Vol. 5, https://doi.org/10.1145/130385.130401.
- Dhanachandra, N., Manglem, K., Chanu, Y.J. (2015). Image segmentation using k -means clustering algorithm and subtractive clustering algorithm. Procedia Computer Science, 54, 764–771. 10.1016/j.procs.2015.06.090. http://www.sciencedirect.com/science/article/pii/S1877050915014143.CrossRefGoogle Scholar
- Dua, D., & Graff, C. (2017). UCI machine learning repository. http://archive.ics.uci.edu/ml.
- Economou, G., Pothos, V., Ifantis, A. (2004). Geodesic distance and mst based image segmentation. In 2004 12th European Signal Processing Conference (pp. 941–944).Google Scholar
- He, Y., & Chen, L. (2004). Minclue: a mst-based clustering method with auto-threshold-detection. In IEEE conference on cybernetics and intelligent systems, (Vol. 1 pp. 229–233), https://doi.org/10.1109/ICCIS.2004.1460417.
- Jothi, R., Mohanty, S.K., Ojha, A. (2017). Fast approximate minimum spanning tree based clustering algorithm. Neurocomputing 272.Google Scholar
- Larsen, B., & Aone, C. (1999). Fast and effective text mining using linear-time document clustering. In ACM SIGKDD international conference on knowledge discovery and data mining (pp. 16–22).Google Scholar
- Luo, T., & Zhong, C. (2010). A neighborhood density estimation clustering algorithm based on minimum spanning tree. In International conference on rough set and knowledge technology.Google Scholar
- Lv, X., Ma, Y., He, X., Huang, H., Yang, J. (2018). CciMST: a clustering algorithm based on minimum spanning tree and cluster centers. Mathematical Problems in Engineering 2018. https://doi.org/10.1155/2018/8451796.
- Peng, B., Zhang, L., Zhang, D. (2013). A survey of graph theoretical approaches to image segmentation. Pattern Recognition, 46(3), 1020–1038. https://doi.org/10.1016/j.patcog.2012.09.015. http://www.sciencedirect.com/science/article/pii/S0031320312004219.CrossRefGoogle Scholar
- Saglam, A., & Baykan, N.A. (2017). Sequential image segmentation based on minimum spanning tree representation. http://www.sciencedirect.com/science/article/pii/S0167865516301192, advances in Graph-based Pattern Recognition, (Vol. 87 pp. 155–162), https://doi.org/10.1016/j.patrec.2016.06.001.
- Vella, F., Infantino, I., Gaglio, S., Vetrano, G. (2012). Image segmentation through a hierarchy of minimum spanning trees. In 2012 Eighth international conference on signal image technology and internet based systems. https://doi.org/10.1109/SITIS.2012.62 (pp. 381–388).
- Wang, X.L., & Wang, X. (2018). An efficient approximate emst algorithm for color image segmentation. In Perner, P. (Ed.) Machine learning and data mining in pattern recognition (pp. 147–159). Cham: Springer International Publishing.Google Scholar
- Wang, X., Wang, X.L., Wilkes, D.M. (2012). A minimum spanning tree-inspired clustering-based outlier detection technique. In Industrial conference on advances in data mining: applications and theoretical aspects (pp. 209–223).Google Scholar
- Wang, X.L., Wang, X., Li, X. Perner, P. (Ed.). (2018). A fast two-level approximate euclidean minimum spanning tree algorithm for high-dimensional data. Cham: Springer International Publishing.Google Scholar
- Zahn, C.T. (1971). Graph-theoretical methods for detecting and describing gestalt clusters. In IEEE Trans. on Computers (pp. 68–86).Google Scholar
- Zhang, H., Fritts, J.E., Goldman, S.A. (2008). Image segmentation evaluation: a survey of unsupervised methods. Computer Vision and Image Understanding, 110 (2), 260–280. https://doi.org/10.1016/j.cviu.2007.08.003. http://www.sciencedirect.com/science/article/pii/S1077314207001294.CrossRefGoogle Scholar