arXiv Computer Vision By Haiqing Hao, Zhipeng Sui, Rong Zou, Zijia Dai, Nikola Zubi\'c, Davide Scaramuzza, Wenhui Wang

Low-Latency Event-Based Object Detection with Spatially-Sparse Linear Attention

Read the original on arXiv Computer Vision →

The paper introduces Spatially‑Sparse Linear Attention (SSLA), a novel attention mechanism that activates only a sparse subset of spatial states, enabling efficient parallel training and inference for event‑based vision. Building on SSLA, the authors present SSLA‑Det, an end‑to‑end asynchronous linear attention model that achieves state‑of‑the‑art accuracy on Gen1 and N‑Caltech101 while reducing per‑event computation by more than 20× compared to the strongest prior asynchronous baseline.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Computer Vision.

arXiv Computer Vision
Oct 9

SV-TAD: Native Sparse Convs for Efficient Temporal Action Detection

SV-TAD introduces native sparse 2D convolutions to enable convolutional adapters to operate directly on dynamically pruned token sets, addressing the inefficiency of dense reconstruction in token‑selection methods. By integrating this primitive into a temporal action detection framework, the approach cuts VideoMAEv2‑L computation by up to 64% and achieves 2.2× faster inference while preserving state‑of‑the‑art accuracy on THUMOS‑14 and ActivityNet‑1.3. When applied to InternVideoNext‑L, it surpasses prior state‑of‑the‑art performance at roughly half the computational cost and naturally supports auxiliary task tokens for improved fine‑grained assembly detection on ATTACH.

By Ricardo Pizarro, Roberto Valle, Jos\'e M. Buenaposada, Luis M. Bergasa, Luis Baumela
Hugging Face Trending Papers
Oct 8

SV-TAD: Native Sparse Convs for Efficient Temporal Action Detection

SV‑TAD introduces native sparse 2D convolutions to enable convolutional adapters to operate directly on dynamically pruned token sets, addressing the inefficiency of existing adapters that do not reduce inference‑time computation. By integrating this primitive, SV‑TAD cuts VideoMAEv2‑L computation by up to 64% and achieves 2.2× faster inference while preserving state‑of‑the‑art accuracy on THUMOS‑14 and ActivityNet‑1.3. When applied to InternVideoNext‑L, the approach surpasses prior state‑of‑the‑art performance at roughly half the computational cost and also supports auxiliary task tokens, improving fine‑grained assembly detection on ATTACH.

arXiv Computer Vision
Aug 27

FLEET: Token-Based Feature Extraction for Event Camera-based Reinforcement Learning

FLEET is a token‑based feature extractor that processes event camera data directly, using random Fourier features and cross‑attention to compress variable‑length event streams into fixed‑size latent representations. By decoupling inference cost from sensor resolution, it avoids the high compute and temporal blurring associated with CNN‑based grid aggregation. Experiments on a new high‑throughput benchmark show that FLEET outperforms state‑of‑the‑art methods and remains robust across different observation frequencies.

By Tristan Gottwald, Maximilian Schier, Melanie Schaller, Bodo Rosenhahn
arXiv Machine Learning
Sep 23

GTR: Gated Token Recurrence for Efficient Dense Prediction

The paper introduces Gated Token Recurrence (GTR), a softmax‑free recurrent vision backbone that replaces global softmax attention with gated linear attention, alternating scan directions, and enhanced SwiGLU blocks. GTR is distilled from a DINOv3 teacher using only final‑layer patch‑token alignment, and achieves strong performance on COCO object detection (58.9 box AP) with very low latency (1.908 ms on an RTX 4090). The backbone also transfers to multiple dense prediction tasks and runs efficiently on edge hardware via a specialized CUDA operator and TensorRT deployment.

By Zhe Feng, Longfei Liu, Wei Liu, Kai Chen, Jiangjiang Kong, Wei Zhou, Yifeng Qian, Dexiong Chen, Xuanlong Yu, Xi Shen
arXiv Computer Vision
Sep 7

Efficient Multi-Timescale Event Representations for Feed-Forward Object Detection

The paper introduces a confidence‑normalized continuous multi‑timescale representation for event cameras, using logarithmic B‑spline temporal encoding and a geometry‑aware local confidence mechanism. When paired with a fixed feed‑forward EventCenterNet detector, this representation outperforms the compact CSTR representation on the PEDRo and Gen1 datasets. Additionally, a recursive exponential‑polynomial approximation is proposed to allow efficient event‑by‑event updates while maintaining detection performance.

By Fredrik Lundell, Per-Erik Forssen, M{\aa}rten Wadenb\"ack, Astrid Lundmark
arXiv AI
Sep 18

PointEvent: Rethinking Event-based Tiny Object Detection via Serialized Motion Evidence Accumulation

PointEvent introduces serialized motion evidence accumulation for event-based tiny object detection, treating motion continuity as an ordered evidence propagation process. The method organizes event streams into locality‑preserving spatiotemporal paths and chronology‑preserving temporal paths, alternating serialized scans across complementary orders to consolidate fragmented motion evidence. A lightweight event‑wise state‑space framework with a high‑resolution event branch and compact context modulation achieves state‑of‑the‑art performance with the fewest parameters and fastest inference among compared methods.

By Zongze Wu, Baofeng Jia, Weiqi Yan, Jingyuan Zhang, Yu Zang, Xiaoyu Chen, Jing Han