Abstract
We focus on spherical shells clustering by a mini-max information (MMI) clustering algorithm based on mini-max optimization of mutual information (MI). The minimization optimization leads to a mass constrained deterministic annealing (DA) approach, which is independent of the choice of the initial data configuration and has the ability to avoid poor local optima. The maximization optimization provides a robust estimation of probability soft margin to phase out outliers. Furthermore, a novel cluster validity criteria is estimated to determine an optimal cluster number of spherical shells for a given set of data. The effectiveness of MMI algorithm for clustering spherical shells is demonstrated by experimental results.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Blahut, R.E.: Computation of Channel Capacity and Rate-Distortion Functions. IEEE Tran. on Information Theory 18, 460–473 (1972)
Blahut, R.E.: Princinple and practice of information theory. Addison-Wesley, Reading (1987)
Dave, R.N.: Fuzzy shell-clustering and applications to circle detection in digital images. Int. J. General Systems 16, 343–355 (1990)
Dave, R.N.: Validating fuzzy partitions obtained through c-shells clustering. Pattern Recognition Letters 17, 613–623 (1996)
Krishnapuram, R., Nasraoui, O., Frigui, H.: The fuzzy c-spherical shells algorithm: a new approach. IEEE Trans. Neural Networks 3, 663–671 (1992)
Man, Y., Gath, I.: Detection and Separation of Ring-Shaped Clusters Using Fuzzy Clustering. IEEE Trans. Pattern Analysis and Machine Intelligence 16, 855–861 (1994)
Rose, K., Gurewitz, E., Fox, G.C.: Statistical mechanics and phase transitions in clustering. Physical Review letters 65, 945–948 (1990)
Rose, K.: Deterministic annealing for clustering, compression, classification, regression, and related optimization problems. Proc. of IEEE, 86, 2210–2239 (1998)
Song, Q.: A robust information clustering algorithm. Neural Computation 17, 2672–2698 (2005)
Vapnik, V.N.: Statistical Learning Theory. John Wiley and Sons, NY (1998)
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
Yang, X., Song, Q., Zhang, W., Wang, Z. (2006). Clustering Spherical Shells by a Mini-Max Information Algorithm. In: Narayanan, P.J., Nayar, S.K., Shum, HY. (eds) Computer Vision – ACCV 2006. ACCV 2006. Lecture Notes in Computer Science, vol 3852. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11612704_23
Download citation
DOI: https://doi.org/10.1007/11612704_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31244-4
Online ISBN: 978-3-540-32432-4
eBook Packages: Computer ScienceComputer Science (R0)