Abstract
First, a modified Neighborhood-Based Clustering (MNBC) algorithm using the directed tree for data clustering is presented. It represents a dataset as some directed trees corresponding to meaningful clusters. Governed by Neighborhood-based Density Factor (NDF), it also can discover clusters of arbitrary shape and different densities like NBC. Moreover, it greatly simplify NBC. However, a failure applying in image segmentation is due to an unsuitable use of Euclidean distance between image pixels. Second, Gray NDF (GNDF) is introduced to make MNBC suitable for image segmentation. The dataset to be segmented is all grays and thus MNBC has the constant computational complexity O(256). The experiments on synthetic datasets and real-world images shows that MNBC outperforms some existing graph-theoretical approaches in terms of computation time as well as segmentation effect.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Zhou, S., Zhao, Y., Guan, J., Huang, J.: A Neighborhood-Based Clustering Algorithm. In: Ho, T.-B., Cheung, D., Liu, H. (eds.) PAKDD 2005. LNCS (LNAI), vol. 3518, pp. 361–371. Springer, Heidelberg (2005)
Ester, M., Kriegel, H., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: Proc. KDD 1996, Portland, Oregon, pp. 226–231 (1996)
Weber, R., Schek, H., Blott, S.: A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In: Proc. of VLDB 1998, New York, August 1998, pp. 194–205 (1998)
Shi, J., Malik, J.: Normalized Cuts and Image Segmentation. In: Proc. of IEEE Conf. on CVPR, pp. 731–737 (1997)
Shi, J., Malik, J.: Normalized Cuts and Image Segmentation. IEEE Trans. on PAMI 22(8), 888–905 (2000)
Koontz, W., Narendra, P., Fukunaga, K.: A Graph-Theoretic Approach to Nonparametric Cluster Analysis. IEEE Trans. on Comp. C-25(9), 936–944 (1976)
Felzenszwalb, P., Huttenlocher, D.: Image segmentation using local variation. In: Proc. of IEEE Conf. on CVPR, pp. 98–104 (1998)
Felzenszwalb, P., Huttenlocher, D.: Efficient Graph-Based Image Segmentation. International Journal of Computer Vision 59(2) (September 2004)
Reinhard, D.: Graph Theory. Electronic edn. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ding, J., Chen, S., Ma, R., Wang, B. (2006). A Fast Directed Tree Based Neighborhood Clustering Algorithm for Image Segmentation. In: King, I., Wang, J., Chan, LW., Wang, D. (eds) Neural Information Processing. ICONIP 2006. Lecture Notes in Computer Science, vol 4233. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11893257_41
Download citation
DOI: https://doi.org/10.1007/11893257_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-46481-5
Online ISBN: 978-3-540-46482-2
eBook Packages: Computer ScienceComputer Science (R0)