0

Event Driven Clustering Algorithm

This paper introduces a novel asynchronous, event-driven algorithm for real-time detection of small event clusters in event camera data. Similar to hierarchical agglomerative clustering methods, the proposed algorithm detects clusters based on their spatio-temporal proximity.

Preview
Year
2026
Hosting
Full text hostedCC-BY-4.0

Cite

Notes

Only stored in your browser.

Attribution

Abstract & full text
arxiv.org/abs/2602.00115CC-BY-4.0
TL;DR
Semantic Scholar
Attribution policy →

Abstract

This paper introduces a novel asynchronous, event-driven algorithm for real-time detection of small event clusters in event camera data. Similar to hierarchical agglomerative clustering methods, the proposed algorithm detects clusters based on their spatio-temporal proximity. However, it explicitly leverages the asynchronous structure of event camera data and employs a simple yet efficient decision mechanism, achieving a linear time complexity of Θ(N), where N is the number of events. Furthermore, the runtime is independent of the sensor resolution, i.e., the number of pixels.