How far can one compress digital fault records? Analysis of a matching pursuit-based algorithm

• DOI: 10.1016/j.dsp.2011.11.003
• Publication Date: 2011-12-07T19:37:53Z
• Authors: Michel P. Tcheou; André L.L. Miranda; Lisandro Lovisolo; Eduardo A.B. da S...; Marco A.M. Rodrigues; Paulo S.R. Diniz
• Keywords: Feature (linguistics)

In this paper, we verify how far electric disturbance signals can be compressed without compromising the analysis of encoded fault records. A recently proposed compression algorithm, referred to as Damped Sinusoidal Matching Pursuit (DSMP) has the remarkable feature of obtaining both compact and physically interpretable representations. However, for fault analysis applications, one is primarily interested in how accurate can be the analysis performed on compressed signals, instead of evaluating mean-squared error figures. Unlike previous works in digital fault records compression, the performance of the DSMP compression method is evaluated using a protocol based on fault analysis procedures commonly performed by expert engineers. This protocol is applied for comparing the results obtained in the analysis of both uncompressed records and their compressed versions at different compression ratios. The results show that the DSMP is a reliable compression system since it achieves high compression ratios (6.4:1) without causing fault analysis misinterpretation.