cannam@50: cannam@50: cannam@50:
cannam@50: cannam@50:
cannam@50: VampPluginSDK
cannam@50: 2.1
cannam@50:
cannam@50:
cannam@50: |
cannam@50:
cannam@50:
cannam@50:
cannam@50:
00001 /* -*- c-basic-offset: 4 indent-tabs-mode: nil -*- vi:set ts=8 sts=4 sw=4: */ cannam@50: 00002 cannam@50: 00003 /* cannam@50: 00004 Vamp cannam@50: 00005 cannam@50: 00006 An API for audio analysis and feature extraction plugins. cannam@50: 00007 cannam@50: 00008 Centre for Digital Music, Queen Mary, University of London. cannam@50: 00009 Copyright 2006 Chris Cannam. cannam@50: 00010 cannam@50: 00011 Permission is hereby granted, free of charge, to any person cannam@50: 00012 obtaining a copy of this software and associated documentation cannam@50: 00013 files (the "Software"), to deal in the Software without cannam@50: 00014 restriction, including without limitation the rights to use, copy, cannam@50: 00015 modify, merge, publish, distribute, sublicense, and/or sell copies cannam@50: 00016 of the Software, and to permit persons to whom the Software is cannam@50: 00017 furnished to do so, subject to the following conditions: cannam@50: 00018 cannam@50: 00019 The above copyright notice and this permission notice shall be cannam@50: 00020 included in all copies or substantial portions of the Software. cannam@50: 00021 cannam@50: 00022 THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, cannam@50: 00023 EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF cannam@50: 00024 MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND cannam@50: 00025 NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR cannam@50: 00026 ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF cannam@50: 00027 CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION cannam@50: 00028 WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. cannam@50: 00029 cannam@50: 00030 Except as contained in this notice, the names of the Centre for cannam@50: 00031 Digital Music; Queen Mary, University of London; and Chris Cannam cannam@50: 00032 shall not be used in advertising or otherwise to promote the sale, cannam@50: 00033 use or other dealings in this Software without prior written cannam@50: 00034 authorization. cannam@50: 00035 */ cannam@50: 00036 cannam@50: 00037 #include "ZeroCrossing.h" cannam@50: 00038 cannam@50: 00039 using std::string; cannam@50: 00040 using std::vector; cannam@50: 00041 using std::cerr; cannam@50: 00042 using std::endl; cannam@50: 00043 cannam@50: 00044 #include <cmath> cannam@50: 00045 cannam@50: 00046 ZeroCrossing::ZeroCrossing(float inputSampleRate) : cannam@50: 00047 Plugin(inputSampleRate), cannam@50: 00048 m_stepSize(0), cannam@50: 00049 m_previousSample(0.0f) cannam@50: 00050 { cannam@50: 00051 } cannam@50: 00052 cannam@50: 00053 ZeroCrossing::~ZeroCrossing() cannam@50: 00054 { cannam@50: 00055 } cannam@50: 00056 cannam@50: 00057 string cannam@50: 00058 ZeroCrossing::getIdentifier() const cannam@50: 00059 { cannam@50: 00060 return "zerocrossing"; cannam@50: 00061 } cannam@50: 00062 cannam@50: 00063 string cannam@50: 00064 ZeroCrossing::getName() const cannam@50: 00065 { cannam@50: 00066 return "Zero Crossings"; cannam@50: 00067 } cannam@50: 00068 cannam@50: 00069 string cannam@50: 00070 ZeroCrossing::getDescription() const cannam@50: 00071 { cannam@50: 00072 return "Detect and count zero crossing points"; cannam@50: 00073 } cannam@50: 00074 cannam@50: 00075 string cannam@50: 00076 ZeroCrossing::getMaker() const cannam@50: 00077 { cannam@50: 00078 return "Vamp SDK Example Plugins"; cannam@50: 00079 } cannam@50: 00080 cannam@50: 00081 int cannam@50: 00082 ZeroCrossing::getPluginVersion() const cannam@50: 00083 { cannam@50: 00084 return 2; cannam@50: 00085 } cannam@50: 00086 cannam@50: 00087 string cannam@50: 00088 ZeroCrossing::getCopyright() const cannam@50: 00089 { cannam@50: 00090 return "Freely redistributable (BSD license)"; cannam@50: 00091 } cannam@50: 00092 cannam@50: 00093 bool cannam@50: 00094 ZeroCrossing::initialise(size_t channels, size_t stepSize, size_t blockSize) cannam@50: 00095 { cannam@50: 00096 if (channels < getMinChannelCount() || cannam@50: 00097 channels > getMaxChannelCount()) return false; cannam@50: 00098 cannam@50: 00099 m_stepSize = std::min(stepSize, blockSize); cannam@50: 00100 cannam@50: 00101 return true; cannam@50: 00102 } cannam@50: 00103 cannam@50: 00104 void cannam@50: 00105 ZeroCrossing::reset() cannam@50: 00106 { cannam@50: 00107 m_previousSample = 0.0f; cannam@50: 00108 } cannam@50: 00109 cannam@50: 00110 ZeroCrossing::OutputList cannam@50: 00111 ZeroCrossing::getOutputDescriptors() const cannam@50: 00112 { cannam@50: 00113 OutputList list; cannam@50: 00114 cannam@50: 00115 OutputDescriptor zc; cannam@50: 00116 zc.identifier = "counts"; cannam@50: 00117 zc.name = "Zero Crossing Counts"; cannam@50: 00118 zc.description = "The number of zero crossing points per processing block"; cannam@50: 00119 zc.unit = "crossings"; cannam@50: 00120 zc.hasFixedBinCount = true; cannam@50: 00121 zc.binCount = 1; cannam@50: 00122 zc.hasKnownExtents = false; cannam@50: 00123 zc.isQuantized = true; cannam@50: 00124 zc.quantizeStep = 1.0; cannam@50: 00125 zc.sampleType = OutputDescriptor::OneSamplePerStep; cannam@50: 00126 list.push_back(zc); cannam@50: 00127 cannam@50: 00128 zc.identifier = "zerocrossings"; cannam@50: 00129 zc.name = "Zero Crossings"; cannam@50: 00130 zc.description = "The locations of zero crossing points"; cannam@50: 00131 zc.unit = ""; cannam@50: 00132 zc.hasFixedBinCount = true; cannam@50: 00133 zc.binCount = 0; cannam@50: 00134 zc.sampleType = OutputDescriptor::VariableSampleRate; cannam@50: 00135 zc.sampleRate = m_inputSampleRate; cannam@50: 00136 list.push_back(zc); cannam@50: 00137 cannam@50: 00138 return list; cannam@50: 00139 } cannam@50: 00140 cannam@50: 00141 ZeroCrossing::FeatureSet cannam@50: 00142 ZeroCrossing::process(const float *const *inputBuffers, cannam@50: 00143 Vamp::RealTime timestamp) cannam@50: 00144 { cannam@50: 00145 if (m_stepSize == 0) { cannam@50: 00146 cerr << "ERROR: ZeroCrossing::process: " cannam@50: 00147 << "ZeroCrossing has not been initialised" cannam@50: 00148 << endl; cannam@50: 00149 return FeatureSet(); cannam@50: 00150 } cannam@50: 00151 cannam@50: 00152 float prev = m_previousSample; cannam@50: 00153 size_t count = 0; cannam@50: 00154 cannam@50: 00155 FeatureSet returnFeatures; cannam@50: 00156 cannam@50: 00157 for (size_t i = 0; i < m_stepSize; ++i) { cannam@50: 00158 cannam@50: 00159 float sample = inputBuffers[0][i]; cannam@50: 00160 bool crossing = false; cannam@50: 00161 cannam@50: 00162 if (sample <= 0.0) { cannam@50: 00163 if (prev > 0.0) crossing = true; cannam@50: 00164 } else if (sample > 0.0) { cannam@50: 00165 if (prev <= 0.0) crossing = true; cannam@50: 00166 } cannam@50: 00167 cannam@50: 00168 if (crossing) { cannam@50: 00169 ++count; cannam@50: 00170 Feature feature; cannam@50: 00171 feature.hasTimestamp = true; cannam@50: 00172 feature.timestamp = timestamp + cannam@50: 00173 Vamp::RealTime::frame2RealTime(i, (size_t)m_inputSampleRate); cannam@50: 00174 returnFeatures[1].push_back(feature); cannam@50: 00175 } cannam@50: 00176 cannam@50: 00177 prev = sample; cannam@50: 00178 } cannam@50: 00179 cannam@50: 00180 m_previousSample = prev; cannam@50: 00181 cannam@50: 00182 Feature feature; cannam@50: 00183 feature.hasTimestamp = false; cannam@50: 00184 feature.values.push_back(float(count)); cannam@50: 00185 cannam@50: 00186 returnFeatures[0].push_back(feature); cannam@50: 00187 return returnFeatures; cannam@50: 00188 } cannam@50: 00189 cannam@50: 00190 ZeroCrossing::FeatureSet cannam@50: 00191 ZeroCrossing::getRemainingFeatures() cannam@50: 00192 { cannam@50: 00193 return FeatureSet(); cannam@50: 00194 } cannam@50: 00195 cannam@50: