Share Email Print

Optical Engineering

Trajectory occlusion handling with multiple-view distance-minimization clustering
Author(s): Mikhail G. Mozerov; Ariel Amato; Xavier Roca; Jordi Gonzalez
Format Member Price Non-Member Price
PDF $20.00 $25.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

A 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.

Paper Details

Date Published: 1 April 2008
PDF: 9 pages
Opt. Eng. 47(4) 047202 doi: 10.1117/1.2909665
Published in: Optical Engineering Volume 47, Issue 4
Show Author Affiliations
Mikhail G. Mozerov, Univ. Autònoma de Barcelona (Spain)
Ariel Amato, Univ. Autònoma de Barcelona (Spain)
Xavier Roca, Univ. Autònoma de Barcelona (Spain)
Jordi Gonzalez, UPC-CSIC (Spain)

© SPIE. Terms of Use
Back to Top