loading...
A Dynamic Programming Technique for Classifying Trajectories
Modena, Italy September 10-September 14
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICIAP.2007.614th International Conference on Imag ...
 This Article 
 
PDF
HTML
IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Simone Calderara, University of Modena and Reggio Emilia, Italy
Rita Cucchiara, University of Modena and Reggio Emilia, Italy
Andrea Prati, University of Modena and Reggio Emilia, Italy
This paper proposes the exploitation of a dynamic programming technique for efficiently comparing people trajectories adopting an encoding scheme that jointly takes into account both the direction and the velocity of movement. With this approach, each pair of trajectories in the training set is compared and the corresponding distance computed. Clustering is achieved by using the k-medoids algorithm and each cluster is modeled with a 1-D Gaussian over the distance from the medoid. A MAP framework is adopted for the testing phase. The reported results are encouraging.
Citation:
Simone Calderara, Rita Cucchiara, Andrea Prati, "A Dynamic Programming Technique for Classifying Trajectories," iciap, pp.137-142, 14th International Conference on Image Analysis and Processing (ICIAP 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.