This Article 
 Bibliographic References 
 Add to: 
A Modified K-Means Algorithm for Circular Invariant Clustering
December 2005 (vol. 27 no. 12)
pp. 1856-1865
Several important pattern recognition applications are based on feature vector extraction and vector clustering. Directional patterns are commonly represented by rotation-variant vectors {\schmi{\schmi{F}}}_d formed from features uniformly extracted in M directions. It is often desirable that pattern recognition algorithms are invariant under pattern rotation. This paper introduces a distance measure and a K--means-based algorithm, namely, Circular K-means (CK-means) to cluster vectors containing directional information, such as {\schmi{\schmi{F}}}_d, in a circular-shift invariant manner. A circular shift of {\schmi{\schmi{F}}}_d corresponds to pattern rotation, thus, the algorithm is rotation invariant. An efficient Fourier domain representation of the proposed measure is presented to reduce computational complexity. A split and merge approach (SMCK-means), suited to the proposed CK-means technique, is proposed to reduce the possibility of converging at local minima and to estimate the correct number of clusters. Experiments performed for textural images illustrate the superior performance of the proposed algorithm for clustering directional vectors {\schmi{\schmi{F}}}_d, compared to the alternative approach that uses the original K-means and rotation-invariant feature vectors transformed from {\schmi{\schmi{F}}}_d.

[1] A.K. Jain and R.C. Dubes, Algorithms for Clustering. Englewood Cliffs, N.J.: Prentice Hall, 1988.
[2] R.O. Duda and P.E. Hart, Pattern Classification and Scene Analysis. New York: Wiley, 1973.
[3] J. Bezdek, Pattern Recognition with Fuzzy Objective Function Algorithms. New York: Plenum, 1981.
[4] J. Hartigan, Clustering Algorithms. New York: Wiley, 1975.
[5] J. Tou and R. Gonzalez, Pattern Recognition Principles. Reading, Mass.: Addison-Wesley, 1974.
[6] E. Ruspini, “A New Approach to Clustering,” Information Control, vol. 15, no. 1, pp. 22-32, July 1969.
[7] M.C. Su and C.-H. Chou, “A Modified Version of the K-Means Algorithm with a Distance Based on Cluster Symmetry,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 23, no. 6, June 2001.
[8] T. Kohonen, “The Neural Phonetic Typewriter,” Computer, vol. 27, no. 3, pp. 11-12, Mar. 1988.
[9] T. Kohonen, Self-Organization and Associative Memory, third ed. New York, Berlin: Springer-Verlag, 1989.
[10] G.A. Carpenter and S. Grossberg, “A Massively Parallel Architecture for a Self-Organizing Neural Pattern Recognition Machine,” Computer Vision, Graphics, and Image Processing, vol. 37, pp. 54-115, 1987.
[11] D. Charalampidis, T. Kasparis, and M. Georgiopoulos, “Classification of Noisy Signals Using Fuzzy ARTMAP Neural Networks,” IEEE Trans. Neural Networks, vol. 12, no. 5, pp. 1023-1036, Sept. 2001.
[12] H. Arof and F. Deravi, “Circular Neighborhood and 1-D DFT Features for Texture Classification and Segmentation,” IEE Proc. Vision Image and Signal Processing, vol. 145, no. 3, pp. 167-172, June 1998.
[13] D. Charalampidis and T. Kasparis, “Wavelet-Based Rotational Invariant Segmentation and Classification of Textural Images Using Directional Roughness Features,” IEEE Trans. Image Processing, vol. 11, no. 8, pp. 825-836, Aug. 2002.
[14] G.M. Haley and B.S. Manjunath, “Rotation-Invariant Texture Classification Using a Complete Space-Frequency Model,” IEEE Trans. Image Processing, vol. 8, no. 2, pp. 255-269, Feb. 1999.
[15] F.S. Cohen, Z. Fan, and M.A. Patel, “Classification of Rotated and Scaled Textured Images Using Gaussian Markov Random Field Models,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 13, no. 2, pp. 192-201, Feb. 1991.
[16] T. Kasparis, D. Charalampidis, J. Rolland, and M. Georgiopoulos, “Segmentation of Textured Images Using Fractals and Image Filtering,” Pattern Recognition, vol. 34, no. 10, pp. 1963-1973, Oct. 2001.
[17] G.W. Milligan and M.C. Cooper, “An Examination of Procedures for Determining the Number of Clusters in a Data Set,” Phychometrica, pp. 159-179, 1985.
[18] R.M. Gray, “Toeplitz and Circulant Matrices: A Review,” , Aug. 2005.
[19] S.Z. Selim and M.A. Ismail, “K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 6, no. 1, 1984.
[20] W.T. Freeman and E.H. Adelson, “The Design and Use of Steerable Filters,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 13, no. 9, pp. 891-906, Sept. 1991.
[21] D. Charalampidis, T. Kasparis, and L. Jones, “Multifractal and Intensity Measures for the Removal of Non-Precipitation Echoes from Weather Radars,” IEEE Trans. Geoscience and Remote Sensing, vol. 40, no. 5, pp. 1121-1131, May 2002.
[22] J. Mao and A.K. Jain, “Texture Classification and Segmentation Using Multiresolution Simultaneous Autoregressive Models,” Pattern Recognition, vol. 25, no. 2, pp. 173-188, 1992.
[23] M. Georgiopoulos, I. Dagher, G.L. Heileman, and G. Bebis, “Properties of Learning of a Fuzzy ART Variant,” Neural Networks, vol. 12, no. 6, pp. 837-850, 1999.
[24] H. Greenspan, S. Belongie, R. Goodman, and P. Perona, “Rotation Invariant Texture Recognition Using a Steerable Pyramid,” Proc. 12th IAPR Int'l Conf. Pattern Recognition— Conf. B: Computer Vision & Image Processing, vol. 2, pp. 162-167, 1994.
[25] P.S. Bradley and U.M. Fayyad, “Refining Initial Points for K-Means Clustering,” Proc. 15th Int'l Conf. Machine Learning, pp. 91-99, 1998.

Index Terms:
Index Terms- Clustering, algorithms, similarity measures.
Dimitrios Charalampidis, "A Modified K-Means Algorithm for Circular Invariant Clustering," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 27, no. 12, pp. 1856-1865, Dec. 2005, doi:10.1109/TPAMI.2005.230
Usage of this product signifies your acceptance of the Terms of Use.