Better Modeling of Matching Possibilities and Uncertainty for Offline Visual Mult-object Tracking

Doctoral Candidate Name: 
Lance A Rice
Program: 
Computing and Information Systems
Abstract: 

The task of visually tracking multiple objects remains an active field of algorithm development even after several decades of research in the computer vision community. It remains an active research area because identifying and maintaining the location of multiple targets in a video recording can be approached from several perspectives. Another reason is simply that the general problem of automated tracking can be very challenging. Challenges within visual tracking collectively manifest into three broader design decisions often faced by multiple object tracking (MOT) algorithms. First is how to handle what one could think of as "easy" and "hard" regions of a trajectory. The second is how to handle the sheer number of possible explanations of the data. The third is how do you model certainty. This dissertation aims to better model the uncertainty among possible answers to the tracking data in offline tracking scenarios. Furthermore, the method does so in a way that utilizes the information within the "hard to track" regions — information that is typically not used. The way we do this results in accurate tracking that is better suited for video analysis pipelines that may need to filter or correct any tracking errors.

Defense Date and Time: 
Monday, November 15, 2021 - 12:00pm
Defense Location: 
Remote / online (https://meet.google.com/beo-uhvo-wxk)
Committee Chair's Name: 
Dr. Min Shin
Committee Members: 
D. Robert Cox, Dr. Minwoo Lee, Dr. Gabriel Terejanu