Supervised and Unsupervised Machine Learning Approaches for Bridge Damage Prediction S. TAMURA, B. ZHANG, Y. WANG, F. CHEN and K. NGUYEN

ABSTRACT Structural health monitoring (SHM) starts to gain increasing attentions in the recent decade with the enormous support received from information and communication technology (ICT) which provides not only efficient data acquisition and transmission instruments, but also data analysis techniques for system modeling. In this work, we present a novel approach for bridge health assessment and damage localization based on vibration monitoring. Specifically, we consider one of the largest bridges in Sydney as a study case. We aim to distinguish damaged and undamaged joints in the bridge via supervised and unsupervised machine learning methods. Health conditions of bridge joints are reflected by their vibrations caused by vehicle passing events. The proposed machine learning methods train classifiers on historical vibration data for the purpose of distinguishing vibrations from healthy and unhealthy joints. Vibration events are recorded by 18 tri-axial accelerometers, 3 per joint with a total of 6 joints. Attempts have been made to normalize input data by selecting events with the dominant occurrence order of vibration peaks. Both time domain and frequency domain features have been used for training and testing. 10-fold cross validation is used for evaluation. For supervised method, 99.71% and 99.30% detection accuracies are achieved for time and frequency domain features respectively. Peak selection boosts the detection accuracy from 69% to 84% for the unsupervised method. INTRODUCTION The safety and fitness for the use of transport infrastructures, such as bridges, are compromised by ageing and the operational environment. Fatigue crack growth, overload in traffic and hazards such as fires and strong wind can degrade the safety of a bridge. Early detection of damage in structure is important to avoid further risks. Structural health monitoring (SHM) tries to implement a system to detect and localize damage on the basic level, assess and predict the degree of damage on an advanced level [1]. SHM has been increasingly used due to the development in information and communication technology (ICT), facilitating the shift from time

National ICT Australia, Australian Technology Park, 13 Garden Street Eveleigh NSW 2015 {Sayuri.Tamura, bang.zhang, yang.wang, fang.chen, khoa.nguyen}@nicta.com.au * To whom all correspondence should be addressed

based maintenance to condition-based maintenance. Damage is defined as a change in material or geometric property of a system that significantly affects its performance [2]. The two main approaches of SHM are model based and statistics based; model based method compares the collected data against a physical model created by finite element analysis and signals any deviation from the normal state as damage. Statistics based method finds the probability density function, indicating the outliers as damage [1]. Statistics based approaches namely pattern recognition and machine learning have been adopted to remove the complexity of creating a physical model. Application of SHM to the studied bridge for damage detection and localization will complement its current routine inspection which is performed biennially. The importance of normalizing the input data to reduce the effect of varying operating and environmental conditions have been stressed by [2]. It is suggested that data could be normalized in a temporal method to group data of similar operating or environmental conditions before feature selection so that the changing conditions do not overwhelm the damaged characteristics. It is also stated that variability should be minimized or where it is impossible, quantified so that damage can be detected. A good feature to select is one that is able to distinguish damaged and undamaged component easily [2]. SHM are performed widely on bridges around the world such as the Golden Gate bridge (US) [3], Tsing Ma bridge (Hong Kong) [4], Rion-Antirion bridge (Greece), the Millau viaduct (France) and the Confederation bridge (Canada) [5]. A variety of sensors are installed for SHM on various bridges, such as temperature sensor, strain gauge, displacement transducer, accelerometer, corrosion sensor and hygrometer to measure a physical change in the structure or the surrounding environment [6]. Vibration based approach for damage detection has been adopted by many studies investigating the changes in modal properties (modal frequency, mode shape), spectral patterns and time and frequency domain features [2]. The aim of this study is to distinguish faulty joints from normal joints in the studied bridge using support vector machine (SVM) and one class SVM for training and classification of vibrations caused by passing vehicles. The following describes the method of data collection and pre-processing, feature selection, training and classification and considers the feasibility of using accelerometer signals to detect damages in the bridge. METHOD In this work, we propose a novel approach for bridge health assessment and damage localization based on vibration monitoring. Due to the easiness of its data acquisition, vibration-based technique is one of the most widely used SHM techniques. Vibration theories have been well established for helping us to understand the natures of structure vibrations. However, in reality, exact physical model of structure is usually complex and difficult to be obtained. Besides, operational and environmental variations usually apply significant impacts on structures during their lifetime. Thus, in order to tackle these uncertainties on structures, we frame the SHM problem in a machine learning paradigm. Specifically, in this work, we focus on feature extraction, data calibration and statistical learning.

