An Efficient Content Based Image Retrieval Algorithm Using Clustering Techniques For Large Dataset

Content based image retrieval (CBIR) is a well chosen fast and accurate retrieval technique. In recent years, a range of techniques have been developed to improve the performance of CBIR. An unsupervised method called data clustering is used for extracting hidden patterns from large data sets. Also, there is possibility of high dimensionality in large datasets. Most of clustering and segmentation algorithms suffer from the curse of high dimensionality and the optimal number of clusters provided by a human user. In this paper, we present a method HDK that optimizes these limitations. It uses more than one clustering technique with efficient indexing based on color feature. A new cluster based similarity measure conforming like human perception is applied and shown to be effective. From the experimental results, it is evident that our system is powerful, accurate and efficient.

[1]  Donald W. Bouldin,et al.  A Cluster Separation Measure , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  Vipin Kumar,et al.  Chameleon: Hierarchical Clustering Using Dynamic Modeling , 1999, Computer.

[3]  Peter Stanchev,et al.  Content-Based Image Retrieval Systems , 2001 .

[4]  J. Dunn Well-Separated Clusters and Optimal Fuzzy Partitions , 1974 .

[5]  Vittorio Castelli,et al.  Image Databases: Search and Retrieval of Digital Imagery , 2002 .

[6]  Monika Jain,et al.  A Survey On: Content Based Image Retrieval Systems Using Clustering Techniques For Large Data sets , 2011 .

[7]  D. Mitchell Wilkes,et al.  A Divide-and-Conquer Approach for Minimum Spanning Tree-Based Clustering , 2009, IEEE Transactions on Knowledge and Data Engineering.

[8]  Sudipto Guha,et al.  ROCK: a robust clustering algorithm for categorical attributes , 1999, Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337).

[9]  Ajith Kumar,et al.  Cluster Analysis and Factor Analysis , 2006 .

[10]  Tian Zhang,et al.  BIRCH: an efficient data clustering method for very large databases , 1996, SIGMOD '96.

[11]  P. Fränti,et al.  Sum-of-Squares Based Cluster Validity Index and Significance Analysis , 2009, ICANNGA.

[12]  Elias Dahlhaus,et al.  Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition , 2000, J. Algorithms.

[13]  Anil K. Jain,et al.  Algorithms for Clustering Data , 1988 .

[14]  Sudipto Guha,et al.  CURE: an efficient clustering algorithm for large databases , 1998, SIGMOD '98.

[15]  Michael J. Swain,et al.  Color indexing , 1991, International Journal of Computer Vision.

[16]  Clark F. Olson,et al.  Parallel Algorithms for Hierarchical Clustering , 1995, Parallel Comput..