GateMOT: Q-Gated Attention for Dense Object Tracking

Mingjin Lv, Zelin Liu, Feifei Shao, Yi-Ping Phoebe Chen, Junqing Yu, Wei Yang, Zikai SongarXiv 2026 · arXiv

TL;DR

GateMOT introduces Q-Gated Attention (Q-Attention), a novel attention variant that swaps out expensive all-to-all token interactions for highly efficient, linear-complexity element-wise gating. By repurposing the Query into a learnable spatial gate, GateMOT enables dense, multi-task tracking decoders to run efficiently on high-resolution feature maps, setting new state-of-the-art performance benchmarks in crowded and occlusion-heavy scenes.

What Problem Does This Paper Address?

Multi-Object Tracking (MOT) in dense, crowded environments—like a swarm of bees or a packed subway station—requires high-resolution feature maps to accurately localize and differentiate targets. While vanilla self-attention mechanisms excel at capturing rich global context, their computational complexity scales quadratically ($O(N^2d)$) with the number of spatial locations ($N$). This makes them prohibitively expensive to deploy directly inside dense, pixel-level tracking heads.

To avoid this computational bottleneck, existing trackers usually resort to compromises:

  1. Tracking-by-detection with Kalman Filters: Separates motion from deep visual features, struggling with complex, non-linear dynamics.
  2. Sparse query-based transformers: Apply attention only to a small set of object queries, which avoids dense computation but weakens explicit geometric reasoning for motion.
  3. Pure convolutions: Efficient and locality-preserving, but rely on static filtering and lack adaptive, task-conditioned feature routing.

GateMOT bridges this gap by rethinking the fundamental role of the Query component in attention, combining the feature selection power of attention with the linear efficiency required for dense motion and tracking estimation.

Fig. 1: Comparison between our Q-Attention and vanilla attention. Top: our Q-Attention employs a learned Gating-Q to perform efficient, element-wise gating on Key (K) features. Bottom: vanilla attention relies on two expensive matrix multipli- cations for global feature aggregation.

Methods

The core innovation of GateMOT is Q-Gated Attention (Q-Attention). Instead of using the Query ($Q$) to compute a massive similarity matrix against Keys ($K$), Q-Attention transforms the Query into a learnable projection that estimates task-relevance across the feature map.

