TRACKING MULTI-TARGETS WITH UNIFIED HANDLING OF VIDEO

Data association is an essential component of the human detection and tracking system. The majority of the existing methods, such as Bi-partite matching and GMCP methods are incorporated the limited-temporal-locality of the sequence into data association problem. GMCP tracker is considered as an important complete representation of the tracking problem, where all pair wise relationships between the detections in temporal span of a video is considered and makes the input to the data association as a complete Bi-partite graph. In Bi-partite graph a track of a person will form a clique (a subgraph in which all the nodes are connected to each other). A cost is assigned to each clique and it maximizes the score function, which is selected as the best clique (track), but it is sub-optimal. GMCP tracker does not follow the joint optimization for all the tracks simultaneously and finds the tracks one by one which makes difficulties caused by cluttered background, and crowded scenes to detect and tracking