Simultaneous denoising and compression of power system disturbances using sparse representation on overcomplete hybrid dictionaries
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
This study introduces a novel unified framework for simultaneous denoising and compression of electric power system disturbance signals using sparse signal decomposition and reconstruction on overcomplete hybrid dictionary (OHD) matrix. In the proposed method, the power quality signal is first decomposed into deterministic sinusoidal components and non‐deterministic components using the OHD matrix, including discrete impulse dictionary ( I ), cosine dictionary ( C ), sine dictionary ( S ) and the ℓ 1 ‐norm optimisation algorithm. Then, the hard‐thresholding, uniform threshold dead‐zone quantisation, modified index coding and Huffman coding techniques are used for compression of significant detail signal samples and approximation coefficients. To justify the selection of OHD matrix, four compression methods are implemented using the decomposition techniques based on the dictionaries Ψ = [ I C S ] and Ψ = [ I C ], the wavelet transform (WT) and the discrete cosine transform (DCT). The performance of each method is tested and validated using a wide variety of typical power quality disturbance (PQD) signals taken from the IEEE‐1159‐PQE and GIM–PQE databases and generated using the Microgrid model. The results show that the method with dictionary Ψ = [ I C S ] is capable of effectively compressing the PQD signals as well as suppressing the noise components in the signals.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it