IJCSET16-07-09-001 (2).pdf
收藏DataCite Commons2020-09-03 更新2024-07-25 收录
下载链接:
https://figshare.com/articles/dataset/IJCSET16-07-09-001_2_pdf/3978516/1
下载链接
链接失效反馈官方服务:
资源简介:
K-Means algorithm is the most commonly chosen technique for color image segmentation task.Although this algorithm is famous for its low complexity and easy implementation, but usually it is seen thatthe segmentation results are suffering from noises and over-segmentation, which mislead the final imageanalysis process. This is because of the inappropriate selection of the number of clusters in K-Means. Also,choosing a proper distance metric for this algorithm is very important as it impacts on the final segmentationresults. This paper deals with these problems and presents a novel approach to solving the same. As per colorimage segmentation concerned, so choosing a suitable color space is the first mandatory condition. HSVcolor space is selected for the proposed research work. The input RGB image is first converted to HSV one.Here, the number of clusters is determined from the input image beforehand. For this, it is considered thatnumber of regions in an image is equivalent to the number of clusters that can be formed through clusteringthe pixels of the image. The number of regions of an image is determined with Meyer’s Watershed algorithmwith a proper preprocessing technique. Generally, mere applying Watershed algorithm results in oversegmentation. So, we have introduced an improved Sobel filter based on multiple directional edge detection todeal with this problem. The V channel of the HSV converted image is filtered by the proposed improved Sobelfilter first and then the filtered image is sent as input to the watershed algorithm. The watershed algorithmanalyses the regions of the image through local minima calculations and the total number of regions herebyfound is assigned to K. Then with the predetermined K, the pixels of the HSV converted image are clusteredwith K-Means Algorithm. “Cosine Distance Metric” is chosen for the distance based calculations involved inthe K-Means algorithm. By properly labeling the different clusters, the final segmented image is obtained.The experimental results proved the better performance of the proposed approach in comparison to K-Meansalgorithm. Also, when applied to satellite color images, it is found that the proposed approach succeeds toform clear and distinct segments of the same and hence establishes a good framework for satellite colorimage segmentation.
提供机构:
figshare
创建时间:
2016-10-03



