Source-linked AI summary

Learning Spatio-Temporal Transformer for Visual Tracking

Bin Yan, Houwen Peng, Jianlong Fu, Dong Wang, Huchuan Lu

arXiv:2103.17154v1cs.CV

TL;DR

Visual trackers struggle to model long-range spatial and temporal dependencies while often relying on complicated proposal and postprocessing pipelines. The paper introduces STARK, an encoder-decoder transformer tracker with direct box prediction, and reports state-of-the-art performance on five benchmarks at real-time speed. Its scope includes dynamic-template reliability decisions during tracking.

  • Problem

    Convolutional trackers are limited in capturing long-range global interactions, while existing tracking pipelines often rely on proposal generation and hyperparameter-sensitive postprocessing.

  • Method

    STARK uses an encoder-decoder transformer to integrate spatial and temporal features and predict target boxes directly through a query-based, corner-oriented architecture.

  • Results

    STARK achieves state-of-the-art performance on five short-term and long-term benchmarks and runs at real-time speed, including 6× faster than Siam R-CNN.

  • Takeaways & Limitations

    The end-to-end tracker simplifies inference by removing cosine-window and bounding-box-smoothing postprocessing while retaining real-time tracking performance.

  • Takeaways & Limitations

    Dynamic templates are updated only when the search region contains the target, with reliability determined by a thresholded score head.

Abstract

from arXiv · show

In this paper, we present a new tracking architecture with an encoder-decoder transformer as the key component. The encoder models the global spatio-temporal feature dependencies between target objects and search regions, while the decoder learns a query embedding to predict the spatial positions of the target objects. Our method casts object tracking as a direct bounding box prediction problem, without using any proposals or predefined anchors. With the encoder-decoder transformer, the prediction of objects just uses a simple fully-convolutional network, which estimates the corners of objects directly. The whole method is end-to-end, does not need any postprocessing steps such as cosine window and bounding box smoothing, thus largely simplifying existing tracking pipelines. The proposed tracker achieves state-of-the-art performance on five challenging short-term and long-term benchmarks, while running at real-time speed, being 6x faster than Siam R-CNN. Code and models are open-sourced at https://github.com/researchmm/Stark.

1. Introduction

The paper addresses limited long-range modeling in convolutional trackers with an end-to-end encoder-decoder transformer that integrates spatial and temporal information. It directly predicts target boxes without proposal-based postprocessing and achieves state-of-the-art results at real-time speed.

  • Convolutional trackers primarily model local relationships, limiting their ability to capture global context for targets undergoing large-scale variation or leaving and re-entering views.
  • Transformer self-attention integrates spatial appearance and temporal state changes into discriminative spatio-temporal features for localization.
  • The proposed architecture uses an encoder for feature dependencies, a decoder query for target positions, and a prediction head for visual tracking.
  • The end-to-end tracker removes cosine-window and bounding-box-smoothing postprocessing, simplifying the tracking pipeline.
  • State-of-the-art performance is achieved on five short-term and long-term benchmarks while running at real-time speed.

2. Related Work

Related work spans transformer-based vision models, spatial-only and spatio-temporal trackers, and proposal-heavy tracking pipelines. STARK differs through its tracking-specific inputs, single-query design, corner-based head, and direct alternative to conventional postprocessing.

  • Transformers capture dependencies across sequential inputs and have been applied to vision tasks including detection, segmentation, and multiple-object tracking.
  • Unlike DETR, STARK tracks rather than detects, uses a search region with two templates, one query, direct matching, and a corner-based box head.
  • TransTrack and TrackFormer use different frame inputs, decoder/query arrangements, and association mechanisms from STARK.
  • Spatial-only trackers use correlation to model local template-search similarity, whereas transformer self-attention captures long-range relationships.
  • Conventional tracking pipelines generate many proposals and apply postprocessing such as cosine windows, penalties, and box smoothing, making performance hyperparameter-sensitive.

3. Method

