Abstract :
We describe a framework that explicitly reasons about data association and combines estimates to improve the tracking performance in many difficult visual environments. This work extends two previously reported algorithms: the probabilistic data association filter (PDAF), which handles single-target tracking tasks involving agile motions and clutter; and the joint probabilistic data association filter (JPDAF), which shares information between multiple same-modality trackers (such as homogeneous regions, textured regions, or snakes). The capabilities of these methods are improved in two steps: first, by a joint likelihood filter that allows mixed tracker modalities when tracking several objects and accommodates overlaps robustly. A second technique, the constrained joint likelihood filter, tracks complex objects as conjunctions of cues that are diverse both geometrically (e.g., parts) and qualitatively (e.g., attributes). Rigid and hinge constraints between part trackers and multiple descriptive attributes for individual parts render the whole object more distinctive, reducing the susceptibility to mistracking. The generality of our approach allows for easy application to different target types, and it is flexibly defined for straightforward incorporation of other modalities
Keywords :
filtering theory; image motion analysis; image sequences; image texture; probability; target tracking; tracking filters; JDAF algorithm; PDAF algorithm; agile motions; clutter; constrained joint likelihood filter; data association; hinge constraints; homogeneous regions; image sequence; joint likelihood filter; joint likelihood methods; joint target tracking algorithm; mixed tracker modalities; multiple descriptive attributes; part trackers; rigid constraints; single-target tracking; snakes; textured regions; tracking performance; visual environments; visual tracking disturbances; Computed tomography; Computer science; Fasteners; Filters; Image segmentation; Layout; NIST; Parametric statistics; Robustness; Target tracking;