首页    期刊浏览 2025年02月23日 星期日
登录注册

文章基本信息

  • 标题:Image Compression Using Partitioning Around Medoids Clustering Algorithm
  • 本地全文:下载
  • 作者:Valmik B Nikam ; Vinod J Kadam ; B.B.Meshram
  • 期刊名称:International Journal of Computer Science Issues
  • 印刷版ISSN:1694-0784
  • 电子版ISSN:1694-0814
  • 出版年度:2011
  • 卷号:8
  • 期号:6
  • 出版社:IJCSI Press
  • 摘要:Clustering is a unsupervised learning technique. This paper presents a clustering based technique that may be applied to Image compression. The proposed technique clusters all the pixels into predetermined number of groups and produces a representative color for each group. Finally for each pixel only clusters number is stored during compression. This technique can be obtained in machine learning which one of the best methods for clustering is. The k-medoids algorithm is a clustering algorithm related to the K-means algorithm and the medoidshift algorithm.
  • 关键词:Data Mining; K;medoids clustering; Machine learning; Image compression
国家哲学社会科学文献中心版权所有