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

Institutions

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

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Event Denoising Based on Iterative Tree-Structured Information Aggregation

Zheng-Jun Zha, Chengjie Ge, Xueyang Fu, Yueyang Xu
Neural Networks and Applications
article

Event Denoising Based on Iterative Tree-Structured Information Aggregation

Zheng-Jun Zha, Chengjie Ge, Xueyang Fu, Yueyang Xu
article en

Abstract

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.

University of Science and Technology of China (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 89%
Neural Networks and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Event Denoising Based on Iterative Tree-Structured Information Aggregation — Zheng-Jun Zha, Chengjie Ge, et al. · (2025) | TGRS Research Map | TGRS