2017/09/18 by Ahmed Elliethy, Gaurav Sharma
Computer Science · Engineering · #Association (psychology) #Automated Road and Building Extraction #Autonomous Vehicle Technology and Safety #Computation #Context (archaeology) #Data association #Probabilistic logic #Set (abstract data type) #Spurious relationship #Tracking (education) #Vehicle tracking system #Video Surveillance and Tracking Methods #cs.CV
paper · pdf · doi:10.1109/tip.2018.2818443
arxiv created 2017/09/18 · openalex created_date 2017/09/25 · openalex publication_date 2018/03/22 · arxiv updated 2018/04/17 · openalex updated_date 2026/08/05
Vehicle tracking in Wide Area Motion Imagery (WAMI) relies on associating vehicle detections across multiple WAMI frames to form tracks corresponding to individual vehicles. The temporal window length, i.e., the number M of sequential frames, over which associations are collectively estimated poses a trade-off between accuracy and computational complexity. A larger M improves performance because the increased temporal context enables the use of motion models and allows occlusions and spurious detections to be handled better. The number of total hypotheses tracks, on the other hand, grows exponentially with increasing M, making larger values of M computationally challenging to tackle. In this paper, we introduce SPAAM an iterative approach that progressively grows M with each iteration to improve estimated tracks by exploiting the enlarged temporal context while keeping computation manageable through two novel approaches for pruning association hypotheses. First, guided by a road network, accurately co-registered to the WAMI frames, we disregard unlikely associations that do not agree with the road network. Second, as M is progressively enlarged at each iteration, the related increase in association hypotheses is limited by revisiting only the subset of association possibilities rendered open by stochastically determined dis-associations for the previous iteration. The stochastic disassociation at each iteration maintains each estimated association according to an estimated probability for confidence, obtained via a probabilistic model. Associations at each iteration are then estimated globally over the M frames by (approximately) solving a binary integer programming problem for selecting a set of compatible tracks. Vehicle tracking results obtained over test WAMI datasets indicate that our proposed approach provides significant performance improvements over state of the art alternatives.