Transition Detection for Automatic Segmentation of Wrist-Worn Acceleration Data: A Comparison of New and Existing Methods

2020 ◽  
Vol 3 (1) ◽  
pp. 19-28
Author(s):  
Joshua Twaites ◽  
Richard Everson ◽  
Joss Langford ◽  
Melvyn Hillsdon
Keyword(s):  
Change Point ◽  
Mean Squared Error ◽  
Detection Method ◽  
Processing Technique ◽  
Change Point Detection ◽  
Detection Methods ◽  
Vertical Acceleration ◽  
Accelerometer Data ◽  
Post Processing ◽  
Point Detection

Introduction: Data from wrist-worn accelerometers often has an inherent natural segmentation that reflects transitioning from one activity to another. The aim of this study was to develop an activity transition detection method to realize this natural segmentation. Methods: Data was gathered from 16 participants who wore triaxial wrist accelerometers in a lab-based protocol and 47 participants in a free-living protocol. Change point detection was used to create a method for detecting activity transitions. The agreement between observed and predicted transitions was assessed by the Matthews Correlation Coefficient (MCC), Root Mean Squared Error (RMSE), and two additional metrics created for this task; the Ratio of Minimum Mean Distance (RMMD) and the Ratio of Sensitivity (RoS). The effects of varying combinations of acceleration axes were also investigated to determine the most effective set of axes. A novel post-processing technique was developed to mitigate a major limitation identified in current transition detection methods. Results: The developed transition detection method achieved a MCC of 0.763, a RMSE of 3.17, a RoS of 2.40, and a RMMD of 3.21, outperforming existing techniques. The post-processing technique developed improved the performance of all methods when identifying transitions. It was found that using solely the y-axis (vertical acceleration) allowed for optimal performance. Conclusion: Change point detection is a valid method for identifying transitions in activity using wrist-worn accelerometer data. The new post processing technique developed improves the performance of transition detection methods.

scholarly journals Change-point detection in wind turbine SCADA data for robust condition monitoring with normal behaviour models

2020 ◽  
Author(s):  
Simon Letzgus
Keyword(s):  
Wind Turbine ◽  
Change Point ◽  
Significant Loss ◽  
Change Point Detection ◽  
Training Data ◽  
Change Points ◽  
Detection Methods ◽  
Full Potential ◽  
Normal Behaviour ◽  
Point Detection

Abstract. Analysis of data from wind turbine supervisory control and data acquisition (SCADA) systems has attracted considerable research interest in recent years. The data is predominantly used to gain insights into turbine condition without the need for additional sensing equipment. Most successful approaches apply semi-supervised anomaly detection methods, also called normal behaivour models, that use clean training data sets to establish healthy component baseline models. However, one of the major challenges when working with wind turbine SCADA data in practice is the presence of systematic changes in signal behaviour induced by malfunctions or maintenance actions. Even though this problem is well described in literature it has not been systematically addressed so far. This contribution is the first to comprehensively analyse the presence of change-points in wind turbine SCADA signals and introduce an algorithm for their automated detection. 600 signals from 33 turbines are analysed over an operational period of more than two years. During this time one third of the signals are affected by change-points. Kernel change-point detection methods have shown promising results in similar settings but their performance strongly depends on the choice of several hyperparameters. This contribution presents a comprehensive comparison between different kernels as well as kernel-bandwidth and regularisation-penalty selection heuristics. Moreover, an appropriate data pre-processing procedure is introduced. The results show that the combination of Laplace kernels with a newly introduced bandwidth and penalty selection heuristic robustly outperforms existing methods. In a signal validation setting more than 90 % of the signals were classified correctly regarding the presence or absence of change-points, resulting in a F1-score of 0.86. For a change-point-free sequence selection the most severe 60 % of all CPs could be automatically removed with a precision of more than 0.96 and therefore without a significant loss of training data. These results indicate that the algorithm can be a meaningful step towards automated SCADA data pre-processing which is key for data driven methods to reach their full potential. The algorithm is open source and its implementation in Python publicly available.

Sign in / Sign up

Export Citation Format

Share Document