The Q-Attention Mechanism

  1. Gating Map Generation: The Query projection yields a spatial map of scores transformed into a probabilistic gating map $\mathbf{M}$ via a sigmoid function: $$\mathbf{M} = \sigma(\mathbf{Q})$$
  2. Element-wise Gating: This gating map dynamically modulates the Key features (which carry the visual content) via efficient element-wise multiplication (Hadamard product): $$\mathbf{K}' = \mathbf{M} \odot \mathbf{K}$$
  3. Local Aggregation & Residual Fusion: The gated Key pathway undergoes local max-pooling to distill local evidence. Meanwhile, the Value ($V$) projection acts as an unfiltered residual stream to preserve the integrity of the original features. They are concatenated and fused via a $1 \times 1$ convolution: $$\mathbf{Y} = \psi([\mathbf{V}, \text{MaxPool}(\mathbf{K}')])$$

This formulation drops the quadratic token interaction term entirely, achieving an overall complexity of $O(Nd^2)$ with an $O(Nd)$ gating interaction term.

Fig. 2: The architecture of our Q-Attention module. Its core is a gating mecha- nism driven by a learnable Gating-Query (Gating-Q). The Gating-Q generates a proba- bilistic gate that element-wise modulates Key features, performing an efficient selection that is then fused with an unfiltered Value branch.

The GateMOT Architecture

Built on top of a Deep Layer Aggregation (DLA-34) backbone, GateMOT deploys parallel Q-Attention heads in a tightly coupled multi-task decoder. Because each head (Detection, Motion, ReID) learns its own independent gate from a shared dense feature map, the model extracts task-specific features while maintaining strict cross-task spatial consistency.

The overall architecture of GateMOT

Datasets

The authors evaluated GateMOT across four diverse and challenging multi-object tracking benchmarks:

  • BEE24: A dataset featuring extremely small, densely packed, and highly identical targets (bees) with frequent occlusions.
  • SportsMOT: Focuses on fast-moving athletes with similar uniforms and body types in sports sequences.
  • MOT17: A classic benchmark for pedestrian tracking in complex urban environments with varying camera motions.
  • MOT20: Highly crowded pedestrian environments characterized by extreme target density and heavy occlusions.

Key Insights and Ideas

  • Queries as Gates: Attention doesn't inherently require all-to-all token matching. Repurposing the Query as a point-wise spatial filter retains attention-style selectivity while scaling linearly.
  • The Power of Unfiltered Values: Keeping the Value pathway completely unfiltered as a residual stream is vital. It ensures that while the Key pathway performs aggressive task-specific selection, holistic feature integrity is never lost.
  • Less is More in Head Depth: Ablation studies revealed that a single layer of Q-Attention outperforms deeper 3-layer convolutional heads or multi-layer attention heads. Stacking more gating layers actually over-smoothes localization-sensitive features, harming dense tracking precision.

Key Results

GateMOT achieves state-of-the-art results across multiple dense tracking benchmarks:

  • BEE24: Set a new state-of-the-art with a HOTA of 48.4, MOTA of 67.8, and IDF1 of 64.5, significantly reducing identity switches compared to strong baselines like ByteTrack and TOPICTrack.
  • SportsMOT: Achieved 76.3 HOTA and 79.0 IDF1, proving that the query-gated design extracts highly discriminative ReID embeddings even when targets wear identical uniforms.
  • MOT17 & MOT20: Delivered highly competitive performance (63.3 HOTA on MOT17; 62.8 HOTA on MOT20), demonstrating robust generalization in classic crowded urban scenes.
  • Efficiency: On MOT17-val, Q-Attention achieved higher tracking accuracy (64.4 HOTA) at a lower computational cost (159.7 GFLOPs) and higher throughput (13.3 FPS) than deformable attention or linear attention alternatives.

Limitations and Future Work

Despite its strength in dense scenes, the authors noted a few edge cases where GateMOT struggles:

  • Long-Horizon Occlusions: In sparse, highly dynamic scenes (like DanceTrack), targets that remain occluded or invisible for prolonged periods occasionally fail to re-activate correctly. Because Q-Attention relies heavily on localized spatial evidence, it can lose track of identities over long temporal gaps.
  • Abrupt Camera Motion: Sudden, violent shifts in the camera viewpoint can destabilize both geometric and appearance cues, leading to identity switches.

Future Direction: The authors point to strengthening long-range memory mechanisms and improving re-entry modeling as key areas to make the tracker more resilient to long-term tracking disruptions.

Summary updated

Abstract

While large models demonstrate the strong representational power of vanilla attention, this core mechanism cannot be directly applied to Dense Object Tracking: its quadratic all-to-all interactions are computationally prohibitive for dense motion estimation on high-resolution features. This mismatch prevents Dense Object Tracking from fully leveraging attention-based modeling in crowded and occlusion-heavy scenes. To address this challenge, we introduce GateMOT, an online tracking framework centered on Q-Gated Attention (Q-Attention), an efficient and spatially aware attention variant. Our key idea is to repurpose the Query from a similarity-conditioning term into a learnable gating unit. This Gating-Query (Gating-Q) produces a probabilistic gate that modulates Key features in an element-wise manner, enabling explicit relevance selection instead of costly global aggregation. Built on this mechanism, parallel Q-Attention heads transform one shared feature map into task-specific yet consistent representations for detection, motion, and re-identification, yielding a tightly coupled multi-task decoder with linear-complexity gating operations. GateMOT achieves state-of-the-art HOTA of 48.4, MOTA of 67.8, and IDF1 of 64.5 on BEE24, and demonstrates strong performance on additional Dense Object Tracking benchmarks. These results show that Q-Attention is a simple, effective, and transferable building block for attention-based tracking in dense tracking scenarios.
BibTeX
@misc{lv2026gatemot,
  author = {Mingjin Lv and Zelin Liu and Feifei Shao and Yi-Ping Phoebe Chen and Junqing Yu and Wei Yang and Zikai Song},
  title = {{GateMOT: Q-Gated Attention for Dense Object Tracking}},
  year = {2026},
  eprint = {2604.26353},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2604.26353},
}
Figure