2 Copyright (C) 2003 Paul Brossier
4 This program is free software; you can redistribute it and/or modify
5 it under the terms of the GNU General Public License as published by
6 the Free Software Foundation; either version 2 of the License, or
7 (at your option) any later version.
9 This program is distributed in the hope that it will be useful,
10 but WITHOUT ANY WARRANTY; without even the implied warranty of
11 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 GNU General Public License for more details.
14 You should have received a copy of the GNU General Public License
15 along with this program; if not, write to the Free Software
16 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
20 /* see in mathutils.h for doc */
22 #include "aubio_priv.h"
24 #include "mathutils.h"
26 void aubio_window(smpl_t *w, uint_t size, aubio_window_type wintype) {
29 case aubio_win_rectangle:
33 case aubio_win_hamming:
35 w[i] = 0.54 - 0.46 * COS(TWO_PI * i / (size));
37 case aubio_win_hanning:
39 w[i] = 0.5 - (0.5 * COS(TWO_PI * i / (size)));
41 case aubio_win_hanningz:
43 w[i] = 0.5 * (1.0 - COS(TWO_PI * i / (size)));
45 case aubio_win_blackman:
48 - 0.50 * COS( TWO_PI*i/(size-1.0))
49 + 0.08 * COS(2.0*TWO_PI*i/(size-1.0));
51 case aubio_win_blackman_harris:
54 - 0.48829 * COS( TWO_PI*i/(size-1.0))
55 + 0.14128 * COS(2.0*TWO_PI*i/(size-1.0))
56 - 0.01168 * COS(3.0*TWO_PI*i/(size-1.0));
58 case aubio_win_gaussian:
60 w[i] = EXP(- 1.0 / SQR(size) * SQR(2.0*i-size));
64 w[i] = 1.0 - SQR((2*i-size)/(size+1.0));
66 case aubio_win_parzen:
68 w[i] = 1.0 - fabsf((2*i-size)/(size+1.0));
76 smpl_t aubio_unwrap2pi(smpl_t phase) {
77 /* mod(phase+pi,-2pi)+pi */
78 return phase + TWO_PI * (1. + floorf(-(phase+PI)/TWO_PI));
82 smpl_t vec_mean(fvec_t *s)
86 for (i=0; i < s->channels; i++)
87 for (j=0; j < s->length; j++)
89 return tmp/(smpl_t)(s->length);
93 smpl_t vec_sum(fvec_t *s)
97 for (i=0; i < s->channels; i++)
98 for (j=0; j < s->length; j++)
104 smpl_t vec_max(fvec_t *s)
108 for (i=0; i < s->channels; i++)
109 for (j=0; j < s->length; j++)
110 tmp = (tmp > s->data[i][j])? tmp : s->data[i][j];
114 smpl_t vec_min(fvec_t *s)
117 smpl_t tmp = s->data[0][0];
118 for (i=0; i < s->channels; i++)
119 for (j=0; j < s->length; j++)
120 tmp = (tmp < s->data[i][j])? tmp : s->data[i][j] ;
125 uint_t vec_min_elem(fvec_t *s)
127 uint_t i,j=0, pos=0.;
128 smpl_t tmp = s->data[0][0];
129 for (i=0; i < s->channels; i++)
130 for (j=0; j < s->length; j++) {
131 pos = (tmp < s->data[i][j])? pos : j;
132 tmp = (tmp < s->data[i][j])? tmp : s->data[i][j] ;
137 uint_t vec_max_elem(fvec_t *s)
139 uint_t i,j=0, pos=0.;
141 for (i=0; i < s->channels; i++)
142 for (j=0; j < s->length; j++) {
143 pos = (tmp > s->data[i][j])? pos : j;
144 tmp = (tmp > s->data[i][j])? tmp : s->data[i][j] ;
149 void vec_shift(fvec_t *s)
153 for (i=0; i < s->channels; i++)
154 for (j=0; j < s->length / 2 ; j++) {
155 //tmp = s->data[i][j];
156 //s->data[i][j] = s->data[i][j+s->length/2];
157 //s->data[i][j+s->length/2] = tmp;
158 ELEM_SWAP(s->data[i][j],s->data[i][j+s->length/2]);
162 smpl_t vec_local_energy(fvec_t * f)
166 for (i=0;i<f->channels;i++)
167 for (j=0;j<f->length;j++)
168 locE+=SQR(f->data[i][j]);
172 smpl_t vec_local_hfc(fvec_t * f)
176 for (i=0;i<f->channels;i++)
177 for (j=0;j<f->length;j++)
178 locE+=(i+1)*f->data[i][j];
182 smpl_t vec_alpha_norm(fvec_t * DF, smpl_t alpha)
186 for (i=0;i<DF->channels;i++)
187 for (j=0;j<DF->length;j++)
188 tmp += POW(ABS(DF->data[i][j]),alpha);
189 return POW(tmp/DF->length,1./alpha);
193 void vec_dc_removal(fvec_t * mag)
196 uint_t length = mag->length, i=0, j;
198 for (j=0;j<length;j++) {
199 mag->data[i][j] -= mini;
204 void vec_alpha_normalise(fvec_t * mag, uint_t alpha)
207 uint_t length = mag->length, i=0, j;
208 alphan = vec_alpha_norm(mag,alpha);
209 for (j=0;j<length;j++){
210 mag->data[i][j] /= alphan;
215 void vec_add(fvec_t * mag, smpl_t threshold) {
216 uint_t length = mag->length, i=0, j;
217 for (j=0;j<length;j++) {
218 mag->data[i][j] += threshold;
223 void vec_adapt_thres(fvec_t * vec, fvec_t * tmp,
224 uint_t post, uint_t pre)
226 uint_t length = vec->length, i=0, j;
227 for (j=0;j<length;j++) {
228 vec->data[i][j] -= vec_moving_thres(vec, tmp, post, pre, j);
232 smpl_t vec_moving_thres(fvec_t * vec, fvec_t * tmpvec,
233 uint_t post, uint_t pre, uint_t pos)
235 smpl_t * medar = (smpl_t *)tmpvec->data[0];
237 uint_t win_length = post+pre+1;
238 uint_t length = vec->length;
239 /* post part of the buffer does not exist */
241 for (k=0;k<post+1-pos;k++)
242 medar[k] = 0.; /* 0-padding at the beginning */
243 for (k=post+1-pos;k<win_length;k++)
244 medar[k] = vec->data[0][k+pos-post];
245 /* the buffer is fully defined */
246 } else if (pos+pre<length) {
247 for (k=0;k<win_length;k++)
248 medar[k] = vec->data[0][k+pos-post];
249 /* pre part of the buffer does not exist */
251 for (k=0;k<length-pos+post+1;k++)
252 medar[k] = vec->data[0][k+pos-post];
253 for (k=length-pos+post+1;k<win_length;k++)
254 medar[k] = 0.; /* 0-padding at the end */
256 return vec_median(tmpvec);
259 smpl_t vec_median(fvec_t * input) {
260 uint_t n = input->length;
261 smpl_t * arr = (smpl_t *) input->data[0];
264 uint_t middle, ll, hh;
266 low = 0 ; high = n-1 ; median = (low + high) / 2;
268 if (high <= low) /* One element only */
271 if (high == low + 1) { /* Two elements only */
272 if (arr[low] > arr[high])
273 ELEM_SWAP(arr[low], arr[high]) ;
277 /* Find median of low, middle and high items; swap into position low */
278 middle = (low + high) / 2;
279 if (arr[middle] > arr[high]) ELEM_SWAP(arr[middle], arr[high]);
280 if (arr[low] > arr[high]) ELEM_SWAP(arr[low], arr[high]);
281 if (arr[middle] > arr[low]) ELEM_SWAP(arr[middle], arr[low]) ;
283 /* Swap low item (now in position middle) into position (low+1) */
284 ELEM_SWAP(arr[middle], arr[low+1]) ;
286 /* Nibble from each end towards middle, swapping items when stuck */
290 do ll++; while (arr[low] > arr[ll]) ;
291 do hh--; while (arr[hh] > arr[low]) ;
296 ELEM_SWAP(arr[ll], arr[hh]) ;
299 /* Swap middle item (in position low) back into correct position */
300 ELEM_SWAP(arr[low], arr[hh]) ;
302 /* Re-set active partition */
310 smpl_t vec_quadint(fvec_t * x,uint_t pos) {
312 smpl_t step = 1./200.;
313 /* hack : init resold to - something (in case x[pos+-span]<0)) */
314 smpl_t res, frac, s0, s1, s2, exactpos = (smpl_t)pos, resold = -1000.;
315 if ((pos > span) && (pos < x->length-span)) {
316 s0 = x->data[0][pos-span];
317 s1 = x->data[0][pos] ;
318 s2 = x->data[0][pos+span];
320 for (frac = 0.; frac < 2.; frac = frac + step) {
321 res = aubio_quadfrac(s0, s1, s2, frac);
325 exactpos += (frac-step)*2. - 1.;
333 smpl_t aubio_quadfrac(smpl_t s0, smpl_t s1, smpl_t s2, smpl_t pf) {
334 smpl_t tmp = s0 + (pf/2.) * (pf * ( s0 - 2.*s1 + s2 ) - 3.*s0 + 4.*s1 - s2);
338 uint_t vec_peakpick(fvec_t * onset, uint_t pos) {
340 /*for (i=0;i<onset->channels;i++)*/
341 tmp = (onset->data[i][pos] > onset->data[i][pos-1]
342 && onset->data[i][pos] > onset->data[i][pos+1]
343 && onset->data[i][pos] > 0.);
347 smpl_t aubio_freqtomidi(smpl_t freq) {
348 /* log(freq/A-2)/log(2) */
349 smpl_t midi = freq/6.875;
350 midi = LOG(midi)/0.69314718055995;
356 smpl_t aubio_miditofreq(smpl_t midi) {
357 smpl_t freq = (midi+3.)/12.;
358 freq = EXP(freq*0.69314718055995);
363 smpl_t aubio_bintofreq(smpl_t bin, smpl_t samplerate, smpl_t fftsize) {
364 smpl_t freq = samplerate/fftsize;
368 smpl_t aubio_bintomidi(smpl_t bin, smpl_t samplerate, smpl_t fftsize) {
369 smpl_t midi = aubio_bintofreq(bin,samplerate,fftsize);
370 return aubio_freqtomidi(midi);
373 smpl_t aubio_freqtobin(smpl_t freq, smpl_t samplerate, smpl_t fftsize) {
374 smpl_t bin = fftsize/samplerate;
378 smpl_t aubio_miditobin(smpl_t midi, smpl_t samplerate, smpl_t fftsize) {
379 smpl_t freq = aubio_miditofreq(midi);
380 return aubio_freqtobin(freq,samplerate,fftsize);
385 /** returns 1 if wassilence is 0 and RMS(ibuf)<threshold
388 uint_t aubio_silence_detection(fvec_t * ibuf, smpl_t threshold) {
391 for (j=0;j<ibuf->length;j++) {
392 loudness += SQR(ibuf->data[i][j]);
394 loudness = SQRT(loudness);
395 loudness /= (smpl_t)ibuf->length;
396 loudness = LIN2DB(loudness);
398 return (loudness < threshold);
401 /** returns level log(RMS(ibuf)) if < threshold, 1 otherwise
404 smpl_t aubio_level_detection(fvec_t * ibuf, smpl_t threshold) {
407 for (j=0;j<ibuf->length;j++) {
408 loudness += SQR(ibuf->data[i][j]);
410 loudness = SQRT(loudness);
411 loudness /= (smpl_t)ibuf->length;
412 loudness = LIN2DB(loudness);
414 if (loudness < threshold)
420 void aubio_autocorr(fvec_t * input, fvec_t * output){
421 uint_t i = 0, j = 0, length = input->length;
422 smpl_t * data = input->data[0];
423 smpl_t * acf = output->data[0];
425 for(i=0;i<length;i++){
426 for(j=i;j<length;j++){
427 tmp += data[j-i]*data[j];
429 acf[i] = tmp /(smpl_t)(length-i);