[88199ce] | 1 | /* |
---|
[f918cb9] | 2 | Copyright (C) 2007 Amaury Hazan <ahazan@iua.upf.edu> |
---|
| 3 | and Paul Brossier <piem@piem.org> |
---|
[88199ce] | 4 | |
---|
| 5 | This program is free software; you can redistribute it and/or modify |
---|
| 6 | it under the terms of the GNU General Public License as published by |
---|
| 7 | the Free Software Foundation; either version 2 of the License, or |
---|
| 8 | (at your option) any later version. |
---|
| 9 | |
---|
| 10 | This program is distributed in the hope that it will be useful, |
---|
| 11 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
---|
| 12 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
---|
| 13 | GNU General Public License for more details. |
---|
| 14 | |
---|
| 15 | You should have received a copy of the GNU General Public License |
---|
| 16 | along with this program; if not, write to the Free Software |
---|
| 17 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
---|
| 18 | |
---|
| 19 | */ |
---|
| 20 | |
---|
[f918cb9] | 21 | |
---|
[7c6c806d] | 22 | #include "aubio_priv.h" |
---|
[b276dee] | 23 | #include "sample.h" |
---|
[32d6958] | 24 | #include "spectral/filterbank.h" |
---|
[17961b0] | 25 | #include "mathutils.h" |
---|
[88199ce] | 26 | |
---|
[b276dee] | 27 | #define VERY_SMALL_NUMBER 2e-42 |
---|
[7c6c806d] | 28 | |
---|
[8708556] | 29 | /** \brief A structure to store a set of n_filters filters of lenghts win_s */ |
---|
| 30 | struct aubio_filterbank_t_ { |
---|
| 31 | uint_t win_s; |
---|
| 32 | uint_t n_filters; |
---|
[b276dee] | 33 | fvec_t **filters; |
---|
[7c6c806d] | 34 | }; |
---|
| 35 | |
---|
[8708556] | 36 | aubio_filterbank_t * new_aubio_filterbank(uint_t n_filters, uint_t win_s){ |
---|
| 37 | /** allocating space for filterbank object */ |
---|
| 38 | aubio_filterbank_t * fb = AUBIO_NEW(aubio_filterbank_t); |
---|
[f918cb9] | 39 | uint_t filter_cnt; |
---|
[8708556] | 40 | fb->win_s=win_s; |
---|
| 41 | fb->n_filters=n_filters; |
---|
[88199ce] | 42 | |
---|
[8708556] | 43 | /** allocating filter tables */ |
---|
[b276dee] | 44 | fb->filters=AUBIO_ARRAY(fvec_t*,n_filters); |
---|
[8708556] | 45 | for (filter_cnt=0; filter_cnt<n_filters; filter_cnt++) |
---|
| 46 | /* considering one-channel filters */ |
---|
[b276dee] | 47 | fb->filters[filter_cnt]=new_fvec(win_s, 1); |
---|
[88199ce] | 48 | |
---|
[b276dee] | 49 | return fb; |
---|
| 50 | } |
---|
| 51 | |
---|
[83d5abf] | 52 | /* |
---|
| 53 | FB initialization based on Slaney's auditory toolbox |
---|
| 54 | TODO: |
---|
| 55 | *solve memory leak problems while |
---|
| 56 | *solve quantization issues when constructing signal: |
---|
| 57 | *bug for win_s=512 |
---|
| 58 | *corrections for win_s=1024 -> why even filters with smaller amplitude |
---|
| 59 | |
---|
| 60 | */ |
---|
[ef1c3b7] | 61 | |
---|
[aa83433] | 62 | aubio_filterbank_t * new_aubio_filterbank_mfcc(uint_t n_filters, uint_t win_s, uint_t samplerate, smpl_t freq_min, smpl_t freq_max){ |
---|
[f72ceeb] | 63 | |
---|
| 64 | aubio_filterbank_t * fb = new_aubio_filterbank(n_filters, win_s); |
---|
| 65 | |
---|
[ef1c3b7] | 66 | |
---|
| 67 | //slaney params |
---|
| 68 | smpl_t lowestFrequency = 133.3333; |
---|
| 69 | smpl_t linearSpacing = 66.66666666; |
---|
| 70 | smpl_t logSpacing = 1.0711703; |
---|
| 71 | |
---|
| 72 | uint_t linearFilters = 13; |
---|
| 73 | uint_t logFilters = 27; |
---|
| 74 | uint_t allFilters = linearFilters + logFilters; |
---|
[7a46bf6] | 75 | |
---|
[ef1c3b7] | 76 | //buffers for computing filter frequencies |
---|
[95a64c7] | 77 | fvec_t * freqs=new_fvec(allFilters+2 , 1); |
---|
[787f1f3] | 78 | |
---|
[ef1c3b7] | 79 | fvec_t * lower_freqs=new_fvec( allFilters, 1); |
---|
| 80 | fvec_t * upper_freqs=new_fvec( allFilters, 1); |
---|
| 81 | fvec_t * center_freqs=new_fvec( allFilters, 1); |
---|
[95a64c7] | 82 | |
---|
[ef1c3b7] | 83 | fvec_t * triangle_heights=new_fvec( allFilters, 1); |
---|
| 84 | //lookup table of each bin frequency in hz |
---|
[f72ceeb] | 85 | fvec_t * fft_freqs=new_fvec(win_s, 1); |
---|
[ef1c3b7] | 86 | |
---|
| 87 | uint_t filter_cnt, bin_cnt; |
---|
| 88 | |
---|
[95a64c7] | 89 | //first step: filling all the linear filter frequencies |
---|
[ef1c3b7] | 90 | for(filter_cnt=0; filter_cnt<linearFilters; filter_cnt++){ |
---|
[f72ceeb] | 91 | freqs->data[0][filter_cnt]=lowestFrequency+ filter_cnt*linearSpacing; |
---|
[ef1c3b7] | 92 | } |
---|
[f72ceeb] | 93 | smpl_t lastlinearCF=freqs->data[0][filter_cnt-1]; |
---|
[ef1c3b7] | 94 | |
---|
[95a64c7] | 95 | //second step: filling all the log filter frequencies |
---|
[ef1c3b7] | 96 | for(filter_cnt=0; filter_cnt<logFilters+2; filter_cnt++){ |
---|
[aa83433] | 97 | freqs->data[0][filter_cnt+linearFilters] = |
---|
| 98 | lastlinearCF*(pow(logSpacing,filter_cnt+1)); |
---|
[ef1c3b7] | 99 | } |
---|
[f72ceeb] | 100 | |
---|
[95a64c7] | 101 | //Option 1. copying interesting values to lower_freqs, center_freqs and upper freqs arrays |
---|
| 102 | //TODO: would be nicer to have a reference to freqs->data, anyway we do not care in this init step |
---|
| 103 | |
---|
| 104 | for(filter_cnt=0; filter_cnt<allFilters; filter_cnt++){ |
---|
| 105 | lower_freqs->data[0][filter_cnt]=freqs->data[0][filter_cnt]; |
---|
| 106 | center_freqs->data[0][filter_cnt]=freqs->data[0][filter_cnt+1]; |
---|
| 107 | upper_freqs->data[0][filter_cnt]=freqs->data[0][filter_cnt+2]; |
---|
| 108 | } |
---|
| 109 | |
---|
[ef1c3b7] | 110 | //computing triangle heights so that each triangle has unit area |
---|
| 111 | for(filter_cnt=0; filter_cnt<allFilters; filter_cnt++){ |
---|
[aa83433] | 112 | triangle_heights->data[0][filter_cnt] = 2./(upper_freqs->data[0][filter_cnt] |
---|
| 113 | - lower_freqs->data[0][filter_cnt]); |
---|
[ef1c3b7] | 114 | } |
---|
[95a64c7] | 115 | |
---|
[aa83433] | 116 | //AUBIO_DBG("filter tables frequencies\n"); |
---|
| 117 | //for(filter_cnt=0; filter_cnt<allFilters; filter_cnt++) |
---|
| 118 | // AUBIO_DBG("filter n. %d %f %f %f %f\n", |
---|
| 119 | // filter_cnt, lower_freqs->data[0][filter_cnt], |
---|
| 120 | // center_freqs->data[0][filter_cnt], upper_freqs->data[0][filter_cnt], |
---|
| 121 | // triangle_heights->data[0][filter_cnt]); |
---|
[bc4ba75] | 122 | |
---|
[f72ceeb] | 123 | //filling the fft_freqs lookup table, which assigns the frequency in hz to each bin |
---|
[ef1c3b7] | 124 | for(bin_cnt=0; bin_cnt<win_s; bin_cnt++){ |
---|
[17961b0] | 125 | fft_freqs->data[0][bin_cnt]= aubio_bintofreq(bin_cnt, samplerate, win_s); |
---|
[ef1c3b7] | 126 | } |
---|
[bc4ba75] | 127 | |
---|
[f72ceeb] | 128 | //building each filter table |
---|
[ef1c3b7] | 129 | for(filter_cnt=0; filter_cnt<allFilters; filter_cnt++){ |
---|
| 130 | |
---|
[f72ceeb] | 131 | //TODO:check special case : lower freq =0 |
---|
| 132 | //calculating rise increment in mag/Hz |
---|
| 133 | smpl_t riseInc= triangle_heights->data[0][filter_cnt]/(center_freqs->data[0][filter_cnt]-lower_freqs->data[0][filter_cnt]); |
---|
| 134 | |
---|
[bc4ba75] | 135 | //zeroing begining of filter |
---|
[f72ceeb] | 136 | for(bin_cnt=0; bin_cnt<win_s-1; bin_cnt++){ |
---|
[ef1c3b7] | 137 | fb->filters[filter_cnt]->data[0][bin_cnt]=0.f; |
---|
[aa83433] | 138 | if( fft_freqs->data[0][bin_cnt] <= lower_freqs->data[0][filter_cnt] && |
---|
| 139 | fft_freqs->data[0][bin_cnt+1] > lower_freqs->data[0][filter_cnt]) { |
---|
[f72ceeb] | 140 | break; |
---|
| 141 | } |
---|
[88199ce] | 142 | } |
---|
[f72ceeb] | 143 | bin_cnt++; |
---|
| 144 | |
---|
| 145 | //positive slope |
---|
| 146 | for(; bin_cnt<win_s-1; bin_cnt++){ |
---|
| 147 | fb->filters[filter_cnt]->data[0][bin_cnt]=(fft_freqs->data[0][bin_cnt]-lower_freqs->data[0][filter_cnt])*riseInc; |
---|
| 148 | //if(fft_freqs->data[0][bin_cnt]<= center_freqs->data[0][filter_cnt] && fft_freqs->data[0][bin_cnt+1]> center_freqs->data[0][filter_cnt]) |
---|
| 149 | if(fft_freqs->data[0][bin_cnt+1]> center_freqs->data[0][filter_cnt]) |
---|
| 150 | break; |
---|
[b276dee] | 151 | } |
---|
[f72ceeb] | 152 | //bin_cnt++; |
---|
| 153 | |
---|
| 154 | //negative slope |
---|
| 155 | for(; bin_cnt<win_s-1; bin_cnt++){ |
---|
| 156 | |
---|
| 157 | //checking whether last value is less than 0... |
---|
| 158 | smpl_t val=triangle_heights->data[0][filter_cnt]-(fft_freqs->data[0][bin_cnt]-center_freqs->data[0][filter_cnt])*riseInc; |
---|
| 159 | if(val>=0) |
---|
| 160 | fb->filters[filter_cnt]->data[0][bin_cnt]=val; |
---|
| 161 | else fb->filters[filter_cnt]->data[0][bin_cnt]=0.f; |
---|
| 162 | |
---|
| 163 | //if(fft_freqs->data[0][bin_cnt]<= upper_freqs->data[0][bin_cnt] && fft_freqs->data[0][bin_cnt+1]> upper_freqs->data[0][filter_cnt]) |
---|
| 164 | //TODO: CHECK whether bugfix correct |
---|
| 165 | if(fft_freqs->data[0][bin_cnt+1]> upper_freqs->data[0][filter_cnt]) |
---|
| 166 | break; |
---|
[b276dee] | 167 | } |
---|
[f72ceeb] | 168 | //bin_cnt++; |
---|
| 169 | |
---|
| 170 | //zeroing tail |
---|
| 171 | for(; bin_cnt<win_s; bin_cnt++) |
---|
| 172 | fb->filters[filter_cnt]->data[0][bin_cnt]=0.f; |
---|
[88199ce] | 173 | |
---|
[b276dee] | 174 | } |
---|
[f72ceeb] | 175 | |
---|
| 176 | |
---|
| 177 | del_fvec(freqs); |
---|
[95a64c7] | 178 | del_fvec(lower_freqs); |
---|
| 179 | del_fvec(upper_freqs); |
---|
| 180 | del_fvec(center_freqs); |
---|
[b276dee] | 181 | |
---|
[f72ceeb] | 182 | del_fvec(triangle_heights); |
---|
| 183 | del_fvec(fft_freqs); |
---|
[b276dee] | 184 | |
---|
| 185 | return fb; |
---|
[88199ce] | 186 | |
---|
[8708556] | 187 | } |
---|
| 188 | |
---|
| 189 | void del_aubio_filterbank(aubio_filterbank_t * fb){ |
---|
[b276dee] | 190 | uint_t filter_cnt; |
---|
[8708556] | 191 | /** deleting filter tables first */ |
---|
| 192 | for (filter_cnt=0; filter_cnt<fb->n_filters; filter_cnt++) |
---|
| 193 | del_fvec(fb->filters[filter_cnt]); |
---|
| 194 | AUBIO_FREE(fb->filters); |
---|
| 195 | AUBIO_FREE(fb); |
---|
| 196 | } |
---|
[88199ce] | 197 | |
---|
[b276dee] | 198 | void aubio_filterbank_do(aubio_filterbank_t * f, cvec_t * in, fvec_t *out) { |
---|
| 199 | uint_t n, filter_cnt; |
---|
[f14a78d] | 200 | for(filter_cnt = 0; (filter_cnt < f->n_filters) |
---|
| 201 | && (filter_cnt < out->length); filter_cnt++){ |
---|
[b276dee] | 202 | out->data[0][filter_cnt] = 0.f; |
---|
[f14a78d] | 203 | for(n = 0; n < in->length; n++){ |
---|
[b276dee] | 204 | out->data[0][filter_cnt] += in->norm[0][n] |
---|
| 205 | * f->filters[filter_cnt]->data[0][n]; |
---|
| 206 | } |
---|
| 207 | out->data[0][filter_cnt] = |
---|
| 208 | LOG(out->data[0][filter_cnt] < VERY_SMALL_NUMBER ? |
---|
| 209 | VERY_SMALL_NUMBER : out->data[0][filter_cnt]); |
---|
| 210 | } |
---|
| 211 | |
---|
| 212 | return; |
---|
[fe28ff3] | 213 | } |
---|
[17961b0] | 214 | |
---|
| 215 | fvec_t * aubio_filterbank_getchannel(aubio_filterbank_t * f, uint_t channel) { |
---|
[5dd22a9] | 216 | if ( (channel < f->n_filters) ) { return f->filters[channel]; } |
---|
[17961b0] | 217 | else { return NULL; } |
---|
| 218 | } |
---|