libcm is a C development framework with an emphasis on audio signal processing applications.
Ви не можете вибрати більше 25 тем Теми мають розпочинатися з літери або цифри, можуть містити дефіси (-) і не повинні перевищувати 35 символів.

cmVectOpsTemplateHdr.h 39KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604
  1. // \file cmVectOpsTemplateHdr.h
  2. /// Vector operations interface.
  3. /// Setting fieldWidth or decPltCnt to to negative values result in fieldWidth == 10 or decPlCnt == 4
  4. void VECT_OP_FUNC(Printf)( cmRpt_t* rpt, unsigned rn, unsigned cn, const VECT_OP_TYPE* dbp, unsigned fieldWidth, unsigned decPlCnt, const char* fmt, unsigned flags );
  5. void VECT_OP_FUNC(Print)( cmRpt_t* rpt, unsigned rn, unsigned cn, const VECT_OP_TYPE* dbp );
  6. void VECT_OP_FUNC(PrintE)( cmRpt_t* rpt, unsigned rn, unsigned cn, const VECT_OP_TYPE* dbp );
  7. void VECT_OP_FUNC(PrintLf)( const char* label, cmRpt_t* rpt, unsigned rn, unsigned cn, const VECT_OP_TYPE* dbp, unsigned fieldWidth, unsigned decPlCnt, const char* fmt );
  8. void VECT_OP_FUNC(PrintL)( const char* label, cmRpt_t* rpt, unsigned rn, unsigned cn, const VECT_OP_TYPE* dbp );
  9. void VECT_OP_FUNC(PrintLE)( const char* label, cmRpt_t* rpt, unsigned rn, unsigned cn, const VECT_OP_TYPE* dbp );
  10. /// Normalize the vector of proabilities by dividing through by the sum.
  11. /// This leaves the relative proportions of each value unchanged while producing a total probability of 1.0.
  12. VECT_OP_TYPE* VECT_OP_FUNC(NormalizeProbabilityVV)(VECT_OP_TYPE* dbp, unsigned dn, const VECT_OP_TYPE* sbp);
  13. VECT_OP_TYPE* VECT_OP_FUNC(NormalizeProbability)(VECT_OP_TYPE* dbp, unsigned dn);
  14. VECT_OP_TYPE* VECT_OP_FUNC(NormalizeProbabilityN)(VECT_OP_TYPE* dbp, unsigned dn, unsigned stride);
  15. /// Standardize the columns of the matrix by subtracting the mean and dividing by the standard deviation.
  16. /// uV[dcn] returns the mean of the data and is optional.
  17. /// sdV[dcn] return the standard deviation of the data and is optional.
  18. VECT_OP_TYPE* VECT_OP_FUNC(StandardizeRows)( VECT_OP_TYPE* dbp, unsigned drn, unsigned dcn, VECT_OP_TYPE* uV, VECT_OP_TYPE* sdV );
  19. VECT_OP_TYPE* VECT_OP_FUNC(StandardizeCols)( VECT_OP_TYPE* dbp, unsigned drn, unsigned dcn, VECT_OP_TYPE* uV, VECT_OP_TYPE* sdV );
  20. /// dbp[] = sbp<0 .* sbp
  21. /// Overlapping the source and dest is allowable as long as dbp <= sbp.
  22. VECT_OP_TYPE* VECT_OP_FUNC(HalfWaveRectify)(VECT_OP_TYPE* dbp, unsigned dn, const VECT_OP_TYPE* sp );
  23. /// Compute the cummulative sum of sbp[dn]. Equivalent to Matlab cumsum().
  24. VECT_OP_TYPE* VECT_OP_FUNC(CumSum)(VECT_OP_TYPE* dbp, unsigned dn, const VECT_OP_TYPE* sbp );
  25. VECT_OP_TYPE VECT_OP_FUNC(Mean)( const VECT_OP_TYPE* sp, unsigned sn );
  26. VECT_OP_TYPE VECT_OP_FUNC(MeanN)( const VECT_OP_TYPE* sp, unsigned sn, unsigned stride );
  27. // Take the mean of each column/row of a matrix.
  28. // Set 'dim' to 0 to return mean of columns else return mean of rows.
  29. VECT_OP_TYPE* VECT_OP_FUNC(MeanM)( VECT_OP_TYPE* dp, const VECT_OP_TYPE* sp, unsigned srn, unsigned scn, unsigned dim );
  30. // Find the mean of the data points returned by srcFuncPtr(argPtr,i) and return it in dp[dim].
  31. // 'dim' is both the size of dp[] and the length of each data point returned by srcFuncPtr().
  32. // srcFuncPtr() will be called 'cnt' times but it may return NULL on some calls if the associated
  33. // data point should not be included in the mean calculation.
  34. VECT_OP_TYPE* VECT_OP_FUNC(Mean2)( VECT_OP_TYPE* dp, const VECT_OP_TYPE* (*srcFuncPtr)(void* arg, unsigned idx ), unsigned dim, unsigned cnt, void* argPtr );
  35. // avgPtr is optional - set to NULL to compute the average
  36. VECT_OP_TYPE VECT_OP_FUNC(Variance)( const VECT_OP_TYPE* sp, unsigned sn, const VECT_OP_TYPE* avgPtr );
  37. VECT_OP_TYPE VECT_OP_FUNC(VarianceN)(const VECT_OP_TYPE* sp, unsigned sn, unsigned stride, const VECT_OP_TYPE* avgPtr );
  38. // Set dim=0 to return variance of columns otherwise return variance or rows.
  39. VECT_OP_TYPE* VECT_OP_FUNC(VarianceM)(VECT_OP_TYPE* dp, const VECT_OP_TYPE* sp, unsigned srn, unsigned scn, const VECT_OP_TYPE* avgPtr, unsigned dim );
  40. // dp[] ./= max(dp). Returns the index of the max value.
  41. unsigned VECT_OP_FUNC(NormToMax)( VECT_OP_TYPE* dp, unsigned dn );
  42. VECT_OP_TYPE VECT_OP_FUNC(AlphaNorm)(const VECT_OP_TYPE* sp, unsigned sn, VECT_OP_TYPE alpha );
  43. // Calculate the sample covariance matrix from a set of Gaussian distributed multidimensional data.
  44. // sp[dn,scn] is the data set.
  45. // dn is the dimensionality of the data.
  46. // scn is the count of data points
  47. // up[dn] is an optional mean vector. If up == NULL then the mean of the data is calculated internally.
  48. // selIdxV[scn] can be used to select a subset of datapoints to process.
  49. // If selIdxV[] is non-NULL then only columns where selIdxV[i]==selKey will be processed.
  50. //
  51. // dp[dn,dn] = covar( sp[dn,scn], u[dn] )
  52. void VECT_OP_FUNC(GaussCovariance)(VECT_OP_TYPE* dp, unsigned dn, const VECT_OP_TYPE* sp, unsigned scn, const VECT_OP_TYPE* up, const unsigned* selIdxV, unsigned selKey );
  53. // Calculate the sample covariance matrix.
  54. // dp[ dn*dn ] - output matrix
  55. // dn - dimensionality of the data
  56. // srcFuncPtr - User defined function which is called to return a pointer to a data vector at index 'idx'.
  57. // The returned data vector must contain 'dn' elements. The function should return NULL
  58. // if the data point associated with 'idx' should not be included in the covariance calculation.
  59. // sn - count of data vectors
  60. // userPtr - User arg. passed to srcFuncPtr.
  61. // uV[ dn ] - mean of the data set (optional)
  62. // Note that this function computes the covariance matrix in 2 serial passes (1 if the mean vector is given)
  63. // through the 'sn' data points.
  64. // The result of this function are identical to the octave cov() function.
  65. void VECT_OP_FUNC(GaussCovariance2)(VECT_OP_TYPE* dp, unsigned dn, const VECT_OP_TYPE* (*srcFuncPtr)(void* userPtr, unsigned idx), unsigned sn, void* userPtr, const VECT_OP_TYPE* uV, const unsigned* selIdxV, unsigned selKey );
  66. bool VECT_OP_FUNC(Equal)( const VECT_OP_TYPE* s0p, const VECT_OP_TYPE* s1p, unsigned sn );
  67. // Returns true if all values are 'normal' according the the C macro 'isnormal'.
  68. // This function will return false if any of the values are zero.
  69. bool VECT_OP_FUNC(IsNormal)( const VECT_OP_TYPE* sp, unsigned sn );
  70. // Returns true if all values are 'normal' or zero according the the C macro 'isnormal'.
  71. // This function accepts zeros as normal.
  72. bool VECT_OP_FUNC(IsNormalZ)(const VECT_OP_TYPE* sp, unsigned sn );
  73. // Set dp[dn] to the indexes of the non-normal numbers in sp[dn].
  74. // Returns the count of indexes stored in dp[].
  75. unsigned VECT_OP_FUNC(FindNonNormal)( unsigned* dp, unsigned dn, const VECT_OP_TYPE* sp );
  76. unsigned VECT_OP_FUNC(FindNonNormalZ)( unsigned* dp, unsigned dn, const VECT_OP_TYPE* sp );
  77. /// Successive call to to ZeroCrossCount should preserve the value pointed to by delaySmpPtr.
  78. unsigned VECT_OP_FUNC(ZeroCrossCount)( const VECT_OP_TYPE* sp, unsigned n, VECT_OP_TYPE* delaySmpPtr);
  79. // Calculuate the sum of the squares of all elements in bp[bn].
  80. VECT_OP_TYPE VECT_OP_FUNC(SquaredSum)( const VECT_OP_TYPE* bp, unsigned bn );
  81. /// sn must be <= wndSmpCnt. If sn < wndSmpCnt then sp[sn] is treated as a
  82. /// a partially filled buffer padded with wndSmpCnt-sn zeros.
  83. /// rms = sqrt( sum(sp[1:sn] .* sp[1:sn]) / wndSmpCnt )
  84. VECT_OP_TYPE VECT_OP_FUNC(RMS)( const VECT_OP_TYPE* sp, unsigned sn, unsigned wndSmpCnt );
  85. /// This function handles the case were sn is not an integer multiple of
  86. /// wndSmpCnt or hopSmpCnt. In this case the function computes zero
  87. /// padded RMS values for windows which go past the end of sp[sn].
  88. VECT_OP_TYPE* VECT_OP_FUNC(RmsV)( VECT_OP_TYPE* dp, unsigned dn, const VECT_OP_TYPE* sp, unsigned sn, unsigned wndSmpCnt, unsigned hopSmpCnt );
  89. /// Return the magnitude (Euclidean Norm) of a vector.
  90. VECT_OP_TYPE VECT_OP_FUNC(EuclidNorm)( const VECT_OP_TYPE* sp, unsigned sn );
  91. // Return the Itakura-Saito distance between a modelled power spectrum (up) and another power spectrum (sp).
  92. VECT_OP_TYPE VECT_OP_FUNC(ItakuraDistance)( const VECT_OP_TYPE* up, const VECT_OP_TYPE* sp, unsigned sn );
  93. /// Return the cosine distance between two vectors.
  94. VECT_OP_TYPE VECT_OP_FUNC(CosineDistance)( const VECT_OP_TYPE* s0P, const VECT_OP_TYPE* s1p, unsigned sn );
  95. /// Return the Euclidean distance between two vectors
  96. VECT_OP_TYPE VECT_OP_FUNC(EuclidDistance)( const VECT_OP_TYPE* s0p, const VECT_OP_TYPE* s1p, unsigned sn );
  97. /// Return the Manhattan distance between two vectors
  98. VECT_OP_TYPE VECT_OP_FUNC(L1Distance)( const VECT_OP_TYPE* s0p, const VECT_OP_TYPE* s1p, unsigned sn );
  99. /// Return the Mahalanobis distance between a vector and the mean of the distribution.
  100. /// The mean vector could be replaced with another vector drawn from the same distribution in which
  101. /// case the returned value would reflect the distance between the two vectors.
  102. /// 'sn' is the dimensionality of the data.
  103. /// up[D] and invCovM[sn,sn] are the mean and inverse of the covariance matrix of the distribution from
  104. /// which sp[D] is drawn.
  105. VECT_OP_TYPE VECT_OP_FUNC(MahalanobisDistance)( const VECT_OP_TYPE* sp, unsigned sn, const VECT_OP_TYPE* up, const VECT_OP_TYPE* invCovM );
  106. /// Return the KL distance between two probability distributions up[sn] and sp[sn].
  107. /// Since up[] and sp[] are probability distributions they must sum to 1.0.
  108. VECT_OP_TYPE VECT_OP_FUNC(KL_Distance)( const VECT_OP_TYPE* up, const VECT_OP_TYPE* sp, unsigned sn );
  109. /// Return the KL distance between a prototype vector up[sn] and another vector sp[sn].
  110. /// This function first normalizes the two vectors to sum to 1.0 before calling
  111. // VECT_OP_FUNC(KL_Distance)(up,sp,sn);
  112. VECT_OP_TYPE VECT_OP_FUNC(KL_Distance2)( const VECT_OP_TYPE* up, const VECT_OP_TYPE* sp, unsigned sn );
  113. /// Measure the Euclidean distance between a vector and all the columns in a matrix.
  114. /// If dv[scn] is no NULL then return the Euclidean distance from sv[scn] to each column of sm[srn,scn].
  115. /// The function returns the index of the closest data point (column) in sm[].
  116. unsigned VECT_OP_FUNC(EuclidDistanceVM)( VECT_OP_TYPE* dv, const VECT_OP_TYPE* sv, const VECT_OP_TYPE* sm, unsigned srn, unsigned scn );
  117. /// Measure the distance between each column in s0M[ rn, s0cn ] and
  118. /// each column in s1M[rn, s1cn ]. If dM is non-NULL store the
  119. /// result in dM[s1cn, s0cn]. The difference between s0M[:,0] and s1M[:,0]
  120. /// is stored in dM[0,0], the diff. between s0M[:,1] and s1M[:,1] is stored
  121. /// in dM[1,0], etc. If mvV[s0cn] is non-NULL then minV[i] is set with
  122. /// the distance from s0M[:,i] to the nearest column in s1M[]. If miV[s0cn]
  123. /// is non-NULL then it is set with the column index of s1M[] which is
  124. /// closest to s0M[:,i]. In other words mvV[i] gives the distance to column
  125. /// miV[i] from column s0M[:,i].
  126. /// In those cases where the distane from a prototype (centroid) to the data point
  127. /// is not the same as from the data point to the centroid then s1M[] is considered
  128. /// to hold the prototypes and s0M[] is considered to hold the data points.
  129. /// The distance function returns the distance from a prototype 'cV[dimN]' to
  130. /// an datapoint dV[dimN]. 'dimN' is the dimensionality of the data vector
  131. /// and is threfore equal to 'rn'.
  132. void VECT_OP_FUNC(DistVMM)(
  133. VECT_OP_TYPE* dM, // dM[s1cn,s0cn] return distance mtx (optional)
  134. VECT_OP_TYPE* mvV, // mvV[s0cn] distance to closest data point in s0M[]. (optional)
  135. unsigned* miV, // miV[s0cn] column index into s1M[] of closest data point to s0M[:,i]. (optional)
  136. unsigned rn, // dimensionality of the data and the row count for s0M[] and s1M[]
  137. const VECT_OP_TYPE* s0M, // s0M[rn,s0cn] contains one data point per column
  138. unsigned s0cn, // count of data points (count of columns in s0M[]
  139. const VECT_OP_TYPE* s1M, // s1M[rn,s1cn] contains one prototype per column
  140. unsigned s1cn, // count of prototypes (count of columns in s1m[]
  141. VECT_OP_TYPE (*distFunc)( void* userPtr, const VECT_OP_TYPE* cV, const VECT_OP_TYPE* dV, unsigned dimN ),
  142. void* userPtr );
  143. /// Select 'selIdxN' columns from sM[srn,scn].
  144. /// dM[srn,selIdxN] receives copies of the selected columns.
  145. /// selIdxV[selIdxN] receives the column indexes of the selected columns.
  146. /// Both dM[] and selIdxV[] are optional.
  147. /// In each case the first selected point is chosen at random.
  148. /// SelectRandom() then selects the following selIdxN-1 points at random.
  149. /// SelectMaxDist() selects the next selIdxN-1 points by selecting
  150. /// the point whose combined distance to the previously selected points
  151. /// is greatest. SelectMaxAvgDist() selectes the points whose combined
  152. /// average distance is greatest relative the the previously selected
  153. /// points.
  154. void VECT_OP_FUNC(SelectRandom)( VECT_OP_TYPE* dM, unsigned* selIdxV, unsigned selIdxN, const VECT_OP_TYPE* sM, unsigned srn, unsigned scn );
  155. void VECT_OP_FUNC(SelectMaxDist)( VECT_OP_TYPE* dM, unsigned* selIdxV, unsigned selIdxN, const VECT_OP_TYPE* sM, unsigned srn, unsigned scn, VECT_OP_TYPE (*distFunc)( void* userPtr, const VECT_OP_TYPE* s0V, const VECT_OP_TYPE* s1V, unsigned sn ), void* distUserPtr );
  156. void VECT_OP_FUNC(SelectMaxAvgDist)( VECT_OP_TYPE* dM, unsigned* selIdxV, unsigned selIdxN, const VECT_OP_TYPE* sM, unsigned srn, unsigned scn, VECT_OP_TYPE (*distFunc)( void* userPtr, const VECT_OP_TYPE* s0V, const VECT_OP_TYPE* s1V, unsigned sn ), void* distUserPtr );
  157. /// Return the sum of the products (dot product)
  158. VECT_OP_TYPE VECT_OP_FUNC(MultSumVV)( const VECT_OP_TYPE* s0p, const VECT_OP_TYPE* s1p, unsigned sn );
  159. VECT_OP_TYPE VECT_OP_FUNC(MultSumVS)( const VECT_OP_TYPE* s0p, unsigned sn, VECT_OP_TYPE s );
  160. /// Number of elements in the dest vector is expected to be the same
  161. /// as the number of source matrix rows.
  162. /// mcn gives the number of columns in the source matrix which is
  163. // expected to match the number of elements in the source vector.
  164. /// dbp[dn,1] = mp[dn,mcn] * vp[mcn,1]
  165. VECT_OP_TYPE* VECT_OP_FUNC(MultVMV)( VECT_OP_TYPE* dbp, unsigned dn, const VECT_OP_TYPE* mp, unsigned mcn, const VECT_OP_TYPE* vp );
  166. /// Multiply a row vector with a matrix to produce a row vector.
  167. /// dbp[1,dn] = v[1,vn] * m[vn,dn]
  168. VECT_OP_TYPE* VECT_OP_FUNC(MultVVM)( VECT_OP_TYPE* dbp, unsigned dn, const VECT_OP_TYPE* vp, unsigned vn, const VECT_OP_TYPE* mp );
  169. /// Same as MultVMtV() except M is transposed as part of the multiply.
  170. /// mrn gives the number of rows in m[] and number of elements in vp[]
  171. /// dpb[dn] = mp[mrn,dn] * vp[mrn]
  172. VECT_OP_TYPE* VECT_OP_FUNC(MultVMtV)( VECT_OP_TYPE* dbp, unsigned dn, const VECT_OP_TYPE* mp, unsigned mrn, const VECT_OP_TYPE* vp );
  173. /// Same as MultVMV() but where the matrix is diagonal.
  174. VECT_OP_TYPE* VECT_OP_FUNC(MultDiagVMV)( VECT_OP_TYPE* dbp, unsigned dn, const VECT_OP_TYPE* mp, unsigned mcn, const VECT_OP_TYPE* vp );
  175. /// Generalized matrix multiply.
  176. /// If transposition is selected for M0 or M1 then the given dimension represent the size of the matrix 'after' the transposion.
  177. /// d[drn,dcn] = alpha * op(m0[drn,m0cn_m1rn]) * op(m1[m0cn_m1rn,dcn]) + beta * d[drn,dcn]
  178. //// See enum { kTranpsoseM0Fl=0x01, kTransposeM1Fl=0x02 } in cmVectOps for flags.
  179. VECT_OP_TYPE* VECT_OP_FUNC(MultMMM1)(VECT_OP_TYPE* dbp, unsigned drn, unsigned dcn, VECT_OP_TYPE alpha, const VECT_OP_TYPE* m0, const VECT_OP_TYPE* m1, unsigned m0cn_m1rn, VECT_OP_TYPE beta, unsigned flags );
  180. /// Same a VECT_OP_FUNC(MultMMM1) except allows the operation on a sub-matrix by providing the physical (memory) row count rather than the logical (matrix) row count.
  181. VECT_OP_TYPE* VECT_OP_FUNC(MultMMM2)(VECT_OP_TYPE* dbp, unsigned drn, unsigned dcn, VECT_OP_TYPE alpha, const VECT_OP_TYPE* m0, const VECT_OP_TYPE* m1, unsigned m0cn_m1rn, VECT_OP_TYPE beta, unsigned flags, unsigned dprn, unsigned m0prn, unsigned m1prn );
  182. /// d[drn,dcn] = m0[drn,m0cn] * m1[m1rn,dcn]
  183. VECT_OP_TYPE* VECT_OP_FUNC(MultMMM)( VECT_OP_TYPE* dbp, unsigned drn, unsigned dcn, const VECT_OP_TYPE* m0, const VECT_OP_TYPE* m1, unsigned m0cn_m1rn );
  184. /// same as MultMMM() except second source matrix is transposed prior to the multiply
  185. VECT_OP_TYPE* VECT_OP_FUNC(MultMMMt)(VECT_OP_TYPE* dbp, unsigned drn, unsigned dcn, const VECT_OP_TYPE* m0, const VECT_OP_TYPE* m1, unsigned m0cn_m1rn );
  186. // Raise dbp[] to the power 'expon'
  187. VECT_OP_TYPE* VECT_OP_FUNC(PowVS)( VECT_OP_TYPE* dbp, unsigned dn, VECT_OP_TYPE expon );
  188. VECT_OP_TYPE* VECT_OP_FUNC(PowVVS)( VECT_OP_TYPE* dbp, unsigned dn, const VECT_OP_TYPE* sp, VECT_OP_TYPE expon );
  189. // Take the natural log of all values in sbp[dn]. It is allowable for sbp point to the same array as dbp=.
  190. VECT_OP_TYPE* VECT_OP_FUNC(LogV)( VECT_OP_TYPE* dbp, unsigned dn, const VECT_OP_TYPE* sbp );
  191. // Convert a magnitude (amplitude) spectrum to/from decibels.
  192. // It is allowable for dbp==sbp.
  193. VECT_OP_TYPE* VECT_OP_FUNC(AmplToDbVV)( VECT_OP_TYPE* dbp, unsigned dn, const VECT_OP_TYPE* sbp, VECT_OP_TYPE minDb );
  194. VECT_OP_TYPE* VECT_OP_FUNC(DbToAmplVV)( VECT_OP_TYPE* dbp, unsigned dn, const VECT_OP_TYPE* sbp);
  195. VECT_OP_TYPE* VECT_OP_FUNC(PowToDbVV)( VECT_OP_TYPE* dbp, unsigned dn, const VECT_OP_TYPE* sbp, VECT_OP_TYPE minDb );
  196. VECT_OP_TYPE* VECT_OP_FUNC(DbToPowVV)( VECT_OP_TYPE* dbp, unsigned dn, const VECT_OP_TYPE* sbp);
  197. /// Initialize dbp[dn,dn] as a square symetric positive definite matrix using values
  198. /// from a random uniform distribution. This is useful for initializing random
  199. /// covariance matrices as used by multivariate Gaussian distributions
  200. /// If t is non-NULL it must point to a block of scratch memory of t[dn,dn].
  201. /// If t is NULL then scratch memory is internally allocated and deallocated.
  202. VECT_OP_TYPE* VECT_OP_FUNC(RandSymPosDef)( VECT_OP_TYPE* dbp, unsigned dn, VECT_OP_TYPE* t );
  203. /// Compute the determinant of any square matrix.
  204. VECT_OP_TYPE VECT_OP_FUNC(DetM)( const VECT_OP_TYPE* sp, unsigned srn );
  205. /// Compute the determinant of a diagonal matrix.
  206. VECT_OP_TYPE VECT_OP_FUNC(DetDiagM)( const VECT_OP_TYPE* sp, unsigned srn);
  207. /// Compute the log determinant of any square matrix.
  208. VECT_OP_TYPE VECT_OP_FUNC(LogDetM)( const VECT_OP_TYPE* sp, unsigned srn );
  209. /// Compute the log determinant of a diagonal matrix.
  210. VECT_OP_TYPE VECT_OP_FUNC(LogDetDiagM)( const VECT_OP_TYPE* sp, unsigned srn);
  211. /// Compute the inverse of a square matrix. Returns NULL if the matrix is not invertable.
  212. /// 'drn' is the dimensionality of the data.
  213. VECT_OP_TYPE* VECT_OP_FUNC(InvM)( VECT_OP_TYPE* dp, unsigned drn );
  214. /// Compute the inverse of a diagonal matrix. Returns NULL if the matrix is not invertable.
  215. VECT_OP_TYPE* VECT_OP_FUNC(InvDiagM)( VECT_OP_TYPE* dp, unsigned drn );
  216. /// Solve a linear system of the form AX=B where A[an,an] is square.
  217. /// Since A is square B must have 'an' rows.
  218. /// Result is returned in B.
  219. /// Returns a pointer to B on success or NULL on fail.
  220. /// NOTE: Both A and B are overwritten by this operation.
  221. VECT_OP_TYPE* VECT_OP_FUNC(SolveLS)( VECT_OP_TYPE* A, unsigned an, VECT_OP_TYPE* B, unsigned bcn );
  222. /// Perform a Cholesky decomposition of the square symetric matrix U[un,un].
  223. /// The factorization has the form: A=U'TU.
  224. /// If the factorization is successful A is set to U and a pointer to A is returned.
  225. /// Note that the lower triangle of A is not overwritten. See CholZ().
  226. /// If the factorization fails NULL is returned.
  227. VECT_OP_TYPE* VECT_OP_FUNC(Chol)(VECT_OP_TYPE* A, unsigned an );
  228. /// Same as Chol() but sets the lower triangle of U to zero.
  229. /// This is equivalent ot the Matlab version.
  230. VECT_OP_TYPE* VECT_OP_FUNC(CholZ)(VECT_OP_TYPE* U, unsigned un );
  231. /// Return the average value of the contents of sbp[] between two fractional indexes
  232. VECT_OP_TYPE VECT_OP_FUNC(FracAvg)( double bi, double ei, const VECT_OP_TYPE* sbp, unsigned sn );
  233. /// Shrinking function - Decrease the size of sbp[] by averaging blocks of values into single values in dbp[]
  234. VECT_OP_TYPE* VECT_OP_FUNC(DownSampleAvg)( VECT_OP_TYPE* dbp, unsigned dn, const VECT_OP_TYPE* sbp, unsigned sn );
  235. /// Stretching function - linear interpolate between points in sbp[] to fill dbp[] ... where dn > sn
  236. VECT_OP_TYPE* VECT_OP_FUNC(UpSampleInterp)( VECT_OP_TYPE* dbp, unsigned dn, const VECT_OP_TYPE* sbp, unsigned sn );
  237. /// Stretch or shrink the sbp[] to fit into dbp[]
  238. VECT_OP_TYPE* VECT_OP_FUNC(FitToSize)( VECT_OP_TYPE* dbp, unsigned dn, const VECT_OP_TYPE* sbp, unsigned sn );
  239. /// Stretch or shrink sV[] to fit into dV[] using a simple linear mapping.
  240. /// When stretching (sn<dn) each source element is repeated dn/sn times
  241. /// and the last fraction position is interpolated. When shrinking
  242. /// (sn>dn) each dest value is formed by the average of sequential segments
  243. /// of sn/dn source elements. Fractional values are used at the beginning
  244. /// and end of each segment.
  245. VECT_OP_TYPE* VECT_OP_FUNC(LinearMap)(VECT_OP_TYPE* dV, unsigned dn, VECT_OP_TYPE* sV, unsigned sn );
  246. /// Generate a vector of uniformly distributed random numbers in the range minVal to maxVal.
  247. VECT_OP_TYPE* VECT_OP_FUNC(Random)( VECT_OP_TYPE* dbp, unsigned dn, VECT_OP_TYPE minVal, VECT_OP_TYPE maxVal );
  248. /// Generate dn random numbers integers between 0 and wn-1 based on a the relative
  249. /// weights in wp[wn]. Note thtat the weights do not have to sum to 1.0.
  250. unsigned* VECT_OP_FUNC(WeightedRandInt)( unsigned* dbp, unsigned dn, const VECT_OP_TYPE* wp, unsigned wn );
  251. /// Generate a vector of normally distributed univariate random numbers
  252. VECT_OP_TYPE* VECT_OP_FUNC(RandomGauss)( VECT_OP_TYPE* dbp, unsigned dn, VECT_OP_TYPE mean, VECT_OP_TYPE var );
  253. /// Generate a vector of normally distributed univariate random numbers where each value has been drawn from a
  254. /// seperately parameterized Gaussian distribution. meanV[] and varV[] must both contain dn velues.
  255. VECT_OP_TYPE* VECT_OP_FUNC(RandomGaussV)( VECT_OP_TYPE* dbp, unsigned dn, const VECT_OP_TYPE* meanV, const VECT_OP_TYPE* varV );
  256. /// Generate a matrix of multi-dimensional random values. Each column represents a single vector value and each row contains a dimension.
  257. /// meanV[] and varV[] must both contain drn elements where each meanV[i],varV[i] pair parameterize one dimensions Gaussian distribution.
  258. VECT_OP_TYPE* VECT_OP_FUNC(RandomGaussM)( VECT_OP_TYPE* dbp, unsigned drn, unsigned dcn, const VECT_OP_TYPE* meanV, const VECT_OP_TYPE* varV );
  259. VECT_OP_TYPE* VECT_OP_FUNC(RandomGaussDiagM)( VECT_OP_TYPE* dbp, unsigned drn, unsigned dcn, const VECT_OP_TYPE* meanV, const VECT_OP_TYPE* diagCovarM );
  260. /// Generate a matrix of multivariate random values drawn from a normal distribution.
  261. /// The dimensionality of the values are 'drn'.
  262. /// The count of returned values is 'dcn'.
  263. /// meanV[drn] and covarM[drn,drn] parameterize the normal distribution.
  264. /// The covariance matrix must be symetric and positive definite.
  265. /// t[(drn*drn) ] points to scratch memory or is set to NULL if the function should
  266. /// allocate the memory internally.
  267. /// Based on octave function mvrnd.m.
  268. VECT_OP_TYPE* VECT_OP_FUNC(RandomGaussNonDiagM)( VECT_OP_TYPE* dbp, unsigned drn, unsigned dcn, const VECT_OP_TYPE* meanV, const VECT_OP_TYPE* covarM, VECT_OP_TYPE* t );
  269. /// Same as RandomGaussNonDiagM() except requires the upper trianglular
  270. /// Cholesky factor of the covar matrix in 'uM'.
  271. VECT_OP_TYPE* VECT_OP_FUNC(RandomGaussNonDiagM2)( VECT_OP_TYPE* dbp, unsigned drn, unsigned dcn, const VECT_OP_TYPE* meanV, const VECT_OP_TYPE* uM );
  272. /// Generate a matrix of N*K multi-dimensional data points.
  273. /// Where D is the dimensionality of the data. (D == drn).
  274. /// K is the number of multi-dimensional PDF's (clusters).
  275. /// N is the number of data points to generate per cluster.
  276. /// dbp[ D, N*K ] contains the returned data point.
  277. /// The first N columns is associated with the cluster 0,
  278. /// the next N columns is associated with cluster 1, ...
  279. /// meanM[ D, K ] and varM[D,K] parameterize the generating PDF.s for each cluster
  280. VECT_OP_TYPE* VECT_OP_FUNC(RandomGaussMM)( VECT_OP_TYPE* dbp, unsigned drn, unsigned dcn, const VECT_OP_TYPE* meanM, const VECT_OP_TYPE* varM, unsigned K );
  281. /// Generate the set of coordinates which describe a circle with a center at x,y.
  282. /// dbp[dn,2] must contain 2*dn elements. The first column holds the x coord and and the second holds the y coord.
  283. VECT_OP_TYPE* VECT_OP_FUNC(CircleCoords)( VECT_OP_TYPE* dbp, unsigned dn, VECT_OP_TYPE x, VECT_OP_TYPE y, VECT_OP_TYPE varX, VECT_OP_TYPE varY );
  284. /// The following functions all return the phase of the next value.
  285. unsigned VECT_OP_FUNC(SynthSine)( VECT_OP_TYPE* dbp, unsigned dn, unsigned phase, double srate, double hz );
  286. unsigned VECT_OP_FUNC(SynthCosine)( VECT_OP_TYPE* dbp, unsigned dn, unsigned phase, double srate, double hz );
  287. unsigned VECT_OP_FUNC(SynthSquare)( VECT_OP_TYPE* dbp, unsigned dn, unsigned phase, double srate, double hz, unsigned otCnt );
  288. unsigned VECT_OP_FUNC(SynthTriangle)( VECT_OP_TYPE* dbp, unsigned dn, unsigned phase, double srate, double hz, unsigned otCnt );
  289. unsigned VECT_OP_FUNC(SynthSawtooth)( VECT_OP_TYPE* dbp, unsigned dn, unsigned phase, double srate, double hz, unsigned otCnt );
  290. unsigned VECT_OP_FUNC(SynthPulseCos)( VECT_OP_TYPE* dbp, unsigned dn, unsigned phase, double srate, double hz, unsigned otCnt );
  291. unsigned VECT_OP_FUNC(SynthImpulse)( VECT_OP_TYPE* dbp, unsigned dn, unsigned phase, double srate, double hz );
  292. unsigned VECT_OP_FUNC(SynthPhasor)( VECT_OP_TYPE* dbp, unsigned dn, unsigned phase, double srate, double hz );
  293. /// Return value should be passed back via delaySmp on the next call.
  294. VECT_OP_TYPE VECT_OP_FUNC(SynthPinkNoise)( VECT_OP_TYPE* dbp, unsigned dn, VECT_OP_TYPE delaySmp );
  295. VECT_OP_TYPE* VECT_OP_FUNC(LinearToDb)( VECT_OP_TYPE* dbp, unsigned dn, const VECT_OP_TYPE* sp, VECT_OP_TYPE mult );
  296. VECT_OP_TYPE* VECT_OP_FUNC(dBToLinear)( VECT_OP_TYPE* dbp, unsigned dn, const VECT_OP_TYPE* sp, VECT_OP_TYPE mult );
  297. VECT_OP_TYPE* VECT_OP_FUNC(AmplitudeToDb)( VECT_OP_TYPE* dbp, unsigned dn, const VECT_OP_TYPE* sp );
  298. VECT_OP_TYPE* VECT_OP_FUNC(PowerToDb)( VECT_OP_TYPE* dbp, unsigned dn, const VECT_OP_TYPE* sp );
  299. VECT_OP_TYPE* VECT_OP_FUNC(dBToAmplitude)( VECT_OP_TYPE* dbp, unsigned dn, const VECT_OP_TYPE* sp );
  300. VECT_OP_TYPE* VECT_OP_FUNC(dBToPower)( VECT_OP_TYPE* dbp, unsigned dn, const VECT_OP_TYPE* sp );
  301. VECT_OP_TYPE VECT_OP_FUNC(KaiserBetaFromSidelobeReject)( double sidelobeRejectDb );
  302. VECT_OP_TYPE VECT_OP_FUNC(KaiserFreqResolutionFactor)( double sidelobeRejectDb );
  303. VECT_OP_TYPE* VECT_OP_FUNC(Kaiser)( VECT_OP_TYPE* dbp, unsigned dn, double beta );
  304. VECT_OP_TYPE* VECT_OP_FUNC(Gaussian)(VECT_OP_TYPE* dbp, unsigned dn, double mean, double variance );
  305. VECT_OP_TYPE* VECT_OP_FUNC(Hamming)( VECT_OP_TYPE* dbp, unsigned dn );
  306. VECT_OP_TYPE* VECT_OP_FUNC(Hann)( VECT_OP_TYPE* dbp, unsigned dn );
  307. VECT_OP_TYPE* VECT_OP_FUNC(Triangle)(VECT_OP_TYPE* dbp, unsigned dn );
  308. /// The MATLAB equivalent Hamming and Hann windows.
  309. //VECT_OP_TYPE* VECT_OP_FUNC(HammingMatlab)(VECT_OP_TYPE* dbp, unsigned dn );
  310. VECT_OP_TYPE* VECT_OP_FUNC(HannMatlab)( VECT_OP_TYPE* dbp, unsigned dn );
  311. /// Simulates the MATLAB GaussWin function. Set arg to 2.5 to simulate the default arg
  312. /// as used by MATLAB.
  313. VECT_OP_TYPE* VECT_OP_FUNC(GaussWin)( VECT_OP_TYPE* dbp, unsigned dn, double arg );
  314. /// Direct form II algorithm based on the MATLAB implmentation
  315. /// http://www.mathworks.com/access/helpdesk/help/techdoc/ref/filter.html#f83-1015962
  316. /// The only difference between this function and the equivalent MATLAB filter() function
  317. /// is that the first feedforward coeff is given as a seperate value. The first b coefficient
  318. /// in this function is therefore the same as the second coefficient in the MATLAB function.
  319. /// and the first a[] coefficient (which is generally set to 1.0) is skipped.
  320. /// Example:
  321. /// Matlab: b=[.5 .4 .3] a=[1 .2 .1]
  322. /// Equiv: b0 = .5 b=[ .4 .3] a=[ .2 .1];
  323. ///
  324. /// y[yn] - output vector
  325. /// x[xn] - input vector. xn must be <= yn. if xn < yn then the end of y[] is set to zero.
  326. /// b0 - signal scale. This can also be seen as b[0] (which is not included in b[])
  327. /// b[dn] - feedforward coeff's b[1..dn-1]
  328. /// a[dn] - feedback coeff's a[1..dn-1]
  329. /// d[dn+1] - delay registers - note that this array must be one element longer than the coeff arrays.
  330. ///
  331. VECT_OP_TYPE* VECT_OP_FUNC(Filter)( VECT_OP_TYPE* y, unsigned yn, const VECT_OP_TYPE* x, unsigned xn, cmReal_t b0, const cmReal_t* b, const cmReal_t* a, cmReal_t* d, unsigned dn );
  332. struct cmFilter_str;
  333. //typedef cmRC_t (*VECT_OP_FUNC(FiltExecFunc_t))( struct acFilter_str* f, const VECT_OP_TYPE* x, unsigned xn, VECT_OP_TYPE* y, unsigned yn );
  334. VECT_OP_TYPE* VECT_OP_FUNC(FilterFilter)(struct cmFilter_str* f, cmRC_t (*func)( struct cmFilter_str* f, const VECT_OP_TYPE* x, unsigned xn, VECT_OP_TYPE* y, unsigned yn ), const cmReal_t bb[], unsigned bn, const cmReal_t aa[], unsigned an, const VECT_OP_TYPE* x, unsigned xn, VECT_OP_TYPE* y, unsigned yn );
  335. /// Compute the coefficients of a low/high pass FIR filter
  336. /// See enum { kHighPass_LPSincFl=0x01, kNormalize_LPSincFl=0x02 } in acVectOps.h
  337. VECT_OP_TYPE* VECT_OP_FUNC(LP_Sinc)(VECT_OP_TYPE* dp, unsigned dn, double srate, double fcHz, unsigned flags );
  338. /// Compute the complex transient detection function from successive spectral frames.
  339. /// The spectral magntidue mag0V precedes mag1V and the phase (radians) spectrum phs0V precedes the phs1V which precedes phs2V.
  340. /// binCnt gives the length of each of the spectral vectors.
  341. VECT_OP_TYPE VECT_OP_FUNC(ComplexDetect)(const VECT_OP_TYPE* mag0V, const VECT_OP_TYPE* mag1V, const VECT_OP_TYPE* phs0V, const VECT_OP_TYPE* phs1V, const VECT_OP_TYPE* phs2V, unsigned binCnt );
  342. /// Compute a set of filterCnt mel filter masks for wieghting magnitude spectra consisting of binCnt bins.
  343. /// The spectrum is divided into bandCnt equal bands in the mel domain
  344. /// Each row of the matrix contains the mask for a single filter band consisting of binCnt elements.
  345. /// See enum{ kShiftMelFl=0x01, kNormalizeMelFl=0x02 } in cmVectOps.h
  346. /// Set kShiftMelFl to shift the mel bands onto the nearest FFT bin.
  347. /// Set kNormalizeMelFl to normalize the combined filters for unity gain.
  348. VECT_OP_TYPE* VECT_OP_FUNC(MelMask)( VECT_OP_TYPE* maskMtx, unsigned bandCnt, unsigned binCnt, double srate, unsigned flags );
  349. /// Fill binIdxV[bandCnt] and cntV[bandCnt] with a bin to band map.
  350. /// binIdx[] contains the first (minimum) bin index for a given band.
  351. /// cntV[] contains the count of bins for each band.
  352. /// bandCnt is the number of bark bands to return
  353. /// The function returns the actual number of bands mapped which will always be <= 23.
  354. unsigned VECT_OP_FUNC(BarkMap)(unsigned* binIdxV, unsigned* cntV, unsigned bandCnt, unsigned binCnt, double srate );
  355. /// Calc a set of triangle fitler masks into each row of maskMtx.
  356. /// maskMtx[ bandCnt, binCnt ] - result matrix
  357. /// binHz - freq resolution of the output filters.
  358. /// stSpread - Semi-tone spread above and below each center frequency (stSpread*2) is the total bandwidth.
  359. /// (Only used if
  360. /// lowHz[ bandCnt ] - set of upper frequency limits for each band.
  361. /// ctrHz[ bandCnt ] set to the center value in Hz for each band
  362. /// uprHz[ bandCnt ] - set of lower frequency limits for each band.
  363. /// Note if lowHz[] and uprHz[] are set to NULL then stSpread is used to set the bandwidth of each band.
  364. VECT_OP_TYPE* VECT_OP_FUNC(TriangleMask)(VECT_OP_TYPE* maskMtx, unsigned bandCnt, unsigned binCnt, const VECT_OP_TYPE* ctrHzV, VECT_OP_TYPE binHz, VECT_OP_TYPE stSpread, const VECT_OP_TYPE* lowHzV, const VECT_OP_TYPE* uprHzV );
  365. /// Calculate a set of Bark band triangle filters into maskMtx.
  366. /// Each row of maskMtx contains the filter for one band.
  367. /// maskMtx[ bandCnt, binCnt ]
  368. /// bandCnt - the number of triangle bankds. If bandCnt is > 24 it will be reduced to 24.
  369. /// binCnt - the number of bins in the filters.
  370. /// binHz - the width of each bin in Hz.
  371. VECT_OP_TYPE* VECT_OP_FUNC(BarkMask)(VECT_OP_TYPE* maskMtx, unsigned bandCnt, unsigned binCnt, double binHz );
  372. // Terhardt 1979 (Calculating virtual pitch, Hearing Research #1, pp 155-182)
  373. // See enum { kNoTtmFlags=0, kModifiedTtmFl=0x01 } in cmVectOps.h
  374. VECT_OP_TYPE* VECT_OP_FUNC(TerhardtThresholdMask)(VECT_OP_TYPE* maskV, unsigned binCnt, double srate, unsigned flags);
  375. //Schroeder et al., 1979, JASA, Optimizing digital speech coders by exploiting masking properties of the human ear
  376. VECT_OP_TYPE* VECT_OP_FUNC(ShroederSpreadingFunc)(VECT_OP_TYPE* m, unsigned bandCnt, double srate);
  377. /// Compute a set of DCT-II coefficients. Result dp[ coeffCnt, filtCnt ]
  378. VECT_OP_TYPE* VECT_OP_FUNC(DctMatrix)( VECT_OP_TYPE* dp, unsigned coeffCnt, unsigned filtCnt );
  379. /// Set the indexes of local peaks greater than threshold in dbp[].
  380. /// Returns the number of peaks in dbp[]
  381. /// The maximum number of peaks from n source values is max(0,floor((n-1)/2)).
  382. /// Note that peaks will never be found at index 0 or index sn-1.
  383. unsigned VECT_OP_FUNC(PeakIndexes)( unsigned* dbp, unsigned dn, const VECT_OP_TYPE* sbp, unsigned sn, VECT_OP_TYPE threshold );
  384. /// Return the index of the bin containing v or acInvalidIdx if v is below sbp[0] or above sbp[ n-1 ]
  385. /// The bin limits are contained in sbp[].
  386. /// The value in spb[] are therefore expected to be in increasing order.
  387. /// The value returned will be in the range 0:sn-1.
  388. unsigned VECT_OP_FUNC(BinIndex)( const VECT_OP_TYPE* sbp, unsigned sn, VECT_OP_TYPE v );
  389. /// Assign each data point to one of k clusters using an expectation-maximization algorithm.
  390. /// k gives the number of clusters to identify
  391. /// Each column of sp[ srn, scn ] contains a multidimensional data point.
  392. /// srn therefore defines the dimensionality of the data.
  393. /// Each column of centroidV[ srn, k ] is set to the centroid of each of k clusters.
  394. /// classIdxV[ scn ] assigns the index (0 to k-1) of a cluster to each soure data point
  395. /// The function returns the number of iterations required for the EM process to converge.
  396. /// selIdxV[ scn ] is optional and contains a list of id's assoc'd with each column of sM.
  397. /// selKey is a integer value.
  398. /// If selIdxV is non-NULL then only columns of sM[] where selIdxV[] == selKey will be clustered.
  399. /// All columns of sM[] where the associated column in selIdxV[] do not match will be ignored.
  400. /// Set 'initFromCentroidFl' to true if the initial centroids should be taken from centroidM[].
  401. /// otherwise the initial centroids are selected from 'k' random data points in sp[].
  402. /// The distance function distFunc(cV,dV,dN) is called to determine the distance from a
  403. /// centroid the centroid 'cV[dN]' to a data point 'dV[dN]'. 'dN' is the dimensionality of the
  404. /// feature vector and is therefore equal to 'srn'.
  405. unsigned VECT_OP_FUNC(Kmeans)(
  406. unsigned* classIdxV,
  407. VECT_OP_TYPE* centroidM,
  408. unsigned k,
  409. const VECT_OP_TYPE* sp,
  410. unsigned srn,
  411. unsigned scn,
  412. const unsigned* selIdxV,
  413. unsigned selKey,
  414. bool initFromCentroidFl,
  415. VECT_OP_TYPE (*distFunc)( void* userPtr, const VECT_OP_TYPE* cV, const VECT_OP_TYPE* dV, unsigned dN ),
  416. void* userDistPtr );
  417. /// 'srcFunc() should return NULL if the data point located at 'frmIdx' should not be included in the clustering.
  418. /// Clustering is considered to be complete after 'maxIterCnt' iterations or when
  419. /// 'deltaStopCnt' or fewer data points change class on a single iteration
  420. unsigned VECT_OP_FUNC(Kmeans2)(
  421. unsigned* classIdxV, // classIdxV[scn] - data point class assignments
  422. VECT_OP_TYPE* centroidM, // centroidM[srn,K] - cluster centroids
  423. unsigned K, // count of clusters
  424. const VECT_OP_TYPE* (*srcFunc)(void* userPtr, unsigned frmIdx ),
  425. unsigned srn, // dimensionality of each data point
  426. unsigned scn, // count of data points
  427. void* userSrcPtr, // callback data for srcFunc
  428. VECT_OP_TYPE (*distFunc)( void* userPtr, const VECT_OP_TYPE* cV, const VECT_OP_TYPE* dV, unsigned dN ),
  429. void* userDistPtr, // arg. to distFunc()
  430. int iterCnt, // max. number of iterations (-1 to ignore)
  431. int deltaStopCnt); // if less than deltaStopCnt data points change classes on a given iteration then convergence occurs.
  432. /// Evaluate the univariate normal distribution defined by 'mean' and 'stdDev'.
  433. VECT_OP_TYPE* VECT_OP_FUNC(GaussPDF)( VECT_OP_TYPE* dbp, unsigned dn, const VECT_OP_TYPE* sbp, VECT_OP_TYPE mean, VECT_OP_TYPE stdDev );
  434. /// Evaluate a multivariate normal distribution defined by meanV[D] and covarM[D,D]
  435. /// at the data points held in the columns of xM[D,N]. Return the evaluation
  436. /// results in the vector yV[N]. D is the dimensionality of the data. N is the number of
  437. /// data points to evaluate and values to return in yV[N].
  438. /// Set diagFl to true if covarM is diagonal.
  439. /// The function fails and returns false if the covariance matrix is singular.
  440. bool VECT_OP_FUNC(MultVarGaussPDF)( VECT_OP_TYPE* yV, const VECT_OP_TYPE* xM, const VECT_OP_TYPE* meanV, const VECT_OP_TYPE* covarM, unsigned D, unsigned N, bool diagFl );
  441. /// Same as multVarGaussPDF[] except takes the inverse covar mtx invCovarM[D,D]
  442. /// and log determinant of covar mtx.
  443. /// Always returns yV[].
  444. VECT_OP_TYPE* VECT_OP_FUNC(MultVarGaussPDF2)( VECT_OP_TYPE* yV, const VECT_OP_TYPE* xM, const VECT_OP_TYPE* meanV, const VECT_OP_TYPE* invCovarM, VECT_OP_TYPE logDet, unsigned D, unsigned N, bool diagFl );
  445. /// Same as multVarGaussPDF[] except uses a function to obtain the data vectors.
  446. /// srcFunc() can filter the data points by returning NULL if the data vector at frmIdx should
  447. /// not be evaluated against the PDF. In this case yV[frmIdx] will be set to 0.
  448. VECT_OP_TYPE* VECT_OP_FUNC(MultVarGaussPDF3)(
  449. VECT_OP_TYPE* yV,
  450. const VECT_OP_TYPE* (*srcFunc)(void* funcDataPtr, unsigned frmIdx ),
  451. void* funcDataPtr,
  452. const VECT_OP_TYPE* meanV,
  453. const VECT_OP_TYPE* invCovarM,
  454. VECT_OP_TYPE logDet,
  455. unsigned D,
  456. unsigned N,
  457. bool diagFl );
  458. /// Determine the most likely state sequece stateV[timeN] given a
  459. /// transition matrix a[stateN,stateN],
  460. /// observation probability matrix b[stateN,timeN] and
  461. /// initial state probability vector phi[stateN].
  462. /// a[i,j] is the probability of transitioning from state i to state j.
  463. /// b[i,t] is the probability of state i emitting the obj t.
  464. void VECT_OP_FUNC(DiscreteViterbi)(unsigned* stateV, unsigned timeN, unsigned stateN, const VECT_OP_TYPE* phi, const VECT_OP_TYPE* a, const VECT_OP_TYPE* b );
  465. /// Clip the line defined by x0,y0 to x1,y1 into the rect defined by xMin,yMin xMax,yMax.
  466. bool VECT_OP_FUNC(ClipLine)( VECT_OP_TYPE* x0, VECT_OP_TYPE* y0, VECT_OP_TYPE* x1, VECT_OP_TYPE* y1, VECT_OP_TYPE xMin, VECT_OP_TYPE yMin, VECT_OP_TYPE xMax, VECT_OP_TYPE yMax );
  467. /// Return true if the line defined by x0,y0 to x1,y1 intersects with
  468. /// the rectangle formed by xMin,yMin - xMax,yMax
  469. bool VECT_OP_FUNC(IsLineInRect)( VECT_OP_TYPE x0, VECT_OP_TYPE y0, VECT_OP_TYPE x1, VECT_OP_TYPE y1, VECT_OP_TYPE xMin, VECT_OP_TYPE yMin, VECT_OP_TYPE xMax, VECT_OP_TYPE yMax );
  470. /// Return the perpendicular distance from the line formed by x0,y0 and x1,y1
  471. /// and the point px,py
  472. VECT_OP_TYPE VECT_OP_FUNC(PtToLineDistance)( VECT_OP_TYPE x0, VECT_OP_TYPE y0, VECT_OP_TYPE x1, VECT_OP_TYPE y1, VECT_OP_TYPE px, VECT_OP_TYPE py);
  473. /// Calculate the best fit line: b0 + b1*x_i through the points x_i,y_i.
  474. /// Set x to NULL if it uses sequential integers [0,1,2,3...]
  475. void VECT_OP_FUNC(Lsq1)(const VECT_OP_TYPE* x, const VECT_OP_TYPE* y, unsigned n, VECT_OP_TYPE* b0, VECT_OP_TYPE* b1 );