In this paper, we brought out a noise-insensitive pixel-wise object tracking algorithm whose kernel is a new reliable data grouping algorithm that introduces the reliability evaluation into the existing K-means clustering (called as RK-means clustering). The RK-means clustering concentrates on two problems of the existing K-mean clustering algorithm: 1) the unreliable clustering result when the noise data exists; 2) the bad/wrong clustering result caused by the incorrectly assumed number of clusters. The first problem is solved by evaluating the reliability of classifying an unknown data vector according to the triangular relationship among it and its two nearest cluster centers. Noise data will be ignored by being assigned low reliability. The second problem is solved by introducing a new group merging method that can delete pairs of ”too near” data groups by checking their variance and average reliability, and then combining them together. We developed a video-rate object tracking system (called as RK-means tracker) with the proposed algorithm. The extensive experiments of tracking various objects in cluttered environments confirmed its effectiveness and advantages.
A Noise-Insensitive Object Tracking Algorithm
Asian Conference on Computer Vision ; 2007 ; Tokyo, Japan November 18, 2007 - November 22, 2007
2007-01-01
11 pages
Aufsatz/Kapitel (Buch)
Elektronische Ressource
Englisch
Noise Insensitive High Resolution Demosaicing Algorithm Considering Cross-Channel Correlation
British Library Conference Proceedings | 2005
|Object tracking with improved firefly algorithm
British Library Online Contents | 2018
|An Algorithm for Multiple Object Trajectory Tracking
British Library Conference Proceedings | 2004
|