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 Vamp feature extraction plugin using the MATCH audio alignment
|
cannam@0
|
4 algorithm.
|
cannam@0
|
5
|
cannam@0
|
6 Centre for Digital Music, Queen Mary, University of London.
|
cannam@0
|
7 This file copyright 2007 Simon Dixon, Chris Cannam and QMUL.
|
cannam@0
|
8
|
cannam@0
|
9 This program is free software; you can redistribute it and/or
|
cannam@0
|
10 modify it under the terms of the GNU General Public License as
|
cannam@0
|
11 published by the Free Software Foundation; either version 2 of the
|
cannam@0
|
12 License, or (at your option) any later version. See the file
|
cannam@0
|
13 COPYING included with this distribution for more information.
|
cannam@0
|
14 */
|
cannam@0
|
15
|
Chris@24
|
16 #ifndef _MATCH_FEATURE_FEEDER_H_
|
Chris@24
|
17 #define _MATCH_FEATURE_FEEDER_H_
|
cannam@0
|
18
|
cannam@0
|
19 #include "Matcher.h"
|
cannam@0
|
20 #include "Finder.h"
|
cannam@0
|
21
|
cannam@0
|
22 #include <queue>
|
Chris@14
|
23 #include <vector>
|
cannam@0
|
24
|
Chris@24
|
25 class MatchFeatureFeeder
|
cannam@0
|
26 {
|
cannam@0
|
27 public:
|
Chris@24
|
28 MatchFeatureFeeder(Matcher *m1, Matcher *m2);
|
Chris@24
|
29 ~MatchFeatureFeeder();
|
cannam@0
|
30
|
Chris@14
|
31 /**
|
Chris@24
|
32 * Feed the two supplied feature vectors to feeders 1 and 2
|
Chris@24
|
33 * respectively (depending on their advance status). Matchers must
|
Chris@24
|
34 * have been constructed using the external featureSize
|
Chris@24
|
35 * constructor.
|
Chris@60
|
36 *
|
Chris@60
|
37 * f1 and f2 are normally expected to have the same number of
|
Chris@60
|
38 * values, and that number should be the featureSize passed to the
|
Chris@60
|
39 * constructors for both Matchers. The exception is when one input
|
Chris@60
|
40 * ends before the other one: subsequent calls should pass a
|
Chris@60
|
41 * feature vector as normal for the input that is still going on,
|
Chris@60
|
42 * and an empty vector for the one that has ended.
|
Chris@14
|
43 */
|
Chris@24
|
44 void feed(std::vector<double> f1, std::vector<double> f2);
|
Chris@14
|
45
|
Chris@63
|
46 /**
|
Chris@167
|
47 * Get the best estimate for the frame in the reference (f1)
|
Chris@167
|
48 * corresponding to the latest frame in the other input (f2).
|
Chris@167
|
49 */
|
Chris@167
|
50 int getEstimatedReferenceFrame();
|
Chris@167
|
51
|
Chris@167
|
52 /**
|
Chris@63
|
53 * Indicate that both inputs have come to an end.
|
Chris@63
|
54 */
|
Chris@63
|
55 void finish();
|
Chris@135
|
56
|
Chris@135
|
57 /**
|
Chris@135
|
58 * Return the forward path, that is, the estimate of the
|
Chris@135
|
59 * lowest-cost path that was generated (possibly in real-time)
|
Chris@135
|
60 * while initially tracking the inputs. This is the path that is
|
Chris@135
|
61 * used to determine the shape of the search zone within which the
|
Chris@135
|
62 * eventual reverse path will be sought by the Finder.
|
Chris@135
|
63 */
|
Chris@135
|
64 void retrieveForwardPath(std::vector<int> &pathx, std::vector<int> &pathy) {
|
Chris@135
|
65 pathx = m_fpx;
|
Chris@135
|
66 pathy = m_fpy;
|
Chris@135
|
67 }
|
Chris@135
|
68
|
Chris@167
|
69 Finder *getFinder() { return &m_finder; }
|
cannam@0
|
70
|
cannam@0
|
71 protected:
|
Chris@24
|
72 void feedBlock();
|
Chris@24
|
73 void feed1();
|
Chris@24
|
74 void feed2();
|
cannam@0
|
75
|
Chris@147
|
76 Matcher *m_pm1; // I do not own this
|
Chris@147
|
77 Matcher *m_pm2; // I do not own this
|
cannam@0
|
78
|
Chris@167
|
79 Finder m_finder; // I own this, and it refers to m_pm1
|
Chris@167
|
80
|
Chris@74
|
81 std::queue<std::vector<double> > m_q1;
|
Chris@74
|
82 std::queue<std::vector<double> > m_q2;
|
Chris@135
|
83
|
Chris@135
|
84 vector<int> m_fpx;
|
Chris@135
|
85 vector<int> m_fpy;
|
Chris@171
|
86
|
Chris@171
|
87 // not provided:
|
Chris@171
|
88 MatchFeatureFeeder(const MatchFeatureFeeder &other);
|
Chris@171
|
89 MatchFeatureFeeder &operator=(const MatchFeatureFeeder &other);
|
cannam@0
|
90 };
|
cannam@0
|
91
|
cannam@0
|
92 #endif
|