Mercurial > hg > match-vamp
comparison src/Matcher.h @ 48:c7aa28f0d2ac refactors
Comment
author | Chris Cannam |
---|---|
date | Fri, 14 Nov 2014 09:02:32 +0000 |
parents | b0ebc3e2c016 |
children | 331a17753663 |
comparison
equal
deleted
inserted
replaced
47:b183534a2cf5 | 48:c7aa28f0d2ac |
---|---|
212 int m_runCount; | 212 int m_runCount; |
213 | 213 |
214 /** The number of values in a feature vector. */ | 214 /** The number of values in a feature vector. */ |
215 int m_featureSize; | 215 int m_featureSize; |
216 | 216 |
217 /** A block of previously seen frames are stored in this structure | 217 /** A block of previously seen feature frames is stored in this |
218 * for calculation of the distance matrix as the new frames are | 218 * structure for calculation of the distance matrix as the new |
219 * read in. One can think of the structure of the array as a | 219 * frames are received. One can think of the structure of the |
220 * circular buffer of vectors. These are the frames with all | 220 * array as a circular buffer of vectors. */ |
221 * applicable processing applied (e.g. spectral difference, | |
222 * normalisation), unlike prevFrame and newFrame. The total | |
223 * energy of frames[i] is stored in totalEnergies[i]. */ | |
224 vector<vector<double> > m_frames; | 221 vector<vector<double> > m_frames; |
225 | 222 |
226 /** The best path cost matrix. */ | 223 /** The best path cost matrix. */ |
227 vector<vector<float> > m_bestPathCost; | 224 vector<vector<float> > m_bestPathCost; |
228 | 225 |