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"
27 void aubio_window(smpl_t *w, uint_t size, aubio_window_type wintype) {
30 case aubio_win_rectangle:
34 case aubio_win_hamming:
36 w[i] = 0.54 - 0.46 * COS(TWO_PI * i / (size));
38 case aubio_win_hanning:
40 w[i] = 0.5 - (0.5 * COS(TWO_PI * i / (size)));
42 case aubio_win_hanningz:
44 w[i] = 0.5 * (1.0 - COS(TWO_PI * i / (size)));
46 case aubio_win_blackman:
49 - 0.50 * COS( TWO_PI*i/(size-1.0))
50 + 0.08 * COS(2.0*TWO_PI*i/(size-1.0));
52 case aubio_win_blackman_harris:
55 - 0.48829 * COS( TWO_PI*i/(size-1.0))
56 + 0.14128 * COS(2.0*TWO_PI*i/(size-1.0))
57 - 0.01168 * COS(3.0*TWO_PI*i/(size-1.0));
59 case aubio_win_gaussian:
61 w[i] = EXP(- 1.0 / SQR(size) * SQR(2.0*i-size));
65 w[i] = 1.0 - SQR((2*i-size)/(size+1.0));
67 case aubio_win_parzen:
69 w[i] = 1.0 - ABS((2*i-size)/(size+1.0));
77 smpl_t aubio_unwrap2pi(smpl_t phase) {
78 /* mod(phase+pi,-2pi)+pi */
79 return phase + TWO_PI * (1. + FLOOR(-(phase+PI)/TWO_PI));
83 smpl_t vec_mean(fvec_t *s)
87 for (i=0; i < s->channels; i++)
88 for (j=0; j < s->length; j++)
90 return tmp/(smpl_t)(s->length);
94 smpl_t vec_sum(fvec_t *s)
98 for (i=0; i < s->channels; i++)
99 for (j=0; j < s->length; j++)
100 tmp += s->data[i][j];
105 smpl_t vec_max(fvec_t *s)
109 for (i=0; i < s->channels; i++)
110 for (j=0; j < s->length; j++)
111 tmp = (tmp > s->data[i][j])? tmp : s->data[i][j];
115 smpl_t vec_min(fvec_t *s)
118 smpl_t tmp = s->data[0][0];
119 for (i=0; i < s->channels; i++)
120 for (j=0; j < s->length; j++)
121 tmp = (tmp < s->data[i][j])? tmp : s->data[i][j] ;
126 uint_t vec_min_elem(fvec_t *s)
128 uint_t i,j=0, pos=0.;
129 smpl_t tmp = s->data[0][0];
130 for (i=0; i < s->channels; i++)
131 for (j=0; j < s->length; j++) {
132 pos = (tmp < s->data[i][j])? pos : j;
133 tmp = (tmp < s->data[i][j])? tmp : s->data[i][j] ;
138 uint_t vec_max_elem(fvec_t *s)
140 uint_t i,j=0, pos=0.;
142 for (i=0; i < s->channels; i++)
143 for (j=0; j < s->length; j++) {
144 pos = (tmp > s->data[i][j])? pos : j;
145 tmp = (tmp > s->data[i][j])? tmp : s->data[i][j] ;
150 void vec_shift(fvec_t *s)
154 for (i=0; i < s->channels; i++)
155 for (j=0; j < s->length / 2 ; j++) {
156 //tmp = s->data[i][j];
157 //s->data[i][j] = s->data[i][j+s->length/2];
158 //s->data[i][j+s->length/2] = tmp;
159 ELEM_SWAP(s->data[i][j],s->data[i][j+s->length/2]);
163 smpl_t vec_local_energy(fvec_t * f)
167 for (i=0;i<f->channels;i++)
168 for (j=0;j<f->length;j++)
169 locE+=SQR(f->data[i][j]);
173 smpl_t vec_local_hfc(fvec_t * f)
177 for (i=0;i<f->channels;i++)
178 for (j=0;j<f->length;j++)
179 locE+=(i+1)*f->data[i][j];
183 smpl_t vec_alpha_norm(fvec_t * DF, smpl_t alpha)
187 for (i=0;i<DF->channels;i++)
188 for (j=0;j<DF->length;j++)
189 tmp += POW(ABS(DF->data[i][j]),alpha);
190 return POW(tmp/DF->length,1./alpha);
194 void vec_dc_removal(fvec_t * mag)
197 uint_t length = mag->length, i=0, j;
199 for (j=0;j<length;j++) {
200 mag->data[i][j] -= mini;
205 void vec_alpha_normalise(fvec_t * mag, uint_t alpha)
208 uint_t length = mag->length, i=0, j;
209 alphan = vec_alpha_norm(mag,alpha);
210 for (j=0;j<length;j++){
211 mag->data[i][j] /= alphan;
216 void vec_add(fvec_t * mag, smpl_t threshold) {
217 uint_t length = mag->length, i=0, j;
218 for (j=0;j<length;j++) {
219 mag->data[i][j] += threshold;
224 void vec_adapt_thres(fvec_t * vec, fvec_t * tmp,
225 uint_t post, uint_t pre)
227 uint_t length = vec->length, i=0, j;
228 for (j=0;j<length;j++) {
229 vec->data[i][j] -= vec_moving_thres(vec, tmp, post, pre, j);
233 smpl_t vec_moving_thres(fvec_t * vec, fvec_t * tmpvec,
234 uint_t post, uint_t pre, uint_t pos)
236 smpl_t * medar = (smpl_t *)tmpvec->data[0];
238 uint_t win_length = post+pre+1;
239 uint_t length = vec->length;
240 /* post part of the buffer does not exist */
242 for (k=0;k<post+1-pos;k++)
243 medar[k] = 0.; /* 0-padding at the beginning */
244 for (k=post+1-pos;k<win_length;k++)
245 medar[k] = vec->data[0][k+pos-post];
246 /* the buffer is fully defined */
247 } else if (pos+pre<length) {
248 for (k=0;k<win_length;k++)
249 medar[k] = vec->data[0][k+pos-post];
250 /* pre part of the buffer does not exist */
252 for (k=0;k<length-pos+post+1;k++)
253 medar[k] = vec->data[0][k+pos-post];
254 for (k=length-pos+post+1;k<win_length;k++)
255 medar[k] = 0.; /* 0-padding at the end */
257 return vec_median(tmpvec);
260 smpl_t vec_median(fvec_t * input) {
261 uint_t n = input->length;
262 smpl_t * arr = (smpl_t *) input->data[0];
265 uint_t middle, ll, hh;
267 low = 0 ; high = n-1 ; median = (low + high) / 2;
269 if (high <= low) /* One element only */
272 if (high == low + 1) { /* Two elements only */
273 if (arr[low] > arr[high])
274 ELEM_SWAP(arr[low], arr[high]) ;
278 /* Find median of low, middle and high items; swap into position low */
279 middle = (low + high) / 2;
280 if (arr[middle] > arr[high]) ELEM_SWAP(arr[middle], arr[high]);
281 if (arr[low] > arr[high]) ELEM_SWAP(arr[low], arr[high]);
282 if (arr[middle] > arr[low]) ELEM_SWAP(arr[middle], arr[low]) ;
284 /* Swap low item (now in position middle) into position (low+1) */
285 ELEM_SWAP(arr[middle], arr[low+1]) ;
287 /* Nibble from each end towards middle, swapping items when stuck */
291 do ll++; while (arr[low] > arr[ll]) ;
292 do hh--; while (arr[hh] > arr[low]) ;
297 ELEM_SWAP(arr[ll], arr[hh]) ;
300 /* Swap middle item (in position low) back into correct position */
301 ELEM_SWAP(arr[low], arr[hh]) ;
303 /* Re-set active partition */
311 smpl_t vec_quadint(fvec_t * x,uint_t pos) {
313 smpl_t step = 1./200.;
314 /* hack : init resold to - something (in case x[pos+-span]<0)) */
315 smpl_t res, frac, s0, s1, s2, exactpos = (smpl_t)pos, resold = -1000.;
316 if ((pos > span) && (pos < x->length-span)) {
317 s0 = x->data[0][pos-span];
318 s1 = x->data[0][pos] ;
319 s2 = x->data[0][pos+span];
321 for (frac = 0.; frac < 2.; frac = frac + step) {
322 res = aubio_quadfrac(s0, s1, s2, frac);
326 exactpos += (frac-step)*2. - 1.;
334 smpl_t vec_quadint_min(fvec_t * x,uint_t pos, uint_t span) {
335 smpl_t step = 1./200.;
336 /* init resold to - something (in case x[pos+-span]<0)) */
337 smpl_t res, frac, s0, s1, s2, exactpos = (smpl_t)pos, resold = 100000.;
338 if ((pos > span) && (pos < x->length-span)) {
339 s0 = x->data[0][pos-span];
340 s1 = x->data[0][pos] ;
341 s2 = x->data[0][pos+span];
343 for (frac = 0.; frac < 2.; frac = frac + step) {
344 res = aubio_quadfrac(s0, s1, s2, frac);
348 exactpos += (frac-step)*span - span/2.;
356 smpl_t aubio_quadfrac(smpl_t s0, smpl_t s1, smpl_t s2, smpl_t pf) {
357 smpl_t tmp = s0 + (pf/2.) * (pf * ( s0 - 2.*s1 + s2 ) - 3.*s0 + 4.*s1 - s2);
361 uint_t vec_peakpick(fvec_t * onset, uint_t pos) {
363 /*for (i=0;i<onset->channels;i++)*/
364 tmp = (onset->data[i][pos] > onset->data[i][pos-1]
365 && onset->data[i][pos] > onset->data[i][pos+1]
366 && onset->data[i][pos] > 0.);
370 smpl_t aubio_freqtomidi(smpl_t freq) {
371 /* log(freq/A-2)/log(2) */
372 smpl_t midi = freq/6.875;
373 midi = LOG(midi)/0.69314718055995;
379 smpl_t aubio_miditofreq(smpl_t midi) {
380 smpl_t freq = (midi+3.)/12.;
381 freq = EXP(freq*0.69314718055995);
386 smpl_t aubio_bintofreq(smpl_t bin, smpl_t samplerate, smpl_t fftsize) {
387 smpl_t freq = samplerate/fftsize;
391 smpl_t aubio_bintomidi(smpl_t bin, smpl_t samplerate, smpl_t fftsize) {
392 smpl_t midi = aubio_bintofreq(bin,samplerate,fftsize);
393 return aubio_freqtomidi(midi);
396 smpl_t aubio_freqtobin(smpl_t freq, smpl_t samplerate, smpl_t fftsize) {
397 smpl_t bin = fftsize/samplerate;
401 smpl_t aubio_miditobin(smpl_t midi, smpl_t samplerate, smpl_t fftsize) {
402 smpl_t freq = aubio_miditofreq(midi);
403 return aubio_freqtobin(freq,samplerate,fftsize);
408 /** returns 1 if wassilence is 0 and RMS(ibuf)<threshold
411 uint_t aubio_silence_detection(fvec_t * ibuf, smpl_t threshold) {
414 for (j=0;j<ibuf->length;j++) {
415 loudness += SQR(ibuf->data[i][j]);
417 loudness = SQRT(loudness);
418 loudness /= (smpl_t)ibuf->length;
419 loudness = LIN2DB(loudness);
421 return (loudness < threshold);
424 /** returns level log(RMS(ibuf)) if < threshold, 1 otherwise
427 smpl_t aubio_level_detection(fvec_t * ibuf, smpl_t threshold) {
430 for (j=0;j<ibuf->length;j++) {
431 loudness += SQR(ibuf->data[i][j]);
433 loudness = SQRT(loudness);
434 loudness /= (smpl_t)ibuf->length;
435 loudness = LIN2DB(loudness);
437 if (loudness < threshold)
443 smpl_t aubio_zero_crossing_rate(fvec_t * input) {
446 for ( j = 1; j < input->length; j++ ) {
447 // previous was negative
448 if( input->data[i][j-1] <= 0. ) {
449 if ( input->data[i][j] > 0. ) {
452 //previous was positive
453 } else if ( input->data[i][j] <= 0. ){
457 return zcr/(smpl_t)input->length;
460 smpl_t aubio_spectral_centroid(cvec_t * spectrum, smpl_t samplerate) {
462 smpl_t sum = 0., sc = 0.;
463 for ( j = 0; j < spectrum->length; j++ ) {
464 sum += spectrum->norm[i][j];
466 if (sum == 0.) return 0.;
467 for ( j = 0; j < spectrum->length; j++ ) {
468 sc += (smpl_t)j * spectrum->norm[i][j];
470 return sc / sum * samplerate / (smpl_t)(spectrum->length);
473 void aubio_autocorr(fvec_t * input, fvec_t * output){
474 uint_t i = 0, j = 0, length = input->length;
475 smpl_t * data = input->data[0];
476 smpl_t * acf = output->data[0];
478 for(i=0;i<length;i++){
479 for(j=i;j<length;j++){
480 tmp += data[j-i]*data[j];
482 acf[i] = tmp /(smpl_t)(length-i);
487 void aubio_cleanup(void)