Chris@103
|
1 /* -*- c-basic-offset: 4 indent-tabs-mode: nil -*- vi:set ts=8 sts=4 sw=4: */
|
Chris@103
|
2
|
Chris@103
|
3 /*
|
Chris@103
|
4 Vamp feature extraction plugin using the MATCH audio alignment
|
Chris@103
|
5 algorithm.
|
Chris@103
|
6
|
Chris@103
|
7 Centre for Digital Music, Queen Mary, University of London.
|
Chris@103
|
8
|
Chris@103
|
9 This program is free software; you can redistribute it and/or
|
Chris@103
|
10 modify it under the terms of the GNU General Public License as
|
Chris@103
|
11 published by the Free Software Foundation; either version 2 of the
|
Chris@103
|
12 License, or (at your option) any later version. See the file
|
Chris@103
|
13 COPYING included with this distribution for more information.
|
Chris@103
|
14 */
|
Chris@103
|
15
|
Chris@103
|
16 #include "FeatureConditioner.h"
|
Chris@103
|
17
|
Chris@103
|
18 #include <iostream>
|
Chris@103
|
19
|
Chris@103
|
20 using namespace std;
|
Chris@103
|
21
|
Chris@103
|
22 vector<double>
|
Chris@103
|
23 FeatureConditioner::process(const vector<double> &feature)
|
Chris@103
|
24 {
|
Chris@103
|
25 if (m_prev.empty()) {
|
Chris@103
|
26 m_prev.resize(feature.size(), 0.0);
|
Chris@103
|
27 }
|
Chris@103
|
28 if (m_prev.size() != feature.size()) {
|
Chris@103
|
29 cerr << "ERROR: FeatureConditioner::process: feature size "
|
Chris@103
|
30 << feature.size() << " differs from previous feature size "
|
Chris@103
|
31 << m_prev.size() << endl;
|
Chris@103
|
32 return feature;
|
Chris@103
|
33 }
|
Chris@103
|
34
|
Chris@103
|
35 int size = feature.size();
|
Chris@103
|
36
|
Chris@103
|
37 vector<double> out(size, 0.0);
|
Chris@103
|
38
|
Chris@103
|
39 double totalEnergy = 0;
|
Chris@116
|
40
|
Chris@116
|
41 switch (m_params.order) {
|
Chris@116
|
42
|
Chris@116
|
43 case OutputRectifiedDerivative:
|
Chris@103
|
44 for (int i = 0; i < size; i++) {
|
Chris@103
|
45 totalEnergy += feature[i];
|
Chris@103
|
46 if (feature[i] > m_prev[i]) {
|
Chris@103
|
47 out[i] = feature[i] - m_prev[i];
|
Chris@103
|
48 } else {
|
Chris@103
|
49 out[i] = 0;
|
Chris@103
|
50 }
|
Chris@103
|
51 }
|
Chris@116
|
52 break;
|
Chris@116
|
53
|
Chris@116
|
54 case OutputDerivative:
|
Chris@103
|
55 for (int i = 0; i < size; i++) {
|
Chris@116
|
56 totalEnergy += feature[i];
|
Chris@116
|
57 out[i] = feature[i] - m_prev[i];
|
Chris@116
|
58 }
|
Chris@116
|
59 break;
|
Chris@116
|
60
|
Chris@116
|
61 case OutputFeatures:
|
Chris@116
|
62 for (int i = 0; i < size; i++) {
|
Chris@116
|
63 totalEnergy += feature[i];
|
Chris@103
|
64 out[i] = feature[i];
|
Chris@103
|
65 }
|
Chris@116
|
66 break;
|
Chris@103
|
67 }
|
Chris@103
|
68
|
Chris@103
|
69 if (m_ltAverage == 0) {
|
Chris@103
|
70 m_ltAverage = totalEnergy;
|
Chris@103
|
71 } else {
|
Chris@103
|
72 double decay = m_params.decay;
|
Chris@103
|
73 m_ltAverage = m_ltAverage * decay + totalEnergy * (1.0 - decay);
|
Chris@103
|
74 }
|
Chris@103
|
75
|
Chris@103
|
76 if (totalEnergy <= m_params.silenceThreshold) {
|
Chris@103
|
77 for (int i = 0; i < size; i++) {
|
Chris@103
|
78 out[i] = 0;
|
Chris@103
|
79 }
|
Chris@103
|
80 } else if (m_params.norm == NormaliseToSum1) {
|
Chris@103
|
81 for (int i = 0; i < size; i++) {
|
Chris@103
|
82 out[i] /= totalEnergy;
|
Chris@103
|
83 }
|
Chris@103
|
84 } else if (m_params.norm == NormaliseToLTAverage) {
|
Chris@103
|
85 for (int i = 0; i < size; i++) {
|
Chris@103
|
86 out[i] /= m_ltAverage;
|
Chris@103
|
87 }
|
Chris@103
|
88 }
|
Chris@103
|
89
|
Chris@103
|
90 m_prev = feature;
|
Chris@103
|
91 return out;
|
Chris@103
|
92 }
|
Chris@103
|
93
|