Abstract
Clustering the spatial feature of the object region plays an important role in object modeling, detecting and tracking etc. However, many clustering methods adopt the pre-set cluster number, which cannot adapt to full automatic system. In this paper, a novel frame work for adaptively determining the number of clusters is proposed based on hierarchically kernel cutting. We firstly extract the value contour of object region and rank the peaks of the contour in descending order. And then we utilize a group of gauss kernels located at peaks to sequentially segment the contour into several subintervals. When the residual area being not cut is lower than a threshold value, the cutting process is compulsively terminated. Furthermore, we merge adjacent kernels according to the intersection area ratio and take the retained kernel number as the cluster number k. We finally classify the object region with k and K-means algorithm. Both theoretical reasoning and experimental comparing illustrate the proposed method is rational, adaptive and efficient.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Mignotte, M.: Segmentation by fusion of histogram-based K-means clusters in different color spaces. IEEE Trans. Image Process 17(5), 780–787 (2008)
Wang, L., Wang, Y.Z., Jiang, T.T., et al.: Learning discriminative features for fast frame-based action recognition. Pattern Recogn. 46, 1832–1840 (2013)
Lu, H., Gu, K., Lin, W.: Tracking based on stable feature mining using intraframe clustering and interframe association. IEEE Access 5, 4690–4703 (2017)
Zhang, T.Z., Liu, S., Xu, C.S., et al.: Mining semantic context information for intelligent video surveillance of traffic scenes. IEEE Trans. Ind. Inf. 9, 149–160 (2013)
Thangavel, K., Manavalan, R.: Soft computing models based feature selection for TRUS prostate cancer image classification. Soft. Comput. 18, 1165–1176 (2014)
Su, M.C., Chou, C.H.: A modified version of the K-means algorithm with a distance based on cluster symmetry. IEEE Trans. Pattern Anal. Mach. Intell. 23(6), 674–680 (2001)
Yip, A.M., Ding, C., Chan, T.F.: Dynamic cluster formation using level set methods. IEEE Trans. Pattern Anal. Mach. Intell. 28(6), 877–889 (2006)
Duda, R.O., Hart, P.E., Stork, D.G.: Pattern Classication. Wiley, New York (2001)
Wang, H.X., Yuan, J.S., Wu, Y.: Context-aware discovery of visual co-occurrence patterns. IEEE Trans. Image Process. 23(4), 1805–1819 (2014)
Mai, S.D., Ngo, L.T.: Multiple kernel approach to semi-supervised fuzzy clustering algorithm for land-cover classification. Eng. Appl. Artif. Intel. 68, 205–213 (2018)
Yin, J., Sun, H., Yang, J., et al.: Comparison of K-means and fuzzy c-Means algorithm performance for automated determination of the arterial input function. PLoS ONE 9(2), 1–8 (2014)
Haghverdi, A., Leib, B.G., Washington-Allen, R.A., et al.: Perspectives on delineating management zones for variable rate irrigation. Comput. Electron. Agr. 117, 154–167 (2015)
Girma, A., de Bie, C.A.J.M., Skidmore, A.K., et al.: Hyper-temporal SPOT-NDVI dataset parameterization captures species distributions. Int. J. Geogr. Inf. Sci. 30(1), 89–107 (2016)
Sabin, M.J.: Convergence and consistency of fuzzy c-means/ISODATA algorithms. IEEE Trans. Pattern Anal. Mach. Intell. 9(5), 661–668 (1987)
Memarsadeghi, N., Mount, D.M., Netanyahu, N.S., et al.: A fast implementation of the ISODATA clustering algorithm. Int. J. Comput. Geom. Ap. 17(1), 71–103 (2007)
Ester, M., Kriegel, H.P., Sander, J., et al.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: Proceedings of the International Conference on Knowledge Discovery and Data Mining, SIGKDD, Portland, pp. 226–231. ACM, USA (1996)
Guan, C.H., Chen, Y.D., Chen, H.Y., et al.: Improved DBSCAN clustering algorithm based vehicle detection using a vehicle-mounted laser scanner. Trans. Beijing Inst. Technol. 30(6), 732–736 (2010)
Lu, H., Li, H.S., Qiang, Y., et al.: Image segmentation using region division and local parameters based density clustering. J. Comput. Inform. Sys. 11(14), 4985–4994 (2015)
Zhang, W., Zhang, X.L., Zhao, J.J., et al.: A segmentation method for lung nodule image sequences based on superpixels and density-based spatial clustering of applications with noise. PLOS ONE 12(9), 1–25 (2017). 0184290
Xin, B., Tian, Y., Wang, Y. Z., et al.: Background Subtraction via generalized fused lasso foreground modeling. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR), Boston, Massachusetts USA, pp. 4676–4684 (2015)
Acknowledgments
This work was supported by the National Natural Science Foundation of China (61305011, 61703009), the Young Elite Scientist Sponsorship Program by China Association for Science and Technology (2017QNRC001), and Young Top-Notch Talents Team Program of Beijing Excellent Talents Funding (2017000026833ZK40). We thank the anonymous reviewers for their constructive comments.
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Lu, H., Gu, K., Yang, C., Hu, Y. (2019). Sequentially Cutting Based the Cluster Number Determination for Spatial Feature Classification. In: Zhai, G., Zhou, J., An, P., Yang, X. (eds) Digital TV and Multimedia Communication. IFTC 2018. Communications in Computer and Information Science, vol 1009. Springer, Singapore. https://doi.org/10.1007/978-981-13-8138-6_37
Download citation
DOI: https://doi.org/10.1007/978-981-13-8138-6_37
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-8137-9
Online ISBN: 978-981-13-8138-6
eBook Packages: Computer ScienceComputer Science (R0)