1 April 2008 Trajectory occlusion handling with multiple-view distance-minimization clustering
Mikhail G. Mozerov, Ariel Amato, Xavier Roca, Jordi Gonzalez
Author Affiliations +
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.
©(2008) Society of Photo-Optical Instrumentation Engineers (SPIE)
Mikhail G. Mozerov, Ariel Amato, Xavier Roca, and Jordi Gonzalez "Trajectory occlusion handling with multiple-view distance-minimization clustering," Optical Engineering 47(4), 047202 (1 April 2008). https://doi.org/10.1117/1.2909665
Published: 1 April 2008
Lens.org Logo
CITATIONS
Cited by 7 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Cameras

Detection and tracking algorithms

Calibration

Imaging systems

Optical engineering

Filtering (signal processing)

Image segmentation

RELATED CONTENT


Back to Top