Multi-Object Tracking Using Common Eigenvalues and the Short Minimum Clique Problem

Multi-Object Tracking Using Common Eigenvalues and the Short Minimum Clique Problem

Data association is the main part of many multi-object tracking (MOT) methods and is inherently prone to problems such as ID-switches and difficulties caused by long-term occlusion, cluttered background, and crowded scenes. In this paper, data association is formulated as a Short Minimum Clique Problem (SMCP). Using three consecutive frames, three clusters are created where each clique between these clusters is a tracklet (partial trajectory) of a person. For this purpose, a fast and simple ...

دریافت فایل