Searched refs:train_rows (Results 1 - 2 of 2) sorted by relevance

/external/opencv3/modules/features2d/src/opencl/
H A Dbrute_force_match.cl185 int train_rows,
221 for (int t = 0, endt = (train_rows + BLOCK_SIZE - 1) / BLOCK_SIZE; t < endt; t++)
225 const int trainOffset = min(mad24(BLOCK_SIZE, t, lidy), train_rows - 1) * step;
269 if (queryIdx < query_rows && trainIdx < train_rows && result < myBestDistance /*&& mask(queryIdx, trainIdx)*/)
317 int train_rows,
334 const int trainOffset = min(mad24(BLOCK_SIZE, groupidx, lidy), train_rows - 1) * step;
369 if (queryIdx < query_rows && trainIdx < train_rows && convert_float(result) < maxDistance)
388 int train_rows,
425 for (int t = 0, endt = (train_rows + BLOCK_SIZE - 1) / BLOCK_SIZE; t < endt ; t++)
429 int trainOffset = min(mad24(BLOCK_SIZE, t, lidy), train_rows
[all...]
/external/opencv3/modules/features2d/src/
H A Dmatchers.cpp280 const int train_rows = train.rows(); local
286 ensureSizeIsEnough(query_rows, std::max((train_rows / 100), 10), CV_32SC1, trainIdx);
287 ensureSizeIsEnough(query_rows, std::max((train_rows / 100), 10), CV_32FC1, distance);
309 size_t globalSize[] = {(train_rows + block_size - 1) / block_size * block_size, (query_rows + block_size - 1) / block_size * block_size};

Completed in 30 milliseconds