International Conference on Recent Trends in Information Technology and Computer Science 2012 |
Foundation of Computer Science USA |
ICRTITCS2012 - Number 2 |
February 2013 |
Authors: Bharambe M. G., Joshi S. |
362cbf56-d2d8-43e7-9f4c-625bf7ef18f8 |
Bharambe M. G., Joshi S. . Strategic Filter for Noise Removal using Graph Clustering. International Conference on Recent Trends in Information Technology and Computer Science 2012. ICRTITCS2012, 2 (February 2013), 24-27.
Image segmentation is to classify or cluster an image into several regions according to the feature of image, for example, the pixel intensity or the distance measure. Up to now, lots of image segmentation algorithms exist and be extensively applied in science and daily life. [2,3]. According to their segmentation method, we can approximately categorize them into region-based segmentation, data clustering, and edge-base segmentation. Clustering data is a fundamental task in machine learning. Given a set of data instances, the goal is to group them in a meaningful way, with the interpretation of the grouping dictated by the domain. In this paper we present a method for noise removal that makes use of graph clustering using both features (pixel intensity and connectivity). In this paper hierarchical clustering as well as centroid-based clustering is used. This will give us clusters and by analyzing these clusters we can identify noisy clusters. This is better method over the standard Vector Median Filter (VMF) [4]when noise ratio is high.