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);
55 uint_t err = fvec_set_window (win, window_type);
63 uint_t fvec_set_window (fvec_t *win, char_t *window_type) {
64 smpl_t * w = win->data;
65 uint_t i, size = win->length;
66 aubio_window_type wintype;
67 if (window_type == NULL) {
68 AUBIO_ERR ("window type can not be null.\n");
70 } else if (strcmp (window_type, "rectangle") == 0)
71 wintype = aubio_win_rectangle;
72 else if (strcmp (window_type, "hamming") == 0)
73 wintype = aubio_win_hamming;
74 else if (strcmp (window_type, "hanning") == 0)
75 wintype = aubio_win_hanning;
76 else if (strcmp (window_type, "hanningz") == 0)
77 wintype = aubio_win_hanningz;
78 else if (strcmp (window_type, "blackman") == 0)
79 wintype = aubio_win_blackman;
80 else if (strcmp (window_type, "blackman_harris") == 0)
81 wintype = aubio_win_blackman_harris;
82 else if (strcmp (window_type, "gaussian") == 0)
83 wintype = aubio_win_gaussian;
84 else if (strcmp (window_type, "welch") == 0)
85 wintype = aubio_win_welch;
86 else if (strcmp (window_type, "parzen") == 0)
87 wintype = aubio_win_parzen;
88 else if (strcmp (window_type, "default") == 0)
89 wintype = aubio_win_default;
91 AUBIO_ERR ("unknown window type `%s`.\n", window_type);
95 case aubio_win_rectangle:
99 case aubio_win_hamming:
101 w[i] = 0.54 - 0.46 * COS(TWO_PI * i / (size));
103 case aubio_win_hanning:
105 w[i] = 0.5 - (0.5 * COS(TWO_PI * i / (size)));
107 case aubio_win_hanningz:
109 w[i] = 0.5 * (1.0 - COS(TWO_PI * i / (size)));
111 case aubio_win_blackman:
114 - 0.50 * COS( TWO_PI*i/(size-1.0))
115 + 0.08 * COS(2.0*TWO_PI*i/(size-1.0));
117 case aubio_win_blackman_harris:
120 - 0.48829 * COS( TWO_PI*i/(size-1.0))
121 + 0.14128 * COS(2.0*TWO_PI*i/(size-1.0))
122 - 0.01168 * COS(3.0*TWO_PI*i/(size-1.0));
124 case aubio_win_gaussian:
126 lsmp_t a, b, c = 0.5;
128 for (n = 0; n < size; n++)
130 a = (n-c*(size-1))/(SQR(c)*(size-1));
136 case aubio_win_welch:
138 w[i] = 1.0 - SQR((2.*i-size)/(size+1.0));
140 case aubio_win_parzen:
142 w[i] = 1.0 - ABS((2.*i-size)/(size+1.0));
151 aubio_unwrap2pi (smpl_t phase)
153 /* mod(phase+pi,-2pi)+pi */
154 return phase + TWO_PI * (1. + FLOOR (-(phase + PI) / TWO_PI));
158 fvec_mean (fvec_t * s)
162 for (j = 0; j < s->length; j++) {
165 return tmp / (smpl_t) (s->length);
169 fvec_sum (fvec_t * s)
173 for (j = 0; j < s->length; j++) {
180 fvec_max (fvec_t * s)
182 #ifndef HAVE_ACCELERATE
185 for (j = 0; j < s->length; j++) {
186 tmp = (tmp > s->data[j]) ? tmp : s->data[j];
190 #if !HAVE_AUBIO_DOUBLE
191 vDSP_maxv(s->data, 1, &tmp, s->length);
193 vDSP_maxvD(s->data, 1, &tmp, s->length);
200 fvec_min (fvec_t * s)
202 #ifndef HAVE_ACCELERATE
204 smpl_t tmp = s->data[0];
205 for (j = 0; j < s->length; j++) {
206 tmp = (tmp < s->data[j]) ? tmp : s->data[j];
210 #if !HAVE_AUBIO_DOUBLE
211 vDSP_minv(s->data, 1, &tmp, s->length);
213 vDSP_minvD(s->data, 1, &tmp, s->length);
220 fvec_min_elem (fvec_t * s)
222 #ifndef HAVE_ACCELERATE
224 smpl_t tmp = s->data[0];
225 for (j = 0; j < s->length; j++) {
226 pos = (tmp < s->data[j]) ? pos : j;
227 tmp = (tmp < s->data[j]) ? tmp : s->data[j];
232 #if !HAVE_AUBIO_DOUBLE
233 vDSP_minvi(s->data, 1, &tmp, (vDSP_Length *)&pos, s->length);
235 vDSP_minviD(s->data, 1, &tmp, (vDSP_Length *)&pos, s->length);
242 fvec_max_elem (fvec_t * s)
244 #ifndef HAVE_ACCELERATE
247 for (j = 0; j < s->length; j++) {
248 pos = (tmp > s->data[j]) ? pos : j;
249 tmp = (tmp > s->data[j]) ? tmp : s->data[j];
254 #if !HAVE_AUBIO_DOUBLE
255 vDSP_maxvi(s->data, 1, &tmp, (vDSP_Length *)&pos, s->length);
257 vDSP_maxviD(s->data, 1, &tmp, (vDSP_Length *)&pos, s->length);
264 fvec_shift (fvec_t * s)
267 for (j = 0; j < s->length / 2; j++) {
268 ELEM_SWAP (s->data[j], s->data[j + s->length / 2]);
273 aubio_level_lin (fvec_t * f)
277 for (j = 0; j < f->length; j++) {
278 energy += SQR (f->data[j]);
280 return energy / f->length;
284 fvec_local_hfc (fvec_t * v)
288 for (j = 0; j < v->length; j++) {
289 hfc += (j + 1) * v->data[j];
295 fvec_min_removal (fvec_t * v)
297 smpl_t v_min = fvec_min (v);
298 fvec_add (v, - v_min );
302 fvec_alpha_norm (fvec_t * o, smpl_t alpha)
306 for (j = 0; j < o->length; j++) {
307 tmp += POW (ABS (o->data[j]), alpha);
309 return POW (tmp / o->length, 1. / alpha);
313 fvec_alpha_normalise (fvec_t * o, smpl_t alpha)
316 smpl_t norm = fvec_alpha_norm (o, alpha);
317 for (j = 0; j < o->length; j++) {
323 fvec_add (fvec_t * o, smpl_t val)
326 for (j = 0; j < o->length; j++) {
331 void fvec_adapt_thres(fvec_t * vec, fvec_t * tmp,
332 uint_t post, uint_t pre) {
333 uint_t length = vec->length, j;
334 for (j=0;j<length;j++) {
335 vec->data[j] -= fvec_moving_thres(vec, tmp, post, pre, j);
340 fvec_moving_thres (fvec_t * vec, fvec_t * tmpvec,
341 uint_t post, uint_t pre, uint_t pos)
344 smpl_t *medar = (smpl_t *) tmpvec->data;
345 uint_t win_length = post + pre + 1;
346 uint_t length = vec->length;
347 /* post part of the buffer does not exist */
348 if (pos < post + 1) {
349 for (k = 0; k < post + 1 - pos; k++)
350 medar[k] = 0.; /* 0-padding at the beginning */
351 for (k = post + 1 - pos; k < win_length; k++)
352 medar[k] = vec->data[k + pos - post];
353 /* the buffer is fully defined */
354 } else if (pos + pre < length) {
355 for (k = 0; k < win_length; k++)
356 medar[k] = vec->data[k + pos - post];
357 /* pre part of the buffer does not exist */
359 for (k = 0; k < length - pos + post; k++)
360 medar[k] = vec->data[k + pos - post];
361 for (k = length - pos + post; k < win_length; k++)
362 medar[k] = 0.; /* 0-padding at the end */
364 return fvec_median (tmpvec);
367 smpl_t fvec_median (fvec_t * input) {
368 uint_t n = input->length;
369 smpl_t * arr = (smpl_t *) input->data;
372 uint_t middle, ll, hh;
374 low = 0 ; high = n-1 ; median = (low + high) / 2;
376 if (high <= low) /* One element only */
379 if (high == low + 1) { /* Two elements only */
380 if (arr[low] > arr[high])
381 ELEM_SWAP(arr[low], arr[high]) ;
385 /* Find median of low, middle and high items; swap into position low */
386 middle = (low + high) / 2;
387 if (arr[middle] > arr[high]) ELEM_SWAP(arr[middle], arr[high]);
388 if (arr[low] > arr[high]) ELEM_SWAP(arr[low], arr[high]);
389 if (arr[middle] > arr[low]) ELEM_SWAP(arr[middle], arr[low]) ;
391 /* Swap low item (now in position middle) into position (low+1) */
392 ELEM_SWAP(arr[middle], arr[low+1]) ;
394 /* Nibble from each end towards middle, swapping items when stuck */
398 do ll++; while (arr[low] > arr[ll]) ;
399 do hh--; while (arr[hh] > arr[low]) ;
404 ELEM_SWAP(arr[ll], arr[hh]) ;
407 /* Swap middle item (in position low) back into correct position */
408 ELEM_SWAP(arr[low], arr[hh]) ;
410 /* Re-set active partition */
418 smpl_t fvec_quadratic_peak_pos (fvec_t * x, uint_t pos) {
420 if (pos == 0 || pos == x->length - 1) return pos;
421 uint_t x0 = (pos < 1) ? pos : pos - 1;
422 uint_t x2 = (pos + 1 < x->length) ? pos + 1 : pos;
423 if (x0 == pos) return (x->data[pos] <= x->data[x2]) ? pos : x2;
424 if (x2 == pos) return (x->data[pos] <= x->data[x0]) ? pos : x0;
428 return pos + 0.5 * (s0 - s2 ) / (s0 - 2.* s1 + s2);
431 uint_t fvec_peakpick(fvec_t * onset, uint_t pos) {
433 tmp = (onset->data[pos] > onset->data[pos-1]
434 && onset->data[pos] > onset->data[pos+1]
435 && onset->data[pos] > 0.);
440 aubio_quadfrac (smpl_t s0, smpl_t s1, smpl_t s2, smpl_t pf)
443 s0 + (pf / 2.) * (pf * (s0 - 2. * s1 + s2) - 3. * s0 + 4. * s1 - s2);
448 aubio_freqtomidi (smpl_t freq)
450 if (freq < 2. || freq > 100000.) return 0.; // avoid nans and infs
451 /* log(freq/A-2)/log(2) */
452 smpl_t midi = freq / 6.875;
453 midi = LOG (midi) / 0.69314718055995;
460 aubio_miditofreq (smpl_t midi)
462 if (midi > 140.) return 0.; // avoid infs
463 smpl_t freq = (midi + 3.) / 12.;
464 freq = EXP (freq * 0.69314718055995);
470 aubio_bintofreq (smpl_t bin, smpl_t samplerate, smpl_t fftsize)
472 smpl_t freq = samplerate / fftsize;
473 return freq * MAX(bin, 0);
477 aubio_bintomidi (smpl_t bin, smpl_t samplerate, smpl_t fftsize)
479 smpl_t midi = aubio_bintofreq (bin, samplerate, fftsize);
480 return aubio_freqtomidi (midi);
484 aubio_freqtobin (smpl_t freq, smpl_t samplerate, smpl_t fftsize)
486 smpl_t bin = fftsize / samplerate;
487 return MAX(freq, 0) * bin;
491 aubio_miditobin (smpl_t midi, smpl_t samplerate, smpl_t fftsize)
493 smpl_t freq = aubio_miditofreq (midi);
494 return aubio_freqtobin (freq, samplerate, fftsize);
498 aubio_is_power_of_two (uint_t a)
500 if ((a & (a - 1)) == 0) {
508 aubio_next_power_of_two (uint_t a)
511 while (i < a) i <<= 1;
516 aubio_db_spl (fvec_t * o)
518 return 10. * LOG10 (aubio_level_lin (o));
522 aubio_silence_detection (fvec_t * o, smpl_t threshold)
524 return (aubio_db_spl (o) < threshold);
528 aubio_level_detection (fvec_t * o, smpl_t threshold)
530 smpl_t db_spl = aubio_db_spl (o);
531 if (db_spl < threshold) {
539 aubio_zero_crossing_rate (fvec_t * input)
543 for (j = 1; j < input->length; j++) {
544 // previous was strictly negative
545 if (input->data[j - 1] < 0.) {
546 // current is positive or null
547 if (input->data[j] >= 0.) {
550 // previous was positive or null
552 // current is strictly negative
553 if (input->data[j] < 0.) {
558 return zcr / (smpl_t) input->length;
562 aubio_autocorr (fvec_t * input, fvec_t * output)
564 uint_t i, j, length = input->length;
569 for (i = 0; i < length; i++) {
571 for (j = i; j < length; j++) {
572 tmp += data[j - i] * data[j];
574 acf[i] = tmp / (smpl_t) (length - i);