fixed TBB version in LatentSVM.
example works ok.
* b = bb;\r
* count = N_comp + 1; \r
} else {\r
- cmp = (int *)malloc(sizeof(int) * (N_comp + 1));\r
+ cmp = (int *)malloc(sizeof(int) * (N_comp + 1));\r
bb = (float *)malloc(sizeof(float) * (N_comp + 1));\r
for(ii = 0; ii < N_comp; ii++){\r
- cmp[i] = (* comp)[ii];\r
- bb [i] = (* b )[ii];\r
+ cmp[ii] = (* comp)[ii];\r
+ bb [ii] = (* b )[ii];\r
}\r
free(* comp);\r
free(* b );\r
// Computation the number of levels for seaching object,\r
// first lambda-levels are used for computation values\r
// of score function for each position of root filter\r
- numLevels = H->numLevels;\r
+ numLevels = H->numLevels - LAMBDA;\r
kLevels = (int *)malloc(sizeof(int) * threadsNum);\r
procLevels = (int **)malloc(sizeof(int*) * threadsNum);\r
computeBorderSize(maxXBorder, maxYBorder, &bx, &by);\r