- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper investigates the computational efficiency of graph representations for event cameras. Existing event-graph methods typically represent each individual event as a graph node, which causes the graph size and computational overhead to scale with the number of events. We propose CSEG, a graph compression strategy that retains a subset of event nodes while fusing the temporal contributions of discarded events into the kept nodes. Specifically, CSEG determines whether to preserve an incoming event based on the temporal state change of existing nodes, and selects fusion targets using local message differences from the first graph convolution layer. The framework further leverages cached features and incremental updates for asynchronous graph inference. Evaluated on Gen1 and DSEC-Det, our method retains approximately 42.56% and 44.23% of event nodes respectively, and achieves an mAP of 38.7 and 42.17. Under the measurement setup with cached image features and 1 ms event batching, we report around 2.6x speedup compared with DAGr.
Critical strengths
S1. For the information loss incurred in graph compression, we propose a representation that is well-founded and amenable to incremental updates. CSEG accumulates the temporal contributions of discarded events into retained nodes instead of simply dropping them. This design targets the practical bottleneck of computational overhead in event graphs and exhibits good compatibility with asynchronous inference. On both datasets, competitive detection performance is maintained while retaining fewer than half of the event nodes, demonstrating the practical value of this research direction. S2. Ablation studies provide direct evidence for the effectiveness of temporal information fusion. As shown in Table 3, under the same node retention ratio of 44.23%, CSEG improves from 41.31 mAP without temporal fusion to 42.17 mAP for the full model. The random retention baseline also benefits when fusion is enabled.Temporal activity reconstruction results in Table 4 further verify that fusion preserves more aggregated temporal information. Collectively, these results demonstrate that temporal information fusion contributes meaningfully to the final performance.
Critical weaknesses
W1. The current comparisons do not sufficiently isolate the gains brought by the proposed method itself. W2. Ambiguities remain in the accounting criteria of efficiency experiments, which affect the core conclusion regarding speedup.
Questions for authors
- What is the performance gain of message-guided fusion over nearest-neighbor fusion and random fusion under strictly matched node budgets and training conditions? When varying the retention threshold, is the trade-off between accuracy and practical latency stable?