A framework for mobile activity recognition
Jiahui Wen
- 22 May 2017
TL;DR: A hybrid method that integrates Latent Dirichlet Allocation with conventional classifiers for learning a generic activity model with minimum annotated data is proposed and a framework for low-level activity recognition with dynamically available sensors is proposed.
read more
Abstract: Activity recognition is being applied in an increasing number of applications. They include health monitoring of the elderly, discovery of frequent behavioural patterns, monitoring of daily life activities (e.g. eating, tooth brushing, sleeping), and analysis of exercise activities (e.g. swimming, running). Current approaches for activity recognition usually use the process of data preprocessing, feature extraction, activity model learning and activity recognition. Most of the previous research pipeline these steps and create static models for processing activity data and recognizing activities. The static models have predefined data sources that are tightly coupled with the models and never change once the models are created. However, the static models are unable to deal with sensor failures and sensor replacements that are quite common in real scenarios. Moreover, additional information provided by newly available data sources from dynamically discovered new sensors may potentially refine the activity model if this information can discriminatively characterize a specific activity class. However, the static models cannot leverage this additional information for self-refinement due to the static assumption of data sources. The primary goal of our research is to design and develop frameworks for activity recognition with dynamically available data sources, and propose and develop algorithms for activity model adaptation with the additional information provided by those data sources. In this thesis, we first provide a critical literature review in the areas of contexts modelling, context management, sensor modelling and sensors in mobile devices, activity recognition, activity model retraining and adaptation, and sensor dynamics in activity recognition. We then present the research on our activity recognition framework that makes the following key contributions. First, we propose a hybrid method that integrates Latent Dirichlet Allocation with conventional classifiers for learning a generic activity model with minimum annotated data. The hybrid method is able to alleviate the problem of data sparsity and requires a little amount of labelled activity data. Furthermore, it can deal with different variants of activity patterns since it is created with activity data of multiple users. The generic activity modelling serves as the starting point of our activity model adaptation with dynamically available sensor data. However, it can also serve as an independent component for other applications such as activity personalization. Second, based on the generic model, we propose a framework for low-level activity (e.g. running, walking) recognition with dynamically available sensors. The components of the framework include a basic classifier, instance selection and smoothing. Firstly, we use AdaBoost as our basic classifier as it is flexible with feature dimensionality and it can automatically select the discriminative features during the learning process. Secondly, we propose to select the most informative instances for activity model adaptation in an unsupervised manner. The instances contain features of the new sensor data, and the information of new sensors are incorporated seamlessly through the adaptation process. Finally, we design smoothing methods by integrating the graphical models such as Hidden Markov Model and Conditional Random Field with the basic classifier AdaBoost. Finally, we propose a framework for high-level activity (e.g, making coffee) recognition with dynamically available contexts. We propose sensor and activity models to address sensor heterogeneity and populating contextual information. Knowledge-driven and data-driven methods are proposed for incorporating the new contexts. The knowledge-driven method specifies the parameters of the new contexts with external knowledge in an unsupervised manner, and the data-driven method learns the parameters of the new contexts with the users' data using the proposed learning-to-rank technique and temporal regularization. Extensive experiments and comprehensive comparisons demonstrate the effectiveness of the proposed frameworks.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Figures

Figure 2.4: Sensor context model. 
Figure 5.17: F1-score before and after adaptation across the datasets 
Figure 4.11: F1-score corresponding to the number of iterations during inference process for BoostCRF. 
Table 5.6: Parameters for baselines. 
Table 5.7: Comparison with hybrid classifiers. 
Figure 2.6: General architecture of mobile context sensing system.
Citations
Object-based Activity Recognition with Heterogeneous Sensors on Wrist
Mohammad Albaida
- 14 Jul 2018
TL;DR: This paper explains how to achieve activities of daily living using a sensor device attached to a users wrist that contains a camera, a microphone and an accelerometer and suggests a method that will protect the privacy of the user, as the camera and the microphone can records part of the users private life.
Transfer Learning in Human Activity Recognition: A Survey
TL;DR: This survey provides a reference to the HAR community, by summarizing the existing works and providing a promising research agenda, and presents an updated view of the state-of-the-art for both application domains.
9
•Proceedings Article
Online classifier construction algorithm for human activity detection using a tri-axial accelerometer
Yen-Ping Chen,Jhun-Ying Yang,Shun-Nan Liou,Gwo-Yun Lee,Jeen-Shing Wang +4 more
- 01 Jan 2008
TL;DR: The proposed dynamic linear discriminant analysis (LDA) which can dynamically update the scatter matrices for online constructing FBF classifiers without storing all the training samples in memory can reduce computational burden and achieve satisfactory recognition accuracy.
References
•Book
The Nature of Statistical Learning Theory
Vladimir Vapnik
- 01 Jan 1995
TL;DR: Setting of the learning problem consistency of learning processes bounds on the rate of convergence ofLearning processes controlling the generalization ability of learning process constructing learning algorithms what is important in learning theory?
46K
Activity recognition from user-annotated acceleration data
Ling Bao,Stephen S. Intille +1 more
- 21 Apr 2004
TL;DR: This is the first work to investigate performance of recognition algorithms with multiple, wire-free accelerometers on 20 activities using datasets annotated by the subjects themselves, and suggests that multiple accelerometers aid in recognition.
Activity recognition using cell phone accelerometers
TL;DR: This work describes and evaluates a system that uses phone-based accelerometers to perform activity recognition, a task which involves identifying the physical activity a user is performing, and has a wide range of applications, including automatic customization of the mobile device's behavior based upon a user's activity.
A survey of mobile phone sensing
Nicholas D. Lane,Emiliano Miluzzo,Hong Lu,Daniel Peebles,Tanzeem Choudhury,Andrew T. Campbell +5 more
TL;DR: This article surveys existing mobile phone sensing algorithms, applications, and systems, and discusses the emerging sensing paradigms, and formulates an architectural framework for discussing a number of the open issues and challenges emerging in the new area ofMobile phone sensing research.
Learning to rank: from pairwise approach to listwise approach
Zhe Cao,Tao Qin,Tie-Yan Liu,Ming-Feng Tsai,Hang Li +4 more
- 20 Jun 2007
TL;DR: It is proposed that learning to rank should adopt the listwise approach in which lists of objects are used as 'instances' in learning, and introduces two probability models, respectively referred to as permutation probability and top k probability, to define a listwise loss function for learning.
2.4K