comparison src/Matcher.h @ 104:6636aca831c0 feature_conditioner

Feature size is not actually needed in Matcher

      *
      *  @param p The Matcher representing the performance with which
      *  this one is going to be matched.  Some information is shared
      *  between the two matchers (currently one possesses the distance
      *  matrix and optimal path matrix).
-     *  
-     *  @param featureSize Number of values in each of the feature
-     *  vectors that will be provided.
-     */
-    Matcher(Parameters parameters, Matcher *p, int featureSize);
+     */
+    Matcher(Parameters parameters, Matcher *p);
 
     /** Destructor for Matcher.
      */
     ~Matcher();
 

      *  Calculates the distance to all frames stored in the
      *  otherMatcher and stores in the distance matrix, before
      *  updating the optimal path matrix using the dynamic time
      *  warping algorithm.
      *
-     *  The supplied feature must be of the size that was passed as
-     *  featureSize to the constructor.
+     *  The supplied features must always be of the same size (within
+     *  any pair of Matcher objects).
      */
     void consumeFeatureVector(std::vector<double> feature);
     
     /** Tests whether a location is in range in the minimum cost matrix.
      *

     /** The number of frames sequentially processed by this matcher,
      *  without a frame of the other matcher being processed.
      */
     int m_runCount;
 
-    /** The number of values in a feature vector. */
-    int m_featureSize;
-
     /** A block of previously seen feature frames is stored in this
      *  structure for calculation of the distance matrix as the new
      *  frames are received.  One can think of the structure of the
      *  array as a circular buffer of vectors. */
     vector<vector<double> > m_frames;