Pith. sign in

REVIEW 2 cited by

Asynchronous Blob Tracker for Event Cameras

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2307.10593 v3 pith:ZKJJYIQG submitted 2023-07-20 cs.CV

classification cs.CV
keywords eventblobalgorithmestimationobjectstrackingcamerasdata
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Event-based cameras are popular for tracking fast-moving objects due to their high temporal resolution, low latency, and high dynamic range. In this paper, we propose a novel algorithm for tracking event blobs using raw events asynchronously in real time. We introduce the concept of an event blob as a spatio-temporal likelihood of event occurrence where the conditional spatial likelihood is blob-like. Many real-world objects such as car headlights or any quickly moving foreground objects generate event blob data. The proposed algorithm uses a nearest neighbour classifier with a dynamic threshold criteria for data association coupled with an extended Kalman filter to track the event blob state. Our algorithm achieves highly accurate blob tracking, velocity estimation, and shape estimation even under challenging lighting conditions and high-speed motions (> 11000 pixels/s). The microsecond time resolution achieved means that the filter output can be used to derive secondary information such as time-to-contact or range estimation, that will enable applications to real-world problems such as collision avoidance in autonomous driving.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. GoStop: Reinforcement Learning for Adaptive Temporal Aggregation in Event-Based Feature Tracking

    cs.CV 2026-07 conditional novelty 6.0 of 10

    An RL agent that adaptively decides when to accumulate events and when to run tracking inference improves event-based feature tracking on a new dynamic benchmark, but the gains are less consistent on an existing benchmark.

  2. Event Driven Clustering Algorithm

    cs.CV 2026-01 reject novelty 4.0 of 10

    An asynchronous clustering algorithm detects the roots of small event-camera clusters in O(N) time, independent of sensor resolution.

Pith tools