• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2013, Vol. 35 ›› Issue (5): 118-123.

• 论文 • Previous Articles     Next Articles

Image denoising based on K-Means
clustering and binary tree decision        

LIU Yongxia1,ZHANG Zhaohui1,2,ZHANG Yanmin1   

  1. (1.College of Mathematics and Information Science,Hebei Normal University,Shijiazhuang 050024;
    2.Key Laboratory of Computational Mathematics and Applications of Hebei Province,Shijiazhuang 050024,China)
  • Received:2011-12-23 Revised:2012-05-21 Online:2013-05-25 Published:2013-05-25

Abstract:

In this paper, a new filter algorithm was proposed for pepperandsalt noise suppression. Firstly, the neighborhood of each given pixel is partitioned by Kmeans clustering according to the local grey level distribution. Secondly, the recognition rules for noisepolluted pixel detection are constructed, and the noise pixel can be detected based on multilayer binary tree decision. The proposed algorithm only filters the recognized noise pixels without changing those nonpolluted pixel values. Experimental results show that the proposed algorithm can efficiently preserve informative details when filtering image noise. For those images with strong noise pollution, the proposed algorithm outperforms both median filter and the algorithm proposed in[7].

Key words: pepper-and-salt noise;K-means clustering;binary tree;image filtering;noise detection