English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/30587
logo share SHARE logo core CORE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:


Trajectory occlusion handling with multiple view distance minimization clustering

AuthorsMozerov, Mikhail; Amato, Ariel; Roca, F. Xavier; Gonzàlez, Jordi
KeywordsMotion analysis
Trajectory tracking
Issue Date2008
PublisherThe International Society for Optics and Photonics
CitationOptical Engineering 47(4): 2021-2029 (2008)
AbstractA robust and efficient method for overcoming the negative effects of long-time occlusion in the tracking process is presented. The proposed approach is based on the matching of multiple trajectories in time. Trajectories are sets of 2-D points in time and in a joint ground plane of the world coordinate system. In order to avoid mismatches due to possible measurement outliers, we introduce an integral distance between compared trajectories. The proposed method can also be considered as an interpolation algorithm for a disconnected trajectory during the blackout. Thus this technique solves one of the most difficult problems of occlusion handling: the matching of two unconnected parts of the same trajectory.
Publisher version (URL)http://dx.doi.org/10.1117/1.2909665
Appears in Collections:(IRII) Artículos
Files in This Item:
File Description SizeFormat 
Trajectory occlusion.pdf652,77 kBAdobe PDFThumbnail
Show full item record
Review this work

Related articles:

WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.