Moving Target Detection and Tracking Based on Improved FCM Algorithm

Moving Target Detection and Tracking Based on Improved FCM Algorithm

Wang Ke Feng, Sheng Xiao Chun
DOI: 10.4018/IJCINI.2020010105
Article PDF Download
Open access articles are freely available for download

Abstract

With the rapid development of computer intelligence technology, the majority of scholars have a great interest in the detection and tracking of moving targets in the field of video surveillance and have been involved in its research. Moving target detection and tracking has also been widely used in military, industrial control, and intelligent transportation. With the rapid progress of the social economy, the supervision of traffic has become more and more complicated. How to detect the vehicles on the road in real time, monitor the illegal vehicles, and control the illegal vehicles effectively has become a hot issue. In view of the complex situation of moving vehicles in various traffic videos, the authors propose an improved algorithm for effective detection and tracking of moving vehicles, namely improved FCM algorithm. It combines traditional FCM algorithm with genetic algorithm and Kalman filter algorithm to track and detect moving targets. Experiments show that this improved clustering algorithm has certain advantages over other clustering algorithms.
Article Preview
Top

2. Fcm Clustering Algorithm

The fuzzy C-means clustering algorithm (FCM) is simple in principle, easy to be operated and widely used. The core idea is to minimize the objective function, and to find the final class center and membership matrix. A given data set IJCINI.2020010105.m01, which contains N samples, the number of clusters is C, IJCINI.2020010105.m02 is the degree of membership for the first j sample IJCINI.2020010105.m03IJCINI.2020010105.m04 which belong to the Ith category IJCINI.2020010105.m05IJCINI.2020010105.m06, the objective function of FCM is as follows[Gao, 2016]:

Complete Article List

Search this Journal:
Reset
Volume 18: 1 Issue (2024)
Volume 17: 1 Issue (2023)
Volume 16: 1 Issue (2022)
Volume 15: 4 Issues (2021)
Volume 14: 4 Issues (2020)
Volume 13: 4 Issues (2019)
Volume 12: 4 Issues (2018)
Volume 11: 4 Issues (2017)
Volume 10: 4 Issues (2016)
Volume 9: 4 Issues (2015)
Volume 8: 4 Issues (2014)
Volume 7: 4 Issues (2013)
Volume 6: 4 Issues (2012)
Volume 5: 4 Issues (2011)
Volume 4: 4 Issues (2010)
Volume 3: 4 Issues (2009)
Volume 2: 4 Issues (2008)
Volume 1: 4 Issues (2007)
View Complete Journal Contents Listing