On the compromise between noise reduction and speech/noise spatial information preservation in binaural speech enhancement
Bibliographic record
Abstract
Spatial information is important for human perception of speech and sound signals. However, this information is often either distorted or completely neglected in noise reduction because it is challenging, to say the least, to achieve optimal noise reduction and accurate spatial information preservation at the same time. This paper studies the problem of binaural speech enhancement. By jointly diagonalizing the speech and noise correlation matrices, we present a method to construct the noise reduction filter as a linear combination of different eigenvectors, which span a certain subspace of the entire space. A different dimension of the subspace gives a different trade-off between noise reduction and speech/noise spatial information preservation. On the one side, if the dimension is equal to 1, maximum noise reduction is achieved but at the price of significant spatial information distortion. On the other extreme, if the dimension of the subspace is equal to that of the entire space, spatial information is accurately preserved but at the cost of no noise reduction. Therefore, one can achieve different levels of compromises between the amount of noise reduction and the level of speech/noise spatial information preservation by adjusting the dimension of the used subspace.
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.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".