Spiking Patches: Asynchronous, Sparse, and Efficient Tokens for Event Cameras
Read the original on arXiv Computer Vision →The Flow has not summarised this story yet — read it at arXiv Computer Vision.
The Flow has not summarised this story yet — read it at arXiv Computer Vision.
The paper introduces four new event‑based vision datasets created with the ANTShapes simulation tool, designed to support object classification research using spiking neural networks (SNNs). These datasets vary in difficulty and are benchmarked against established spiking datasets such as N‑MNIST, CIFAR10‑DVS, DVSGesture, and POKER‑DVS using a convolutional SNN. The work provides detailed, high‑quality datasets for future experiments and validates ANTShapes as a suitable tool for generating event‑based vision data.
arXiv:2605. 05895v2 Announce Type: replace-cross Abstract: Modern AI-generated videos are photorealistic at the single-frame level, leaving inter-frame dynamics as the main remaining axis for detection.
arXiv:2608. 19238v1 Announce Type: cross Abstract: Spiking Transformers model token interactions primarily through spiking self-attention (SSA).
The paper presents a lightweight, training‑free framework for real‑time unsupervised object discovery from asynchronous event camera streams. It introduces a linear‑time Spatio‑Temporal Probabilistic Event Filter (SPEF) that adaptively distinguishes salient motion from noise, and an Event Morton Code Clustering (EMCC) module that efficiently groups events without costly distance calculations. Experiments on E‑MLB, FRED, and eTraM datasets show SPEF outperforms classical filters and competes with learning‑based methods, while EMCC achieves the highest accuracy and fastest execution among density‑based clustering baselines.
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.
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.