Figure 1. All events of joint 44 for 3 sensors (top), joint 43 (middle) and joint 45 (bottom) in the time domain (left) and frequency domain (right). Bosch BMA 150 is used for data collection.

Feature selection As aforementioned, health conditions of bridge components can be monitored via their vibrations caused by vehicle passing events. Here, we adopt both time and frequency domain features to represent such events. As an example, Fig. 1 demonstrates the difference in vibration peak amplitude between damaged and undamaged components. In time domain, the damaged joint has a significantly larger acceleration magnitude and obvious peaks above the baseline compared to undamaged joints. Acceleration magnitude tended to decrease away from joint 44 (damaged) and had no or less obvious peaks. For time domain, 600-point time series per sensor is used for recording an event. As 3 sensors are mounted on one joint, the feature vector has 1800 dimensionalities. For the frequency domain, Fast Fourier Transform (FFT) is used to compute the frequency spectrum of each sensor before attaching all 3 sensors. For a vibration signal in the time domain ( ), FFT was computed as follows:

Where

represents frequency, |

| denotes signal amplitude in frequency domain,

represents one of the 600 time domain sampling points and

.

Training and classification Supervised learning is performed on extracted features for training a binary classifier to differentiate damage bridge components from undamaged ones. We group damaged and undamaged components as positive and negative class respectively for training. The obtained classifier can make prediction on new coming data, and tell us whether the data is from a healthy joint or a faulty one. Support vector machine [7] is used for supervised method, we use vector to represent feature vector. ∈ 1,1 represents the label of , where 1 means that is recorded from a damaged bridge component and 1 otherwise. The → 1,1 . It is in the form: . classification model is a function, : and are the parameters of the model. They can be learned from a training processing. Given a set of training samples, , , the training process is to determine the model parameters and by making sure that the classification error , is of the obtained model on the training data set minimized. Mathematically, the training process is equivalent to the following minimization problem: 1 min ‖ ‖ , , 2 . .

1

,

0, ∈ 1,

.

and are intermediate parameters in training process. is a slack variable and is the variable for controlling the balance between and . This minimization problem can be solved by Lagrangian multiplier and quadratic programming. Once the classification model is learned, a health score for a new vibration record, denoted as , can be generated as . Then the health score for a bridge component in a specific time period can be obtained by the averaged score over all the vibration records recorded. We use one-class support vector machine [8] as an unsupervised approach for anomaly detection. It assumes that all positive examples share some common properties to form one class. And negative examples can have very different properties without any commonness. It fits damage detection in structural health monitoring, since there may exist many failure patterns and one-class SVM can cover all of them as outliers. Follow the settings of supervised learning, the unsupervised learning process can be regarded as the following optimization problem: 1 min ‖ ‖ , , 2 . .

,

1 0, ∈ 1,

.

It is worth noting that the training data set only contains feature vectors and no label information is provided. Once the classification model is obtained, health score can is generated in the same as the supervised learning. DATA COLLECTION AND PRE-PROCESSING In this section, we describe the data collection and pre-processing steps. Vibration caused by passing vehicles was recorded by tri-axial accelerometers positioned under

the beams of lane 7, as shown in Fig. 2, and sampled at a frequency of 400 Hz. 3 sensors were placed on a joint with a total of 6 joints, namely 41, 42, 43, 44, 45 and 46. It is known that damage is present in 44. Dataset 1 consists of events from 43, 44 and 45, dataset 2 includes events from all joints and dataset 3 contains the events of sensor 2 of all 6 joints. Datasets are collected in different months. Magnitude of the instantaneous minus rest state of the acceleration was calculated from the accelerometer signals. Events were standardized to a 600 points time series, where events with less than 500 points were discarded and events with less than 600 points had 0s appended at the end. In an attempt to normalize input and select similar vehicle passing events, events with the same vibration peak order were selected. 3 peaks were detected per event with a minimum peak to peak distance of 50 samples as shown in Fig. 3. Most of the events in dataset 1 were found to fall in a certain peak order, as shown in Fig. 4. At the pre-processing stage, events that have the dominant peak order are selected and the rest are discarded; the selected events are shown in Fig. 5. Two sets of experiments are performed, without pre-processing (No peak) and selection of events where all 3 sensors of the same joint had the dominant peak order (Peak Sync).

