jamie@141: /* jamie@141: * Copyright (C) 2012 Jamie Bullock jamie@140: * jamie@141: * Permission is hereby granted, free of charge, to any person obtaining a copy jamie@141: * of this software and associated documentation files (the "Software"), to jamie@141: * deal in the Software without restriction, including without limitation the jamie@141: * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or jamie@141: * sell copies of the Software, and to permit persons to whom the Software is jamie@141: * furnished to do so, subject to the following conditions: jamie@1: * jamie@141: * The above copyright notice and this permission notice shall be included in jamie@141: * all copies or substantial portions of the Software. jamie@1: * jamie@141: * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR jamie@141: * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, jamie@141: * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE jamie@141: * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER jamie@141: * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING jamie@141: * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS jamie@141: * IN THE SOFTWARE. jamie@1: * jamie@1: */ jamie@1: jamie@107: /* scalar.c: defines functions that extract a feature as a single value from an input vector */ jamie@1: jamie@113: #include jamie@113: jamie@5: #include jamie@43: #include jamie@78: #include jamie@113: #include jamie@113: jamie@113: #include "xtract/libxtract.h" jamie@113: #include "xtract/xtract_helper.h" jamie@113: #include "xtract_macros_private.h" jamie@1: jamie@85: #ifndef powf jamie@140: #define powf pow jamie@85: #endif jamie@85: jamie@85: #ifndef expf jamie@140: #define expf exp jamie@85: #endif jamie@85: jamie@113: #ifndef sqrtf jamie@140: #define sqrtf sqrt jamie@113: #endif jamie@113: jamie@113: #ifndef fabsf jamie@140: #define fabsf fabs jamie@113: #endif jamie@113: jamie@113: jamie@140: void test(void) jamie@140: { jamie@113: printf("Hello world\n"); jamie@113: #ifdef WORDS_BIGENDIAN jamie@113: printf("Big endian!\n"); jamie@113: #endif jamie@88: } jamie@88: jamie@140: int xtract_mean(const float *data, const int N, const void *argv, float *result) jamie@140: { jamie@25: jamie@1: int n = N; jamie@1: jamie@122: *result = 0.f; jamie@113: jamie@1: while(n--) jamie@140: *result += data[n]; jamie@140: jamie@140: *result /= N; jamie@140: jamie@140: return XTRACT_SUCCESS; jamie@140: } jamie@140: jamie@140: int xtract_variance(const float *data, const int N, const void *argv, float *result) jamie@140: { jamie@140: jamie@140: int n = N; jamie@140: jamie@140: *result = 0.f; jamie@140: jamie@140: while(n--) jamie@140: *result += powf(data[n] - *(float *)argv, 2); jamie@25: jamie@43: *result = *result / (N - 1); jamie@44: jamie@56: return XTRACT_SUCCESS; jamie@1: } jamie@1: jamie@140: int xtract_standard_deviation(const float *data, const int N, const void *argv, float *result) jamie@140: { jamie@25: jamie@113: *result = sqrtf(*(float *)argv); jamie@25: jamie@56: return XTRACT_SUCCESS; jamie@1: } jamie@1: jamie@140: int xtract_average_deviation(const float *data, const int N, const void *argv, float *result) jamie@140: { jamie@25: jamie@1: int n = N; jamie@44: jamie@122: *result = 0.f; jamie@113: jamie@1: while(n--) jamie@140: *result += fabsf(data[n] - *(float *)argv); jamie@25: jamie@1: *result /= N; jamie@1: jamie@56: return XTRACT_SUCCESS; jamie@1: } jamie@1: jamie@140: int xtract_skewness(const float *data, const int N, const void *argv, float *result) jamie@140: { jamie@25: jamie@1: int n = N; jamie@1: jamie@59: float temp = 0.f; jamie@25: jamie@122: *result = 0.f; jamie@113: jamie@140: while(n--) jamie@140: { jamie@140: temp = (data[n] - ((float *)argv)[0]) / ((float *)argv)[1]; jamie@140: *result += powf(temp, 3); jamie@42: } jamie@1: jamie@42: *result /= N; jamie@44: jamie@59: jamie@56: return XTRACT_SUCCESS; jamie@1: } jamie@1: jamie@140: int xtract_kurtosis(const float *data, const int N, const void *argv, float *result) jamie@140: { jamie@25: jamie@1: int n = N; jamie@1: jamie@113: float temp = 0.f; jamie@113: jamie@122: *result = 0.f; jamie@25: jamie@140: while(n--) jamie@140: { jamie@140: temp = (data[n] - ((float *)argv)[0]) / ((float *)argv)[1]; jamie@140: *result += powf(temp, 4); jamie@42: } jamie@25: jamie@42: *result /= N; jamie@42: *result -= 3.0f; jamie@44: jamie@56: return XTRACT_SUCCESS; jamie@1: } jamie@1: jamie@140: int xtract_spectral_centroid(const float *data, const int N, const void *argv, float *result) jamie@140: { jamie@25: jamie@37: int n = (N >> 1); jamie@11: jamie@43: const float *freqs, *amps; jamie@43: float FA = 0.f, A = 0.f; jamie@11: jamie@52: amps = data; jamie@52: freqs = data + n; jamie@25: jamie@140: while(n--) jamie@140: { jamie@140: FA += freqs[n] * amps[n]; jamie@140: A += amps[n]; jamie@25: } jamie@25: jamie@113: if(A == 0.f) jamie@113: *result = 0.f; jamie@113: else jamie@113: *result = FA / A; jamie@11: jamie@56: return XTRACT_SUCCESS; jamie@11: } jamie@11: jamie@140: int xtract_spectral_mean(const float *data, const int N, const void *argv, float *result) jamie@140: { jamie@52: jamie@52: return xtract_spectral_centroid(data, N, argv, result); jamie@52: jamie@52: } jamie@52: jamie@140: int xtract_spectral_variance(const float *data, const int N, const void *argv, float *result) jamie@140: { jamie@52: jamie@53: int m; jamie@53: float A = 0.f; jamie@53: const float *freqs, *amps; jamie@52: jamie@53: m = N >> 1; jamie@52: jamie@53: amps = data; jamie@53: freqs = data + m; jamie@52: jamie@122: *result = 0.f; jamie@113: jamie@140: while(m--) jamie@140: { jamie@123: A += amps[m]; jamie@123: *result += powf(freqs[m] - ((float *)argv)[0], 2) * amps[m]; jamie@53: } jamie@53: jamie@123: *result = *result / A; jamie@52: jamie@56: return XTRACT_SUCCESS; jamie@52: } jamie@52: jamie@140: int xtract_spectral_standard_deviation(const float *data, const int N, const void *argv, float *result) jamie@140: { jamie@52: jamie@140: *result = sqrtf(*(float *)argv); jamie@52: jamie@56: return XTRACT_SUCCESS; jamie@52: } jamie@52: jamie@123: /*int xtract_spectral_average_deviation(const float *data, const int N, const void *argv, float *result){ jamie@52: jamie@53: int m; jamie@53: float A = 0.f; jamie@53: const float *freqs, *amps; jamie@52: jamie@53: m = N >> 1; jamie@52: jamie@53: amps = data; jamie@53: freqs = data + m; jamie@52: jamie@122: *result = 0.f; jamie@113: jamie@53: while(m--){ jamie@123: A += amps[m]; jamie@123: *result += fabsf((amps[m] * freqs[m]) - *(float *)argv); jamie@53: } jamie@53: jamie@53: *result /= A; jamie@52: jamie@56: return XTRACT_SUCCESS; jamie@123: }*/ jamie@52: jamie@140: int xtract_spectral_skewness(const float *data, const int N, const void *argv, float *result) jamie@140: { jamie@52: jamie@53: int m; jamie@53: const float *freqs, *amps; jamie@52: jamie@53: m = N >> 1; jamie@53: jamie@53: amps = data; jamie@53: freqs = data + m; jamie@52: jamie@122: *result = 0.f; jamie@113: jamie@123: while(m--) jamie@123: *result += powf(freqs[m] - ((float *)argv)[0], 3) * amps[m]; jamie@52: jamie@123: *result /= powf(((float *)argv)[1], 3); jamie@52: jamie@56: return XTRACT_SUCCESS; jamie@52: } jamie@52: jamie@140: int xtract_spectral_kurtosis(const float *data, const int N, const void *argv, float *result) jamie@140: { jamie@52: jamie@53: int m; jamie@53: const float *freqs, *amps; jamie@52: jamie@53: m = N >> 1; jamie@53: jamie@53: amps = data; jamie@53: freqs = data + m; jamie@52: jamie@122: *result = 0.f; jamie@113: jamie@123: while(m--) jamie@123: *result += powf(freqs[m] - ((float *)argv)[0], 4) * amps[m]; jamie@52: jamie@123: *result /= powf(((float *)argv)[1], 4); jamie@52: *result -= 3.0f; jamie@52: jamie@56: return XTRACT_SUCCESS; jamie@52: } jamie@52: jamie@140: int xtract_irregularity_k(const float *data, const int N, const void *argv, float *result) jamie@140: { jamie@25: jamie@1: int n, jamie@140: M = N - 1; jamie@140: jamie@113: *result = 0.f; jamie@140: jamie@1: for(n = 1; n < M; n++) jamie@140: *result += fabsf(data[n] - (data[n-1] + data[n] + data[n+1]) / 3.f); jamie@1: jamie@56: return XTRACT_SUCCESS; jamie@1: } jamie@1: jamie@140: int xtract_irregularity_j(const float *data, const int N, const void *argv, float *result) jamie@140: { jamie@25: jamie@1: int n = N; jamie@1: jamie@59: double num = 0.f, den = 0.f; jamie@1: jamie@140: while(n--) jamie@140: { jamie@140: num += powf(data[n] - data[n+1], 2); jamie@140: den += powf(data[n], 2); jamie@1: } jamie@25: jamie@59: *result = (float)(num / den); jamie@1: jamie@56: return XTRACT_SUCCESS; jamie@1: } jamie@1: jamie@140: int xtract_tristimulus_1(const float *data, const int N, const void *argv, float *result) jamie@140: { jamie@1: jamie@1: int n = N; jamie@1: jamie@42: float den, p1, temp; jamie@1: jamie@42: den = p1 = temp = 0.f; jamie@1: jamie@140: for(n = 0; n < N; n++) jamie@140: { jamie@140: if((temp = data[n])) jamie@140: { jamie@140: den += temp; jamie@140: if(!p1) jamie@140: p1 = temp; jamie@140: } jamie@42: } jamie@42: jamie@140: if(den == 0.f || p1 == 0.f) jamie@140: { jamie@113: *result = 0.f; jamie@113: return XTRACT_NO_RESULT; jamie@113: } jamie@140: else jamie@140: { jamie@113: *result = p1 / den; jamie@113: return XTRACT_SUCCESS; jamie@113: } jamie@1: } jamie@1: jamie@140: int xtract_tristimulus_2(const float *data, const int N, const void *argv, float *result) jamie@140: { jamie@25: jamie@1: int n = N; jamie@1: jamie@113: float den, p2, p3, p4, ps, temp; jamie@1: jamie@113: den = p2 = p3 = p4 = ps = temp = 0.f; jamie@1: jamie@140: for(n = 0; n < N; n++) jamie@140: { jamie@140: if((temp = data[n])) jamie@140: { jamie@140: den += temp; jamie@140: if(!p2) jamie@140: p2 = temp; jamie@140: else if(!p3) jamie@140: p3 = temp; jamie@140: else if(!p4) jamie@140: p4 = temp; jamie@140: } jamie@42: } jamie@42: jamie@113: ps = p2 + p3 + p4; jamie@25: jamie@140: if(den == 0.f || ps == 0.f) jamie@140: { jamie@113: *result = 0.f; jamie@113: return XTRACT_NO_RESULT; jamie@113: } jamie@140: else jamie@140: { jamie@113: *result = ps / den; jamie@113: return XTRACT_SUCCESS; jamie@113: } jamie@113: jamie@1: } jamie@1: jamie@140: int xtract_tristimulus_3(const float *data, const int N, const void *argv, float *result) jamie@140: { jamie@25: jamie@42: int n = N, count = 0; jamie@1: jamie@42: float den, num, temp; jamie@1: jamie@42: den = num = temp = 0.f; jamie@1: jamie@140: for(n = 0; n < N; n++) jamie@140: { jamie@140: if((temp = data[n])) jamie@140: { jamie@140: den += temp; jamie@140: if(count >= 5) jamie@140: num += temp; jamie@140: count++; jamie@140: } jamie@42: } jamie@25: jamie@140: if(den == 0.f || num == 0.f) jamie@140: { jamie@113: *result = 0.f; jamie@113: return XTRACT_NO_RESULT; jamie@113: } jamie@140: else jamie@140: { jamie@113: *result = num / den; jamie@113: return XTRACT_SUCCESS; jamie@113: } jamie@1: } jamie@1: jamie@140: int xtract_smoothness(const float *data, const int N, const void *argv, float *result) jamie@140: { jamie@25: jamie@59: int n, M; jamie@1: jamie@43: float *input; jamie@43: jamie@43: input = (float *)malloc(N * sizeof(float)); jamie@59: memcpy(input, data, N * sizeof(float)); jamie@43: jamie@140: if (input[0] <= 0) jamie@113: input[0] = XTRACT_LOG_LIMIT; jamie@140: if (input[1] <= 0) jamie@113: input[1] = XTRACT_LOG_LIMIT; jamie@25: jamie@59: M = N - 1; jamie@59: jamie@140: for(n = 1; n < M; n++) jamie@140: { jamie@140: if(input[n+1] <= 0) jamie@113: input[n+1] = XTRACT_LOG_LIMIT; jamie@140: *result += fabsf(20.f * logf(input[n]) - (20.f * logf(input[n-1]) + jamie@140: 20.f * logf(input[n]) + 20.f * logf(input[n+1])) / 3.f); jamie@25: } jamie@43: jamie@43: free(input); jamie@44: jamie@56: return XTRACT_SUCCESS; jamie@1: } jamie@1: jamie@140: int xtract_spread(const float *data, const int N, const void *argv, float *result) jamie@140: { jamie@1: jamie@140: return xtract_spectral_variance(data, N, argv, result); jamie@1: } jamie@1: jamie@140: int xtract_zcr(const float *data, const int N, const void *argv, float *result) jamie@140: { jamie@1: jamie@1: int n = N; jamie@25: jamie@1: for(n = 1; n < N; n++) jamie@140: if(data[n] * data[n-1] < 0) (*result)++; jamie@25: jamie@113: *result /= (float)N; jamie@25: jamie@56: return XTRACT_SUCCESS; jamie@1: } jamie@1: jamie@140: int xtract_rolloff(const float *data, const int N, const void *argv, float *result) jamie@140: { jamie@1: jamie@1: int n = N; jamie@55: float pivot, temp, percentile; jamie@42: jamie@42: pivot = temp = 0.f; jamie@55: percentile = ((float *)argv)[1]; jamie@25: jamie@140: while(n--) pivot += data[n]; jamie@25: jamie@55: pivot *= percentile / 100.f; jamie@25: jamie@42: for(n = 0; temp < pivot; n++) jamie@140: temp += data[n]; jamie@1: jamie@55: *result = n * ((float *)argv)[0]; jamie@55: /* *result = (n / (float)N) * (((float *)argv)[1] * .5); */ jamie@25: jamie@56: return XTRACT_SUCCESS; jamie@1: } jamie@1: jamie@140: int xtract_loudness(const float *data, const int N, const void *argv, float *result) jamie@140: { jamie@25: jamie@47: int n = N, rv; jamie@25: jamie@113: *result = 0.f; jamie@113: jamie@140: if(n > XTRACT_BARK_BANDS) jamie@140: { jamie@140: n = XTRACT_BARK_BANDS; jamie@140: rv = XTRACT_BAD_VECTOR_SIZE; jamie@93: } jamie@47: else jamie@140: rv = XTRACT_SUCCESS; jamie@1: jamie@1: while(n--) jamie@140: *result += powf(data[n], 0.23); jamie@38: jamie@47: return rv; jamie@1: } jamie@1: jamie@140: int xtract_flatness(const float *data, const int N, const void *argv, float *result) jamie@140: { jamie@1: jamie@113: int n, count, denormal_found; jamie@1: jamie@140: double num, den, temp; jamie@25: jamie@113: num = 1.f; jamie@113: den = temp = 0.f; jamie@43: jamie@113: denormal_found = 0; jamie@113: count = 0; jamie@113: jamie@140: for(n = 0; n < N; n++) jamie@140: { jamie@140: if((temp = data[n]) != 0.f) jamie@140: { jamie@140: if (xtract_is_denormal(num)) jamie@140: { jamie@113: denormal_found = 1; jamie@113: break; jamie@113: } jamie@113: num *= temp; jamie@113: den += temp; jamie@113: count++; jamie@113: } jamie@1: } jamie@44: jamie@140: if(!count) jamie@140: { jamie@113: *result = 0.f; jamie@113: return XTRACT_NO_RESULT; jamie@113: } jamie@25: jamie@113: num = powf(num, 1.f / (float)N); jamie@113: den /= (float)N; jamie@44: jamie@44: jamie@113: *result = (float) (num / den); jamie@113: jamie@113: if(denormal_found) jamie@113: return XTRACT_DENORMAL_FOUND; jamie@113: else jamie@113: return XTRACT_SUCCESS; jamie@140: jamie@113: } jamie@113: jamie@140: int xtract_flatness_db(const float *data, const int N, const void *argv, float *result) jamie@140: { jamie@113: jamie@115: float flatness; jamie@113: jamie@115: flatness = *(float *)argv; jamie@113: jamie@140: if (flatness <= 0) jamie@115: flatness = XTRACT_LOG_LIMIT; jamie@113: jamie@115: *result = 10 * log10f(flatness); jamie@25: jamie@56: return XTRACT_SUCCESS; jamie@44: jamie@1: } jamie@1: jamie@140: int xtract_tonality(const float *data, const int N, const void *argv, float *result) jamie@140: { jamie@25: jamie@113: float sfmdb; jamie@25: jamie@113: sfmdb = *(float *)argv; jamie@1: jamie@113: *result = XTRACT_MIN(sfmdb / -60.f, 1); jamie@25: jamie@56: return XTRACT_SUCCESS; jamie@1: } jamie@1: jamie@140: int xtract_crest(const float *data, const int N, const void *argv, float *result) jamie@140: { jamie@25: jamie@140: float max, mean; jamie@45: jamie@45: max = mean = 0.f; jamie@45: jamie@45: max = *(float *)argv; jamie@45: mean = *((float *)argv+1); jamie@45: jamie@45: *result = max / mean; jamie@45: jamie@56: return XTRACT_SUCCESS; jamie@25: jamie@1: } jamie@1: jamie@140: int xtract_noisiness(const float *data, const int N, const void *argv, float *result) jamie@140: { jamie@25: jamie@45: float h, i, p; /*harmonics, inharmonics, partials */ jamie@45: jamie@45: i = p = h = 0.f; jamie@45: jamie@45: h = *(float *)argv; jamie@45: p = *((float *)argv+1); jamie@45: jamie@45: i = p - h; jamie@45: jamie@45: *result = i / p; jamie@45: jamie@56: return XTRACT_SUCCESS; jamie@25: jamie@1: } jamie@2: jamie@140: int xtract_rms_amplitude(const float *data, const int N, const void *argv, float *result) jamie@140: { jamie@1: jamie@1: int n = N; jamie@1: jamie@113: *result = 0.f; jamie@113: jamie@56: while(n--) *result += XTRACT_SQ(data[n]); jamie@1: jamie@113: *result = sqrtf(*result / (float)N); jamie@25: jamie@56: return XTRACT_SUCCESS; jamie@1: } jamie@1: jamie@140: int xtract_spectral_inharmonicity(const float *data, const int N, const void *argv, float *result) jamie@140: { jamie@1: jamie@41: int n = N >> 1; jamie@140: float num = 0.f, den = 0.f, fund; jamie@43: const float *freqs, *amps; jamie@1: jamie@41: fund = *(float *)argv; jamie@52: amps = data; jamie@52: freqs = data + n; jamie@25: jamie@140: while(n--) jamie@140: { jamie@140: if(amps[n]) jamie@140: { jamie@140: num += fabsf(freqs[n] - n * fund) * XTRACT_SQ(amps[n]); jamie@140: den += XTRACT_SQ(amps[n]); jamie@140: } jamie@1: } jamie@1: jamie@140: *result = (2 * num) / (fund * den); jamie@25: jamie@56: return XTRACT_SUCCESS; jamie@1: } jamie@1: jamie@1: jamie@140: int xtract_power(const float *data, const int N, const void *argv, float *result) jamie@140: { jamie@1: jamie@56: return XTRACT_FEATURE_NOT_IMPLEMENTED; jamie@25: jamie@1: } jamie@1: jamie@140: int xtract_odd_even_ratio(const float *data, const int N, const void *argv, float *result) jamie@140: { jamie@1: jamie@43: int M = (N >> 1), n; jamie@1: jamie@113: float odd = 0.f, even = 0.f, temp; jamie@44: jamie@140: for(n = 0; n < M; n++) jamie@140: { jamie@140: if((temp = data[n])) jamie@140: { jamie@140: if(XTRACT_IS_ODD(n)) jamie@140: { jamie@140: odd += temp; jamie@140: } jamie@140: else jamie@140: { jamie@140: even += temp; jamie@140: } jamie@140: } jamie@1: } jamie@1: jamie@140: if(odd == 0.f || even == 0.f) jamie@140: { jamie@113: *result = 0.f; jamie@113: return XTRACT_NO_RESULT; jamie@113: } jamie@140: else jamie@140: { jamie@113: *result = odd / even; jamie@113: return XTRACT_SUCCESS; jamie@113: } jamie@1: } jamie@1: jamie@140: int xtract_sharpness(const float *data, const int N, const void *argv, float *result) jamie@140: { jamie@1: jamie@48: int n = N, rv; jamie@113: float sl, g; /* sl = specific loudness */ jamie@140: double temp; jamie@48: jamie@113: sl = g = 0.f; jamie@113: temp = 0.f; jamie@48: jamie@140: if(n > XTRACT_BARK_BANDS) jamie@140: rv = XTRACT_BAD_VECTOR_SIZE; jamie@48: else jamie@140: rv = XTRACT_SUCCESS; jamie@48: jamie@48: jamie@140: while(n--) jamie@140: { jamie@140: sl = powf(data[n], 0.23); jamie@140: g = (n < 15 ? 1.f : 0.066 * expf(0.171 * n)); jamie@140: temp += n * g * sl; jamie@48: } jamie@48: jamie@113: temp = 0.11 * temp / (float)N; jamie@113: *result = (float)temp; jamie@48: jamie@48: return rv; jamie@25: jamie@1: } jamie@1: jamie@140: int xtract_spectral_slope(const float *data, const int N, const void *argv, float *result) jamie@140: { jamie@1: jamie@140: const float *freqs, *amps; jamie@48: float f, a, jamie@140: F, A, FA, FXTRACT_SQ; /* sums of freqs, amps, freq * amps, freq squared */ jamie@140: int n, M; jamie@140: jamie@56: F = A = FA = FXTRACT_SQ = 0.f; jamie@48: n = M = N >> 1; jamie@48: jamie@52: amps = data; jamie@52: freqs = data + n; jamie@48: jamie@140: while(n--) jamie@140: { jamie@140: f = freqs[n]; jamie@140: a = amps[n]; jamie@140: F += f; jamie@140: A += a; jamie@140: FA += f * a; jamie@140: FXTRACT_SQ += f * f; jamie@48: } jamie@48: jamie@140: *result = (1.f / A) * (M * FA - F * A) / (M * FXTRACT_SQ - F * F); jamie@48: jamie@56: return XTRACT_SUCCESS; jamie@25: jamie@1: } jamie@1: jamie@140: int xtract_lowest_value(const float *data, const int N, const void *argv, float *result) jamie@140: { jamie@25: jamie@45: int n = N; jamie@45: float temp; jamie@45: jamie@46: *result = data[--n]; jamie@45: jamie@140: while(n--) jamie@140: { jamie@140: if((temp = data[n]) > *(float *)argv) jamie@140: *result = XTRACT_MIN(*result, data[n]); jamie@45: } jamie@45: jamie@56: return XTRACT_SUCCESS; jamie@45: } jamie@45: jamie@140: int xtract_highest_value(const float *data, const int N, const void *argv, float *result) jamie@140: { jamie@45: jamie@1: int n = N; jamie@1: jamie@46: *result = data[--n]; jamie@44: jamie@140: while(n--) jamie@140: *result = XTRACT_MAX(*result, data[n]); jamie@44: jamie@56: return XTRACT_SUCCESS; jamie@1: } jamie@1: jamie@45: jamie@140: int xtract_sum(const float *data, const int N, const void *argv, float *result) jamie@140: { jamie@45: jamie@45: int n = N; jamie@45: jamie@113: *result = 0.f; jamie@113: jamie@45: while(n--) jamie@140: *result += *data++; jamie@45: jamie@56: return XTRACT_SUCCESS; jamie@45: jamie@45: } jamie@45: jamie@140: int xtract_nonzero_count(const float *data, const int N, const void *argv, float *result) jamie@140: { jamie@59: jamie@59: int n = N; jamie@140: jamie@122: *result = 0.f; jamie@59: jamie@59: while(n--) jamie@140: *result += (*data++ ? 1 : 0); jamie@59: jamie@59: return XTRACT_SUCCESS; jamie@59: jamie@59: } jamie@59: jamie@140: int xtract_hps(const float *data, const int N, const void *argv, float *result) jamie@140: { jamie@1: jamie@1: int n = N, M, m, l, peak_index, position1_lwr; jamie@140: float *coeffs2, *coeffs3, *product, L, jamie@140: largest1_lwr, peak, ratio1, sr; jamie@1: jamie@25: sr = *(float*)argv; jamie@78: if(sr == 0) jamie@140: sr = 44100.f; jamie@25: jamie@1: coeffs2 = (float *)malloc(N * sizeof(float)); jamie@1: coeffs3 = (float *)malloc(N * sizeof(float)); jamie@1: product = (float *)malloc(N * sizeof(float)); jamie@25: jamie@1: while(n--) coeffs2[n] = coeffs3[n] = 1; jamie@1: jamie@1: M = N >> 1; jamie@113: L = N / 3.f; jamie@1: jamie@140: while(M--) jamie@140: { jamie@140: m = M << 1; jamie@140: coeffs2[M] = (data[m] + data[m+1]) * 0.5f; jamie@1: jamie@140: if(M < L) jamie@140: { jamie@140: l = M * 3; jamie@140: coeffs3[M] = (data[l] + data[l+1] + data[l+2]) / 3.f; jamie@140: } jamie@1: } jamie@25: jamie@1: peak_index = peak = 0; jamie@25: jamie@140: for(n = 1; n < N; n++) jamie@140: { jamie@140: product[n] = data[n] * coeffs2[n] * coeffs3[n]; jamie@140: if(product[n] > peak) jamie@140: { jamie@140: peak_index = n; jamie@140: peak = product[n]; jamie@140: } jamie@1: } jamie@1: jamie@1: largest1_lwr = position1_lwr = 0; jamie@1: jamie@140: for(n = 0; n < N; n++) jamie@140: { jamie@140: if(data[n] > largest1_lwr && n != peak_index) jamie@140: { jamie@140: largest1_lwr = data[n]; jamie@140: position1_lwr = n; jamie@140: } jamie@1: } jamie@1: jamie@1: ratio1 = data[position1_lwr] / data[peak_index]; jamie@1: jamie@140: if(position1_lwr > peak_index * 0.4 && position1_lwr < jamie@140: peak_index * 0.6 && ratio1 > 0.1) jamie@140: peak_index = position1_lwr; jamie@1: jamie@140: *result = sr / (float)peak_index; jamie@25: jamie@1: free(coeffs2); jamie@1: free(coeffs3); jamie@1: free(product); jamie@25: jamie@56: return XTRACT_SUCCESS; jamie@1: } jamie@5: jamie@5: jamie@140: int xtract_f0(const float *data, const int N, const void *argv, float *result) jamie@140: { jamie@5: jamie@78: int M, tau, n; jamie@78: float sr; jamie@43: size_t bytes; jamie@140: float f0, err_tau_1, err_tau_x, array_max, jamie@140: threshold_peak, threshold_centre, jamie@140: *input; jamie@22: jamie@25: sr = *(float *)argv; jamie@78: if(sr == 0) jamie@140: sr = 44100.f; jamie@43: jamie@43: input = (float *)malloc(bytes = N * sizeof(float)); jamie@43: input = memcpy(input, data, bytes); jamie@25: /* threshold_peak = *((float *)argv+1); jamie@140: threshold_centre = *((float *)argv+2); jamie@140: printf("peak: %.2f\tcentre: %.2f\n", threshold_peak, threshold_centre);*/ jamie@25: /* add temporary dynamic control over thresholds to test clipping effects */ jamie@22: jamie@25: /* FIX: tweak and make into macros */ jamie@25: threshold_peak = .8; jamie@25: threshold_centre = .3; jamie@25: M = N >> 1; jamie@25: err_tau_1 = 0; jamie@25: array_max = 0; jamie@25: jamie@25: /* Find the array max */ jamie@140: for(n = 0; n < N; n++) jamie@140: { jamie@140: if (input[n] > array_max) jamie@140: array_max = input[n]; jamie@12: } jamie@25: jamie@25: threshold_peak *= array_max; jamie@25: jamie@25: /* peak clip */ jamie@140: for(n = 0; n < N; n++) jamie@140: { jamie@140: if(input[n] > threshold_peak) jamie@140: input[n] = threshold_peak; jamie@140: else if(input[n] < -threshold_peak) jamie@140: input[n] = -threshold_peak; jamie@25: } jamie@25: jamie@25: threshold_centre *= array_max; jamie@25: jamie@25: /* Centre clip */ jamie@140: for(n = 0; n < N; n++) jamie@140: { jamie@140: if (input[n] < threshold_centre) jamie@140: input[n] = 0; jamie@140: else jamie@140: input[n] -= threshold_centre; jamie@25: } jamie@25: jamie@25: /* Estimate fundamental freq */ jamie@25: for (n = 1; n < M; n++) jamie@140: err_tau_1 = err_tau_1 + fabsf(input[n] - input[n+1]); jamie@140: /* FIX: this doesn't pose too much load if it returns 'early', but if it can't find f0, load can be significant for larger block sizes M^2 iterations! */ jamie@140: for (tau = 2; tau < M; tau++) jamie@140: { jamie@140: err_tau_x = 0; jamie@140: for (n = 1; n < M; n++) jamie@140: { jamie@140: err_tau_x = err_tau_x + fabsf(input[n] - input[n+tau]); jamie@140: } jamie@140: if (err_tau_x < err_tau_1) jamie@140: { jamie@140: f0 = sr / (tau + (err_tau_x / err_tau_1)); jamie@140: *result = f0; jamie@140: free(input); jamie@140: return XTRACT_SUCCESS; jamie@140: } jamie@25: } jamie@43: *result = -0; jamie@43: free(input); jamie@56: return XTRACT_NO_RESULT; jamie@5: } jamie@43: jamie@140: int xtract_failsafe_f0(const float *data, const int N, const void *argv, float *result) jamie@140: { jamie@44: jamie@59: float *spectrum = NULL, argf[2], *peaks = NULL, return_code, sr; jamie@44: jamie@43: return_code = xtract_f0(data, N, argv, result); jamie@44: jamie@140: if(return_code == XTRACT_NO_RESULT) jamie@140: { jamie@44: jamie@140: sr = *(float *)argv; jamie@140: if(sr == 0) jamie@140: sr = 44100.f; jamie@140: spectrum = (float *)malloc(N * sizeof(float)); jamie@140: peaks = (float *)malloc(N * sizeof(float)); jamie@140: argf[0] = sr; jamie@140: argf[1] = XTRACT_MAGNITUDE_SPECTRUM; jamie@140: xtract_spectrum(data, N, argf, spectrum); jamie@140: argf[1] = 10.f; jamie@140: xtract_peak_spectrum(spectrum, N >> 1, argf, peaks); jamie@140: argf[0] = 0.f; jamie@140: xtract_lowest_value(peaks+(N >> 1), N >> 1, argf, result); jamie@44: jamie@140: free(spectrum); jamie@140: free(peaks); jamie@43: } jamie@43: jamie@56: return XTRACT_SUCCESS; jamie@43: jamie@43: } jamie@44: