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@54
|
38 int n , NxN, M, vector;
|
jamie@1
|
39 fftwf_plan plan;
|
jamie@1
|
40
|
jamie@54
|
41 M = N >> 1;
|
jamie@56
|
42 NxN = XTRACT_SQ(N);
|
jamie@54
|
43
|
jamie@54
|
44 rfft = (float *)fftwf_malloc(N * sizeof(float));
|
jamie@43
|
45 input = (float *)malloc(bytes = N * sizeof(float));
|
jamie@43
|
46 input = memcpy(input, data, bytes);
|
jamie@1
|
47
|
jamie@56
|
48 q = *(float *)argv;
|
jamie@54
|
49 vector = (int)*((float *)argv+1);
|
jamie@46
|
50
|
jamie@56
|
51 XTRACT_CHECK_q;
|
jamie@46
|
52
|
jamie@54
|
53 plan = fftwf_plan_r2r_1d(N, input, rfft, FFTW_R2HC, FFTW_ESTIMATE);
|
jamie@1
|
54
|
jamie@1
|
55 fftwf_execute(plan);
|
jamie@54
|
56
|
jamie@54
|
57 switch(vector){
|
jamie@67
|
58
|
jamie@67
|
59 /* case XTRACT_MAGNITUDE_SPECTRUM:
|
jamie@67
|
60 for(n = 1; n < M; n++){
|
jamie@67
|
61 result[n] = sqrt(XTRACT_SQ(rfft[n]) +
|
jamie@67
|
62 XTRACT_SQ(rfft[N - n - 1])) / N;
|
jamie@56
|
63 result[M + n] = n * q;
|
jamie@54
|
64 }
|
jamie@54
|
65 break;
|
jamie@67
|
66 */
|
jamie@56
|
67 case XTRACT_LOG_MAGNITUDE_SPECTRUM:
|
jamie@67
|
68 for(n = 1; n < M; n++){
|
jamie@67
|
69 if ((temp = XTRACT_SQ(rfft[n]) +
|
jamie@67
|
70 XTRACT_SQ(rfft[N - n - 1])) > XTRACT_LOG_LIMIT)
|
jamie@54
|
71 temp = log(sqrt(temp) / N);
|
jamie@54
|
72 else
|
jamie@56
|
73 temp = XTRACT_LOG_LIMIT_DB;
|
jamie@54
|
74 /*Normalise*/
|
jamie@67
|
75 result[n] =
|
jamie@67
|
76 (temp + XTRACT_DB_SCALE_OFFSET) / XTRACT_DB_SCALE_OFFSET;
|
jamie@56
|
77 result[M + n] = n * q;
|
jamie@54
|
78 }
|
jamie@54
|
79 break;
|
jamie@67
|
80
|
jamie@56
|
81 case XTRACT_POWER_SPECTRUM:
|
jamie@67
|
82 for(n = 1; n < M; n++){
|
jamie@67
|
83 result[n] = (XTRACT_SQ(rfft[n]) + XTRACT_SQ(rfft[N - n - 1]))
|
jamie@67
|
84 / NxN;
|
jamie@56
|
85 result[M + n] = n * q;
|
jamie@54
|
86 }
|
jamie@54
|
87 break;
|
jamie@67
|
88
|
jamie@56
|
89 case XTRACT_LOG_POWER_SPECTRUM:
|
jamie@67
|
90 for(n = 1; n < M; n++){
|
jamie@67
|
91 if ((temp = XTRACT_SQ(rfft[n]) + XTRACT_SQ(rfft[N - n - 1])) >
|
jamie@67
|
92 XTRACT_LOG_LIMIT)
|
jamie@54
|
93 temp = log(temp / NxN);
|
jamie@54
|
94 else
|
jamie@56
|
95 temp = XTRACT_LOG_LIMIT_DB;
|
jamie@67
|
96 result[n] = (temp + XTRACT_DB_SCALE_OFFSET) /
|
jamie@67
|
97 XTRACT_DB_SCALE_OFFSET;
|
jamie@56
|
98 result[M + n] = n * q;
|
jamie@54
|
99 }
|
jamie@54
|
100 break;
|
jamie@67
|
101
|
jamie@54
|
102 default:
|
jamie@54
|
103 /* MAGNITUDE_SPECTRUM */
|
jamie@67
|
104 for(n = 1; n < M; n++){
|
jamie@67
|
105 result[n] = sqrt(XTRACT_SQ(rfft[n]) +
|
jamie@67
|
106 XTRACT_SQ(rfft[N - n - 1])) / N;
|
jamie@56
|
107 result[M + n] = n * q;
|
jamie@54
|
108 }
|
jamie@54
|
109 break;
|
jamie@1
|
110 }
|
jamie@1
|
111
|
jamie@67
|
112 /* Set the DC component to 0 */
|
jamie@67
|
113 result[0] = result[M] = 0.f;
|
jamie@67
|
114 /* Set the Nyquist */
|
jamie@56
|
115 result[N] = q * M;
|
jamie@1
|
116
|
jamie@1
|
117 fftwf_destroy_plan(plan);
|
jamie@54
|
118 fftwf_free(rfft);
|
jamie@43
|
119 free(input);
|
jamie@1
|
120
|
jamie@56
|
121 return XTRACT_SUCCESS;
|
jamie@1
|
122 }
|
jamie@1
|
123
|
jamie@43
|
124 int xtract_autocorrelation_fft(const float *data, const int N, const void *argv, float *result){
|
jamie@1
|
125
|
jamie@43
|
126 float *temp, *input;
|
jamie@43
|
127 size_t bytes;
|
jamie@1
|
128 int n;
|
jamie@1
|
129 fftwf_plan plan;
|
jamie@1
|
130
|
jamie@1
|
131 temp = (float *)fftwf_malloc(N * sizeof(float));
|
jamie@43
|
132 input = (float *)malloc(bytes = N * sizeof(float));
|
jamie@43
|
133 input = memcpy(input, data, bytes);
|
jamie@43
|
134
|
jamie@43
|
135 plan = fftwf_plan_r2r_1d(N, input, temp, FFTW_HC2R, FFTW_ESTIMATE);
|
jamie@1
|
136
|
jamie@1
|
137 fftwf_execute(plan);
|
jamie@1
|
138
|
jamie@1
|
139 for(n = 0; n < N - 1; n++)
|
jamie@1
|
140 result[n] = temp[n+1];
|
jamie@1
|
141
|
jamie@1
|
142 fftwf_destroy_plan(plan);
|
jamie@1
|
143 fftwf_free(temp);
|
jamie@43
|
144 free(input);
|
jamie@38
|
145
|
jamie@56
|
146 return XTRACT_SUCCESS;
|
jamie@1
|
147 }
|
jamie@1
|
148
|
jamie@43
|
149 int xtract_mfcc(const float *data, const int N, const void *argv, float *result){
|
jamie@30
|
150
|
jamie@30
|
151 xtract_mel_filter *f;
|
jamie@43
|
152 float *input;
|
jamie@43
|
153 size_t bytes;
|
jamie@30
|
154 int n, filter;
|
jamie@30
|
155
|
jamie@30
|
156 f = (xtract_mel_filter *)argv;
|
jamie@39
|
157
|
jamie@43
|
158 input = (float *)malloc(bytes = N * sizeof(float));
|
jamie@43
|
159 input = memcpy(input, data, bytes);
|
jamie@43
|
160
|
jamie@30
|
161 for(filter = 0; filter < f->n_filters; filter++){
|
jamie@30
|
162 for(n = 0; n < N; n++){
|
jamie@43
|
163 result[filter] += input[n] * f->filters[filter][n];
|
jamie@30
|
164 }
|
jamie@56
|
165 if(result[filter] < XTRACT_LOG_LIMIT) result[filter] = XTRACT_LOG_LIMIT;
|
jamie@30
|
166 result[filter] = log(result[filter]);
|
jamie@30
|
167 }
|
jamie@30
|
168
|
jamie@30
|
169 for(n = filter + 1; n < N; n++) result[n] = 0;
|
jamie@30
|
170
|
jamie@30
|
171 xtract_dct(result, f->n_filters, NULL, result);
|
jamie@30
|
172
|
jamie@43
|
173 free(input);
|
jamie@43
|
174
|
jamie@56
|
175 return XTRACT_SUCCESS;
|
jamie@30
|
176 }
|
jamie@30
|
177
|
jamie@43
|
178 int xtract_dct(const float *data, const int N, const void *argv, float *result){
|
jamie@30
|
179
|
jamie@30
|
180 fftwf_plan plan;
|
jamie@43
|
181 float *input;
|
jamie@43
|
182 size_t bytes;
|
jamie@30
|
183
|
jamie@43
|
184 input = (float *)malloc(bytes = N * sizeof(float));
|
jamie@43
|
185 input = memcpy(input, data, bytes);
|
jamie@43
|
186
|
jamie@30
|
187 plan =
|
jamie@43
|
188 fftwf_plan_r2r_1d(N, input, result, FFTW_REDFT00, FFTW_ESTIMATE);
|
jamie@30
|
189
|
jamie@30
|
190 fftwf_execute(plan);
|
jamie@30
|
191 fftwf_destroy_plan(plan);
|
jamie@43
|
192 free(input);
|
jamie@38
|
193
|
jamie@56
|
194 return XTRACT_SUCCESS;
|
jamie@30
|
195 }
|
jamie@30
|
196
|
jamie@30
|
197 #else
|
jamie@30
|
198
|
jamie@67
|
199 int xtract_spectrum(const float *data, const int N, const void *argv, float *result){
|
jamie@30
|
200
|
danstowell@66
|
201 XTRACT_NEEDS_FFTW;
|
danstowell@66
|
202 return XTRACT_NO_RESULT;
|
jamie@30
|
203
|
jamie@30
|
204 }
|
jamie@30
|
205
|
jamie@43
|
206 int xtract_autocorrelation_fft(const float *data, const int N, const void *argv, float *result){
|
jamie@30
|
207
|
danstowell@66
|
208 XTRACT_NEEDS_FFTW;
|
danstowell@66
|
209 return XTRACT_NO_RESULT;
|
jamie@30
|
210
|
jamie@30
|
211 }
|
jamie@30
|
212
|
jamie@43
|
213 int xtract_mfcc(const float *data, const int N, const void *argv, float *result){
|
jamie@30
|
214
|
danstowell@66
|
215 XTRACT_NEEDS_FFTW;
|
danstowell@66
|
216 return XTRACT_NO_RESULT;
|
jamie@30
|
217
|
jamie@30
|
218 }
|
jamie@30
|
219
|
jamie@43
|
220 int xtract_dct(const float *data, const int N, const void *argv, float *result){
|
jamie@30
|
221
|
danstowell@66
|
222 XTRACT_NEEDS_FFTW;
|
danstowell@66
|
223 return XTRACT_NO_RESULT;
|
jamie@30
|
224
|
jamie@30
|
225 }
|
jamie@30
|
226
|
jamie@30
|
227 #endif
|
jamie@30
|
228
|
jamie@43
|
229 int xtract_autocorrelation(const float *data, const int N, const void *argv, float *result){
|
jamie@30
|
230
|
jamie@30
|
231 /* Naive time domain implementation */
|
jamie@30
|
232
|
jamie@30
|
233 int n = N, i;
|
jamie@30
|
234
|
jamie@30
|
235 float corr;
|
jamie@30
|
236
|
jamie@30
|
237 while(n--){
|
jamie@30
|
238 corr = 0;
|
jamie@30
|
239 for(i = 0; i < N - n; i++){
|
jamie@30
|
240 corr += data[i] * data[i + n];
|
jamie@30
|
241 }
|
jamie@30
|
242 result[n] = corr / N;
|
jamie@30
|
243 }
|
jamie@38
|
244
|
jamie@56
|
245 return XTRACT_SUCCESS;
|
jamie@30
|
246 }
|
jamie@30
|
247
|
jamie@43
|
248 int xtract_amdf(const float *data, const int N, const void *argv, float *result){
|
jamie@1
|
249
|
jamie@1
|
250 int n = N, i;
|
jamie@1
|
251
|
jamie@6
|
252 float md, temp;
|
jamie@1
|
253
|
jamie@1
|
254 while(n--){
|
jamie@1
|
255 md = 0;
|
jamie@1
|
256 for(i = 0; i < N - n; i++){
|
jamie@6
|
257 temp = data[i] - data[i + n];
|
jamie@6
|
258 temp = (temp < 0 ? -temp : temp);
|
jamie@6
|
259 md += temp;
|
jamie@1
|
260 }
|
jamie@1
|
261 result[n] = md / N;
|
jamie@1
|
262 }
|
jamie@38
|
263
|
jamie@56
|
264 return XTRACT_SUCCESS;
|
jamie@1
|
265 }
|
jamie@1
|
266
|
jamie@43
|
267 int xtract_asdf(const float *data, const int N, const void *argv, float *result){
|
jamie@1
|
268
|
jamie@1
|
269 int n = N, i;
|
jamie@1
|
270
|
jamie@1
|
271 float sd;
|
jamie@1
|
272
|
jamie@1
|
273 while(n--){
|
jamie@1
|
274 sd = 0;
|
jamie@1
|
275 for(i = 0; i < N - n; i++){
|
jamie@6
|
276 /*sd = 1;*/
|
jamie@56
|
277 sd += XTRACT_SQ(data[i] - data[i + n]);
|
jamie@1
|
278 }
|
jamie@1
|
279 result[n] = sd / N;
|
jamie@1
|
280 }
|
jamie@38
|
281
|
jamie@56
|
282 return XTRACT_SUCCESS;
|
jamie@1
|
283 }
|
jamie@1
|
284
|
jamie@43
|
285 int xtract_bark_coefficients(const float *data, const int N, const void *argv, float *result){
|
jamie@1
|
286
|
jamie@1
|
287 int *limits, band, n;
|
jamie@1
|
288
|
jamie@1
|
289 limits = (int *)argv;
|
jamie@1
|
290
|
jamie@59
|
291 for(band = 0; band < XTRACT_BARK_BANDS - 1; band++){
|
jamie@1
|
292 for(n = limits[band]; n < limits[band + 1]; n++)
|
jamie@1
|
293 result[band] += data[n];
|
jamie@1
|
294 }
|
jamie@38
|
295
|
jamie@56
|
296 return XTRACT_SUCCESS;
|
jamie@1
|
297 }
|
jamie@1
|
298
|
jamie@52
|
299 int xtract_peak_spectrum(const float *data, const int N, const void *argv, float *result){
|
jamie@1
|
300
|
jamie@56
|
301 float threshold, max, y, y2, y3, p, q, *input = NULL;
|
jamie@43
|
302 size_t bytes;
|
jamie@59
|
303 int n = N, rv = XTRACT_SUCCESS;
|
jamie@49
|
304
|
jamie@56
|
305 threshold = max = y = y2 = y3 = p = q = 0.f;
|
jamie@1
|
306
|
jamie@1
|
307 if(argv != NULL){
|
jamie@56
|
308 q = ((float *)argv)[0];
|
jamie@55
|
309 threshold = ((float *)argv)[1];
|
jamie@1
|
310 }
|
jamie@49
|
311 else
|
jamie@56
|
312 rv = XTRACT_BAD_ARGV;
|
jamie@49
|
313
|
jamie@55
|
314 if(threshold < 0 || threshold > 100){
|
jamie@55
|
315 threshold = 0;
|
jamie@56
|
316 rv = XTRACT_BAD_ARGV;
|
jamie@1
|
317 }
|
jamie@1
|
318
|
jamie@56
|
319 XTRACT_CHECK_q;
|
jamie@49
|
320
|
jamie@43
|
321 input = (float *)malloc(bytes = N * sizeof(float));
|
jamie@43
|
322
|
jamie@43
|
323 if(input != NULL)
|
jamie@43
|
324 input = memcpy(input, data, bytes);
|
jamie@43
|
325 else
|
jamie@56
|
326 return XTRACT_MALLOC_FAILED;
|
jamie@43
|
327
|
jamie@45
|
328 while(n--)
|
jamie@56
|
329 max = XTRACT_MAX(max, input[n]);
|
jamie@1
|
330
|
jamie@55
|
331 threshold *= .01 * max;
|
jamie@1
|
332
|
jamie@1
|
333 result[0] = 0;
|
jamie@59
|
334 result[N] = 0;
|
jamie@1
|
335
|
jamie@59
|
336 for(n = 1; n < N; n++){
|
jamie@55
|
337 if(input[n] >= threshold){
|
jamie@43
|
338 if(input[n] > input[n - 1] && input[n] > input[n + 1]){
|
jamie@59
|
339 result[N + n] = q * (n + (p = .5 * (y = input[n-1] -
|
jamie@52
|
340 (y3 = input[n+1])) / (input[n - 1] - 2 *
|
jamie@52
|
341 (y2 = input[n]) + input[n + 1])));
|
jamie@52
|
342 result[n] = y2 - .25 * (y - y3) * p;
|
jamie@1
|
343 }
|
jamie@1
|
344 else{
|
jamie@1
|
345 result[n] = 0;
|
jamie@59
|
346 result[N + n] = 0;
|
jamie@1
|
347 }
|
jamie@1
|
348 }
|
jamie@1
|
349 else{
|
jamie@1
|
350 result[n] = 0;
|
jamie@59
|
351 result[N + n] = 0;
|
jamie@1
|
352 }
|
jamie@1
|
353 }
|
jamie@1
|
354
|
jamie@43
|
355 free(input);
|
jamie@56
|
356 return (rv ? rv : XTRACT_SUCCESS);
|
jamie@1
|
357 }
|
jamie@41
|
358
|
jamie@52
|
359 int xtract_harmonic_spectrum(const float *data, const int N, const void *argv, float *result){
|
jamie@38
|
360
|
jamie@38
|
361 int n = (N >> 1), M = n;
|
jamie@38
|
362
|
jamie@43
|
363 const float *freqs, *amps;
|
jamie@55
|
364 float f0, threshold, ratio, nearest, distance;
|
jamie@38
|
365
|
jamie@52
|
366 amps = data;
|
jamie@52
|
367 freqs = data + n;
|
jamie@38
|
368 f0 = *((float *)argv);
|
jamie@55
|
369 threshold = *((float *)argv+1);
|
jamie@38
|
370
|
jamie@38
|
371 ratio = nearest = distance = 0.f;
|
jamie@38
|
372
|
jamie@38
|
373 while(n--){
|
jamie@38
|
374 if(freqs[n]){
|
jamie@38
|
375 ratio = freqs[n] / f0;
|
jamie@38
|
376 nearest = round(ratio);
|
jamie@38
|
377 distance = fabs(nearest - ratio);
|
jamie@55
|
378 if(distance > threshold)
|
jamie@38
|
379 result[n] = result[M + n] = 0.f;
|
jamie@42
|
380 else {
|
jamie@52
|
381 result[n] = amps[n];
|
jamie@52
|
382 result[M + n] = freqs[n];
|
jamie@42
|
383 }
|
jamie@38
|
384 }
|
jamie@38
|
385 else
|
jamie@38
|
386 result[n] = result[M + n] = 0.f;
|
jamie@38
|
387 }
|
jamie@56
|
388 return XTRACT_SUCCESS;
|
jamie@38
|
389 }
|
jamie@38
|
390
|