Video Not Available
Details
Abstract
DVS is sensitive to background active noise. The ordinary O(N2)-Space spatiotemporal filter’s memory complexity is high. Some works reduce memory complexity by sacrificing the performance of the filter. To ensure the filtering effect and reduce the filter’s memory complexity, this paper proposes a novel filter: Queue-based spatiotemporal filter. Moreover, this paper proposes a clustering algorithm. Experiments show that the proposed filter’s performance is similar to the O(N2)-Space spatiotemporal filter while having a lower memory complexity. Besides, using the proposed clustering algorithm, the objects in motion can be clustered with low calculation complexity.