Sparse Optimization of Vibration Signal by ADMM

In this paper, the alternating direction method of multipliers (ADMM) algorithm is applied to the compressed sensing theory to realize the sparse optimization of vibration signal. Solving the basis pursuit problem for minimizing the L1 norm minimization under the equality constraints, the sparse matrix obtained by the ADMM algorithm can be reconstructed by inverse sparse orthogonal matrix inversion. This paper analyzes common sparse orthogonal basis on the reconstruction results, that is, discrete Fourier orthogonal basis, discrete cosine orthogonal basis, and discrete wavelet orthogonal basis. In particular, we will show that, from the point of view of central tendency, the discrete cosine orthogonal basis is more suitable, for instance, at the vibration signal data because its error is close to zero. Moreover, using the discrete wavelet transform in signal reconstruction there still are some outliers but the error is unstable. We also use the time complex degree and validity, for the analysis of the advantages and disadvantages of the ADMM algorithm applied to sparse signal optimization.The advantage of this method is that these abnormal values are limited in the control range.


Introduction
The monitoring and forecast technique of mechanical fault state is mainly applied to extract or separate the fault features which can reflect the development trend of the equipment fault.Monitoring enables to predict both the tendency of the fault features, and the running healthy state, and make feasible a better maintenance scheme according to the deterioration level of the equipment.However, in order to improve the accuracy of prediction, a large amount of vibration data must be collected from the equipment which runs for long time (e.g., half a year).We always expect to store the data quickly and efficiently and operate at real time.
Compressed sensing (CS) theory [1] breakthroughs the limit of traditional Nyquist Sampling Theorem, data sampling and compression are performed at the same time, thus greatly reducing the sampling costs and storage resource.We can forecast the changing trend of the equipment state and the probable fault through the analysis of a long-time vibration signal; there results a big data processing via the long-time monitoring of equipment status.
The key technique of CS is signal reconstruction, and difference reconstruction algorithm directly affects the accuracy of the original vibration reconstruction.The most popular algorithms in signal reconstruction are: the Minimum algorithm 0, the orthogonal matching pursuit (OMP) algorithm [2] and its improved type, the 1-magi algorithm [3,4], the weighted algorithm 1 [5], the Homotopy algorithm [6], the Lq-FL algorithm [7].These reconstructions, however, have to face some cumbersome problems both on the uncertainty arising in the mathematical inverse problem, and on the computational complexity due to the deficiency of a small quantity of sparse value.There follows a group of highly undetermined equations, some approximation errors, and a very high complexity, thus making a problem with large scale data a very hard task.
In this paper we study the application of ADMM algorithm in the sparse reconstruction problem for the vibration signal of an equipment.We will show that, comparing with the other current methods, the ADMM is more accurate and has low computational costs, thus being the more suitable method in engineering applications for the long-time monitoring of an equipment status.

ADMM Reconstruction Compares with OPM and Dual Interior Point
ADMM blends decomposability of dual ascent and excellent convergence of Lagrange multiplier [8], it is a simple and effective new method to solve the optimization problem of separable target.ADMM is a new algorithm deduced based on augmented Lagrange [9].Compared with augmented Lagrange, ADMM may decompose original problem into much alternating minimization subproblems; the algorithm can make full use of the advantage on the separability of the objective function.The separating minimization subproblems by ADMM can get global solutions and display solutions more easily.
The updates step of ADMM for basis pursuit is shown in Figure 2. -axis is the number of iteration steps, and -axis is the value of object function (  ) + (  ).When the object function is enough small, exit update process, the result is optimal solution.
Figures 3 and 4 show a signal reconstruction by dual interior point method and OPM, respectively.

Sparse Basis Selection during Reconstruction of ADMM
When we choose the different sparse bases during the process of reconstruction of ADMM, the error would be different and we compare them in two ways: central tendency and dispersion tendency.
(A) One of the measurement indexes of central tendency is arithmetic average and the equation is where  1 ,  2 , . . .,   are the values of variables.found by arranging all the observations from lowest value to highest value and picking the middle one.The numbers of lower values are equal to the higher values in general and the most common way to median is the direct method which arranges the data from large to small.The equations are as follows: is odd:  =  ((+1)/2) ,  is even: (C) Dispersion tendency (variation index) reflects the difference between each individual value.The greater the degree of data separation, the greater the variation index.The dispersion tendency indexes include range, variance and standard deviation which could measure the error of reconstruction.Among them, range is received by the difference value of the maximum and the minimum, so it reflects the difference of the overall scope.
From Table 1, we can see that the reconstruction error of the DCT of vibration signal is closest to zero.From the dispersion tendency, the reconstruction error of FFT shows little batch difference, while it has the abnormal value compared with DWT which is instability.The results of DCT are in between.

The Comparison between the ADMM and Other Algorithms
We compare the ADMM with primal-dual interior point algorithm and orthogonal matching pursuit (OMP) in the time complexity and error which reflect the effect of reconstruction.The results are shown in Table 2.
Figure 5 shows the effect contrast of different restructuring algorithms.
From the error indicator of Table 2, in the centralized tendency, the mean and median of ADMM, respectively, are 1.85967 − 13 and −0.2223, while the OMP are 1.2141 − 7 and 0.1803 and the primal-dual interior point algorithms are −0.0330 and −0.5372.All of them are close to zero and the values of ADMM are the least.It means that the effect of refactoring of ADMM is the best and primal-dual interior point algorithm is worst in the centralized tendency.Figure 6 shows the error contrast waveform of three reconstructions.Although the range of ADMM is not the minimum of three, the variance and the standard deviation are quite small which indicate the superiority of ADMM.So, ADMM possesses the good performance in sparse reconstruction compared with primal-dual interior point algorithm and OMP.

Conclusion
In the aspect of error, the mean of ADMM is the minimum and the median is after OMP in view of the central tendency.It indicates the reconstruction error of ADMM is the best and the OMP takes second place.And in view of the dispersion tendency, despite the range of ADMM is not the minimum of three, the variance and the standard deviation are quite small.So, ADMM possesses the good performance in sparse reconstruction compared with primal-dual interior point algorithm and OMP.The insufficient of the algorithm is the present of abnormal value which is not obvious through range.As a result, ADMM sparse optimization algorithm to deal with the problem of sparse reconstruction in compressed sensing has good performance.
Iteration based on DWT sparse

Table 1 :
The error trend indicator during reconstruction of ADMM.

Table 2 :
The comparison between the ADMM and other algorithms.