Figure 2. Sensors are placed under the beams to record vehicle passing events. 400 200 0

100 50 0

100 50 0

100 50 0

400 200 0

0

100

200

300

400

500

600

0

100

200

300

400

500

600

0

100

200

300

400

500

600

0

100

200

300

400

500

600

0

100

200

300 time (s)

400

500

600

Figure 3. Peak detection of the first 5 events of sensor 1 joint 44. Red corresponds to the highest, green to the middle and magenta to the lowest peak magnitude.

RESULTS Five iterations of 10 fold cross validation are conducted to obtain average classification accuracies. The results are shown in Table 1 and the confidence values are shown in Fig. 6.

Figure 4. Most events had the peak order 213 in dataset 1. 213 correspond to the highest peak being the 2nd, the middle peak being the 1st and the lowest peak being the 3rd in the temporal order. 400 200 0

100 50 0

100 50 0

200 100 0

100 50 0

0

100

200

300

400

500

600

0

100

200

300

400

500

600

0

100

200

300

400

500

600

0

100

200

300

400

500

600

0

100

200

300 time (s)

400

500

600

Figure 5. First 5 selected events of same peak order for sensor 1 joint 44. Dataset 1 

 

Supervised 

No Peak (n=994) Peak Sync (n=296) No Peak (n=994) Peak Sync (n=296)

Unsupervised 

Dataset 2 

 

Supervised 

No Peak (n=35986) Peak Sync (n=1042) No Peak (n=3599) Peak Sync (n=1042)

Unsupervised 

Dataset 3

Time domain Accuracy (%)  98.83 98.04 57.75 75.34

Frequency domain  Accuracy (%)  98.55 96.62 57.75 75.34

Time domain Accuracy (%)  99.71 99.50 68.55 83.97

Frequency domain  Accuracy (%)  99.30 99.27 68.63 83.97

Time domain Frequency domain Accuracy (%) Accuracy (%) Supervised No Peak(n=3599) 99.02 99.08 Peak Sync (n=9874) 98.98 98.89 Unsupervised No Peak (n=3599) 68.63 68.59 Peak Sync (n=9874) 82.51 82.43 Table 1. Detection accuracies on time and frequency domains for supervised and unsupervised approaches

Figure 6. Damage confidence values for Dataset.1, time domain. Top left: supervised without peak. Top right: supervised with peak. Bottom left: unsupervised without peak. Bottom right: unsupervised with peak.

Table 1 shows time and frequency domain accuracy with and without peak selection for supervised and unsupervised learning. Here n is the number of observations. Dataset 1, 2 and 3 show high classification accuracies for supervised learning with a maximum accuracy of 99.71% for supervised, no peak, time domain features in dataset 2. Generally, a higher accuracy is achieved for time domain features compared to frequency domain features. Selecting peaks reduced the accuracy a bit for the supervised case, while it increased the accuracy from 57.75% to 75.34% for dataset 1, 69% to 84% for dataset 2 and 69% to 82% for dataset 3 for unsupervised learning. This could be contributed by the initial normalization process of grouping similar vehicle passing events. Fairly high classification accuracy for dataset 3 implies that it is feasible to use only 1 sensor from each joint. Overall, highest accuracies are achieved by dataset 2 and the distinction between the damaged and undamaged components can be observed from the damage confidence values, Fig. 6. There are several reasons that peak selection does not contribute largely to increased classification accuracy in the supervised case. Firstly, classification accuracies are high without pre-processing due to the significant difference in amplitude of the time and frequency features. Damaged joints tend to have obvious peaks above the baseline while the change in vibration amplitude is less in undamaged joints. The extent to which input data is normalized by selecting events of the dominant peak order needs to be taken into account as there are many other features in the vibration signals. No obvious peaks, variable number of peaks, peaks occurring at different times and large variation in peak amplitude are a few examples of other features; therefore selecting peak order is only one approach to classifying similar vehicle passing events. However, as it is important that the features are different between the damaged and undamaged joints, selecting events with too similar features

