Image segmentation by using K-means clustering algorithm in Euclidean and Mahalanobis distance calculation in camouflage images

被引:12
作者
Bayram, Erkan [1 ]
Nabiyev, Vasif [2 ]
机构
[1] Ataturk Univ, Bilgisayar Bilimleri Arastirma & Uygulama Merkezi, Erzurum, Turkey
[2] Karadeniz Tech Univ, Bilgisayar Muhendisligi Bolumu, Trabzon, Turkey
来源
2020 28TH SIGNAL PROCESSING AND COMMUNICATIONS APPLICATIONS CONFERENCE (SIU) | 2020年
关键词
Image segmentation; K-means clustering; Euclidean distance; mahalanobis distance; camouflage image;
D O I
10.1109/siu49456.2020.9302320
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In camouflage images, the texture of an object is hidden in the background image texture. The hidden object has almost the same color tone and texture as the background image. Since camouflage images show close features with background texture, it is quite difficult to segment and detect the camouflaged object from the image background. In this study, image segmentation is performed on camouflage images using K-means method using Euclidean and Mahalanobis distance calculations. The average value of RMSE 262.47 and the average value of PSNR 24.26 was obtained when using Euclidean distance calculation. Also, the average value of RMSE 799.62 and the average value of PSNR 19,66 was obtained when using Mahalanobis distance calculation. According to the result obtained from this study, while the low RMSE values were obtained with the K-means method by using the Euclidean distance calculation, the lower PSNR values were obtained by using the Mahalanobis distance calculation. In the experimental results; K-means method with Euclidean distance calculation is more successful than the K-means method with Mahalanobis distance calculation.
引用
收藏
页数:4
相关论文
共 12 条
[1]  
[Anonymous], 2013, INT J COMPUTER SCI C
[2]  
Galun M, 2003, NINTH IEEE INTERNATIONAL CONFERENCE ON COMPUTER VISION, VOLS I AND II, PROCEEDINGS, P716
[3]   A robust foreground segmentation method by temporal averaging multiple video frames [J].
Guo, Hongxing ;
Dou, Yaling ;
Tian, Ting ;
Zhou, Jingli ;
Yu, Shengsheng .
2008 INTERNATIONAL CONFERENCE ON AUDIO, LANGUAGE AND IMAGE PROCESSING, VOLS 1 AND 2, PROCEEDINGS, 2008, :878-882
[4]  
Hammouda K., 2000, A comparative study of data clustering techniques, P1
[5]  
Jose A, 2014, INT J INNOV RES COMP, V2
[6]  
Kaur J., 2012, International Journal of Engineering Research and Applications, V2, P664
[7]   Cluster center initialization algorithm for K-means clustering [J].
Khan, SS ;
Ahmad, A .
PATTERN RECOGNITION LETTERS, 2004, 25 (11) :1293-1302
[8]  
Madhu YedlaS.R. Pathakota., 2010, International Journal of Computer Science and Information Technologies, V1, P121
[9]  
Salihah A, 2010, IEEE SYS MAN CYBERN, P3677, DOI 10.1109/ICSMC.2010.5641867
[10]  
Sengottuvelan P., 2008, 2008 1st International Conference on Emerging Trends in Engineering and Technology (ICETET), P6, DOI 10.1109/ICETET.2008.232