File size: 11,841 Bytes
5610573 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 | /* -*- c-basic-offset: 4; indent-tabs-mode: nil -*- */
/* ====================================================================
* Copyright (c) 2013 Carnegie Mellon University. All rights
* reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in
* the documentation and/or other materials provided with the
* distribution.
*
* This work was supported in part by funding from the Defense Advanced
* Research Projects Agency and the National Science Foundation of the
* United States of America, and the CMU Sphinx Speech Consortium.
*
* THIS SOFTWARE IS PROVIDED BY CARNEGIE MELLON UNIVERSITY ``AS IS'' AND
* ANY EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
* THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL CARNEGIE MELLON UNIVERSITY
* NOR ITS EMPLOYEES BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
* ====================================================================
*
*/
/* This noise removal algorithm is inspired by the following papers
* Computationally Efficient Speech Enchancement by Spectral Minina Tracking
* by G. Doblinger
*
* Power-Normalized Cepstral Coefficients (PNCC) for Robust Speech Recognition
* by C. Kim.
*
* For the recent research and state of art see papers about IMRCA and
* A Minimum-Mean-Square-Error Noise Reduction Algorithm On Mel-Frequency
* Cepstra For Robust Speech Recognition by Dong Yu and others
*/
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
#include <math.h>
#include <pocketsphinx.h>
#include "util/ckd_alloc.h"
#include "util/strfuncs.h"
#include "fe/fe_noise.h"
#include "fe/fe_internal.h"
/* Noise supression constants */
#define SMOOTH_WINDOW 4
#define LAMBDA_POWER 0.7
#define LAMBDA_A 0.995
#define LAMBDA_B 0.5
#define LAMBDA_T 0.85
#define MU_T 0.2
#define MAX_GAIN 20
#define SLOW_PEAK_FORGET_FACTOR 0.9995
#define SLOW_PEAK_LEARN_FACTOR 0.9
#define SPEECH_VOLUME_RANGE 8.0
struct noise_stats_s {
/* Smoothed power */
powspec_t *power;
/* Noise estimate */
powspec_t *noise;
/* Signal floor estimate */
powspec_t *floor;
/* Peak for temporal masking */
powspec_t *peak;
/* Buffers used in update_noisestats */
powspec_t *signal, *gain;
/* Initialize it next time */
int undefined;
/* Number of items to process */
int num_filters;
/* Sum of slow peaks for VAD */
powspec_t slow_peak_sum;
/* Precomputed constants */
powspec_t lambda_power;
powspec_t comp_lambda_power;
powspec_t lambda_a;
powspec_t comp_lambda_a;
powspec_t lambda_b;
powspec_t comp_lambda_b;
powspec_t lambda_t;
powspec_t mu_t;
powspec_t max_gain;
powspec_t inv_max_gain;
powspec_t smooth_scaling[2 * SMOOTH_WINDOW + 3];
};
static void
fe_lower_envelope(noise_stats_t *noise_stats, const powspec_t *buf, powspec_t *floor_buf, int32 num_filt)
{
int i;
for (i = 0; i < num_filt; i++) {
#ifndef FIXED_POINT
if (buf[i] >= floor_buf[i]) {
floor_buf[i] =
noise_stats->lambda_a * floor_buf[i] + noise_stats->comp_lambda_a * buf[i];
}
else {
floor_buf[i] =
noise_stats->lambda_b * floor_buf[i] + noise_stats->comp_lambda_b * buf[i];
}
#else
if (buf[i] >= floor_buf[i]) {
floor_buf[i] = fe_log_add(noise_stats->lambda_a + floor_buf[i],
noise_stats->comp_lambda_a + buf[i]);
}
else {
floor_buf[i] = fe_log_add(noise_stats->lambda_b + floor_buf[i],
noise_stats->comp_lambda_b + buf[i]);
}
#endif
}
}
/* temporal masking */
static void
fe_temp_masking(noise_stats_t *noise_stats, powspec_t * buf, powspec_t * peak, int32 num_filt)
{
powspec_t cur_in;
int i;
for (i = 0; i < num_filt; i++) {
cur_in = buf[i];
#ifndef FIXED_POINT
peak[i] *= noise_stats->lambda_t;
if (buf[i] < noise_stats->lambda_t * peak[i])
buf[i] = peak[i] * noise_stats->mu_t;
#else
peak[i] += noise_stats->lambda_t;
if (buf[i] < noise_stats->lambda_t + peak[i])
buf[i] = peak[i] + noise_stats->mu_t;
#endif
if (cur_in > peak[i])
peak[i] = cur_in;
}
}
/* spectral weight smoothing */
static void
fe_weight_smooth(noise_stats_t *noise_stats, powspec_t * buf, powspec_t * coefs, int32 num_filt)
{
int i, j;
int l1, l2;
powspec_t coef;
for (i = 0; i < num_filt; i++) {
l1 = ((i - SMOOTH_WINDOW) > 0) ? (i - SMOOTH_WINDOW) : 0;
l2 = ((i + SMOOTH_WINDOW) <
(num_filt - 1)) ? (i + SMOOTH_WINDOW) : (num_filt - 1);
#ifndef FIXED_POINT
(void)noise_stats;
coef = 0;
for (j = l1; j <= l2; j++) {
coef += coefs[j];
}
buf[i] = buf[i] * (coef / (l2 - l1 + 1));
#else
coef = MIN_FIXLOG;
for (j = l1; j <= l2; j++) {
coef = fe_log_add(coef, coefs[j]);
}
buf[i] = buf[i] + coef - noise_stats->smooth_scaling[l2 - l1 + 1];
#endif
}
}
noise_stats_t *
fe_init_noisestats(int num_filters)
{
int i;
noise_stats_t *noise_stats;
noise_stats = (noise_stats_t *) ckd_calloc(1, sizeof(noise_stats_t));
noise_stats->power =
(powspec_t *) ckd_calloc(num_filters, sizeof(powspec_t));
noise_stats->noise =
(powspec_t *) ckd_calloc(num_filters, sizeof(powspec_t));
noise_stats->floor =
(powspec_t *) ckd_calloc(num_filters, sizeof(powspec_t));
noise_stats->peak =
(powspec_t *) ckd_calloc(num_filters, sizeof(powspec_t));
noise_stats->undefined = TRUE;
noise_stats->num_filters = num_filters;
#ifndef FIXED_POINT
noise_stats->lambda_power = LAMBDA_POWER;
noise_stats->comp_lambda_power = 1 - LAMBDA_POWER;
noise_stats->lambda_a = LAMBDA_A;
noise_stats->comp_lambda_a = 1 - LAMBDA_A;
noise_stats->lambda_b = LAMBDA_B;
noise_stats->comp_lambda_b = 1 - LAMBDA_B;
noise_stats->lambda_t = LAMBDA_T;
noise_stats->mu_t = MU_T;
noise_stats->max_gain = MAX_GAIN;
noise_stats->inv_max_gain = 1.0 / MAX_GAIN;
for (i = 1; i < 2 * SMOOTH_WINDOW + 1; i++) {
noise_stats->smooth_scaling[i] = 1.0 / i;
}
#else
noise_stats->lambda_power = FLOAT2FIX(log(LAMBDA_POWER));
noise_stats->comp_lambda_power = FLOAT2FIX(log(1 - LAMBDA_POWER));
noise_stats->lambda_a = FLOAT2FIX(log(LAMBDA_A));
noise_stats->comp_lambda_a = FLOAT2FIX(log(1 - LAMBDA_A));
noise_stats->lambda_b = FLOAT2FIX(log(LAMBDA_B));
noise_stats->comp_lambda_b = FLOAT2FIX(log(1 - LAMBDA_B));
noise_stats->lambda_t = FLOAT2FIX(log(LAMBDA_T));
noise_stats->mu_t = FLOAT2FIX(log(MU_T));
noise_stats->max_gain = FLOAT2FIX(log(MAX_GAIN));
noise_stats->inv_max_gain = FLOAT2FIX(log(1.0 / MAX_GAIN));
for (i = 1; i < 2 * SMOOTH_WINDOW + 3; i++) {
noise_stats->smooth_scaling[i] = FLOAT2FIX(log(i));
}
#endif
noise_stats->signal = (powspec_t *) ckd_calloc(num_filters, sizeof(powspec_t));
noise_stats->gain = (powspec_t *) ckd_calloc(num_filters, sizeof(powspec_t));
return noise_stats;
}
void
fe_reset_noisestats(noise_stats_t * noise_stats)
{
if (noise_stats)
noise_stats->undefined = TRUE;
}
void
fe_free_noisestats(noise_stats_t * noise_stats)
{
ckd_free(noise_stats->signal);
ckd_free(noise_stats->gain);
ckd_free(noise_stats->power);
ckd_free(noise_stats->noise);
ckd_free(noise_stats->floor);
ckd_free(noise_stats->peak);
ckd_free(noise_stats);
}
/**
* For fixed point we are doing the computation in a fixlog domain,
* so we have to add many processing cases.
*/
void
fe_remove_noise(fe_t * fe)
{
noise_stats_t *noise_stats;
powspec_t *mfspec;
int32 i, num_filts;
if (fe->noise_stats == NULL)
return;
noise_stats = fe->noise_stats;
mfspec = fe->mfspec;
num_filts = noise_stats->num_filters;
if (noise_stats->undefined) {
noise_stats->slow_peak_sum = FIX2FLOAT(0.0);
for (i = 0; i < num_filts; i++) {
noise_stats->power[i] = mfspec[i];
#ifndef FIXED_POINT
noise_stats->noise[i] = mfspec[i] / noise_stats->max_gain;
noise_stats->floor[i] = mfspec[i] / noise_stats->max_gain;
noise_stats->peak[i] = 0.0;
#else
noise_stats->noise[i] = mfspec[i] - noise_stats->max_gain;;
noise_stats->floor[i] = mfspec[i] - noise_stats->max_gain;
noise_stats->peak[i] = MIN_FIXLOG;
#endif
}
noise_stats->undefined = FALSE;
}
/* Calculate smoothed power */
for (i = 0; i < num_filts; i++) {
#ifndef FIXED_POINT
noise_stats->power[i] =
noise_stats->lambda_power * noise_stats->power[i] + noise_stats->comp_lambda_power * mfspec[i];
#else
noise_stats->power[i] = fe_log_add(noise_stats->lambda_power + noise_stats->power[i],
noise_stats->comp_lambda_power + mfspec[i]);
#endif
}
/* Update noise spectrum estimate */
fe_lower_envelope(noise_stats, noise_stats->power, noise_stats->noise, num_filts);
/* Drop out noise from signal */
for (i = 0; i < num_filts; i++) {
#ifndef FIXED_POINT
noise_stats->signal[i] = noise_stats->power[i] - noise_stats->noise[i];
if (noise_stats->signal[i] < 1.0)
noise_stats->signal[i] = 1.0;
#else
noise_stats->signal[i] = fe_log_sub(noise_stats->power[i], noise_stats->noise[i]);
#endif
}
/* FIXME: Somewhat unclear why we have to do this twice, but this
* seeems to estimate some kind of signal floor. */
fe_lower_envelope(noise_stats, noise_stats->signal, noise_stats->floor, num_filts);
fe_temp_masking(noise_stats, noise_stats->signal, noise_stats->peak, num_filts);
for (i = 0; i < num_filts; i++) {
if (noise_stats->signal[i] < noise_stats->floor[i])
noise_stats->signal[i] = noise_stats->floor[i];
}
#ifndef FIXED_POINT
for (i = 0; i < num_filts; i++) {
if (noise_stats->signal[i] < noise_stats->max_gain * noise_stats->power[i])
noise_stats->gain[i] = noise_stats->signal[i] / noise_stats->power[i];
else
noise_stats->gain[i] = noise_stats->max_gain;
if (noise_stats->gain[i] < noise_stats->inv_max_gain)
noise_stats->gain[i] = noise_stats->inv_max_gain;
}
#else
for (i = 0; i < num_filts; i++) {
noise_stats->gain[i] = noise_stats->signal[i] - noise_stats->power[i];
if (noise_stats->gain[i] > noise_stats->max_gain)
noise_stats->gain[i] = noise_stats->max_gain;
if (noise_stats->gain[i] < noise_stats->inv_max_gain)
noise_stats->gain[i] = noise_stats->inv_max_gain;
}
#endif
/* Weight smoothing and time frequency normalization */
fe_weight_smooth(noise_stats, mfspec, noise_stats->gain, num_filts);
}
|