Remove all using directives for STL namespace and members
Made all STL usages explicit to be able automatically find all usages of particular class or function.
This commit is contained in:
@@ -49,9 +49,7 @@
|
||||
#include <vector>
|
||||
using namespace cv;
|
||||
using namespace cv::ocl;
|
||||
using namespace std;
|
||||
|
||||
using namespace std;
|
||||
namespace cv
|
||||
{
|
||||
namespace ocl
|
||||
@@ -71,24 +69,24 @@ void matchUnrolledCached(const oclMat &query, const oclMat &train, const oclMat
|
||||
const size_t smemSize = (BLOCK_SIZE * (MAX_DESC_LEN >= 2 * BLOCK_SIZE ? MAX_DESC_LEN : 2 * BLOCK_SIZE) + BLOCK_SIZE * BLOCK_SIZE) * sizeof(int);
|
||||
int block_size = BLOCK_SIZE;
|
||||
int m_size = MAX_DESC_LEN;
|
||||
vector< pair<size_t, const void *> > args;
|
||||
std::vector< std::pair<size_t, const void *> > args;
|
||||
|
||||
if(globalSize[0] != 0)
|
||||
{
|
||||
args.push_back( make_pair( sizeof(cl_mem), (void *)&query.data ));
|
||||
args.push_back( make_pair( sizeof(cl_mem), (void *)&train.data ));
|
||||
args.push_back( make_pair( sizeof(cl_mem), (void *)&mask.data ));
|
||||
args.push_back( make_pair( sizeof(cl_mem), (void *)&trainIdx.data ));
|
||||
args.push_back( make_pair( sizeof(cl_mem), (void *)&distance.data ));
|
||||
args.push_back( make_pair( smemSize, (void *)NULL));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&block_size ));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&m_size ));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&query.rows ));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&query.cols ));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&train.rows ));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&train.cols ));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&query.step ));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&distType ));
|
||||
args.push_back( std::make_pair( sizeof(cl_mem), (void *)&query.data ));
|
||||
args.push_back( std::make_pair( sizeof(cl_mem), (void *)&train.data ));
|
||||
args.push_back( std::make_pair( sizeof(cl_mem), (void *)&mask.data ));
|
||||
args.push_back( std::make_pair( sizeof(cl_mem), (void *)&trainIdx.data ));
|
||||
args.push_back( std::make_pair( sizeof(cl_mem), (void *)&distance.data ));
|
||||
args.push_back( std::make_pair( smemSize, (void *)NULL));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&block_size ));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&m_size ));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&query.rows ));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&query.cols ));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&train.rows ));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&train.cols ));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&query.step ));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&distType ));
|
||||
|
||||
std::string kernelName = "BruteForceMatch_UnrollMatch";
|
||||
|
||||
@@ -111,23 +109,23 @@ void match(const oclMat &query, const oclMat &train, const oclMat &mask,
|
||||
size_t localSize[] = {BLOCK_SIZE, BLOCK_SIZE, 1};
|
||||
const size_t smemSize = (2 * BLOCK_SIZE * BLOCK_SIZE) * sizeof(int);
|
||||
int block_size = BLOCK_SIZE;
|
||||
vector< pair<size_t, const void *> > args;
|
||||
std::vector< std::pair<size_t, const void *> > args;
|
||||
|
||||
if(globalSize[0] != 0)
|
||||
{
|
||||
args.push_back( make_pair( sizeof(cl_mem), (void *)&query.data ));
|
||||
args.push_back( make_pair( sizeof(cl_mem), (void *)&train.data ));
|
||||
args.push_back( make_pair( sizeof(cl_mem), (void *)&mask.data ));
|
||||
args.push_back( make_pair( sizeof(cl_mem), (void *)&trainIdx.data ));
|
||||
args.push_back( make_pair( sizeof(cl_mem), (void *)&distance.data ));
|
||||
args.push_back( make_pair( smemSize, (void *)NULL));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&block_size ));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&query.rows ));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&query.cols ));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&train.rows ));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&train.cols ));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&query.step ));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&distType ));
|
||||
args.push_back( std::make_pair( sizeof(cl_mem), (void *)&query.data ));
|
||||
args.push_back( std::make_pair( sizeof(cl_mem), (void *)&train.data ));
|
||||
args.push_back( std::make_pair( sizeof(cl_mem), (void *)&mask.data ));
|
||||
args.push_back( std::make_pair( sizeof(cl_mem), (void *)&trainIdx.data ));
|
||||
args.push_back( std::make_pair( sizeof(cl_mem), (void *)&distance.data ));
|
||||
args.push_back( std::make_pair( smemSize, (void *)NULL));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&block_size ));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&query.rows ));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&query.cols ));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&train.rows ));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&train.cols ));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&query.step ));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&distType ));
|
||||
|
||||
std::string kernelName = "BruteForceMatch_Match";
|
||||
|
||||
@@ -152,28 +150,28 @@ void matchUnrolledCached(const oclMat &query, const oclMat &train, float maxDist
|
||||
const size_t smemSize = (2 * BLOCK_SIZE * BLOCK_SIZE) * sizeof(int);
|
||||
int block_size = BLOCK_SIZE;
|
||||
int m_size = MAX_DESC_LEN;
|
||||
vector< pair<size_t, const void *> > args;
|
||||
std::vector< std::pair<size_t, const void *> > args;
|
||||
|
||||
if(globalSize[0] != 0)
|
||||
{
|
||||
args.push_back( make_pair( sizeof(cl_mem), (void *)&query.data ));
|
||||
args.push_back( make_pair( sizeof(cl_mem), (void *)&train.data ));
|
||||
args.push_back( make_pair( sizeof(cl_float), (void *)&maxDistance ));
|
||||
args.push_back( make_pair( sizeof(cl_mem), (void *)&mask.data ));
|
||||
args.push_back( make_pair( sizeof(cl_mem), (void *)&trainIdx.data ));
|
||||
args.push_back( make_pair( sizeof(cl_mem), (void *)&distance.data ));
|
||||
args.push_back( make_pair( sizeof(cl_mem), (void *)&nMatches.data ));
|
||||
args.push_back( make_pair( smemSize, (void *)NULL));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&block_size ));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&m_size ));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&query.rows ));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&query.cols ));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&train.rows ));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&train.cols ));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&trainIdx.cols ));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&query.step ));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&trainIdx.step ));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&distType ));
|
||||
args.push_back( std::make_pair( sizeof(cl_mem), (void *)&query.data ));
|
||||
args.push_back( std::make_pair( sizeof(cl_mem), (void *)&train.data ));
|
||||
args.push_back( std::make_pair( sizeof(cl_float), (void *)&maxDistance ));
|
||||
args.push_back( std::make_pair( sizeof(cl_mem), (void *)&mask.data ));
|
||||
args.push_back( std::make_pair( sizeof(cl_mem), (void *)&trainIdx.data ));
|
||||
args.push_back( std::make_pair( sizeof(cl_mem), (void *)&distance.data ));
|
||||
args.push_back( std::make_pair( sizeof(cl_mem), (void *)&nMatches.data ));
|
||||
args.push_back( std::make_pair( smemSize, (void *)NULL));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&block_size ));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&m_size ));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&query.rows ));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&query.cols ));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&train.rows ));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&train.cols ));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&trainIdx.cols ));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&query.step ));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&trainIdx.step ));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&distType ));
|
||||
|
||||
std::string kernelName = "BruteForceMatch_RadiusUnrollMatch";
|
||||
|
||||
@@ -191,27 +189,27 @@ void radius_match(const oclMat &query, const oclMat &train, float maxDistance, c
|
||||
size_t localSize[] = {BLOCK_SIZE, BLOCK_SIZE, 1};
|
||||
const size_t smemSize = (2 * BLOCK_SIZE * BLOCK_SIZE) * sizeof(int);
|
||||
int block_size = BLOCK_SIZE;
|
||||
vector< pair<size_t, const void *> > args;
|
||||
std::vector< std::pair<size_t, const void *> > args;
|
||||
|
||||
if(globalSize[0] != 0)
|
||||
{
|
||||
args.push_back( make_pair( sizeof(cl_mem), (void *)&query.data ));
|
||||
args.push_back( make_pair( sizeof(cl_mem), (void *)&train.data ));
|
||||
args.push_back( make_pair( sizeof(cl_float), (void *)&maxDistance ));
|
||||
args.push_back( make_pair( sizeof(cl_mem), (void *)&mask.data ));
|
||||
args.push_back( make_pair( sizeof(cl_mem), (void *)&trainIdx.data ));
|
||||
args.push_back( make_pair( sizeof(cl_mem), (void *)&distance.data ));
|
||||
args.push_back( make_pair( sizeof(cl_mem), (void *)&nMatches.data ));
|
||||
args.push_back( make_pair( smemSize, (void *)NULL));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&block_size ));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&query.rows ));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&query.cols ));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&train.rows ));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&train.cols ));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&trainIdx.cols ));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&query.step ));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&trainIdx.step ));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&distType ));
|
||||
args.push_back( std::make_pair( sizeof(cl_mem), (void *)&query.data ));
|
||||
args.push_back( std::make_pair( sizeof(cl_mem), (void *)&train.data ));
|
||||
args.push_back( std::make_pair( sizeof(cl_float), (void *)&maxDistance ));
|
||||
args.push_back( std::make_pair( sizeof(cl_mem), (void *)&mask.data ));
|
||||
args.push_back( std::make_pair( sizeof(cl_mem), (void *)&trainIdx.data ));
|
||||
args.push_back( std::make_pair( sizeof(cl_mem), (void *)&distance.data ));
|
||||
args.push_back( std::make_pair( sizeof(cl_mem), (void *)&nMatches.data ));
|
||||
args.push_back( std::make_pair( smemSize, (void *)NULL));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&block_size ));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&query.rows ));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&query.cols ));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&train.rows ));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&train.cols ));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&trainIdx.cols ));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&query.step ));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&trainIdx.step ));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&distType ));
|
||||
|
||||
std::string kernelName = "BruteForceMatch_RadiusMatch";
|
||||
|
||||
@@ -481,24 +479,24 @@ void knn_matchUnrolledCached(const oclMat &query, const oclMat &train, const ocl
|
||||
const size_t smemSize = (BLOCK_SIZE * (MAX_DESC_LEN >= BLOCK_SIZE ? MAX_DESC_LEN : BLOCK_SIZE) + BLOCK_SIZE * BLOCK_SIZE) * sizeof(int);
|
||||
int block_size = BLOCK_SIZE;
|
||||
int m_size = MAX_DESC_LEN;
|
||||
vector< pair<size_t, const void *> > args;
|
||||
std::vector< std::pair<size_t, const void *> > args;
|
||||
|
||||
if(globalSize[0] != 0)
|
||||
{
|
||||
args.push_back( make_pair( sizeof(cl_mem), (void *)&query.data ));
|
||||
args.push_back( make_pair( sizeof(cl_mem), (void *)&train.data ));
|
||||
args.push_back( make_pair( sizeof(cl_mem), (void *)&mask.data ));
|
||||
args.push_back( make_pair( sizeof(cl_mem), (void *)&trainIdx.data ));
|
||||
args.push_back( make_pair( sizeof(cl_mem), (void *)&distance.data ));
|
||||
args.push_back( make_pair( smemSize, (void *)NULL));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&block_size ));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&m_size ));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&query.rows ));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&query.cols ));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&train.rows ));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&train.cols ));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&query.step ));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&distType ));
|
||||
args.push_back( std::make_pair( sizeof(cl_mem), (void *)&query.data ));
|
||||
args.push_back( std::make_pair( sizeof(cl_mem), (void *)&train.data ));
|
||||
args.push_back( std::make_pair( sizeof(cl_mem), (void *)&mask.data ));
|
||||
args.push_back( std::make_pair( sizeof(cl_mem), (void *)&trainIdx.data ));
|
||||
args.push_back( std::make_pair( sizeof(cl_mem), (void *)&distance.data ));
|
||||
args.push_back( std::make_pair( smemSize, (void *)NULL));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&block_size ));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&m_size ));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&query.rows ));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&query.cols ));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&train.rows ));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&train.cols ));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&query.step ));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&distType ));
|
||||
|
||||
std::string kernelName = "BruteForceMatch_knnUnrollMatch";
|
||||
|
||||
@@ -515,23 +513,23 @@ void knn_match(const oclMat &query, const oclMat &train, const oclMat &mask,
|
||||
size_t localSize[] = {BLOCK_SIZE, BLOCK_SIZE, 1};
|
||||
const size_t smemSize = (2 * BLOCK_SIZE * BLOCK_SIZE) * sizeof(int);
|
||||
int block_size = BLOCK_SIZE;
|
||||
vector< pair<size_t, const void *> > args;
|
||||
std::vector< std::pair<size_t, const void *> > args;
|
||||
|
||||
if(globalSize[0] != 0)
|
||||
{
|
||||
args.push_back( make_pair( sizeof(cl_mem), (void *)&query.data ));
|
||||
args.push_back( make_pair( sizeof(cl_mem), (void *)&train.data ));
|
||||
args.push_back( make_pair( sizeof(cl_mem), (void *)&mask.data ));
|
||||
args.push_back( make_pair( sizeof(cl_mem), (void *)&trainIdx.data ));
|
||||
args.push_back( make_pair( sizeof(cl_mem), (void *)&distance.data ));
|
||||
args.push_back( make_pair( smemSize, (void *)NULL));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&block_size ));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&query.rows ));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&query.cols ));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&train.rows ));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&train.cols ));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&query.step ));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&distType ));
|
||||
args.push_back( std::make_pair( sizeof(cl_mem), (void *)&query.data ));
|
||||
args.push_back( std::make_pair( sizeof(cl_mem), (void *)&train.data ));
|
||||
args.push_back( std::make_pair( sizeof(cl_mem), (void *)&mask.data ));
|
||||
args.push_back( std::make_pair( sizeof(cl_mem), (void *)&trainIdx.data ));
|
||||
args.push_back( std::make_pair( sizeof(cl_mem), (void *)&distance.data ));
|
||||
args.push_back( std::make_pair( smemSize, (void *)NULL));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&block_size ));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&query.rows ));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&query.cols ));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&train.rows ));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&train.cols ));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&query.step ));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&distType ));
|
||||
|
||||
std::string kernelName = "BruteForceMatch_knnMatch";
|
||||
|
||||
@@ -548,23 +546,23 @@ void calcDistanceUnrolled(const oclMat &query, const oclMat &train, const oclMat
|
||||
const size_t smemSize = (2 * BLOCK_SIZE * BLOCK_SIZE) * sizeof(int);
|
||||
int block_size = BLOCK_SIZE;
|
||||
int m_size = MAX_DESC_LEN;
|
||||
vector< pair<size_t, const void *> > args;
|
||||
std::vector< std::pair<size_t, const void *> > args;
|
||||
|
||||
if(globalSize[0] != 0)
|
||||
{
|
||||
args.push_back( make_pair( sizeof(cl_mem), (void *)&query.data ));
|
||||
args.push_back( make_pair( sizeof(cl_mem), (void *)&train.data ));
|
||||
args.push_back( make_pair( sizeof(cl_mem), (void *)&mask.data ));
|
||||
args.push_back( make_pair( sizeof(cl_mem), (void *)&allDist.data ));
|
||||
args.push_back( make_pair( smemSize, (void *)NULL));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&block_size ));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&m_size ));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&query.rows ));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&query.cols ));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&train.rows ));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&train.cols ));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&query.step ));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&distType ));
|
||||
args.push_back( std::make_pair( sizeof(cl_mem), (void *)&query.data ));
|
||||
args.push_back( std::make_pair( sizeof(cl_mem), (void *)&train.data ));
|
||||
args.push_back( std::make_pair( sizeof(cl_mem), (void *)&mask.data ));
|
||||
args.push_back( std::make_pair( sizeof(cl_mem), (void *)&allDist.data ));
|
||||
args.push_back( std::make_pair( smemSize, (void *)NULL));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&block_size ));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&m_size ));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&query.rows ));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&query.cols ));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&train.rows ));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&train.cols ));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&query.step ));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&distType ));
|
||||
|
||||
std::string kernelName = "BruteForceMatch_calcDistanceUnrolled";
|
||||
|
||||
@@ -580,22 +578,22 @@ void calcDistance(const oclMat &query, const oclMat &train, const oclMat &mask,
|
||||
size_t localSize[] = {BLOCK_SIZE, BLOCK_SIZE, 1};
|
||||
const size_t smemSize = (2 * BLOCK_SIZE * BLOCK_SIZE) * sizeof(int);
|
||||
int block_size = BLOCK_SIZE;
|
||||
vector< pair<size_t, const void *> > args;
|
||||
std::vector< std::pair<size_t, const void *> > args;
|
||||
|
||||
if(globalSize[0] != 0)
|
||||
{
|
||||
args.push_back( make_pair( sizeof(cl_mem), (void *)&query.data ));
|
||||
args.push_back( make_pair( sizeof(cl_mem), (void *)&train.data ));
|
||||
args.push_back( make_pair( sizeof(cl_mem), (void *)&mask.data ));
|
||||
args.push_back( make_pair( sizeof(cl_mem), (void *)&allDist.data ));
|
||||
args.push_back( make_pair( smemSize, (void *)NULL));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&block_size ));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&query.rows ));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&query.cols ));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&train.rows ));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&train.cols ));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&query.step ));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&distType ));
|
||||
args.push_back( std::make_pair( sizeof(cl_mem), (void *)&query.data ));
|
||||
args.push_back( std::make_pair( sizeof(cl_mem), (void *)&train.data ));
|
||||
args.push_back( std::make_pair( sizeof(cl_mem), (void *)&mask.data ));
|
||||
args.push_back( std::make_pair( sizeof(cl_mem), (void *)&allDist.data ));
|
||||
args.push_back( std::make_pair( smemSize, (void *)NULL));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&block_size ));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&query.rows ));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&query.cols ));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&train.rows ));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&train.cols ));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&query.step ));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&distType ));
|
||||
|
||||
std::string kernelName = "BruteForceMatch_calcDistance";
|
||||
|
||||
@@ -676,16 +674,16 @@ void findKnnMatch(int k, const oclMat &trainIdx, const oclMat &distance, const o
|
||||
|
||||
for (int i = 0; i < k; ++i)
|
||||
{
|
||||
vector< pair<size_t, const void *> > args;
|
||||
std::vector< std::pair<size_t, const void *> > args;
|
||||
|
||||
args.push_back( make_pair( sizeof(cl_mem), (void *)&allDist.data ));
|
||||
args.push_back( make_pair( sizeof(cl_mem), (void *)&trainIdx.data ));
|
||||
args.push_back( make_pair( sizeof(cl_mem), (void *)&distance.data ));
|
||||
args.push_back( make_pair( sizeof(cl_mem), (void *)&i));
|
||||
args.push_back( make_pair( sizeof(cl_int), (void *)&block_size ));
|
||||
//args.push_back( make_pair( sizeof(cl_int), (void *)&train.rows ));
|
||||
//args.push_back( make_pair( sizeof(cl_int), (void *)&train.cols ));
|
||||
//args.push_back( make_pair( sizeof(cl_int), (void *)&query.step ));
|
||||
args.push_back( std::make_pair( sizeof(cl_mem), (void *)&allDist.data ));
|
||||
args.push_back( std::make_pair( sizeof(cl_mem), (void *)&trainIdx.data ));
|
||||
args.push_back( std::make_pair( sizeof(cl_mem), (void *)&distance.data ));
|
||||
args.push_back( std::make_pair( sizeof(cl_mem), (void *)&i));
|
||||
args.push_back( std::make_pair( sizeof(cl_int), (void *)&block_size ));
|
||||
//args.push_back( std::make_pair( sizeof(cl_int), (void *)&train.rows ));
|
||||
//args.push_back( std::make_pair( sizeof(cl_int), (void *)&train.cols ));
|
||||
//args.push_back( std::make_pair( sizeof(cl_int), (void *)&query.step ));
|
||||
|
||||
openCLExecuteKernel(ctx, &brute_force_match, kernelName, globalSize, localSize, args, -1, -1);
|
||||
}
|
||||
@@ -900,12 +898,12 @@ cv::ocl::BruteForceMatcher_OCL_base::BruteForceMatcher_OCL_base(DistType distTyp
|
||||
{
|
||||
}
|
||||
|
||||
void cv::ocl::BruteForceMatcher_OCL_base::add(const vector<oclMat> &descCollection)
|
||||
void cv::ocl::BruteForceMatcher_OCL_base::add(const std::vector<oclMat> &descCollection)
|
||||
{
|
||||
trainDescCollection.insert(trainDescCollection.end(), descCollection.begin(), descCollection.end());
|
||||
}
|
||||
|
||||
const vector<oclMat> &cv::ocl::BruteForceMatcher_OCL_base::getTrainDescriptors() const
|
||||
const std::vector<oclMat> &cv::ocl::BruteForceMatcher_OCL_base::getTrainDescriptors() const
|
||||
{
|
||||
return trainDescCollection;
|
||||
}
|
||||
@@ -964,7 +962,7 @@ void cv::ocl::BruteForceMatcher_OCL_base::matchSingle(const oclMat &query, const
|
||||
func(query, train, mask, trainIdx, distance);
|
||||
}
|
||||
|
||||
void cv::ocl::BruteForceMatcher_OCL_base::matchDownload(const oclMat &trainIdx, const oclMat &distance, vector<DMatch> &matches)
|
||||
void cv::ocl::BruteForceMatcher_OCL_base::matchDownload(const oclMat &trainIdx, const oclMat &distance, std::vector<DMatch> &matches)
|
||||
{
|
||||
if (trainIdx.empty() || distance.empty())
|
||||
return;
|
||||
@@ -975,7 +973,7 @@ void cv::ocl::BruteForceMatcher_OCL_base::matchDownload(const oclMat &trainIdx,
|
||||
matchConvert(trainIdxCPU, distanceCPU, matches);
|
||||
}
|
||||
|
||||
void cv::ocl::BruteForceMatcher_OCL_base::matchConvert(const Mat &trainIdx, const Mat &distance, vector<DMatch> &matches)
|
||||
void cv::ocl::BruteForceMatcher_OCL_base::matchConvert(const Mat &trainIdx, const Mat &distance, std::vector<DMatch> &matches)
|
||||
{
|
||||
if (trainIdx.empty() || distance.empty())
|
||||
return;
|
||||
@@ -1005,14 +1003,14 @@ void cv::ocl::BruteForceMatcher_OCL_base::matchConvert(const Mat &trainIdx, cons
|
||||
}
|
||||
}
|
||||
|
||||
void cv::ocl::BruteForceMatcher_OCL_base::match(const oclMat &query, const oclMat &train, vector<DMatch> &matches, const oclMat &mask)
|
||||
void cv::ocl::BruteForceMatcher_OCL_base::match(const oclMat &query, const oclMat &train, std::vector<DMatch> &matches, const oclMat &mask)
|
||||
{
|
||||
oclMat trainIdx, distance;
|
||||
matchSingle(query, train, trainIdx, distance, mask);
|
||||
matchDownload(trainIdx, distance, matches);
|
||||
}
|
||||
|
||||
void cv::ocl::BruteForceMatcher_OCL_base::makeGpuCollection(oclMat &trainCollection, oclMat &maskCollection, const vector<oclMat> &masks)
|
||||
void cv::ocl::BruteForceMatcher_OCL_base::makeGpuCollection(oclMat &trainCollection, oclMat &maskCollection, const std::vector<oclMat> &masks)
|
||||
{
|
||||
|
||||
if (empty())
|
||||
@@ -1098,7 +1096,7 @@ void cv::ocl::BruteForceMatcher_OCL_base::matchCollection(const oclMat &query, c
|
||||
func(query, trainCollection, masks, trainIdx, imgIdx, distance);
|
||||
}
|
||||
|
||||
void cv::ocl::BruteForceMatcher_OCL_base::matchDownload(const oclMat &trainIdx, const oclMat &imgIdx, const oclMat &distance, vector<DMatch> &matches)
|
||||
void cv::ocl::BruteForceMatcher_OCL_base::matchDownload(const oclMat &trainIdx, const oclMat &imgIdx, const oclMat &distance, std::vector<DMatch> &matches)
|
||||
{
|
||||
if (trainIdx.empty() || imgIdx.empty() || distance.empty())
|
||||
return;
|
||||
@@ -1110,7 +1108,7 @@ void cv::ocl::BruteForceMatcher_OCL_base::matchDownload(const oclMat &trainIdx,
|
||||
matchConvert(trainIdxCPU, imgIdxCPU, distanceCPU, matches);
|
||||
}
|
||||
|
||||
void cv::ocl::BruteForceMatcher_OCL_base::matchConvert(const Mat &trainIdx, const Mat &imgIdx, const Mat &distance, vector<DMatch> &matches)
|
||||
void cv::ocl::BruteForceMatcher_OCL_base::matchConvert(const Mat &trainIdx, const Mat &imgIdx, const Mat &distance, std::vector<DMatch> &matches)
|
||||
{
|
||||
if (trainIdx.empty() || imgIdx.empty() || distance.empty())
|
||||
return;
|
||||
@@ -1144,7 +1142,7 @@ void cv::ocl::BruteForceMatcher_OCL_base::matchConvert(const Mat &trainIdx, cons
|
||||
}
|
||||
}
|
||||
|
||||
void cv::ocl::BruteForceMatcher_OCL_base::match(const oclMat &query, vector<DMatch> &matches, const vector<oclMat> &masks)
|
||||
void cv::ocl::BruteForceMatcher_OCL_base::match(const oclMat &query, std::vector<DMatch> &matches, const std::vector<oclMat> &masks)
|
||||
{
|
||||
oclMat trainCollection;
|
||||
oclMat maskCollection;
|
||||
@@ -1212,7 +1210,7 @@ void cv::ocl::BruteForceMatcher_OCL_base::knnMatchSingle(const oclMat &query, co
|
||||
func(query, train, k, mask, trainIdx, distance, allDist);
|
||||
}
|
||||
|
||||
void cv::ocl::BruteForceMatcher_OCL_base::knnMatchDownload(const oclMat &trainIdx, const oclMat &distance, vector< vector<DMatch> > &matches, bool compactResult)
|
||||
void cv::ocl::BruteForceMatcher_OCL_base::knnMatchDownload(const oclMat &trainIdx, const oclMat &distance, std::vector< std::vector<DMatch> > &matches, bool compactResult)
|
||||
{
|
||||
if (trainIdx.empty() || distance.empty())
|
||||
return;
|
||||
@@ -1223,7 +1221,7 @@ void cv::ocl::BruteForceMatcher_OCL_base::knnMatchDownload(const oclMat &trainId
|
||||
knnMatchConvert(trainIdxCPU, distanceCPU, matches, compactResult);
|
||||
}
|
||||
|
||||
void cv::ocl::BruteForceMatcher_OCL_base::knnMatchConvert(const Mat &trainIdx, const Mat &distance, vector< vector<DMatch> > &matches, bool compactResult)
|
||||
void cv::ocl::BruteForceMatcher_OCL_base::knnMatchConvert(const Mat &trainIdx, const Mat &distance, std::vector< std::vector<DMatch> > &matches, bool compactResult)
|
||||
{
|
||||
if (trainIdx.empty() || distance.empty())
|
||||
return;
|
||||
@@ -1244,8 +1242,8 @@ void cv::ocl::BruteForceMatcher_OCL_base::knnMatchConvert(const Mat &trainIdx, c
|
||||
|
||||
for (int queryIdx = 0; queryIdx < nQuery; ++queryIdx)
|
||||
{
|
||||
matches.push_back(vector<DMatch>());
|
||||
vector<DMatch> &curMatches = matches.back();
|
||||
matches.push_back(std::vector<DMatch>());
|
||||
std::vector<DMatch> &curMatches = matches.back();
|
||||
curMatches.reserve(k);
|
||||
|
||||
for (int i = 0; i < k; ++i, ++trainIdx_ptr, ++distance_ptr)
|
||||
@@ -1267,7 +1265,7 @@ void cv::ocl::BruteForceMatcher_OCL_base::knnMatchConvert(const Mat &trainIdx, c
|
||||
}
|
||||
}
|
||||
|
||||
void cv::ocl::BruteForceMatcher_OCL_base::knnMatch(const oclMat &query, const oclMat &train, vector< vector<DMatch> > &matches
|
||||
void cv::ocl::BruteForceMatcher_OCL_base::knnMatch(const oclMat &query, const oclMat &train, std::vector< std::vector<DMatch> > &matches
|
||||
, int k, const oclMat &mask, bool compactResult)
|
||||
{
|
||||
oclMat trainIdx, distance, allDist;
|
||||
@@ -1320,7 +1318,7 @@ void cv::ocl::BruteForceMatcher_OCL_base::knnMatch2Collection(const oclMat &quer
|
||||
}
|
||||
|
||||
void cv::ocl::BruteForceMatcher_OCL_base::knnMatch2Download(const oclMat &trainIdx, const oclMat &imgIdx,
|
||||
const oclMat &distance, vector< vector<DMatch> > &matches, bool compactResult)
|
||||
const oclMat &distance, std::vector< std::vector<DMatch> > &matches, bool compactResult)
|
||||
{
|
||||
if (trainIdx.empty() || imgIdx.empty() || distance.empty())
|
||||
return;
|
||||
@@ -1333,7 +1331,7 @@ void cv::ocl::BruteForceMatcher_OCL_base::knnMatch2Download(const oclMat &trainI
|
||||
}
|
||||
|
||||
void cv::ocl::BruteForceMatcher_OCL_base::knnMatch2Convert(const Mat &trainIdx, const Mat &imgIdx, const Mat &distance,
|
||||
vector< vector<DMatch> > &matches, bool compactResult)
|
||||
std::vector< std::vector<DMatch> > &matches, bool compactResult)
|
||||
{
|
||||
if (trainIdx.empty() || imgIdx.empty() || distance.empty())
|
||||
return;
|
||||
@@ -1353,8 +1351,8 @@ void cv::ocl::BruteForceMatcher_OCL_base::knnMatch2Convert(const Mat &trainIdx,
|
||||
|
||||
for (int queryIdx = 0; queryIdx < nQuery; ++queryIdx)
|
||||
{
|
||||
matches.push_back(vector<DMatch>());
|
||||
vector<DMatch> &curMatches = matches.back();
|
||||
matches.push_back(std::vector<DMatch>());
|
||||
std::vector<DMatch> &curMatches = matches.back();
|
||||
curMatches.reserve(2);
|
||||
|
||||
for (int i = 0; i < 2; ++i, ++trainIdx_ptr, ++imgIdx_ptr, ++distance_ptr)
|
||||
@@ -1391,8 +1389,8 @@ namespace
|
||||
};
|
||||
}
|
||||
|
||||
void cv::ocl::BruteForceMatcher_OCL_base::knnMatch(const oclMat &query, vector< vector<DMatch> > &matches, int k,
|
||||
const vector<oclMat> &masks, bool compactResult)
|
||||
void cv::ocl::BruteForceMatcher_OCL_base::knnMatch(const oclMat &query, std::vector< std::vector<DMatch> > &matches, int k,
|
||||
const std::vector<oclMat> &masks, bool compactResult)
|
||||
{
|
||||
|
||||
|
||||
@@ -1413,12 +1411,12 @@ void cv::ocl::BruteForceMatcher_OCL_base::knnMatch(const oclMat &query, vector<
|
||||
if (query.empty() || empty())
|
||||
return;
|
||||
|
||||
vector< vector<DMatch> > curMatches;
|
||||
vector<DMatch> temp;
|
||||
std::vector< std::vector<DMatch> > curMatches;
|
||||
std::vector<DMatch> temp;
|
||||
temp.reserve(2 * k);
|
||||
|
||||
matches.resize(query.rows);
|
||||
for_each(matches.begin(), matches.end(), bind2nd(mem_fun_ref(&vector<DMatch>::reserve), k));
|
||||
std::for_each(matches.begin(), matches.end(), std::bind2nd(std::mem_fun_ref(&std::vector<DMatch>::reserve), k));
|
||||
|
||||
for (size_t imgIdx = 0, size = trainDescCollection.size(); imgIdx < size; ++imgIdx)
|
||||
{
|
||||
@@ -1426,8 +1424,8 @@ void cv::ocl::BruteForceMatcher_OCL_base::knnMatch(const oclMat &query, vector<
|
||||
|
||||
for (int queryIdx = 0; queryIdx < query.rows; ++queryIdx)
|
||||
{
|
||||
vector<DMatch> &localMatch = curMatches[queryIdx];
|
||||
vector<DMatch> &globalMatch = matches[queryIdx];
|
||||
std::vector<DMatch> &localMatch = curMatches[queryIdx];
|
||||
std::vector<DMatch> &globalMatch = matches[queryIdx];
|
||||
|
||||
for_each(localMatch.begin(), localMatch.end(), ImgIdxSetter(static_cast<int>(imgIdx)));
|
||||
|
||||
@@ -1442,7 +1440,7 @@ void cv::ocl::BruteForceMatcher_OCL_base::knnMatch(const oclMat &query, vector<
|
||||
|
||||
if (compactResult)
|
||||
{
|
||||
vector< vector<DMatch> >::iterator new_end = remove_if(matches.begin(), matches.end(), mem_fun_ref(&vector<DMatch>::empty));
|
||||
std::vector< std::vector<DMatch> >::iterator new_end = std::remove_if(matches.begin(), matches.end(), std::mem_fun_ref(&std::vector<DMatch>::empty));
|
||||
matches.erase(new_end, matches.end());
|
||||
}
|
||||
}
|
||||
@@ -1502,7 +1500,7 @@ void cv::ocl::BruteForceMatcher_OCL_base::radiusMatchSingle(const oclMat &query,
|
||||
}
|
||||
|
||||
void cv::ocl::BruteForceMatcher_OCL_base::radiusMatchDownload(const oclMat &trainIdx, const oclMat &distance, const oclMat &nMatches,
|
||||
vector< vector<DMatch> > &matches, bool compactResult)
|
||||
std::vector< std::vector<DMatch> > &matches, bool compactResult)
|
||||
{
|
||||
if (trainIdx.empty() || distance.empty() || nMatches.empty())
|
||||
return;
|
||||
@@ -1515,7 +1513,7 @@ void cv::ocl::BruteForceMatcher_OCL_base::radiusMatchDownload(const oclMat &trai
|
||||
}
|
||||
|
||||
void cv::ocl::BruteForceMatcher_OCL_base::radiusMatchConvert(const Mat &trainIdx, const Mat &distance, const Mat &nMatches,
|
||||
vector< vector<DMatch> > &matches, bool compactResult)
|
||||
std::vector< std::vector<DMatch> > &matches, bool compactResult)
|
||||
{
|
||||
if (trainIdx.empty() || distance.empty() || nMatches.empty())
|
||||
return;
|
||||
@@ -1541,12 +1539,12 @@ void cv::ocl::BruteForceMatcher_OCL_base::radiusMatchConvert(const Mat &trainIdx
|
||||
if (nMatches == 0)
|
||||
{
|
||||
if (!compactResult)
|
||||
matches.push_back(vector<DMatch>());
|
||||
matches.push_back(std::vector<DMatch>());
|
||||
continue;
|
||||
}
|
||||
|
||||
matches.push_back(vector<DMatch>(nMatches));
|
||||
vector<DMatch> &curMatches = matches.back();
|
||||
matches.push_back(std::vector<DMatch>(nMatches));
|
||||
std::vector<DMatch> &curMatches = matches.back();
|
||||
|
||||
for (int i = 0; i < nMatches; ++i, ++trainIdx_ptr, ++distance_ptr)
|
||||
{
|
||||
@@ -1563,7 +1561,7 @@ void cv::ocl::BruteForceMatcher_OCL_base::radiusMatchConvert(const Mat &trainIdx
|
||||
}
|
||||
}
|
||||
|
||||
void cv::ocl::BruteForceMatcher_OCL_base::radiusMatch(const oclMat &query, const oclMat &train, vector< vector<DMatch> > &matches,
|
||||
void cv::ocl::BruteForceMatcher_OCL_base::radiusMatch(const oclMat &query, const oclMat &train, std::vector< std::vector<DMatch> > &matches,
|
||||
float maxDistance, const oclMat &mask, bool compactResult)
|
||||
{
|
||||
oclMat trainIdx, distance, nMatches;
|
||||
@@ -1572,7 +1570,7 @@ void cv::ocl::BruteForceMatcher_OCL_base::radiusMatch(const oclMat &query, const
|
||||
}
|
||||
|
||||
void cv::ocl::BruteForceMatcher_OCL_base::radiusMatchCollection(const oclMat &query, oclMat &trainIdx, oclMat &imgIdx, oclMat &distance,
|
||||
oclMat &nMatches, float /*maxDistance*/, const vector<oclMat> &masks)
|
||||
oclMat &nMatches, float /*maxDistance*/, const std::vector<oclMat> &masks)
|
||||
{
|
||||
if (query.empty() || empty())
|
||||
return;
|
||||
@@ -1617,15 +1615,15 @@ void cv::ocl::BruteForceMatcher_OCL_base::radiusMatchCollection(const oclMat &qu
|
||||
//caller_t func = callers[distType][query.depth()];
|
||||
//CV_Assert(func != 0);
|
||||
|
||||
vector<oclMat> trains_(trainDescCollection.begin(), trainDescCollection.end());
|
||||
vector<oclMat> masks_(masks.begin(), masks.end());
|
||||
std::vector<oclMat> trains_(trainDescCollection.begin(), trainDescCollection.end());
|
||||
std::vector<oclMat> masks_(masks.begin(), masks.end());
|
||||
|
||||
/* func(query, &trains_[0], static_cast<int>(trains_.size()), maxDistance, masks_.size() == 0 ? 0 : &masks_[0],
|
||||
trainIdx, imgIdx, distance, nMatches));*/
|
||||
}
|
||||
|
||||
void cv::ocl::BruteForceMatcher_OCL_base::radiusMatchDownload(const oclMat &trainIdx, const oclMat &imgIdx, const oclMat &distance,
|
||||
const oclMat &nMatches, vector< vector<DMatch> > &matches, bool compactResult)
|
||||
const oclMat &nMatches, std::vector< std::vector<DMatch> > &matches, bool compactResult)
|
||||
{
|
||||
if (trainIdx.empty() || imgIdx.empty() || distance.empty() || nMatches.empty())
|
||||
return;
|
||||
@@ -1639,7 +1637,7 @@ void cv::ocl::BruteForceMatcher_OCL_base::radiusMatchDownload(const oclMat &trai
|
||||
}
|
||||
|
||||
void cv::ocl::BruteForceMatcher_OCL_base::radiusMatchConvert(const Mat &trainIdx, const Mat &imgIdx, const Mat &distance, const Mat &nMatches,
|
||||
vector< vector<DMatch> > &matches, bool compactResult)
|
||||
std::vector< std::vector<DMatch> > &matches, bool compactResult)
|
||||
{
|
||||
if (trainIdx.empty() || imgIdx.empty() || distance.empty() || nMatches.empty())
|
||||
return;
|
||||
@@ -1667,12 +1665,12 @@ void cv::ocl::BruteForceMatcher_OCL_base::radiusMatchConvert(const Mat &trainIdx
|
||||
if (nMatches == 0)
|
||||
{
|
||||
if (!compactResult)
|
||||
matches.push_back(vector<DMatch>());
|
||||
matches.push_back(std::vector<DMatch>());
|
||||
continue;
|
||||
}
|
||||
|
||||
matches.push_back(vector<DMatch>());
|
||||
vector<DMatch> &curMatches = matches.back();
|
||||
matches.push_back(std::vector<DMatch>());
|
||||
std::vector<DMatch> &curMatches = matches.back();
|
||||
curMatches.reserve(nMatches);
|
||||
|
||||
for (int i = 0; i < nMatches; ++i, ++trainIdx_ptr, ++imgIdx_ptr, ++distance_ptr)
|
||||
@@ -1690,8 +1688,8 @@ void cv::ocl::BruteForceMatcher_OCL_base::radiusMatchConvert(const Mat &trainIdx
|
||||
}
|
||||
}
|
||||
|
||||
void cv::ocl::BruteForceMatcher_OCL_base::radiusMatch(const oclMat &query, vector< vector<DMatch> > &matches, float maxDistance,
|
||||
const vector<oclMat> &masks, bool compactResult)
|
||||
void cv::ocl::BruteForceMatcher_OCL_base::radiusMatch(const oclMat &query, std::vector< std::vector<DMatch> > &matches, float maxDistance,
|
||||
const std::vector<oclMat> &masks, bool compactResult)
|
||||
{
|
||||
oclMat trainIdx, imgIdx, distance, nMatches;
|
||||
radiusMatchCollection(query, trainIdx, imgIdx, distance, nMatches, maxDistance, masks);
|
||||
|
Reference in New Issue
Block a user