Event Denoising Based on Iterative Tree-Structured Information Aggregation
Event cameras play a crucial role in the visual field; however, they are susceptible to noise. Traditional denoising algorithms for event cameras often struggle to balance accuracy and speed. To address this issue, this paper proposes an algorithm named Event Denoising Based on Iterative Tree-Structured Information Aggregation (EDIST). Specifically, the proposed method first establishes connections in event streams using a spatiotemporal window to extract Relation Tree. Then, a pruning algorithm is employed to streamline the subsequent information aggregation process, followed by a multi-stage convolution module designed to process the Relation Tree and obtain aggregated features. Finally, these aggregated features are fed into a classification module to determine whether an event is noise. During the inference stage, an information storage reuse module is designed to enable iterative execution, thereby enhancing inference speed. Experimental results demonstrate that the proposed algorithm outperforms existing methods in both denoising accuracy and inference speed on the DVSNOISE20 dataset.
Authors
- Zheng-Jun Zha (ORCID: https://orcid.org/0000-0003-2510-8993)
- Chengjie Ge
- Xueyang Fu (ORCID: https://orcid.org/0000-0001-8036-4071)
- Yueyang Xu
Institutions
- University of Science and Technology of China (CN)
Publication Details
- Published
- 2025-08-18
- DOI
- https://doi.org/10.1109/icip55913.2025.11084717
- Primary Topic
- Neural Networks and Applications
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Natural Science Foundation of China