Chris@366: /* -*- c-basic-offset: 4 indent-tabs-mode: nil -*-  vi:set ts=8 sts=4 sw=4: */
Chris@366: 
Chris@366: #include "cq/CQSpectrogram.h"
Chris@366: 
Chris@366: #include "dsp/Window.h"
Chris@366: 
Chris@366: #include <cmath>
Chris@366: #include <vector>
Chris@366: #include <iostream>
Chris@366: 
Chris@366: using std::vector;
Chris@366: using std::cerr;
Chris@366: using std::endl;
Chris@366: 
Chris@366: #define BOOST_TEST_DYN_LINK
Chris@366: #define BOOST_TEST_MAIN
Chris@366: 
Chris@366: #include <boost/test/unit_test.hpp>
Chris@366: 
Chris@366: BOOST_AUTO_TEST_SUITE(TestCQTime)
Chris@366: 
Chris@366: // Principle: Run a Dirac impulse through the CQ transform and check
Chris@366: // that its output has all the peak bins aligned correctly in time.
Chris@366: 
Chris@366: // Set up fs/2 = 50, frequency range 10 -> 40 i.e. 2 octaves, fixed
Chris@366: // duration of 2 seconds
Chris@366: static const double sampleRate = 100;
Chris@366: static const double cqmin = 10;
Chris@366: static const double cqmax = 40;
Chris@366: static const double bpo = 4;
Chris@366: static const int duration = sampleRate * 2;
Chris@366: 
Chris@366: // Threshold below which to ignore a column completely
Chris@366: static const double threshold = 0.08;
Chris@366: 
Chris@366: void
Chris@366: testCQTime(double t)
Chris@366: {
Chris@366:     vector<CQSpectrogram::Interpolation> interpolationTypes;
Chris@366:     interpolationTypes.push_back(CQSpectrogram::InterpolateZeros);
Chris@366:     interpolationTypes.push_back(CQSpectrogram::InterpolateHold);
Chris@366:     interpolationTypes.push_back(CQSpectrogram::InterpolateLinear);
Chris@366: 
Chris@366:     for (int k = 0; k < int(interpolationTypes.size()); ++k) {
Chris@366: 
Chris@366:         CQSpectrogram::Interpolation interp = interpolationTypes[k];
Chris@366: 
Chris@366:         CQParameters params(sampleRate, cqmin, cqmax, bpo);
Chris@366:         CQSpectrogram cq(params, interp);
Chris@366: 
Chris@366:         BOOST_CHECK_EQUAL(cq.getBinsPerOctave(), bpo);
Chris@366:         BOOST_CHECK_EQUAL(cq.getOctaves(), 2);
Chris@366: 
Chris@366:         vector<double> input(duration, 0.0);
Chris@366:         int ix = int(floor(t * sampleRate));
Chris@366:         if (ix >= duration) ix = duration-1;
Chris@366:         input[ix] = 1.0;
Chris@366: 
Chris@366:         CQSpectrogram::RealBlock output = cq.process(input);
Chris@366:         CQSpectrogram::RealBlock rest = cq.getRemainingOutput();
Chris@366:         output.insert(output.end(), rest.begin(), rest.end());
Chris@366: 
Chris@366:         BOOST_CHECK_EQUAL(output[0].size(), 
Chris@366:                           cq.getBinsPerOctave() * cq.getOctaves());
Chris@366: 
Chris@366:         vector<int> peaks;
Chris@366:         double eps = 1e-8;
Chris@366: 
Chris@366:         for (int j = 0; j < int(output[0].size()); ++j) {
Chris@366: 
Chris@366:             int maxidx = -1;
Chris@366:             double max = 0.0;
Chris@366:             for (int i = 0; i < int(output.size()); ++i) {
Chris@366:                 double value = output[i][j];
Chris@366:                 if (i == 0 || value + eps > max) {
Chris@366:                     max = value;
Chris@366:                     maxidx = i;
Chris@366:                 }
Chris@366:             }
Chris@366: 
Chris@366:             peaks.push_back(maxidx);
Chris@366:         }
Chris@366: 
Chris@366:         for (int j = 1; j < int(peaks.size()); ++j) {
Chris@366:             int oct = j / bpo;
Chris@366:             int spacing = (1 << oct);
Chris@366:             int actual = peaks[j]/spacing;
Chris@366:             int expected = int(round(double(peaks[0])/spacing));
Chris@366:             if (actual != expected) {
Chris@366:                 cerr << "ERROR: In row " << j << " (bin freq "
Chris@366:                      << cq.getBinFrequency(j) << "), interpolation " << interp
Chris@366:                      << ", maximum value for time " << t 
Chris@366:                      << "\n       found at index " << peaks[j] 
Chris@366:                      << " of " << output.size() << " which does not align with"
Chris@366:                      << " highest frequency\n       bin peak at " << peaks[0]
Chris@366:                      << " given octave spacing of " << spacing
Chris@366:                      << "\n       [latency = " << cq.getLatency()
Chris@366:                      << ", hop = " << cq.getColumnHop() << ", duration = "
Chris@366:                      << duration << ", ix = " << ix << "]" << endl;
Chris@366:                 cerr << "row contains: ";
Chris@366:                 for (int i = 0; i < int(output.size()); ++i) {
Chris@366:                     if (i == expected * spacing) cerr << "*";
Chris@366:                     if (i == peaks[j]) cerr << "**";
Chris@366:                     cerr << output[i][j] << " ";
Chris@366:                 }
Chris@366:                 cerr << endl;
Chris@366: 
Chris@366:                 BOOST_CHECK_EQUAL(actual, expected);
Chris@366:             }
Chris@366:         }
Chris@366:     }
Chris@366: }
Chris@366: 
Chris@366: BOOST_AUTO_TEST_CASE(time_zero) { testCQTime(0); }
Chris@366: BOOST_AUTO_TEST_CASE(time_half) { testCQTime(0.5); }
Chris@366: BOOST_AUTO_TEST_CASE(time_one) { testCQTime(1.0); }
Chris@366: BOOST_AUTO_TEST_CASE(time_two) { testCQTime(2.0); }
Chris@366: 
Chris@366: BOOST_AUTO_TEST_SUITE_END()
Chris@366: