Research Article
Improved K-Mean Clustering with Steepest Ascent (Gradient) Method for Image Retrieval
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 20 - Issue 1 |
| Published: April 2011 |
| Authors: Vaishali Ughade, Nishchol Mishra, Sanjeev Sharma |
10.5120/2400-3193
|
Vaishali Ughade, Nishchol Mishra, Sanjeev Sharma . Improved K-Mean Clustering with Steepest Ascent (Gradient) Method for Image Retrieval. International Journal of Computer Applications. 20, 1 (April 2011), 8-10. DOI=10.5120/2400-3193
@article{ 10.5120/2400-3193,
author = { Vaishali Ughade,Nishchol Mishra,Sanjeev Sharma },
title = { Improved K-Mean Clustering with Steepest Ascent (Gradient) Method for Image Retrieval },
journal = { International Journal of Computer Applications },
year = { 2011 },
volume = { 20 },
number = { 1 },
pages = { 8-10 },
doi = { 10.5120/2400-3193 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2011
%A Vaishali Ughade
%A Nishchol Mishra
%A Sanjeev Sharma
%T Improved K-Mean Clustering with Steepest Ascent (Gradient) Method for Image Retrieval%T
%J International Journal of Computer Applications
%V 20
%N 1
%P 8-10
%R 10.5120/2400-3193
%I Foundation of Computer Science (FCS), NY, USA
Abstract
In this study we present a new frame work for clustering that uses an Improved K-Mean with Steepest ascent (Gradient) Technique. The basic idea of this paper is to use a Color Descriptors which work on RGB and HSV color space after that this result is used by Improved K Mean with Steepest ascent (Gradient) algorithm. In which it used a heuristic local search algorithm that provide additional information about the solution. In this direction it gives the effective result of clustering that provide stability and performs better in global searching.
References
- David Pettinger and Giuseppe Di Fatta “Space Partitioning for Scalable K-Means ” School of Systems Engineering, University of Reading, Reading, UK- Ninth International Conference on Machine Learning and Applications-2010 ,pp .319-324
- Manning, C.D., Raghavan, P., and Schutze, H., “Scoring, Term Weighting, and the Vector Space Model”, Introduction to Information Retrieval, Cambridge University Press,Cambridge, England, 2008, pp. 109-133.
- Otavio Augusto, Bizetto Penatti and Ricardo da Silva Torres Otavio” Color descriptors for Web image retrieval” Institute of Computing, University of Campinas – UNICAMP 13084-970, Campinas, SP, Brazil API.2008,pp.163-170.
- Zhe Zhang, Junxi Zhang, Huifeng Xue” Improved K-means Clustering Algorithm” (College of Automation, Northwestern Polytechnic University, Xi’an 710072) 2008, pp.169-172
- WANG Jiayao, ZHANG Xueping, ZHOU Haiyan.“A Genetic K-means Algorithm for Spatial Clustering” Computer Engineering.(3),2006,pp. 188-190
- Tapas Kanungo, David M. Mount,Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, and Angela Y. Wu “An Efficient k-Means Clustering Algorithm: Analysis and Implementation ” IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, VOL. 24, NO. 7, JULY 2002,pp.881-891
- B. S. Manjunath , Jens-Rainer Ohm, Vinod V. Vasudevan, and Akio Yamada “Color and Texture Descriptors” VOL. 11, NO. 6, JUNE 2001,pp.703-715
- Mali U, Bandyopadhyay S.” Genetic algorithm-based clustering technique. Pattern Recognition” , 33(9): 1455–1465 2000
- MacQueen J. Some methods for classification and analysis of multi-variate observations In: Proceedings of the 5th Berkeley Symposium on Mathematics Statistic Problem, 1967,pp- 281~297
Index Terms
Keywords