Mercurial > hg > silvet
comparison constant-q-cpp/cq/CQSpectrogram.h @ 366:5d0a2ebb4d17
Bring dependent libraries in to repo
author | Chris Cannam |
---|---|
date | Fri, 24 Jun 2016 14:47:45 +0100 |
parents | |
children |
comparison
equal
deleted
inserted
replaced
365:112766f4c34b | 366:5d0a2ebb4d17 |
---|---|
1 /* -*- c-basic-offset: 4 indent-tabs-mode: nil -*- vi:set ts=8 sts=4 sw=4: */ | |
2 /* | |
3 Constant-Q library | |
4 Copyright (c) 2013-2014 Queen Mary, University of London | |
5 | |
6 Permission is hereby granted, free of charge, to any person | |
7 obtaining a copy of this software and associated documentation | |
8 files (the "Software"), to deal in the Software without | |
9 restriction, including without limitation the rights to use, copy, | |
10 modify, merge, publish, distribute, sublicense, and/or sell copies | |
11 of the Software, and to permit persons to whom the Software is | |
12 furnished to do so, subject to the following conditions: | |
13 | |
14 The above copyright notice and this permission notice shall be | |
15 included in all copies or substantial portions of the Software. | |
16 | |
17 THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, | |
18 EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF | |
19 MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND | |
20 NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY | |
21 CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF | |
22 CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION | |
23 WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. | |
24 | |
25 Except as contained in this notice, the names of the Centre for | |
26 Digital Music; Queen Mary, University of London; and Chris Cannam | |
27 shall not be used in advertising or otherwise to promote the sale, | |
28 use or other dealings in this Software without prior written | |
29 authorization. | |
30 */ | |
31 | |
32 #ifndef CQSPECTROGRAM_H | |
33 #define CQSPECTROGRAM_H | |
34 | |
35 #include "ConstantQ.h" | |
36 | |
37 /** | |
38 * Calculate a dense constant-Q magnitude spectrogram from time-domain | |
39 * input. The input of each \ref process call is a single frame of | |
40 * time-domain samples; the output is a series of fixed-height | |
41 * columns. See \ref process for details. | |
42 * | |
43 * If you need the full complex-valued constant-Q output, you must use | |
44 * the \ref ConstantQ class instead. | |
45 */ | |
46 class CQSpectrogram : public CQBase | |
47 { | |
48 public: | |
49 enum Interpolation { | |
50 /// leave empty cells as zero | |
51 InterpolateZeros, | |
52 /// replace empty cells with a repeat of the previous column | |
53 InterpolateHold, | |
54 /// perform linear interpolation between consecutive time cells | |
55 InterpolateLinear, | |
56 }; | |
57 | |
58 /** | |
59 * Construct a Constant-Q magnitude spectrogram object using the | |
60 * given transform parameters. | |
61 */ | |
62 CQSpectrogram(CQParameters params, Interpolation interpolation); | |
63 virtual ~CQSpectrogram(); | |
64 | |
65 // CQBase methods, see CQBase.h for documentation | |
66 virtual bool isValid() const { return m_cq.isValid(); } | |
67 virtual double getSampleRate() const { return m_cq.getSampleRate(); } | |
68 virtual int getBinsPerOctave() const { return m_cq.getBinsPerOctave(); } | |
69 virtual int getOctaves() const { return m_cq.getOctaves(); } | |
70 virtual int getTotalBins() const { return m_cq.getTotalBins(); } | |
71 virtual int getColumnHop() const { return m_cq.getColumnHop(); } | |
72 virtual int getLatency() const { return m_cq.getLatency(); } | |
73 virtual double getMaxFrequency() const { return m_cq.getMaxFrequency(); } | |
74 virtual double getMinFrequency() const { return m_cq.getMinFrequency(); } | |
75 virtual double getBinFrequency(double bin) const { return m_cq.getBinFrequency(bin); } | |
76 | |
77 /** | |
78 * Given a series of time-domain samples, return a series of | |
79 * constant-Q magnitude columns. Any samples left over (that did | |
80 * not fit into a constant-Q processing block) are saved for the | |
81 * next call to process or getRemainingBlocks. | |
82 * | |
83 * The input is assumed to be a single frame of time-domain sample | |
84 * values, such that consecutive calls to \ref process receive | |
85 * contiguous frames from the source signal. Each frame may be of | |
86 * any length in samples. | |
87 * | |
88 * Each output column contains a series of constant-Q bin value | |
89 * magnitudes, ordered from highest to lowest frequency. | |
90 * | |
91 * The columns are all of the same height, but they might not all | |
92 * be populated, depending on the interpolation mode: in | |
93 * InterpolateZeros mode, the lower octaves (which are spaced more | |
94 * widely in the raw constant-Q than the highest octave) will | |
95 * contain zeros for the undefined values, but in the other | |
96 * interpolation modes every cell will be filled. | |
97 * | |
98 * To obtain raw, complex constant-Q bin values, use the ConstantQ | |
99 * class. | |
100 */ | |
101 RealBlock process(const RealSequence &); | |
102 | |
103 /** | |
104 * Return the remaining constant-Q magnitude columns following the | |
105 * end of processing. Any buffered input is padded so as to ensure | |
106 * that all input provided to process() will have been returned. | |
107 */ | |
108 RealBlock getRemainingOutput(); | |
109 | |
110 private: | |
111 ConstantQ m_cq; | |
112 Interpolation m_interpolation; | |
113 | |
114 RealBlock m_buffer; | |
115 RealBlock postProcess(const ComplexBlock &, bool insist); | |
116 RealBlock fetchHold(bool insist); | |
117 RealBlock fetchLinear(bool insist); | |
118 RealBlock linearInterpolated(const RealBlock &, int, int); | |
119 RealColumn m_prevColumn; | |
120 }; | |
121 | |
122 #endif |