Evaluation the influence of distance-based K-means method for detecting moving vehicles

Abstract

Detecting moving vehicles is one of important elements in the applications of Intelligent Transport System (ITS). Detecting moving vehicles is also part of the detection of moving objects. K-Means method has been successfully applied to unsupervised cluster pixels for the detection of moving objects. In general, K-Means is a heuristic algorithm that partitioned the data set into K clusters by minimizing the number of squared distances in each cluster. In this paper, the K-Means algorithm applies Euclidean distance, Manhattan distance, Canberra distance, Chebyshev distance and Braycurtis distance. The aim of this study is to compare and evaluate the implementation of these distances in the K-Means clustering algorithm. The comparison is done with the basis of K-Means assessed with various evaluation paramaters, namely MSE, PSNR, SSIM and PCQI. The results exhibit that the Manhattan distance delivers the best MSE, PSNR, SSIM and PCQI values compared to other distances. Whereas for data processing time exposes that the Braycurtis distance has more advantages.