annotate src/MatchFeatureFeeder.cpp @ 230:175c8f044e7c v1.0

More copyright updates, add CITATION file
author Chris Cannam
date Wed, 09 Sep 2015 09:57:57 +0100
parents f6be68852c1d
children 4d0e9225c179
rev   line source
cannam@0 1 /* -*- c-basic-offset: 4 indent-tabs-mode: nil -*- vi:set ts=8 sts=4 sw=4: */
cannam@0 2
cannam@0 3 /*
cannam@0 4 Vamp feature extraction plugin using the MATCH audio alignment
cannam@0 5 algorithm.
cannam@0 6
cannam@0 7 Centre for Digital Music, Queen Mary, University of London.
Chris@230 8 Copyright (c) 2007-2015 Simon Dixon, Chris Cannam, and Queen Mary
Chris@230 9 University of London, Copyright (c) 2014-2015 Tido GmbH.
cannam@0 10
cannam@0 11 This program is free software; you can redistribute it and/or
cannam@0 12 modify it under the terms of the GNU General Public License as
cannam@0 13 published by the Free Software Foundation; either version 2 of the
cannam@0 14 License, or (at your option) any later version. See the file
cannam@0 15 COPYING included with this distribution for more information.
cannam@0 16 */
cannam@0 17
Chris@24 18 #include "MatchFeatureFeeder.h"
cannam@0 19
Chris@14 20 using std::vector;
Chris@14 21
Chris@24 22 MatchFeatureFeeder::MatchFeatureFeeder(Matcher *m1, Matcher *m2) :
Chris@167 23 m_pm1(m1),
Chris@167 24 m_pm2(m2),
Chris@167 25 m_finder(m_pm1)
cannam@0 26 {
cannam@0 27 }
cannam@0 28
Chris@24 29 MatchFeatureFeeder::~MatchFeatureFeeder()
cannam@0 30 {
cannam@0 31 }
cannam@0 32
Chris@154 33 void
Chris@183 34 MatchFeatureFeeder::feed(feature_t f1, feature_t f2)
cannam@0 35 {
Chris@49 36 // We maintain two FIFO queues of feature vectors, one per input
Chris@49 37 // stream. When the match-feeder function is entered, it knows
Chris@49 38 // that it has at least one feature in each queue. It loops,
Chris@49 39 // processing up to one feature per matcher, until a queue is
Chris@49 40 // empty. Then it returns, to be called again with more data.
Chris@49 41
Chris@60 42 if (!f1.empty()) {
Chris@74 43 m_q1.push(f1);
Chris@60 44 }
Chris@60 45
Chris@60 46 if (!f2.empty()) {
Chris@74 47 m_q2.push(f2);
Chris@60 48 }
Chris@14 49
Chris@74 50 while (!m_q1.empty() && !m_q2.empty()) {
Chris@63 51 feedBlock();
Chris@63 52 }
Chris@63 53 }
Chris@63 54
Chris@167 55 int
Chris@167 56 MatchFeatureFeeder::getEstimatedReferenceFrame()
Chris@167 57 {
Chris@167 58 if (m_pm1->getFrameCount() == 0 || m_pm2->getFrameCount() == 0) {
Chris@167 59 return 0;
Chris@167 60 }
Chris@167 61 int bestRow = 0;
Chris@191 62 normpathcost_t bestCost = 0;
Chris@167 63 if (!m_finder.getBestColCost(m_pm2->getFrameCount()-1, bestRow, bestCost)) {
Chris@167 64 return -1;
Chris@167 65 } else {
Chris@167 66 return bestRow;
Chris@167 67 }
Chris@167 68 }
Chris@167 69
Chris@63 70 void
Chris@63 71 MatchFeatureFeeder::finish()
Chris@63 72 {
Chris@74 73 while (!m_q1.empty() || !m_q2.empty()) {
Chris@24 74 feedBlock();
Chris@14 75 }
Chris@200 76
Chris@200 77 // cerr << "MatchFeatureFeeder::finish: have " << m_pm1->getFrameCount()
Chris@200 78 // << " reference and " << m_pm2->getFrameCount() << " other frames"
Chris@200 79 // << endl;
Chris@14 80 }
Chris@14 81
Chris@24 82 void
Chris@24 83 MatchFeatureFeeder::feedBlock()
Chris@14 84 {
Chris@74 85 if (m_q1.empty()) { // ended
Chris@60 86 feed2();
Chris@74 87 } else if (m_q2.empty()) { // ended
Chris@60 88 feed1();
Chris@171 89 } else if (m_pm1->isFillingInitialBlock()) {
Chris@24 90 feed1();
Chris@24 91 feed2();
Chris@78 92 } else if (m_pm1->isOverrunning()) { // slope constraints
Chris@24 93 feed2();
Chris@78 94 } else if (m_pm2->isOverrunning()) {
Chris@24 95 feed1();
cannam@0 96 } else {
Chris@171 97 switch (m_finder.getExpandDirection()) {
Chris@181 98 case AdvanceThis:
Chris@24 99 feed1();
cannam@0 100 break;
Chris@181 101 case AdvanceOther:
Chris@24 102 feed2();
cannam@0 103 break;
Chris@181 104 case AdvanceBoth:
Chris@24 105 feed1();
Chris@24 106 feed2();
cannam@0 107 break;
Chris@181 108 case AdvanceNone:
Chris@74 109 cerr << "m_finder says AdvanceNone!" << endl;
Chris@45 110 break;
cannam@0 111 }
cannam@0 112 }
Chris@135 113
Chris@135 114 m_fpx.push_back(m_pm2->getFrameCount());
Chris@135 115 m_fpy.push_back(m_pm1->getFrameCount());
cannam@0 116 }
cannam@0 117
Chris@24 118 void
Chris@24 119 MatchFeatureFeeder::feed1()
cannam@0 120 {
Chris@74 121 m_pm1->consumeFeatureVector(m_q1.front());
Chris@74 122 m_q1.pop();
cannam@0 123 }
cannam@0 124
Chris@24 125 void
Chris@24 126 MatchFeatureFeeder::feed2()
cannam@0 127 {
Chris@74 128 m_pm2->consumeFeatureVector(m_q2.front());
Chris@74 129 m_q2.pop();
cannam@0 130 }
cannam@0 131