STARK uses an encoder-decoder transformer to model spatial and temporal dependencies for direct target-box prediction. Its dynamic template, confidence-based updating, and end-to-end training support tracking through changing target appearance.

  • Architecture: STARK combines a convolutional backbone, encoder-decoder transformer, and bounding box prediction head for direct tracking.The baseline framework is extended from spatial-only to spatio-temporal tracking.
  • Architecture: The backbone extracts feature maps from an initial target template and the current search region before transformer processing.A vanilla ResNet is used without its final stage and fully connected layers.
  • Transformer: The encoder uses self-attention to capture global dependencies, while a single decoder query predicts one target bounding box.Unlike DETR, the tracker uses one query because it predicts one target object.
  • Box prediction: The prediction head estimates probability maps for top-left and bottom-right corners, then obtains coordinates from their expected distributions.This explicitly models uncertainty in coordinate estimation rather than directly regressing coordinates.
  • Spatio-temporal tracking: A dynamically updated template supplies temporal appearance information, while a score head updates it only when the current state is reliable.The update is gated by a confidence threshold, and updates are avoided when the target is occluded, out of view, or drifting.
  • Training: Training separates localization and classification into two stages, freezing localization parameters while optimizing the score head with binary cross-entropy.The first stage trains the network except the score head for localization; the second stage trains only the score head.

4. Experiments

Experiments evaluate STARK across short-term and long-term tracking benchmarks, implementation settings, efficiency, and component ablations. The results show strong benchmark performance, real-time speed, and effects from temporal templates, query design, attention, and score filtering.

  • Results and Comparisons: STARK is evaluated on three short-term and two long-term tracking benchmarks, with results compared against state-of-the-art trackers.The experiments also include implementation details, ablations, alternative frameworks, and attention visualizations.
  • Results and Comparisons: 68.8% AO on GOT-10K is achieved by STARK-ST101, surpassing Siam R-CNN by 3.9% with the same ResNet-101 backbone.With ResNet-50, STARK-S50 and STARK-ST50 outperform PrDiMP50 by 3.8% and 4.6% AO, respectively.
  • Results and Comparisons: 82.0% AUC on TrackingNet is achieved by STARK-ST101, outperforming Siam R-CNN by 0.8%.STARK-S50 and STARK-ST50 surpass PrDiMP50 by 4.5% and 5.5% in AUC, respectively.
  • Results and Comparisons: 67.1% success on LaSOT is achieved by STARK-ST101, 2.3% higher than Siam R-CNN; STARK-ST50 and STARK-ST101 also obtain F-scores of 70.2% and 70.1% on VOT2020-LT.The LaSOT gains over PrDiMP are 6.0% for STARK-S50 and 6.6% for STARK-ST50.
  • Speed, FLOPs and Params: STARK-S50 runs at more than 40 fps, while STARK-ST101 remains real-time and is 6x faster than Siam R-CNN at 5 fps.STARK-S50 uses 4× fewer FLOPs and 2× fewer parameters than SiamRPN++; adding temporal information increases these costs only slightly.
  • Ablation Studies: Removing the score head reduces performance to 64.5%, while updating the query embedding yields 64.8% success, 1.6% below STARK-ST50.The ablations indicate that unreliable templates can hurt performance and that temporal information can be introduced through either dynamic templates or query updates.
  • Visualization: Encoder attention concentrates on tracked targets and separates them from background, while decoder attention focuses on target regions and remains robust to distractors.Decoder attention emphasizes the top-left target region in templates and target boundaries in search regions.

5. Conclusion

STARK captures long-range dependencies across spatial and temporal dimensions while simplifying inference by removing hyper-parameter-sensitive post-processing. It achieves stronger performance than previous methods on five benchmarks at real-time speed.

  • STARK uses a transformer-based tracking framework to capture long-range dependencies in spatial and temporal dimensions.
  • The tracker removes hyper-parameter-sensitive post-processing, resulting in a simpler inference pipeline.
  • STARK trackers outperform previous methods on five short-term and long-term benchmarks while running in real time.
Loading 2103.17154v1…