DocumentCode :
2985723
Title :
Clustering Motion Trajectories Based on Isoperimetric Graph Partitioning Algorithm and Directional Trimmed Mean Distance
Author :
Wen Jia ; Wen Desheng
Author_Institution :
Dept. of Comput., Yanshan Univ., Qinhuangdao, China
fYear :
2009
fDate :
18-20 Jan. 2009
Firstpage :
1
Lastpage :
4
Abstract :
Moving object trajectory clustering is one precondition for object moving activity perception. Many researchers pay attention to clustering trajectory. In this paper, a novel method named directional trimmed mean distance (DTMD) is proposed at first to measure similarity according to analyzing some problems in existed method, such as no direction, yawp sensitivity, lower computation speed. Compared with other similarity measure methods, the value of DTMD is smaller between two similar trajectories and bigger between two dissimilar trajectories. It is simple Using this similarity, veracity is provided for clustering. In this paper, we also introduce spectral graph to cluster trajectories using DTMD distance as similarity in order to improve veracity for clustering. We do some experiments in real vehicle video scenes and then compare with other approaches such as LCSS and Hausdorff in the same scenes. The experimental results show that the validity and robust are both proved using our method.
Keywords :
graph theory; pattern clustering; Hausdorff; directional trimmed mean distance; isoperimetric graph partitioning algorithm; motion trajectory clustering; spectral graph; yawp sensitivity; Clustering algorithms; Educational institutions; ISO; Information science; Layout; Mechanical engineering; Partitioning algorithms; Robustness; Vehicles; Velocity measurement;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Network and Multimedia Technology, 2009. CNMT 2009. International Symposium on
Conference_Location :
Wuhan
Print_ISBN :
978-1-4244-5272-9
Type :
conf
DOI :
10.1109/CNMT.2009.5374507
Filename :
5374507
Link To Document :
بازگشت