2 Copyright (C) 2003-2014 Paul Brossier <piem@aubio.org>
4 This file is part of aubio.
6 aubio is free software: you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation, either version 3 of the License, or
9 (at your option) any later version.
11 aubio is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with aubio. If not, see <http://www.gnu.org/licenses/>.
21 /* see in mathutils.h for doc */
23 #include "aubio_priv.h"
25 #include "mathutils.h"
26 #include "musicutils.h"
37 aubio_win_blackman_harris,
41 aubio_win_default = aubio_win_hanningz,
45 new_aubio_window (char_t * window_type, uint_t length)
47 fvec_t * win = new_fvec (length);
52 err = fvec_set_window (win, window_type);
60 uint_t fvec_set_window (fvec_t *win, char_t *window_type) {
61 smpl_t * w = win->data;
62 uint_t i, size = win->length;
63 aubio_window_type wintype;
64 if (window_type == NULL) {
65 AUBIO_ERR ("window type can not be null.\n");
67 } else if (strcmp (window_type, "rectangle") == 0)
68 wintype = aubio_win_rectangle;
69 else if (strcmp (window_type, "hamming") == 0)
70 wintype = aubio_win_hamming;
71 else if (strcmp (window_type, "hanning") == 0)
72 wintype = aubio_win_hanning;
73 else if (strcmp (window_type, "hanningz") == 0)
74 wintype = aubio_win_hanningz;
75 else if (strcmp (window_type, "blackman") == 0)
76 wintype = aubio_win_blackman;
77 else if (strcmp (window_type, "blackman_harris") == 0)
78 wintype = aubio_win_blackman_harris;
79 else if (strcmp (window_type, "gaussian") == 0)
80 wintype = aubio_win_gaussian;
81 else if (strcmp (window_type, "welch") == 0)
82 wintype = aubio_win_welch;
83 else if (strcmp (window_type, "parzen") == 0)
84 wintype = aubio_win_parzen;
85 else if (strcmp (window_type, "default") == 0)
86 wintype = aubio_win_default;
88 AUBIO_ERR ("unknown window type `%s`.\n", window_type);
92 case aubio_win_rectangle:
96 case aubio_win_hamming:
98 w[i] = 0.54 - 0.46 * COS(TWO_PI * i / (size));
100 case aubio_win_hanning:
102 w[i] = 0.5 - (0.5 * COS(TWO_PI * i / (size)));
104 case aubio_win_hanningz:
106 w[i] = 0.5 * (1.0 - COS(TWO_PI * i / (size)));
108 case aubio_win_blackman:
111 - 0.50 * COS( TWO_PI*i/(size-1.0))
112 + 0.08 * COS(2.0*TWO_PI*i/(size-1.0));
114 case aubio_win_blackman_harris:
117 - 0.48829 * COS( TWO_PI*i/(size-1.0))
118 + 0.14128 * COS(2.0*TWO_PI*i/(size-1.0))
119 - 0.01168 * COS(3.0*TWO_PI*i/(size-1.0));
121 case aubio_win_gaussian:
123 lsmp_t a, b, c = 0.5;
125 for (n = 0; n < size; n++)
127 a = (n-c*(size-1))/(SQR(c)*(size-1));
133 case aubio_win_welch:
135 w[i] = 1.0 - SQR((2.*i-size)/(size+1.0));
137 case aubio_win_parzen:
139 w[i] = 1.0 - ABS((2.f*i-size)/(size+1.0f));
148 aubio_unwrap2pi (smpl_t phase)
150 /* mod(phase+pi,-2pi)+pi */
151 return phase + TWO_PI * (1. + FLOOR (-(phase + PI) / TWO_PI));
155 fvec_mean (fvec_t * s)
158 #ifndef HAVE_ACCELERATE
160 for (j = 0; j < s->length; j++) {
163 return tmp / (smpl_t) (s->length);
165 aubio_vDSP_meanv(s->data, 1, &tmp, s->length);
167 #endif /* HAVE_ACCELERATE */
171 fvec_sum (fvec_t * s)
174 #ifndef HAVE_ACCELERATE
176 for (j = 0; j < s->length; j++) {
180 aubio_vDSP_sve(s->data, 1, &tmp, s->length);
181 #endif /* HAVE_ACCELERATE */
186 fvec_max (fvec_t * s)
188 #ifndef HAVE_ACCELERATE
191 for (j = 0; j < s->length; j++) {
192 tmp = (tmp > s->data[j]) ? tmp : s->data[j];
196 aubio_vDSP_maxv(s->data, 1, &tmp, s->length);
202 fvec_min (fvec_t * s)
204 #ifndef HAVE_ACCELERATE
206 smpl_t tmp = s->data[0];
207 for (j = 0; j < s->length; j++) {
208 tmp = (tmp < s->data[j]) ? tmp : s->data[j];
212 aubio_vDSP_minv(s->data, 1, &tmp, s->length);
218 fvec_min_elem (fvec_t * s)
220 #ifndef HAVE_ACCELERATE
222 smpl_t tmp = s->data[0];
223 for (j = 0; j < s->length; j++) {
224 pos = (tmp < s->data[j]) ? pos : j;
225 tmp = (tmp < s->data[j]) ? tmp : s->data[j];
230 aubio_vDSP_minvi(s->data, 1, &tmp, (vDSP_Length *)&pos, s->length);
236 fvec_max_elem (fvec_t * s)
238 #ifndef HAVE_ACCELERATE
241 for (j = 0; j < s->length; j++) {
242 pos = (tmp > s->data[j]) ? pos : j;
243 tmp = (tmp > s->data[j]) ? tmp : s->data[j];
248 aubio_vDSP_maxvi(s->data, 1, &tmp, (vDSP_Length *)&pos, s->length);
254 fvec_shift (fvec_t * s)
256 #ifndef HAVE_ACCELERATE
258 for (j = 0; j < s->length / 2; j++) {
259 ELEM_SWAP (s->data[j], s->data[j + s->length / 2]);
262 uint_t half = s->length / 2;
263 aubio_cblas_xswap(half, s->data, 1, s->data + half, 1);
268 aubio_level_lin (fvec_t * f)
271 #ifndef HAVE_ACCELERATE
273 for (j = 0; j < f->length; j++) {
274 energy += SQR (f->data[j]);
277 energy = aubio_cblas_dot(f->length, f->data, 1, f->data, 1);
279 return energy / f->length;
283 fvec_local_hfc (fvec_t * v)
287 for (j = 0; j < v->length; j++) {
288 hfc += (j + 1) * v->data[j];
294 fvec_min_removal (fvec_t * v)
296 smpl_t v_min = fvec_min (v);
297 fvec_add (v, - v_min );
301 fvec_alpha_norm (fvec_t * o, smpl_t alpha)
305 for (j = 0; j < o->length; j++) {
306 tmp += POW (ABS (o->data[j]), alpha);
308 return POW (tmp / o->length, 1. / alpha);
312 fvec_alpha_normalise (fvec_t * o, smpl_t alpha)
315 smpl_t norm = fvec_alpha_norm (o, alpha);
316 for (j = 0; j < o->length; j++) {
322 fvec_add (fvec_t * o, smpl_t val)
325 for (j = 0; j < o->length; j++) {
330 void fvec_adapt_thres(fvec_t * vec, fvec_t * tmp,
331 uint_t post, uint_t pre) {
332 uint_t length = vec->length, j;
333 for (j=0;j<length;j++) {
334 vec->data[j] -= fvec_moving_thres(vec, tmp, post, pre, j);
339 fvec_moving_thres (fvec_t * vec, fvec_t * tmpvec,
340 uint_t post, uint_t pre, uint_t pos)
343 smpl_t *medar = (smpl_t *) tmpvec->data;
344 uint_t win_length = post + pre + 1;
345 uint_t length = vec->length;
346 /* post part of the buffer does not exist */
347 if (pos < post + 1) {
348 for (k = 0; k < post + 1 - pos; k++)
349 medar[k] = 0.; /* 0-padding at the beginning */
350 for (k = post + 1 - pos; k < win_length; k++)
351 medar[k] = vec->data[k + pos - post];
352 /* the buffer is fully defined */
353 } else if (pos + pre < length) {
354 for (k = 0; k < win_length; k++)
355 medar[k] = vec->data[k + pos - post];
356 /* pre part of the buffer does not exist */
358 for (k = 0; k < length - pos + post; k++)
359 medar[k] = vec->data[k + pos - post];
360 for (k = length - pos + post; k < win_length; k++)
361 medar[k] = 0.; /* 0-padding at the end */
363 return fvec_median (tmpvec);
366 smpl_t fvec_median (fvec_t * input) {
367 uint_t n = input->length;
368 smpl_t * arr = (smpl_t *) input->data;
371 uint_t middle, ll, hh;
373 low = 0 ; high = n-1 ; median = (low + high) / 2;
375 if (high <= low) /* One element only */
378 if (high == low + 1) { /* Two elements only */
379 if (arr[low] > arr[high])
380 ELEM_SWAP(arr[low], arr[high]) ;
384 /* Find median of low, middle and high items; swap into position low */
385 middle = (low + high) / 2;
386 if (arr[middle] > arr[high]) ELEM_SWAP(arr[middle], arr[high]);
387 if (arr[low] > arr[high]) ELEM_SWAP(arr[low], arr[high]);
388 if (arr[middle] > arr[low]) ELEM_SWAP(arr[middle], arr[low]) ;
390 /* Swap low item (now in position middle) into position (low+1) */
391 ELEM_SWAP(arr[middle], arr[low+1]) ;
393 /* Nibble from each end towards middle, swapping items when stuck */
397 do ll++; while (arr[low] > arr[ll]) ;
398 do hh--; while (arr[hh] > arr[low]) ;
403 ELEM_SWAP(arr[ll], arr[hh]) ;
406 /* Swap middle item (in position low) back into correct position */
407 ELEM_SWAP(arr[low], arr[hh]) ;
409 /* Re-set active partition */
417 smpl_t fvec_quadratic_peak_pos (fvec_t * x, uint_t pos) {
418 smpl_t s0, s1, s2; uint_t x0, x2;
419 if (pos == 0 || pos == x->length - 1) return pos;
420 x0 = (pos < 1) ? pos : pos - 1;
421 x2 = (pos + 1 < x->length) ? pos + 1 : pos;
422 if (x0 == pos) return (x->data[pos] <= x->data[x2]) ? pos : x2;
423 if (x2 == pos) return (x->data[pos] <= x->data[x0]) ? pos : x0;
427 return pos + 0.5 * (s0 - s2 ) / (s0 - 2.* s1 + s2);
430 smpl_t fvec_quadratic_peak_mag (fvec_t *x, smpl_t pos) {
432 uint_t index = (uint_t)(pos - .5) + 1;
433 if (pos >= x->length || pos < 0.) return 0.;
434 if ((smpl_t)index == pos) return x->data[index];
435 x0 = x->data[index - 1];
437 x2 = x->data[index + 1];
438 return x1 - .25 * (x0 - x2) * (pos - index);
441 uint_t fvec_peakpick(fvec_t * onset, uint_t pos) {
443 tmp = (onset->data[pos] > onset->data[pos-1]
444 && onset->data[pos] > onset->data[pos+1]
445 && onset->data[pos] > 0.);
450 aubio_quadfrac (smpl_t s0, smpl_t s1, smpl_t s2, smpl_t pf)
453 s0 + (pf / 2.) * (pf * (s0 - 2. * s1 + s2) - 3. * s0 + 4. * s1 - s2);
458 aubio_freqtomidi (smpl_t freq)
461 if (freq < 2. || freq > 100000.) return 0.; // avoid nans and infs
462 /* log(freq/A-2)/log(2) */
464 midi = LOG (midi) / 0.69314718055995;
471 aubio_miditofreq (smpl_t midi)
474 if (midi > 140.) return 0.; // avoid infs
475 freq = (midi + 3.) / 12.;
476 freq = EXP (freq * 0.69314718055995);
482 aubio_bintofreq (smpl_t bin, smpl_t samplerate, smpl_t fftsize)
484 smpl_t freq = samplerate / fftsize;
485 return freq * MAX(bin, 0);
489 aubio_bintomidi (smpl_t bin, smpl_t samplerate, smpl_t fftsize)
491 smpl_t midi = aubio_bintofreq (bin, samplerate, fftsize);
492 return aubio_freqtomidi (midi);
496 aubio_freqtobin (smpl_t freq, smpl_t samplerate, smpl_t fftsize)
498 smpl_t bin = fftsize / samplerate;
499 return MAX(freq, 0) * bin;
503 aubio_miditobin (smpl_t midi, smpl_t samplerate, smpl_t fftsize)
505 smpl_t freq = aubio_miditofreq (midi);
506 return aubio_freqtobin (freq, samplerate, fftsize);
510 aubio_is_power_of_two (uint_t a)
512 if ((a & (a - 1)) == 0) {
520 aubio_next_power_of_two (uint_t a)
523 while (i < a) i <<= 1;
528 aubio_db_spl (fvec_t * o)
530 return 10. * LOG10 (aubio_level_lin (o));
534 aubio_silence_detection (fvec_t * o, smpl_t threshold)
536 return (aubio_db_spl (o) < threshold);
540 aubio_level_detection (fvec_t * o, smpl_t threshold)
542 smpl_t db_spl = aubio_db_spl (o);
543 if (db_spl < threshold) {
551 aubio_zero_crossing_rate (fvec_t * input)
555 for (j = 1; j < input->length; j++) {
556 // previous was strictly negative
557 if (input->data[j - 1] < 0.) {
558 // current is positive or null
559 if (input->data[j] >= 0.) {
562 // previous was positive or null
564 // current is strictly negative
565 if (input->data[j] < 0.) {
570 return zcr / (smpl_t) input->length;
574 aubio_autocorr (fvec_t * input, fvec_t * output)
576 uint_t i, j, length = input->length;
581 for (i = 0; i < length; i++) {
583 for (j = i; j < length; j++) {
584 tmp += data[j - i] * data[j];
586 acf[i] = tmp / (smpl_t) (length - i);