Human activity recognition using LZW-Coded Probabilistic Finite State Automata

Author(s):  
James Wilson ◽  
Nayeff Najjar ◽  
James Hare ◽  
Shalabh Gupta
2019 ◽  
Vol 24 (4) ◽  
pp. 451-464 ◽  
Author(s):  
Enrico Casella ◽  
Marco Ortolani ◽  
Simone Silvestri ◽  
Sajal K. Das

AbstractRecognizing users’ daily life activities without disrupting their lifestyle is a key functionality to enable a broad variety of advanced services for a Smart City, from energy-efficient management of urban spaces to mobility optimization. In this paper, we propose a novel method for human activity recognition from a collection of outdoor mobility traces acquired through wearable devices. Our method exploits the regularities naturally present in human mobility patterns to construct syntactic models in the form of finite state automata, thanks to an approach known as grammatical inference. We also introduce a measure of similarity that accounts for the intrinsic hierarchical nature of such models, and allows to identify the common traits in the paths induced by different activities at various granularity levels. Our method has been validated on a dataset of real traces representing movements of users in a large metropolitan area. The experimental results show the effectiveness of our similarity measure to correctly identify a set of common coarse-grained activities, as well as their refinement at a finer level of granularity.


2015 ◽  
Vol 25 (04) ◽  
pp. 1450036 ◽  
Author(s):  
José R. Villar ◽  
Silvia González ◽  
Javier Sedano ◽  
Camelia Chira ◽  
Jose M. Trejo-Gabriel-Galan

The development of efficient stroke-detection methods is of significant importance in today's society due to the effects and impact of stroke on health and economy worldwide. This study focuses on Human Activity Recognition (HAR), which is a key component in developing an early stroke-diagnosis tool. An overview of the proposed global approach able to discriminate normal resting from stroke-related paralysis is detailed. The main contributions include an extension of the Genetic Fuzzy Finite State Machine (GFFSM) method and a new hybrid feature selection (FS) algorithm involving Principal Component Analysis (PCA) and a voting scheme putting the cross-validation results together. Experimental results show that the proposed approach is a well-performing HAR tool that can be successfully embedded in devices.


Sign in / Sign up

Export Citation Format

Share Document