Source-linked AI summary

Near-Online Multi-target Tracking with Aggregated Local Flow Descriptor

Wongun Choi

arXiv:1504.02340v1cs.CV

TL;DR

Multiple target tracking needs accurate detection affinity and an efficient near-online association algorithm. The paper introduces ALFD and NOMT, and reports best accuracy on KITTI and MOT with substantial margins over state-of-the-art methods. ALFD is less reliable during occlusion.

  • Problem

    Multiple target tracking lacks both robust pairwise affinity measures for distant detections and accurate, efficient near-online association.

  • Method

    ALFD aggregates long-term interest point trajectories for relative-motion affinity, while NOMT repeatedly solves global association in a temporal window using multiple tracking cues.

  • Results

    The method achieves the best accuracy on KITTI and MOT, with MOTA gains exceeding 10% for cars and 8% for pedestrians over state-of-the-art methods.

  • Takeaways & Limitations

    ALFD-based affinity is significantly better than conventional affinity metrics, and NOMT produces better tracking results while running in real time.

  • Takeaways & Limitations

    ALFD may become unreliable during occlusion because target-initiated interest point trajectories tend to adhere to the occluding target.

Abstract

from arXiv · show

In this paper, we focus on the two key aspects of multiple target tracking problem: 1) designing an accurate affinity measure to associate detections and 2) implementing an efficient and accurate (near) online multiple target tracking algorithm. As the first contribution, we introduce a novel Aggregated Local Flow Descriptor (ALFD) that encodes the relative motion pattern between a pair of temporally distant detections using long term interest point trajectories (IPTs). Leveraging on the IPTs, the ALFD provides a robust affinity measure for estimating the likelihood of matching detections regardless of the application scenarios. As another contribution, we present a Near-Online Multi-target Tracking (NOMT) algorithm. The tracking problem is formulated as a data-association between targets and detections in a temporal window, that is performed repeatedly at every frame. While being efficient, NOMT achieves robustness via integrating multiple cues including ALFD metric, target dynamics, appearance similarity, and long term trajectory regularization into the model. Our ablative analysis verifies the superiority of the ALFD metric over the other conventional affinity metrics. We run a comprehensive experimental evaluation on two challenging tracking datasets, KITTI and MOT datasets. The NOMT method combined with ALFD metric achieves the best accuracy in both datasets with significant margins (about 10% higher MOTA) over the state-of-the-arts.

1. Introduction

Multiple target tracking requires accurate detection association, but conventional spatial and appearance affinities can be ambiguous while batch methods sacrifice online applicability. The paper introduces ALFD and NOMT to improve affinity estimation and near-online tracking efficiency.

  • Data association is the key challenge because identity-maintenance mistakes can catastrophically affect downstream tasks.
  • Batch tracking improves association accuracy by using entire sequences but is fundamentally limited to post-analysis.
  • ALFD aggregates long-term interest point trajectories to encode relative motion between detections and provide a strong affinity measure.
  • NOMT repeatedly solves global association within a temporal window, allowing past errors to be corrected when additional observations arrive.
  • The method is evaluated on KITTI and MOT datasets and achieves the best accuracy with a large margin over state-of-the-art methods.

2. Background

Online tracking supports real-time processing but can suffer from short-term association errors, whereas global tracking uses longer-term information but is difficult to extend online. The paper positions NOMT as a temporal-window framework between these approaches.

  • 2.1. Data Association Models: Online algorithms associate existing targets with current-frame detections, enabling real-time use but often causing errors from limited temporal information.
  • 2.1. Data Association Models: Global algorithms improve robustness by considering long-term information, but network-flow formulations may omit target dynamics and interactions.
  • 2.1. Data Association Models: Iterative global methods use intermediate target information to account for dynamics, interactions, and higher-order trajectory statistics.
  • 2.1. Data Association Models: NOMT fills the gap between online and global tracking by solving association repeatedly within a predefined temporal window.
  • 2.2. Affinity Measures: Pairwise affinity is relatively under-investigated, with many methods relying on spatial distance or simple appearance features.

3. Aggregated Local Flow Descriptor

ALFD represents relative motion between temporally separated detections by aggregating interest point trajectories into spatial histograms, then combines bidirectional descriptors into a normalized affinity. Its learned weights account for temporal distance, while its reliability decreases during occlusion.

  • ALFD Design: ALFD aggregates interest point trajectories to encode how points move relative to two detection boxes across a temporal distance.The descriptor uses trajectories existing at both detection times and spatial histograms to tolerate localization errors, orientation changes, and trajectory outliers.
  • Interest Point Trajectories: Interest point trajectories are generated with FAST detection and forward-backward optical flow, terminating tracks with disagreement greater than 10 px.New points are kept more than 4 px from existing trajectories to reduce redundancy.
  • ALFD Design: The descriptor uses 4 × 4 bins for points inside the source detection and 4 × 4 + 2 bins for points relative to the destination detection.The two outside bins distinguish a nearby neighborhood from a farther region beyond the destination box.
  • ALFD Design: Bidirectional ALFDs are averaged and normalized by the number of supporting trajectories plus λ, with λ = 20 in practice.The normalizer makes the L1 norm increase with more supporting trajectories while converging to 1.
  • Learning the Model Weights: Model weights are learned by weighted voting over ALFD patterns, with localization overlap determining each pair’s signed contribution.The resulting weights and affinity are bounded in [−1, 1].
  • Properties: ALFD uses information from all intervening images and remains useful over arbitrary time spans, but can become unreliable when occlusion causes trajectories to adhere to an occluder.This limitation motivates combining ALFD with target dynamics information.

