2 Copyright (C) 2003-2013 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"
29 #ifdef HAVE_ACCELERATE
30 #include <Accelerate/Accelerate.h>
41 aubio_win_blackman_harris,
45 aubio_win_default = aubio_win_hanningz,
49 new_aubio_window (char_t * window_type, uint_t length)
51 fvec_t * win = new_fvec (length);
52 fvec_set_window (win, window_type);
56 uint_t fvec_set_window (fvec_t *win, char_t *window_type) {
57 smpl_t * w = win->data;
58 uint_t i, size = win->length;
59 aubio_window_type wintype;
60 if (window_type == NULL) {
61 AUBIO_ERR ("window type can not be null.\n");
63 } else if (strcmp (window_type, "rectangle") == 0)
64 wintype = aubio_win_rectangle;
65 else if (strcmp (window_type, "hamming") == 0)
66 wintype = aubio_win_hamming;
67 else if (strcmp (window_type, "hanning") == 0)
68 wintype = aubio_win_hanning;
69 else if (strcmp (window_type, "hanningz") == 0)
70 wintype = aubio_win_hanningz;
71 else if (strcmp (window_type, "blackman") == 0)
72 wintype = aubio_win_blackman;
73 else if (strcmp (window_type, "blackman_harris") == 0)
74 wintype = aubio_win_blackman_harris;
75 else if (strcmp (window_type, "gaussian") == 0)
76 wintype = aubio_win_gaussian;
77 else if (strcmp (window_type, "welch") == 0)
78 wintype = aubio_win_welch;
79 else if (strcmp (window_type, "parzen") == 0)
80 wintype = aubio_win_parzen;
81 else if (strcmp (window_type, "default") == 0)
82 wintype = aubio_win_default;
84 AUBIO_ERR ("unknown window type `%s`.\n", window_type);
88 case aubio_win_rectangle:
92 case aubio_win_hamming:
94 w[i] = 0.54 - 0.46 * COS(TWO_PI * i / (size));
96 case aubio_win_hanning:
98 w[i] = 0.5 - (0.5 * COS(TWO_PI * i / (size)));
100 case aubio_win_hanningz:
102 w[i] = 0.5 * (1.0 - COS(TWO_PI * i / (size)));
104 case aubio_win_blackman:
107 - 0.50 * COS( TWO_PI*i/(size-1.0))
108 + 0.08 * COS(2.0*TWO_PI*i/(size-1.0));
110 case aubio_win_blackman_harris:
113 - 0.48829 * COS( TWO_PI*i/(size-1.0))
114 + 0.14128 * COS(2.0*TWO_PI*i/(size-1.0))
115 - 0.01168 * COS(3.0*TWO_PI*i/(size-1.0));
117 case aubio_win_gaussian:
119 lsmp_t a, b, c = 0.5;
121 for (n = 0; n < size; n++)
123 a = (n-c*(size-1))/(SQR(c)*(size-1));
129 case aubio_win_welch:
131 w[i] = 1.0 - SQR((2.*i-size)/(size+1.0));
133 case aubio_win_parzen:
135 w[i] = 1.0 - ABS((2.*i-size)/(size+1.0));
144 aubio_unwrap2pi (smpl_t phase)
146 /* mod(phase+pi,-2pi)+pi */
147 return phase + TWO_PI * (1. + FLOOR (-(phase + PI) / TWO_PI));
151 fvec_mean (fvec_t * s)
155 for (j = 0; j < s->length; j++) {
158 return tmp / (smpl_t) (s->length);
162 fvec_sum (fvec_t * s)
166 for (j = 0; j < s->length; j++) {
173 fvec_max (fvec_t * s)
175 #ifndef HAVE_ACCELERATE
178 for (j = 0; j < s->length; j++) {
179 tmp = (tmp > s->data[j]) ? tmp : s->data[j];
183 #if !HAVE_AUBIO_DOUBLE
184 vDSP_maxv(s->data, 1, &tmp, s->length);
186 vDSP_maxvD(s->data, 1, &tmp, s->length);
193 fvec_min (fvec_t * s)
195 #ifndef HAVE_ACCELERATE
197 smpl_t tmp = s->data[0];
198 for (j = 0; j < s->length; j++) {
199 tmp = (tmp < s->data[j]) ? tmp : s->data[j];
203 #if !HAVE_AUBIO_DOUBLE
204 vDSP_minv(s->data, 1, &tmp, s->length);
206 vDSP_minvD(s->data, 1, &tmp, s->length);
213 fvec_min_elem (fvec_t * s)
215 #ifndef HAVE_ACCELERATE
217 smpl_t tmp = s->data[0];
218 for (j = 0; j < s->length; j++) {
219 pos = (tmp < s->data[j]) ? pos : j;
220 tmp = (tmp < s->data[j]) ? tmp : s->data[j];
225 #if !HAVE_AUBIO_DOUBLE
226 vDSP_minvi(s->data, 1, &tmp, (vDSP_Length *)&pos, s->length);
228 vDSP_minviD(s->data, 1, &tmp, (vDSP_Length *)&pos, s->length);
235 fvec_max_elem (fvec_t * s)
237 #ifndef HAVE_ACCELERATE
240 for (j = 0; j < s->length; j++) {
241 pos = (tmp > s->data[j]) ? pos : j;
242 tmp = (tmp > s->data[j]) ? tmp : s->data[j];
247 #if !HAVE_AUBIO_DOUBLE
248 vDSP_maxvi(s->data, 1, &tmp, (vDSP_Length *)&pos, s->length);
250 vDSP_maxviD(s->data, 1, &tmp, (vDSP_Length *)&pos, s->length);
257 fvec_shift (fvec_t * s)
260 for (j = 0; j < s->length / 2; j++) {
261 ELEM_SWAP (s->data[j], s->data[j + s->length / 2]);
266 aubio_level_lin (fvec_t * f)
270 for (j = 0; j < f->length; j++) {
271 energy += SQR (f->data[j]);
273 return energy / f->length;
277 fvec_local_hfc (fvec_t * v)
281 for (j = 0; j < v->length; j++) {
282 hfc += (j + 1) * v->data[j];
288 fvec_min_removal (fvec_t * v)
290 smpl_t v_min = fvec_min (v);
291 fvec_add (v, - v_min );
295 fvec_alpha_norm (fvec_t * o, smpl_t alpha)
299 for (j = 0; j < o->length; j++) {
300 tmp += POW (ABS (o->data[j]), alpha);
302 return POW (tmp / o->length, 1. / alpha);
306 fvec_alpha_normalise (fvec_t * o, smpl_t alpha)
309 smpl_t norm = fvec_alpha_norm (o, alpha);
310 for (j = 0; j < o->length; j++) {
316 fvec_add (fvec_t * o, smpl_t val)
319 for (j = 0; j < o->length; j++) {
324 void fvec_adapt_thres(fvec_t * vec, fvec_t * tmp,
325 uint_t post, uint_t pre) {
326 uint_t length = vec->length, j;
327 for (j=0;j<length;j++) {
328 vec->data[j] -= fvec_moving_thres(vec, tmp, post, pre, j);
333 fvec_moving_thres (fvec_t * vec, fvec_t * tmpvec,
334 uint_t post, uint_t pre, uint_t pos)
337 smpl_t *medar = (smpl_t *) tmpvec->data;
338 uint_t win_length = post + pre + 1;
339 uint_t length = vec->length;
340 /* post part of the buffer does not exist */
341 if (pos < post + 1) {
342 for (k = 0; k < post + 1 - pos; k++)
343 medar[k] = 0.; /* 0-padding at the beginning */
344 for (k = post + 1 - pos; k < win_length; k++)
345 medar[k] = vec->data[k + pos - post];
346 /* the buffer is fully defined */
347 } else if (pos + pre < length) {
348 for (k = 0; k < win_length; k++)
349 medar[k] = vec->data[k + pos - post];
350 /* pre part of the buffer does not exist */
352 for (k = 0; k < length - pos + post; k++)
353 medar[k] = vec->data[k + pos - post];
354 for (k = length - pos + post; k < win_length; k++)
355 medar[k] = 0.; /* 0-padding at the end */
357 return fvec_median (tmpvec);
360 smpl_t fvec_median (fvec_t * input) {
361 uint_t n = input->length;
362 smpl_t * arr = (smpl_t *) input->data;
365 uint_t middle, ll, hh;
367 low = 0 ; high = n-1 ; median = (low + high) / 2;
369 if (high <= low) /* One element only */
372 if (high == low + 1) { /* Two elements only */
373 if (arr[low] > arr[high])
374 ELEM_SWAP(arr[low], arr[high]) ;
378 /* Find median of low, middle and high items; swap into position low */
379 middle = (low + high) / 2;
380 if (arr[middle] > arr[high]) ELEM_SWAP(arr[middle], arr[high]);
381 if (arr[low] > arr[high]) ELEM_SWAP(arr[low], arr[high]);
382 if (arr[middle] > arr[low]) ELEM_SWAP(arr[middle], arr[low]) ;
384 /* Swap low item (now in position middle) into position (low+1) */
385 ELEM_SWAP(arr[middle], arr[low+1]) ;
387 /* Nibble from each end towards middle, swapping items when stuck */
391 do ll++; while (arr[low] > arr[ll]) ;
392 do hh--; while (arr[hh] > arr[low]) ;
397 ELEM_SWAP(arr[ll], arr[hh]) ;
400 /* Swap middle item (in position low) back into correct position */
401 ELEM_SWAP(arr[low], arr[hh]) ;
403 /* Re-set active partition */
411 smpl_t fvec_quadratic_peak_pos (fvec_t * x, uint_t pos) {
413 if (pos == 0 || pos == x->length - 1) return pos;
414 uint_t x0 = (pos < 1) ? pos : pos - 1;
415 uint_t x2 = (pos + 1 < x->length) ? pos + 1 : pos;
416 if (x0 == pos) return (x->data[pos] <= x->data[x2]) ? pos : x2;
417 if (x2 == pos) return (x->data[pos] <= x->data[x0]) ? pos : x0;
421 return pos + 0.5 * (s0 - s2 ) / (s0 - 2.* s1 + s2);
424 uint_t fvec_peakpick(fvec_t * onset, uint_t pos) {
426 tmp = (onset->data[pos] > onset->data[pos-1]
427 && onset->data[pos] > onset->data[pos+1]
428 && onset->data[pos] > 0.);
433 aubio_quadfrac (smpl_t s0, smpl_t s1, smpl_t s2, smpl_t pf)
436 s0 + (pf / 2.) * (pf * (s0 - 2. * s1 + s2) - 3. * s0 + 4. * s1 - s2);
441 aubio_freqtomidi (smpl_t freq)
443 if (freq < 2. || freq > 100000.) return 0.; // avoid nans and infs
444 /* log(freq/A-2)/log(2) */
445 smpl_t midi = freq / 6.875;
446 midi = LOG (midi) / 0.69314718055995;
453 aubio_miditofreq (smpl_t midi)
455 if (midi > 140.) return 0.; // avoid infs
456 smpl_t freq = (midi + 3.) / 12.;
457 freq = EXP (freq * 0.69314718055995);
463 aubio_bintofreq (smpl_t bin, smpl_t samplerate, smpl_t fftsize)
465 smpl_t freq = samplerate / fftsize;
466 return freq * MAX(bin, 0);
470 aubio_bintomidi (smpl_t bin, smpl_t samplerate, smpl_t fftsize)
472 smpl_t midi = aubio_bintofreq (bin, samplerate, fftsize);
473 return aubio_freqtomidi (midi);
477 aubio_freqtobin (smpl_t freq, smpl_t samplerate, smpl_t fftsize)
479 smpl_t bin = fftsize / samplerate;
480 return MAX(freq, 0) * bin;
484 aubio_miditobin (smpl_t midi, smpl_t samplerate, smpl_t fftsize)
486 smpl_t freq = aubio_miditofreq (midi);
487 return aubio_freqtobin (freq, samplerate, fftsize);
491 aubio_is_power_of_two (uint_t a)
493 if ((a & (a - 1)) == 0) {
501 aubio_next_power_of_two (uint_t a)
504 while (i < a) i <<= 1;
509 aubio_db_spl (fvec_t * o)
511 return 10. * LOG10 (aubio_level_lin (o));
515 aubio_silence_detection (fvec_t * o, smpl_t threshold)
517 return (aubio_db_spl (o) < threshold);
521 aubio_level_detection (fvec_t * o, smpl_t threshold)
523 smpl_t db_spl = aubio_db_spl (o);
524 if (db_spl < threshold) {
532 aubio_zero_crossing_rate (fvec_t * input)
536 for (j = 1; j < input->length; j++) {
537 // previous was strictly negative
538 if (input->data[j - 1] < 0.) {
539 // current is positive or null
540 if (input->data[j] >= 0.) {
543 // previous was positive or null
545 // current is strictly negative
546 if (input->data[j] < 0.) {
551 return zcr / (smpl_t) input->length;
555 aubio_autocorr (fvec_t * input, fvec_t * output)
557 uint_t i, j, length = input->length;
562 for (i = 0; i < length; i++) {
564 for (j = i; j < length; j++) {
565 tmp += data[j - i] * data[j];
567 acf[i] = tmp / (smpl_t) (length - i);