A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Long-term Activities Segmentation using Viterbi Algorithm with a k-minimum-consecutive-states Constraint
2014
Procedia Computer Science
In the last years, several works have made use of acceleration sensors to recognize simple physical activities like: walking, running, sleeping, falling, etc. Many of them rely on segmenting the data into fixed time windows and computing time domain and/or frequency domain features to train a classifier. A long-term activity is composed of a collection of simple activities and may last from a few minutes to several hours (e.g., shopping, exercising, working, etc.). Since long-term activities
doi:10.1016/j.procs.2014.05.460
fatcat:nk5noy2ahvabrkrrsqptywdfqq