Counting Repetitive Actions in Event Stream

The frame-based method is not suitable for counting repetitive actions in event stream, since the framing process will disrupt the temporal information of events. For accurate count of repetitive actions in events, we propose a framework based on threefold ideas: a) converting event stream into time series, b) searching candidates of repetitive actions based on the ascending and descending trends of event time series, and c) checking the candidates with a fast dynamic time warping based method. For accurate counting repetitive actions, an action enhancement method for event time series and a Mann-Kendall test incorporated dynamic candidate selection algorithm are innovatively proposed. The experimental results on artificially synthesized and normally recorded event datasets demonstrate that our framework can count repetitive actions in event stream with high accuracy. All codes, datasets and examples of visualization can be found at https://github.com/ZYL618/action_count_in_events3.

Authors

Institutions

Publication Details

Published
2024-09-27
DOI
https://doi.org/10.1109/icip51287.2024.10647373
Citations
1
Primary Topic
Topic Modeling
Type
article
Field-Weighted Citation Impact
0.35

Funders

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

Counting Repetitive Actions in Event Stream

Yan Fang, Beibei Yang, Huaqiang Yuan, Weiling Li et al.
1 citations
Topic Modeling
0.35
article

Counting Repetitive Actions in Event Stream

Yan Fang, Beibei Yang, Huaqiang Yuan, Weiling Li, Yuelong Zhuo
article en
1 citations

Abstract

The frame-based method is not suitable for counting repetitive actions in event stream, since the framing process will disrupt the temporal information of events. For accurate count of repetitive actions in events, we propose a framework based on threefold ideas: a) converting event stream into time series, b) searching candidates of repetitive actions based on the ascending and descending trends of event time series, and c) checking the candidates with a fast dynamic time warping based method. For accurate counting repetitive actions, an action enhancement method for event time series and a Mann-Kendall test incorporated dynamic candidate selection algorithm are innovatively proposed. The experimental results on artificially synthesized and normally recorded event datasets demonstrate that our framework can count repetitive actions in event stream with high accuracy. All codes, datasets and examples of visualization can be found at https://github.com/ZYL618/action_count_in_events3.

Kennesaw State University (US), Dongguan University of Technology (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 33%
Topic Modeling
0.35
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.