Computer relaying for power systems
Computer relaying for power systems
Introduction to data compression (2nd ed.)
Introduction to data compression (2nd ed.)
EURASIP Journal on Applied Signal Processing
IEEE Transactions on Signal Processing - Part I
Matching pursuits with time-frequency dictionaries
IEEE Transactions on Signal Processing
Embedded image coding using zerotrees of wavelet coefficients
IEEE Transactions on Signal Processing
Image quality assessment: from error visibility to structural similarity
IEEE Transactions on Image Processing
| Hi-index | 0.00 |
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.