.png){kind=icon}
返回
Efficient spatio-temporal feature clustering for large event-based datasets
.png){kind=icon}
OA
AI
DOI：10.1088/2634-4386/ac970d.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Event-based cameras encode changes in a visual scene with high temporal precision and low power consumption, generating millions of events per second in the process. Current event-based processing algorithms do not scale well in terms of runtime and computational resources when applied to a large amount of data. This problem is further exacerbated by the development of high spatial resolution vision sensors. We introduce a fast and computationally efficient clustering algorithm that is particularly designed for dealing with large event-based datasets. The approach is based on the expectation-maximization (EM) algorithm and relies on a stochastic approximation of the E-step over a truncated space to reduce the computational burden and speed up the learning process. We evaluate the quality, complexity, and stability of the clustering algorithm on a variety of large event-based datasets, and then validate our approach with a classification task. The proposed algorithm is significantly faster than standard k-means and reduces computational demands by two to three orders of magnitude while being more stable, interpretable, and close to the state of the art in terms of classification accuracy.
Keyword:
clusterings
asynchronous vision
event-based processing
feature extraction
Gaussian mixture model
期刊
IF:
6.1
论文数:
340
被引数:
920
机构
引用论文
.png){kind=icon}
Contributions of evacuation proctography and anorectal manometry to evaluation of adults with constipation and defecatory difficulty排空直肠造影和肛门直肠测压对成人便秘和排便困难的评估的贡献
PREAI
分享收藏
查看更多内容