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);
56 err = fvec_set_window (win, window_type);
64 uint_t fvec_set_window (fvec_t *win, char_t *window_type) {
65 smpl_t * w = win->data;
66 uint_t i, size = win->length;
67 aubio_window_type wintype;
68 if (window_type == NULL) {
69 AUBIO_ERR ("window type can not be null.\n");
71 } else if (strcmp (window_type, "rectangle") == 0)
72 wintype = aubio_win_rectangle;
73 else if (strcmp (window_type, "hamming") == 0)
74 wintype = aubio_win_hamming;
75 else if (strcmp (window_type, "hanning") == 0)
76 wintype = aubio_win_hanning;
77 else if (strcmp (window_type, "hanningz") == 0)
78 wintype = aubio_win_hanningz;
79 else if (strcmp (window_type, "blackman") == 0)
80 wintype = aubio_win_blackman;
81 else if (strcmp (window_type, "blackman_harris") == 0)
82 wintype = aubio_win_blackman_harris;
83 else if (strcmp (window_type, "gaussian") == 0)
84 wintype = aubio_win_gaussian;
85 else if (strcmp (window_type, "welch") == 0)
86 wintype = aubio_win_welch;
87 else if (strcmp (window_type, "parzen") == 0)
88 wintype = aubio_win_parzen;
89 else if (strcmp (window_type, "default") == 0)
90 wintype = aubio_win_default;
92 AUBIO_ERR ("unknown window type `%s`.\n", window_type);
96 case aubio_win_rectangle:
100 case aubio_win_hamming:
102 w[i] = 0.54 - 0.46 * COS(TWO_PI * i / (size));
104 case aubio_win_hanning:
106 w[i] = 0.5 - (0.5 * COS(TWO_PI * i / (size)));
108 case aubio_win_hanningz:
110 w[i] = 0.5 * (1.0 - COS(TWO_PI * i / (size)));
112 case aubio_win_blackman:
115 - 0.50 * COS( TWO_PI*i/(size-1.0))
116 + 0.08 * COS(2.0*TWO_PI*i/(size-1.0));
118 case aubio_win_blackman_harris:
121 - 0.48829 * COS( TWO_PI*i/(size-1.0))
122 + 0.14128 * COS(2.0*TWO_PI*i/(size-1.0))
123 - 0.01168 * COS(3.0*TWO_PI*i/(size-1.0));
125 case aubio_win_gaussian:
127 lsmp_t a, b, c = 0.5;
129 for (n = 0; n < size; n++)
131 a = (n-c*(size-1))/(SQR(c)*(size-1));
137 case aubio_win_welch:
139 w[i] = 1.0 - SQR((2.*i-size)/(size+1.0));
141 case aubio_win_parzen:
143 w[i] = 1.0 - ABS((2.*i-size)/(size+1.0));
152 aubio_unwrap2pi (smpl_t phase)
154 /* mod(phase+pi,-2pi)+pi */
155 return phase + TWO_PI * (1. + FLOOR (-(phase + PI) / TWO_PI));
159 fvec_mean (fvec_t * s)
163 for (j = 0; j < s->length; j++) {
166 return tmp / (smpl_t) (s->length);
170 fvec_sum (fvec_t * s)
174 for (j = 0; j < s->length; j++) {
181 fvec_max (fvec_t * s)
183 #ifndef HAVE_ACCELERATE
186 for (j = 0; j < s->length; j++) {
187 tmp = (tmp > s->data[j]) ? tmp : s->data[j];
191 #if !HAVE_AUBIO_DOUBLE
192 vDSP_maxv(s->data, 1, &tmp, s->length);
194 vDSP_maxvD(s->data, 1, &tmp, s->length);
201 fvec_min (fvec_t * s)
203 #ifndef HAVE_ACCELERATE
205 smpl_t tmp = s->data[0];
206 for (j = 0; j < s->length; j++) {
207 tmp = (tmp < s->data[j]) ? tmp : s->data[j];
211 #if !HAVE_AUBIO_DOUBLE
212 vDSP_minv(s->data, 1, &tmp, s->length);
214 vDSP_minvD(s->data, 1, &tmp, s->length);
221 fvec_min_elem (fvec_t * s)
223 #ifndef HAVE_ACCELERATE
225 smpl_t tmp = s->data[0];
226 for (j = 0; j < s->length; j++) {
227 pos = (tmp < s->data[j]) ? pos : j;
228 tmp = (tmp < s->data[j]) ? tmp : s->data[j];
233 #if !HAVE_AUBIO_DOUBLE
234 vDSP_minvi(s->data, 1, &tmp, (vDSP_Length *)&pos, s->length);
236 vDSP_minviD(s->data, 1, &tmp, (vDSP_Length *)&pos, s->length);
243 fvec_max_elem (fvec_t * s)
245 #ifndef HAVE_ACCELERATE
248 for (j = 0; j < s->length; j++) {
249 pos = (tmp > s->data[j]) ? pos : j;
250 tmp = (tmp > s->data[j]) ? tmp : s->data[j];
255 #if !HAVE_AUBIO_DOUBLE
256 vDSP_maxvi(s->data, 1, &tmp, (vDSP_Length *)&pos, s->length);
258 vDSP_maxviD(s->data, 1, &tmp, (vDSP_Length *)&pos, s->length);
265 fvec_shift (fvec_t * s)
268 for (j = 0; j < s->length / 2; j++) {
269 ELEM_SWAP (s->data[j], s->data[j + s->length / 2]);
274 aubio_level_lin (fvec_t * f)
278 for (j = 0; j < f->length; j++) {
279 energy += SQR (f->data[j]);
281 return energy / f->length;
285 fvec_local_hfc (fvec_t * v)
289 for (j = 0; j < v->length; j++) {
290 hfc += (j + 1) * v->data[j];
296 fvec_min_removal (fvec_t * v)
298 smpl_t v_min = fvec_min (v);
299 fvec_add (v, - v_min );
303 fvec_alpha_norm (fvec_t * o, smpl_t alpha)
307 for (j = 0; j < o->length; j++) {
308 tmp += POW (ABS (o->data[j]), alpha);
310 return POW (tmp / o->length, 1. / alpha);
314 fvec_alpha_normalise (fvec_t * o, smpl_t alpha)
317 smpl_t norm = fvec_alpha_norm (o, alpha);
318 for (j = 0; j < o->length; j++) {
324 fvec_add (fvec_t * o, smpl_t val)
327 for (j = 0; j < o->length; j++) {
332 void fvec_adapt_thres(fvec_t * vec, fvec_t * tmp,
333 uint_t post, uint_t pre) {
334 uint_t length = vec->length, j;
335 for (j=0;j<length;j++) {
336 vec->data[j] -= fvec_moving_thres(vec, tmp, post, pre, j);
341 fvec_moving_thres (fvec_t * vec, fvec_t * tmpvec,
342 uint_t post, uint_t pre, uint_t pos)
345 smpl_t *medar = (smpl_t *) tmpvec->data;
346 uint_t win_length = post + pre + 1;
347 uint_t length = vec->length;
348 /* post part of the buffer does not exist */
349 if (pos < post + 1) {
350 for (k = 0; k < post + 1 - pos; k++)
351 medar[k] = 0.; /* 0-padding at the beginning */
352 for (k = post + 1 - pos; k < win_length; k++)
353 medar[k] = vec->data[k + pos - post];
354 /* the buffer is fully defined */
355 } else if (pos + pre < length) {
356 for (k = 0; k < win_length; k++)
357 medar[k] = vec->data[k + pos - post];
358 /* pre part of the buffer does not exist */
360 for (k = 0; k < length - pos + post; k++)
361 medar[k] = vec->data[k + pos - post];
362 for (k = length - pos + post; k < win_length; k++)
363 medar[k] = 0.; /* 0-padding at the end */
365 return fvec_median (tmpvec);
368 smpl_t fvec_median (fvec_t * input) {
369 uint_t n = input->length;
370 smpl_t * arr = (smpl_t *) input->data;
373 uint_t middle, ll, hh;
375 low = 0 ; high = n-1 ; median = (low + high) / 2;
377 if (high <= low) /* One element only */
380 if (high == low + 1) { /* Two elements only */
381 if (arr[low] > arr[high])
382 ELEM_SWAP(arr[low], arr[high]) ;
386 /* Find median of low, middle and high items; swap into position low */
387 middle = (low + high) / 2;
388 if (arr[middle] > arr[high]) ELEM_SWAP(arr[middle], arr[high]);
389 if (arr[low] > arr[high]) ELEM_SWAP(arr[low], arr[high]);
390 if (arr[middle] > arr[low]) ELEM_SWAP(arr[middle], arr[low]) ;
392 /* Swap low item (now in position middle) into position (low+1) */
393 ELEM_SWAP(arr[middle], arr[low+1]) ;
395 /* Nibble from each end towards middle, swapping items when stuck */
399 do ll++; while (arr[low] > arr[ll]) ;
400 do hh--; while (arr[hh] > arr[low]) ;
405 ELEM_SWAP(arr[ll], arr[hh]) ;
408 /* Swap middle item (in position low) back into correct position */
409 ELEM_SWAP(arr[low], arr[hh]) ;
411 /* Re-set active partition */
419 smpl_t fvec_quadratic_peak_pos (fvec_t * x, uint_t pos) {
420 smpl_t s0, s1, s2; uint_t x0, x2;
421 if (pos == 0 || pos == x->length - 1) return pos;
422 x0 = (pos < 1) ? pos : pos - 1;
423 x2 = (pos + 1 < x->length) ? pos + 1 : pos;
424 if (x0 == pos) return (x->data[pos] <= x->data[x2]) ? pos : x2;
425 if (x2 == pos) return (x->data[pos] <= x->data[x0]) ? pos : x0;
429 return pos + 0.5 * (s0 - s2 ) / (s0 - 2.* s1 + s2);
432 uint_t fvec_peakpick(fvec_t * onset, uint_t pos) {
434 tmp = (onset->data[pos] > onset->data[pos-1]
435 && onset->data[pos] > onset->data[pos+1]
436 && onset->data[pos] > 0.);
441 aubio_quadfrac (smpl_t s0, smpl_t s1, smpl_t s2, smpl_t pf)
444 s0 + (pf / 2.) * (pf * (s0 - 2. * s1 + s2) - 3. * s0 + 4. * s1 - s2);
449 aubio_freqtomidi (smpl_t freq)
452 if (freq < 2. || freq > 100000.) return 0.; // avoid nans and infs
453 /* log(freq/A-2)/log(2) */
455 midi = LOG (midi) / 0.69314718055995;
462 aubio_miditofreq (smpl_t midi)
465 if (midi > 140.) return 0.; // avoid infs
466 freq = (midi + 3.) / 12.;
467 freq = EXP (freq * 0.69314718055995);
473 aubio_bintofreq (smpl_t bin, smpl_t samplerate, smpl_t fftsize)
475 smpl_t freq = samplerate / fftsize;
476 return freq * MAX(bin, 0);
480 aubio_bintomidi (smpl_t bin, smpl_t samplerate, smpl_t fftsize)
482 smpl_t midi = aubio_bintofreq (bin, samplerate, fftsize);
483 return aubio_freqtomidi (midi);
487 aubio_freqtobin (smpl_t freq, smpl_t samplerate, smpl_t fftsize)
489 smpl_t bin = fftsize / samplerate;
490 return MAX(freq, 0) * bin;
494 aubio_miditobin (smpl_t midi, smpl_t samplerate, smpl_t fftsize)
496 smpl_t freq = aubio_miditofreq (midi);
497 return aubio_freqtobin (freq, samplerate, fftsize);
501 aubio_is_power_of_two (uint_t a)
503 if ((a & (a - 1)) == 0) {
511 aubio_next_power_of_two (uint_t a)
514 while (i < a) i <<= 1;
519 aubio_db_spl (fvec_t * o)
521 return 10. * LOG10 (aubio_level_lin (o));
525 aubio_silence_detection (fvec_t * o, smpl_t threshold)
527 return (aubio_db_spl (o) < threshold);
531 aubio_level_detection (fvec_t * o, smpl_t threshold)
533 smpl_t db_spl = aubio_db_spl (o);
534 if (db_spl < threshold) {
542 aubio_zero_crossing_rate (fvec_t * input)
546 for (j = 1; j < input->length; j++) {
547 // previous was strictly negative
548 if (input->data[j - 1] < 0.) {
549 // current is positive or null
550 if (input->data[j] >= 0.) {
553 // previous was positive or null
555 // current is strictly negative
556 if (input->data[j] < 0.) {
561 return zcr / (smpl_t) input->length;
565 aubio_autocorr (fvec_t * input, fvec_t * output)
567 uint_t i, j, length = input->length;
572 for (i = 0; i < length; i++) {
574 for (j = i; j < length; j++) {
575 tmp += data[j - i] * data[j];
577 acf[i] = tmp / (smpl_t) (length - i);