4. Near Online Multi-target Tracking (NOMT)

NOMT performs near-online data association over a temporal window by generating hypotheses for existing and newly entering targets, selecting a consistent configuration, and updating tracks each frame. Its formulation uses soft exclusivity and parallel graphical-model inference to balance correction of recent errors with efficiency.

  • Model Representation: NOMT updates targets at every frame using detections in the temporal window [t−τ, t].The framework considers multiple frames while retaining near-online operation.
  • Hypothesis Generation: The algorithm represents each existing or new target with candidate hypotheses, including the empty hypothesis for target termination.Each hypothesis contains up to τ detections, with at most one detection per frame.
  • Model Representation: NOMT selects a most consistent hypothesis for every target by minimizing an energy with unary, pairwise, and higher-order terms.The terms encode individual-target compatibility, relationships between targets, and additional regularization.
  • Model Representation: The model uses soft penalties for overlapping targets and duplicate detection assignments rather than hard exclusion constraints.This permits strong single-target consistency costs to overcome the soft penalty.
  • Hypothesis Generation: Candidate hypotheses are generated independently from ALFD-driven tracklets, enabling parallel processing before coherent CRF inference.Tracklets grow greedily by adding the best matching detection until the ALFD threshold or temporal-window limit is reached.
  • Inference and Output: Connected-component analysis decomposes the graphical model, after which NOMT applies junction-tree inference to multi-node subgraphs and direct selection to singleton targets.The selected hypotheses can add, delete, replace, or leave unchanged associations within the temporal window.

5. Model Details

The model combines ALFD-based affinity with target dynamics, pairwise self-consistency, physical feasibility, and long-term appearance consistency. ALFD is intended to remain informative across long temporal distances, while other potentials address its failure cases and track regularity.

  • Unary potential: Unary compatibility combines ALFD affinity with target dynamics, using target dynamics when predicted and detected boxes overlap by more than 0.5.The min operator generally favors ALFD while activating the dynamics cue only under this confident overlap condition.
  • Unary potential: Long-term affinity is modeled over neighbor frame distances N = {1, 2, 5, 10, 20} for computational efficiency.The selected distances provide long-term affinity modeling without using an arbitrarily large set.
  • Pairwise potential: The pairwise potential uses ALFD alone to measure self-consistency between detections within a hypothesis.It evaluates whether detections assigned to the same hypothesis exhibit compatible motion patterns.
  • High-order potential: The high-order potential penalizes abrupt motion and regularizes associations with long-term appearance similarity.Appearance consistency uses intersection-kernel comparisons of detection color histograms.
  • High-order potential: The appearance descriptor uses pyramid LAB histograms with one full-box layer and a 3 × 3 grid layer, using four bins per A and B channel.The resulting representation has 4 × 4 × (1 + 9) bins.
  • Affinity evaluation: Table 1 reports ALFD as robust at a temporal distance of 20 frames, with stable affinity across object types and camera motion.The table evaluates AUC for affinity metrics at varying temporal distances.

6. Experimental Evaluation

Experiments on KITTI and MOT evaluate ALFD, NOMT accuracy, near-online latency, and computational efficiency. NOMT achieves strong tracking results while operating at approximately 10 FPS.

  • ALFD Analysis: ALFD affinity is evaluated using detection pairs separated by 1, 2, 5, 10, and 20 frames against NDist2 and HistIK baselines.The analysis uses KITTI 0001 and MOT PETS09-S2L1 training sequences, with ROC curves and AUC measurements.
  • ALFD Analysis: ALFD performs best across temporal distances, camera configurations, and object types, while conventional metrics become unreliable as temporal distance increases.Figure 6 specifically highlights the unreliability of NDist2 under increasing temporal distance with a moving camera.
  • KITTI Testing Benchmark Evaluation: NOMT outperforms state-of-the-art methods on KITTI, achieving higher MOTA by more than 10% for Car and more than 8% for Pedestrian.It also produces more mostly tracked targets, fewer mostly lost targets, and low identity-switch and fragmentation counts.
  • MOT Challenge Evaluation: On MOT, NOMT records the lowest identity switch and fragmentation counts, highest detection accuracy, and highest MOTA with a margin greater than 14%.The reported detection improvements include lower false positives and false negatives.
  • Timing Analysis: The method runs in real time at approximately 10 FPS on a 2.5GHz CPU with 16 cores, with optical-flow computation as the main bottleneck.The timing breakdown includes IPT computation, color-histogram extraction, hypothesis generation, CRF inference, and file I/O.

7. Conclusion

The paper introduces ALFD for measuring affinity between temporally separated detections and NOMT for near-online multi-target tracking. Experiments show improved tracking on two challenging datasets, while real-time operation supports applications such as autonomous driving and surveillance.

  • Conclusion: ALFD measures affinity between detection pairs using aggregated local motion information from interest point trajectories.The descriptor is intended to compare detections accurately across time.
  • Conclusion: NOMT combines near-online and global-tracking advantages to produce tracking results on challenging large-scale datasets.The conclusion presents NOMT as the tracking algorithm equipped with ALFD.
  • Conclusion: Real-time execution enables applications including autonomous driving and real-time surveillance.The conclusion explicitly connects the method's real-time operation with these application areas.
Loading 1504.02340v1…