jamie@1
|
1 /* libxtract feature extraction library
|
jamie@1
|
2 *
|
jamie@1
|
3 * Copyright (C) 2006 Jamie Bullock
|
jamie@1
|
4 *
|
jamie@1
|
5 * This program is free software; you can redistribute it and/or modify
|
jamie@1
|
6 * it under the terms of the GNU General Public License as published by
|
jamie@1
|
7 * the Free Software Foundation; either version 2 of the License, or
|
jamie@1
|
8 * (at your option) any later version.
|
jamie@1
|
9 *
|
jamie@1
|
10 * This program is distributed in the hope that it will be useful,
|
jamie@1
|
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
|
jamie@1
|
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
jamie@1
|
13 * GNU General Public License for more details.
|
jamie@1
|
14 *
|
jamie@1
|
15 * You should have received a copy of the GNU General Public License
|
jamie@1
|
16 * along with this program; if not, write to the Free Software
|
jamie@1
|
17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
|
jamie@1
|
18 * USA.
|
jamie@1
|
19 */
|
jamie@1
|
20
|
jamie@1
|
21
|
jamie@1
|
22 /* xtract_vector.c: defines functions that extract a feature as a single value from an input vector */
|
jamie@1
|
23
|
jamie@1
|
24 #include "xtract/libxtract.h"
|
jamie@56
|
25 #include "xtract_macros_private.h"
|
jamie@1
|
26 #include <math.h>
|
jamie@43
|
27 #include <string.h>
|
jamie@43
|
28 #include <stdlib.h>
|
jamie@30
|
29
|
jamie@30
|
30 #ifdef XTRACT_FFT
|
jamie@30
|
31
|
jamie@1
|
32 #include <fftw3.h>
|
jamie@1
|
33
|
jamie@54
|
34 int xtract_spectrum(const float *data, const int N, const void *argv, float *result){
|
jamie@1
|
35
|
jamie@56
|
36 float *input, *rfft, q, temp;
|
jamie@43
|
37 size_t bytes;
|
jamie@70
|
38 int n , NxN, M, vector, withDC;
|
jamie@1
|
39 fftwf_plan plan;
|
jamie@1
|
40
|
jamie@54
|
41 M = N >> 1;
|
jamie@56
|
42 NxN = XTRACT_SQ(N);
|
jamie@70
|
43 withDC = 0;
|
jamie@54
|
44
|
jamie@54
|
45 rfft = (float *)fftwf_malloc(N * sizeof(float));
|
jamie@43
|
46 input = (float *)malloc(bytes = N * sizeof(float));
|
jamie@43
|
47 input = memcpy(input, data, bytes);
|
jamie@1
|
48
|
jamie@56
|
49 q = *(float *)argv;
|
jamie@54
|
50 vector = (int)*((float *)argv+1);
|
jamie@70
|
51 withDC = (int)*((float *)argv+2);
|
jamie@46
|
52
|
jamie@56
|
53 XTRACT_CHECK_q;
|
jamie@46
|
54
|
jamie@54
|
55 plan = fftwf_plan_r2r_1d(N, input, rfft, FFTW_R2HC, FFTW_ESTIMATE);
|
jamie@1
|
56
|
jamie@1
|
57 fftwf_execute(plan);
|
jamie@54
|
58
|
jamie@54
|
59 switch(vector){
|
jamie@67
|
60
|
jamie@56
|
61 case XTRACT_LOG_MAGNITUDE_SPECTRUM:
|
jamie@67
|
62 for(n = 1; n < M; n++){
|
jamie@67
|
63 if ((temp = XTRACT_SQ(rfft[n]) +
|
jamie@70
|
64 XTRACT_SQ(rfft[N - n])) > XTRACT_LOG_LIMIT)
|
jamie@54
|
65 temp = log(sqrt(temp) / N);
|
jamie@54
|
66 else
|
jamie@56
|
67 temp = XTRACT_LOG_LIMIT_DB;
|
jamie@70
|
68 if(withDC) {
|
jamie@70
|
69 result[n] =
|
jamie@70
|
70 /*Normalise*/
|
jamie@70
|
71 (temp + XTRACT_DB_SCALE_OFFSET) /
|
jamie@70
|
72 XTRACT_DB_SCALE_OFFSET;
|
jamie@70
|
73 result[M + n + 1] = n * q;
|
jamie@70
|
74 }
|
jamie@70
|
75 else {
|
jamie@70
|
76 result[n - 1] =
|
jamie@70
|
77 (temp + XTRACT_DB_SCALE_OFFSET) /
|
jamie@70
|
78 XTRACT_DB_SCALE_OFFSET;
|
jamie@70
|
79 result[M + n - 1] = n * q;
|
jamie@70
|
80 }
|
jamie@54
|
81 }
|
jamie@54
|
82 break;
|
jamie@67
|
83
|
jamie@56
|
84 case XTRACT_POWER_SPECTRUM:
|
jamie@67
|
85 for(n = 1; n < M; n++){
|
jamie@70
|
86 if(withDC){
|
jamie@70
|
87 result[n] = (XTRACT_SQ(rfft[n]) + XTRACT_SQ(rfft[N - n]))
|
jamie@70
|
88 / NxN;
|
jamie@70
|
89 result[M + n + 1] = n * q;
|
jamie@70
|
90 }
|
jamie@70
|
91 else {
|
jamie@70
|
92 result[n - 1] =
|
jamie@70
|
93 (XTRACT_SQ(rfft[n]) + XTRACT_SQ(rfft[N - n])) / NxN;
|
jamie@70
|
94 result[M + n - 1] = n * q;
|
jamie@70
|
95 }
|
jamie@54
|
96 }
|
jamie@54
|
97 break;
|
jamie@67
|
98
|
jamie@56
|
99 case XTRACT_LOG_POWER_SPECTRUM:
|
jamie@67
|
100 for(n = 1; n < M; n++){
|
jamie@70
|
101 if ((temp = XTRACT_SQ(rfft[n]) + XTRACT_SQ(rfft[N - n])) >
|
jamie@67
|
102 XTRACT_LOG_LIMIT)
|
jamie@54
|
103 temp = log(temp / NxN);
|
jamie@54
|
104 else
|
jamie@56
|
105 temp = XTRACT_LOG_LIMIT_DB;
|
jamie@70
|
106 if(withDC){
|
jamie@70
|
107 result[n] = (temp + XTRACT_DB_SCALE_OFFSET) /
|
jamie@70
|
108 XTRACT_DB_SCALE_OFFSET;
|
jamie@70
|
109 result[M + n + 1] = n * q;
|
jamie@70
|
110 }
|
jamie@70
|
111 else {
|
jamie@70
|
112 result[n - 1] = (temp + XTRACT_DB_SCALE_OFFSET) /
|
jamie@70
|
113 XTRACT_DB_SCALE_OFFSET;
|
jamie@70
|
114 result[M + n - 1] = n * q;
|
jamie@70
|
115 }
|
jamie@54
|
116 }
|
jamie@54
|
117 break;
|
jamie@67
|
118
|
jamie@54
|
119 default:
|
jamie@54
|
120 /* MAGNITUDE_SPECTRUM */
|
jamie@67
|
121 for(n = 1; n < M; n++){
|
jamie@70
|
122 if(withDC){
|
jamie@70
|
123 result[n] = sqrt(XTRACT_SQ(rfft[n]) +
|
jamie@70
|
124 XTRACT_SQ(rfft[N - n])) / N;
|
jamie@70
|
125 result[M + n + 1] = n * q;
|
jamie@70
|
126 }
|
jamie@70
|
127 else {
|
jamie@70
|
128 result[n - 1] = sqrt(XTRACT_SQ(rfft[n]) +
|
jamie@70
|
129 XTRACT_SQ(rfft[N - n])) / N;
|
jamie@70
|
130 result[M + n - 1] = n * q;
|
jamie@70
|
131 }
|
jamie@54
|
132 }
|
jamie@54
|
133 break;
|
jamie@1
|
134 }
|
jamie@1
|
135
|
jamie@70
|
136 if(withDC){
|
jamie@70
|
137 /* The DC component */
|
jamie@70
|
138 result[0] = XTRACT_SQ(rfft[0]);
|
jamie@70
|
139 result[M + 1] = 0.f;
|
jamie@70
|
140 /* The Nyquist */
|
jamie@70
|
141 result[M] = XTRACT_SQ(rfft[M]);
|
jamie@70
|
142 result[N + 1] = q * M;
|
jamie@70
|
143 }
|
jamie@70
|
144 else {
|
jamie@70
|
145 /* The Nyquist */
|
jamie@70
|
146 result[M - 1] = XTRACT_SQ(rfft[M]);
|
jamie@70
|
147 result[N - 1] = q * M;
|
jamie@70
|
148 }
|
jamie@1
|
149
|
jamie@1
|
150 fftwf_destroy_plan(plan);
|
jamie@54
|
151 fftwf_free(rfft);
|
jamie@43
|
152 free(input);
|
jamie@1
|
153
|
jamie@56
|
154 return XTRACT_SUCCESS;
|
jamie@1
|
155 }
|
jamie@1
|
156
|
jamie@43
|
157 int xtract_autocorrelation_fft(const float *data, const int N, const void *argv, float *result){
|
jamie@1
|
158
|
jamie@43
|
159 float *temp, *input;
|
jamie@43
|
160 size_t bytes;
|
jamie@1
|
161 int n;
|
jamie@1
|
162 fftwf_plan plan;
|
jamie@1
|
163
|
jamie@1
|
164 temp = (float *)fftwf_malloc(N * sizeof(float));
|
jamie@43
|
165 input = (float *)malloc(bytes = N * sizeof(float));
|
jamie@43
|
166 input = memcpy(input, data, bytes);
|
jamie@43
|
167
|
jamie@43
|
168 plan = fftwf_plan_r2r_1d(N, input, temp, FFTW_HC2R, FFTW_ESTIMATE);
|
jamie@1
|
169
|
jamie@1
|
170 fftwf_execute(plan);
|
jamie@1
|
171
|
jamie@1
|
172 for(n = 0; n < N - 1; n++)
|
jamie@1
|
173 result[n] = temp[n+1];
|
jamie@1
|
174
|
jamie@1
|
175 fftwf_destroy_plan(plan);
|
jamie@1
|
176 fftwf_free(temp);
|
jamie@43
|
177 free(input);
|
jamie@38
|
178
|
jamie@56
|
179 return XTRACT_SUCCESS;
|
jamie@1
|
180 }
|
jamie@1
|
181
|
jamie@43
|
182 int xtract_mfcc(const float *data, const int N, const void *argv, float *result){
|
jamie@30
|
183
|
jamie@30
|
184 xtract_mel_filter *f;
|
jamie@43
|
185 float *input;
|
jamie@43
|
186 size_t bytes;
|
jamie@30
|
187 int n, filter;
|
jamie@30
|
188
|
jamie@30
|
189 f = (xtract_mel_filter *)argv;
|
jamie@39
|
190
|
jamie@43
|
191 input = (float *)malloc(bytes = N * sizeof(float));
|
jamie@43
|
192 input = memcpy(input, data, bytes);
|
jamie@43
|
193
|
jamie@30
|
194 for(filter = 0; filter < f->n_filters; filter++){
|
danstowell@68
|
195 result[filter] = 0.f;
|
jamie@30
|
196 for(n = 0; n < N; n++){
|
jamie@43
|
197 result[filter] += input[n] * f->filters[filter][n];
|
jamie@30
|
198 }
|
danstowell@69
|
199 result[filter] = log(result[filter] < XTRACT_LOG_LIMIT ? XTRACT_LOG_LIMIT : result[filter]);
|
jamie@30
|
200 }
|
jamie@30
|
201
|
jamie@30
|
202 for(n = filter + 1; n < N; n++) result[n] = 0;
|
jamie@30
|
203
|
jamie@30
|
204 xtract_dct(result, f->n_filters, NULL, result);
|
jamie@30
|
205
|
jamie@43
|
206 free(input);
|
jamie@43
|
207
|
jamie@56
|
208 return XTRACT_SUCCESS;
|
jamie@30
|
209 }
|
jamie@30
|
210
|
jamie@43
|
211 int xtract_dct(const float *data, const int N, const void *argv, float *result){
|
jamie@30
|
212
|
jamie@30
|
213 fftwf_plan plan;
|
jamie@43
|
214 float *input;
|
jamie@43
|
215 size_t bytes;
|
jamie@30
|
216
|
jamie@43
|
217 input = (float *)malloc(bytes = N * sizeof(float));
|
jamie@43
|
218 input = memcpy(input, data, bytes);
|
jamie@43
|
219
|
jamie@30
|
220 plan =
|
jamie@43
|
221 fftwf_plan_r2r_1d(N, input, result, FFTW_REDFT00, FFTW_ESTIMATE);
|
jamie@30
|
222
|
jamie@30
|
223 fftwf_execute(plan);
|
jamie@30
|
224 fftwf_destroy_plan(plan);
|
jamie@43
|
225 free(input);
|
jamie@38
|
226
|
jamie@56
|
227 return XTRACT_SUCCESS;
|
jamie@30
|
228 }
|
jamie@30
|
229
|
jamie@30
|
230 #else
|
jamie@30
|
231
|
jamie@67
|
232 int xtract_spectrum(const float *data, const int N, const void *argv, float *result){
|
jamie@30
|
233
|
danstowell@66
|
234 XTRACT_NEEDS_FFTW;
|
danstowell@66
|
235 return XTRACT_NO_RESULT;
|
jamie@30
|
236
|
jamie@30
|
237 }
|
jamie@30
|
238
|
jamie@43
|
239 int xtract_autocorrelation_fft(const float *data, const int N, const void *argv, float *result){
|
jamie@30
|
240
|
danstowell@66
|
241 XTRACT_NEEDS_FFTW;
|
danstowell@66
|
242 return XTRACT_NO_RESULT;
|
jamie@30
|
243
|
jamie@30
|
244 }
|
jamie@30
|
245
|
jamie@43
|
246 int xtract_mfcc(const float *data, const int N, const void *argv, float *result){
|
jamie@30
|
247
|
danstowell@66
|
248 XTRACT_NEEDS_FFTW;
|
danstowell@66
|
249 return XTRACT_NO_RESULT;
|
jamie@30
|
250
|
jamie@30
|
251 }
|
jamie@30
|
252
|
jamie@43
|
253 int xtract_dct(const float *data, const int N, const void *argv, float *result){
|
jamie@30
|
254
|
danstowell@66
|
255 XTRACT_NEEDS_FFTW;
|
danstowell@66
|
256 return XTRACT_NO_RESULT;
|
jamie@30
|
257
|
jamie@30
|
258 }
|
jamie@30
|
259
|
jamie@30
|
260 #endif
|
jamie@30
|
261
|
jamie@43
|
262 int xtract_autocorrelation(const float *data, const int N, const void *argv, float *result){
|
jamie@30
|
263
|
jamie@30
|
264 /* Naive time domain implementation */
|
jamie@30
|
265
|
jamie@30
|
266 int n = N, i;
|
jamie@30
|
267
|
jamie@30
|
268 float corr;
|
jamie@30
|
269
|
jamie@30
|
270 while(n--){
|
jamie@30
|
271 corr = 0;
|
jamie@30
|
272 for(i = 0; i < N - n; i++){
|
jamie@30
|
273 corr += data[i] * data[i + n];
|
jamie@30
|
274 }
|
jamie@30
|
275 result[n] = corr / N;
|
jamie@30
|
276 }
|
jamie@38
|
277
|
jamie@56
|
278 return XTRACT_SUCCESS;
|
jamie@30
|
279 }
|
jamie@30
|
280
|
jamie@43
|
281 int xtract_amdf(const float *data, const int N, const void *argv, float *result){
|
jamie@1
|
282
|
jamie@1
|
283 int n = N, i;
|
jamie@1
|
284
|
jamie@6
|
285 float md, temp;
|
jamie@1
|
286
|
jamie@1
|
287 while(n--){
|
jamie@1
|
288 md = 0;
|
jamie@1
|
289 for(i = 0; i < N - n; i++){
|
jamie@6
|
290 temp = data[i] - data[i + n];
|
jamie@6
|
291 temp = (temp < 0 ? -temp : temp);
|
jamie@6
|
292 md += temp;
|
jamie@1
|
293 }
|
jamie@1
|
294 result[n] = md / N;
|
jamie@1
|
295 }
|
jamie@38
|
296
|
jamie@56
|
297 return XTRACT_SUCCESS;
|
jamie@1
|
298 }
|
jamie@1
|
299
|
jamie@43
|
300 int xtract_asdf(const float *data, const int N, const void *argv, float *result){
|
jamie@1
|
301
|
jamie@1
|
302 int n = N, i;
|
jamie@1
|
303
|
jamie@1
|
304 float sd;
|
jamie@1
|
305
|
jamie@1
|
306 while(n--){
|
jamie@1
|
307 sd = 0;
|
jamie@1
|
308 for(i = 0; i < N - n; i++){
|
jamie@6
|
309 /*sd = 1;*/
|
jamie@56
|
310 sd += XTRACT_SQ(data[i] - data[i + n]);
|
jamie@1
|
311 }
|
jamie@1
|
312 result[n] = sd / N;
|
jamie@1
|
313 }
|
jamie@38
|
314
|
jamie@56
|
315 return XTRACT_SUCCESS;
|
jamie@1
|
316 }
|
jamie@1
|
317
|
jamie@43
|
318 int xtract_bark_coefficients(const float *data, const int N, const void *argv, float *result){
|
jamie@1
|
319
|
jamie@1
|
320 int *limits, band, n;
|
jamie@1
|
321
|
jamie@1
|
322 limits = (int *)argv;
|
jamie@1
|
323
|
jamie@59
|
324 for(band = 0; band < XTRACT_BARK_BANDS - 1; band++){
|
jamie@1
|
325 for(n = limits[band]; n < limits[band + 1]; n++)
|
jamie@1
|
326 result[band] += data[n];
|
jamie@1
|
327 }
|
jamie@38
|
328
|
jamie@56
|
329 return XTRACT_SUCCESS;
|
jamie@1
|
330 }
|
jamie@1
|
331
|
jamie@52
|
332 int xtract_peak_spectrum(const float *data, const int N, const void *argv, float *result){
|
jamie@1
|
333
|
jamie@56
|
334 float threshold, max, y, y2, y3, p, q, *input = NULL;
|
jamie@43
|
335 size_t bytes;
|
jamie@59
|
336 int n = N, rv = XTRACT_SUCCESS;
|
jamie@49
|
337
|
jamie@56
|
338 threshold = max = y = y2 = y3 = p = q = 0.f;
|
jamie@1
|
339
|
jamie@1
|
340 if(argv != NULL){
|
jamie@56
|
341 q = ((float *)argv)[0];
|
jamie@55
|
342 threshold = ((float *)argv)[1];
|
jamie@1
|
343 }
|
jamie@49
|
344 else
|
jamie@56
|
345 rv = XTRACT_BAD_ARGV;
|
jamie@49
|
346
|
jamie@55
|
347 if(threshold < 0 || threshold > 100){
|
jamie@55
|
348 threshold = 0;
|
jamie@56
|
349 rv = XTRACT_BAD_ARGV;
|
jamie@1
|
350 }
|
jamie@1
|
351
|
jamie@56
|
352 XTRACT_CHECK_q;
|
jamie@49
|
353
|
jamie@43
|
354 input = (float *)malloc(bytes = N * sizeof(float));
|
jamie@43
|
355
|
jamie@43
|
356 if(input != NULL)
|
jamie@43
|
357 input = memcpy(input, data, bytes);
|
jamie@43
|
358 else
|
jamie@56
|
359 return XTRACT_MALLOC_FAILED;
|
jamie@43
|
360
|
jamie@45
|
361 while(n--)
|
jamie@56
|
362 max = XTRACT_MAX(max, input[n]);
|
jamie@1
|
363
|
jamie@55
|
364 threshold *= .01 * max;
|
jamie@1
|
365
|
jamie@1
|
366 result[0] = 0;
|
jamie@59
|
367 result[N] = 0;
|
jamie@1
|
368
|
jamie@59
|
369 for(n = 1; n < N; n++){
|
jamie@55
|
370 if(input[n] >= threshold){
|
jamie@43
|
371 if(input[n] > input[n - 1] && input[n] > input[n + 1]){
|
jamie@59
|
372 result[N + n] = q * (n + (p = .5 * (y = input[n-1] -
|
jamie@52
|
373 (y3 = input[n+1])) / (input[n - 1] - 2 *
|
jamie@52
|
374 (y2 = input[n]) + input[n + 1])));
|
jamie@52
|
375 result[n] = y2 - .25 * (y - y3) * p;
|
jamie@1
|
376 }
|
jamie@1
|
377 else{
|
jamie@1
|
378 result[n] = 0;
|
jamie@59
|
379 result[N + n] = 0;
|
jamie@1
|
380 }
|
jamie@1
|
381 }
|
jamie@1
|
382 else{
|
jamie@1
|
383 result[n] = 0;
|
jamie@59
|
384 result[N + n] = 0;
|
jamie@1
|
385 }
|
jamie@1
|
386 }
|
jamie@1
|
387
|
jamie@43
|
388 free(input);
|
jamie@56
|
389 return (rv ? rv : XTRACT_SUCCESS);
|
jamie@1
|
390 }
|
jamie@41
|
391
|
jamie@52
|
392 int xtract_harmonic_spectrum(const float *data, const int N, const void *argv, float *result){
|
jamie@38
|
393
|
jamie@38
|
394 int n = (N >> 1), M = n;
|
jamie@38
|
395
|
jamie@43
|
396 const float *freqs, *amps;
|
jamie@55
|
397 float f0, threshold, ratio, nearest, distance;
|
jamie@38
|
398
|
jamie@52
|
399 amps = data;
|
jamie@52
|
400 freqs = data + n;
|
jamie@38
|
401 f0 = *((float *)argv);
|
jamie@55
|
402 threshold = *((float *)argv+1);
|
jamie@38
|
403
|
jamie@38
|
404 ratio = nearest = distance = 0.f;
|
jamie@38
|
405
|
jamie@38
|
406 while(n--){
|
jamie@38
|
407 if(freqs[n]){
|
jamie@38
|
408 ratio = freqs[n] / f0;
|
jamie@38
|
409 nearest = round(ratio);
|
jamie@38
|
410 distance = fabs(nearest - ratio);
|
jamie@55
|
411 if(distance > threshold)
|
jamie@38
|
412 result[n] = result[M + n] = 0.f;
|
jamie@42
|
413 else {
|
jamie@52
|
414 result[n] = amps[n];
|
jamie@52
|
415 result[M + n] = freqs[n];
|
jamie@42
|
416 }
|
jamie@38
|
417 }
|
jamie@38
|
418 else
|
jamie@38
|
419 result[n] = result[M + n] = 0.f;
|
jamie@38
|
420 }
|
jamie@56
|
421 return XTRACT_SUCCESS;
|
jamie@38
|
422 }
|
jamie@38
|
423
|