could possibly reduce the classification accuracy. It is also worth noting that the dominant peak order from dataset 1 does not apply to all the sensors in dataset 2. CONCLUSION In this study, damage detection using supervised and unsupervised machine learning for vehicle passing events have been presented. It is motivated by the ability to continuously monitor the health status of the bridge and warn early signs of damage. Peak selection was attempted to normalize input data from various vehicle passing events; the results showed an increase in classification accuracy from 69% to 84% for unsupervised learning. For the supervised case, a high classification accuracy of 99.71% and 99.30% were achieved for the time and frequency domain features. In order to normalize the input data from the operational or environmental conditions, such as vehicle passing events, acquiring vibrations signals under a controlled setting to investigate the signals of different vehicle types, vehicle speed or vehicles travelling on other lanes, on the damaged an undamaged joints would be useful. While the results show the feasibility of applying machine learning to damage detection, other methods of pre-processing or changing properties of SVM could be attempted to improve the classification accuracy of the unsupervised case. REFERENCE 1.

2.

3.

4.

5.

6. 7. 8.

K. Worden and G. Manson, "The application of machine learning to structural health monitoring," Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, vol. 365, pp. 515-537, 2007. C. R. Farrar, T. A. Duffey, S. W. Doebling, and D. A. Nix, "A statistical pattern recognition paradigm for vibration-based structural health monitoring," Structural Health Monitoring, vol. 1999, pp. 764-73, 2000. S. Kim, S. Pakzad, D. Culler, J. Demmel, G. Fenves, S. Glaser, and M. Turon, "Health monitoring of civil infrastructures using wireless sensor networks," in Information Processing in Sensor Networks, 2007. IPSN 2007. 6th International Symposium on, 2007, pp. 254-263. T. H. Chan, L. Yu, H.-Y. Tam, Y.-Q. Ni, S. Liu, W. Chung, and L. Cheng, "Fiber Bragg grating sensors for structural health monitoring of Tsing Ma bridge: Background and experimental observation," Engineering structures, vol. 28, pp. 648-659, 2006. M. Cheung, G. Tadros, T. Brown, W. Dilger, A. Ghali, and D. Lau, "Field monitoring and research on performance of the Confederation Bridge," Canadian Journal of Civil Engineering, vol. 24, pp. 951-962, 1997. J. Ko and Y. Ni, "Technology developments in structural health monitoring of large-scale bridges," Engineering structures, vol. 27, pp. 1715-1725, 2005. C. Cortes and V. Vapnik, “Support vector machine”, Machine learning, vol. 20, pp. 273-297, 1995. Bernhard Scholkopf, John C. Platt, John Shawe-Taylor, Alex J. Smola, and Robert C. Williamson, “Estimating thesupport of a high-dimensional distribution”, vol. 13, pp. 1443-1471, 2001.

Supervised and Unsupervised Machine Learning ...

en ih ca. M de si vr ep us n. U dn a de si vr ep. uS eg di. rB ro fs eh ca or pp. A gn in ra. eL no itc id er. P eg a m a. D. N. E. Y. U. G. N .K dn a. N. E. H. C .F. ,G. N. A. W .Y. ,G. N. A. H. Z .B. ,A. R. U. M. A. T ..... T. H. Chan, L. Yu, H.-Y. Tam, Y.-Q. Ni, S. Liu, W. Chung, and L. Cheng, "Fiber Bragg grating sensors for structural health ...

376KB Sizes 1 Downloads 270 Views

Recommend Documents

Experiments with Semi-Supervised and Unsupervised Learning
The system of Martin. (1990) explained linguistic metaphors through finding the corresponding metaphorical ...... Source Cluster: polish clean scrape scrub soak.

Experiments with Semi-Supervised and Unsupervised Learning
Highly frequent in language and communication, metaphor represents a significant challenge for. Natural Language Processing (NLP) applications.

Unsupervised and Semi-Supervised Learning via l1 ...
optimization algorithms are introduced to solve both sparse learning objectives. In our methods, the ℓ1-norm of spectral embedding formulation leads to sparse and direct clustering results. Both unsupervised and semi-supervised computer vision task

Unsupervised and Semi-supervised Learning of English Noun Gender
while gender information from noun-pronoun co- occurrence provides ... 95 54 glenna. 0. 6. 0. 0. 1Available at http://www.cs.ualberta.ca/˜bergsma/Gender/ ...

