Modified coherence‐based dictionary learning method for speech enhancement
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 paper presents a new method for speech enhancement based on a dictionary learning method. The proposed approach is based on using coherence measure in dictionary learning. Data required for better fitting to atoms in sparse representation of noise is provided by a noise estimation algorithm that causes noise dictionary to be trained with the same data size as speech signal. To decrease coherence between dictionaries after the training step, a new method is applied to yield incoherent dictionaries. In sparse representation of speech data, the highest energy atoms of noise dictionary are replaced with the lowest energy atoms, under certain conditions. A similar replacement can happen in sparse representation of noise data. Furthermore, in this paper, only one noise dictionary, chosen by a classification method, is used in speech enhancement step, resulting in a faster algorithm. Objective and subjective measures are used for evaluating the simulation results. According to experimental results, the proposed algorithm has been found superior in performance and computation overhead in comparison with the earlier methods in this context. Moreover, this method achieves significantly better results compared with baseline methods such as multi‐band and geometric spectral subtraction.
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.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 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