Fast Computation of the Autogram for the Detection of Transient Faults

Structures and machines maintenance is a hot topic, as their failure can be both expensive and dangerous. Condition-based maintenance regimes are ever more desired so that cost-effective, reliable, and damage-responsive diagnostics techniques are needed. Among the others, Vibration Monitoring using accelerometers is a very little invasive technique that can in principle detect also small, incipient damages. Focusing on transient faults, one reliable processing to highlight their presence is the Envelope analysis of the vibration signal filtered in a band of interest. The challenge of selecting an appropriate band for the demodulation is an optimization problem requiring two ingredients: a utility function to evaluate the performance in a particular band, and a scheme to move within the search space of all the possible center frequencies and band sizes (the dyad {f, Δf}) toward the optimal. These problems were effectively tackled by the Kurtogram, a brute-force computation of the kurtosis of the envelope of the filtered signal (the utility function) of every possible {f, Δf} combination. The complete exploration of the whole plane (f, Δf) is a heavy task which compromises the computational efficiency of the algorithm so that the analysis on a discrete (f, Δf) paving was implemented (Fast Kurtogram). To overcome the lack of robustness to non-Gaussian noise, different utility functions were proposed. One is the kurtosis of the unbiased autocorrelation of the squared envelope of the filtered signal found in the Autogram. To spread this improved algorithm in on-line industrial applications, a fast implementation of the Autogram is proposed in this paper