Unsupervised and Semi-supervised Learning of English Noun Gender
(e) Train a 4-way gender classifier (masculine, fem- inine, neutral ... We call these examples pseudo-seeds because they ..... Text REtrieval Conference (TREC).

n-best based supervised and unsupervised adaptation for ... - CiteSeerX
Chien. 3,*. 1Panasonic Technologies Inc., Speech Technology Laboratory, Santa Barbara, California ... 1-best unsupervised adaptation and N-best unsupervised adaptation with ... and the sequences of states, , given the specific mean vector .

Semi-supervised or Semi-unsupervised?
labeled and unlabeled data, or else we wouldn't be at this workshop. ... methods for sentiment analysis (GBM) (Goldberg and Zhu ... for structured prediction using classifiers (Daumé ... ference on Knowledge Discovery and Data Mining. (KDD) ...

A Cascade of Unsupervised and Supervised Neural ...
local signatures describe singularities around interest points detected by ... With the dramatic increase of available digital contents, advanced content man-.

A Cascade of Unsupervised and Supervised Neural ...
In practice, a supervised image classification solution requires three main steps ..... In: The 8th European Conference on Computer Vision, Prague, Czech ...

Active Learning and Semi-supervised Learning for ...
Dec 15, 2008 - We introduce our criterion and framework, show how the crite- .... that the system trained using the combined data set performs best according.

Semi-supervised Learning over Heterogeneous Information Networks ...
social networks with users, tags, URLs, locations, etc., can be considered as an ..... Definition 5 A meta-graph guided random walk over HIN first obtains a set of ...

Semi-supervised Learning and Optimization for Hypergraph Matching
Graph and hypergraph matching are important problems in computer vision. They are successfully used in many ap- plications requiring 2D or 3D feature matching, such as 3D reconstruction and object recognition. While graph match- ing is limited to usi

Non-Negative Semi-Supervised Learning - Semantic Scholar
Univ. of Sci. and Tech. of China ... Engineer at the Department of Electrical and Computer Engineer- .... best reconstruction under non-negative constrains. How-.

UNSUPERVISED LEARNING OF SEMANTIC ... - Research at Google
model evaluation with only a small fraction of the labeled data. This allows us to measure the utility of unlabeled data in reducing an- notation requirements for any sound event classification application where unlabeled data is plentiful. 4.1. Data

Unsupervised Learning of Probabilistic Grammar ...
Index Terms. Computer Vision, Structural Models, Grammars, Markov Random Fields, Object Recognition .... Ten of the object categories from Caltech 101 which we learn in this paper. of PGMMs. Section (V) ...... Ketch Laptop. LeopardsM.

UnURL: Unsupervised Learning from URLs
UnURL is, to the best of our knowledge, the first attempt on ... This demonstration uses a host of techniques presented in. [3]. ... 2 http://en.wikipedia.org/wiki/Blog.

Unsupervised multiple kernel learning for ... -
The comparison of these two approaches demonstrates the benefit of our integration ... ity of biological systems, heterogeneous types (continuous data, counts ... profiles to interaction networks by adding network-regularized con- straints with .....

Unsupervised Learning for Graph Matching
used in the supervised or semi-supervised cases with min- ... We demonstrate experimentally that we can learn meaning- ..... date assignments for each feature, we can obtain the next ..... Int J Comput Vis. Fig. 3 Unsupervised learning stage. First r

Unsupervised Learning for Graph Matching - Springer Link
Apr 14, 2011 - Springer Science+Business Media, LLC 2011. Abstract Graph .... tion as an integer quadratic program (Leordeanu and Hebert. 2006; Cour and Shi ... computer vision applications such as: discovering texture regularity (Hays et al. .... fo

Unsupervised Learning of Probabilistic Grammar ...
1Department of Statistics, 3Psychology and 4Computer Science .... Thirdly, the approach is able to learn from noisy data (where half of the training data is only ...

UNSUPERVISED CONTEXT LEARNING FOR ... - Research at Google
grams. If an n-gram doesn't appear very often in the training ... for training effective biasing models using far less data than ..... We also described how to auto-.

Unsupervised Learning of Probabilistic Grammar-Markov ... - CiteSeerX
Computer Vision, Structural Models, Grammars, Markov Random Fields, .... to scale and rotation, and performing learning for object classes. II. .... characteristics of both a probabilistic grammar, such as a Probabilistic Context Free Grammar.