1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230
|
/*******************************************************
* Copyright (c) 2014, ArrayFire
* All rights reserved.
*
* This file is distributed under 3-clause BSD license.
* The complete license agreement can be obtained at:
* http://arrayfire.com/licenses/BSD-3-Clause
********************************************************/
#include <gtest/gtest.h>
#include <arrayfire.h>
#include <af/dim4.hpp>
#include <af/traits.hpp>
#include <string>
#include <vector>
#include <testHelpers.hpp>
using std::vector;
using std::string;
using af::cfloat;
using af::cdouble;
template<typename T>
class NearestNeighbour : public ::testing::Test
{
public:
virtual void SetUp() {}
};
// create lists of types to be tested
typedef ::testing::Types<float, double, int, uint, intl, uintl, uchar, short, ushort> TestTypes;
template<typename T>
struct otype_t
{
typedef T otype;
};
template<>
struct otype_t<short>
{
typedef int otype;
};
template<>
struct otype_t<ushort>
{
typedef uint otype;
};
template<>
struct otype_t<uchar>
{
typedef uint otype;
};
// register the type list
TYPED_TEST_CASE(NearestNeighbour, TestTypes);
template<typename T>
void nearestNeighbourTest(string pTestFile, int feat_dim, const af_match_type type)
{
if (noDoubleTests<T>()) return;
typedef typename otype_t<T>::otype To;
using af::dim4;
vector<dim4> numDims;
vector<vector<T> > in;
vector<vector<uint> > tests;
readTests<T, uint, uint>(pTestFile, numDims, in, tests);
dim4 qDims = numDims[0];
dim4 tDims = numDims[1];
af_array query = 0;
af_array train = 0;
af_array idx = 0;
af_array dist = 0;
ASSERT_EQ(AF_SUCCESS, af_create_array(&query, &(in[0].front()),
qDims.ndims(), qDims.get(), (af_dtype)af::dtype_traits<T>::af_type));
ASSERT_EQ(AF_SUCCESS, af_create_array(&train, &(in[1].front()),
tDims.ndims(), tDims.get(), (af_dtype)af::dtype_traits<T>::af_type));
ASSERT_EQ(AF_SUCCESS, af_nearest_neighbour(&idx, &dist, query, train, feat_dim, 1, type));
vector<uint> goldIdx = tests[0];
vector<uint> goldDist = tests[1];
size_t nElems = goldIdx.size();
uint *outIdx = new uint[nElems];
To *outDist = new To[nElems];
ASSERT_EQ(AF_SUCCESS, af_get_data_ptr((void*)outIdx, idx));
ASSERT_EQ(AF_SUCCESS, af_get_data_ptr((void*)outDist, dist));
for (size_t elIter=0; elIter<nElems; ++elIter) {
ASSERT_EQ((To)goldDist[elIter], outDist[elIter])<< "at: " << elIter<< std::endl;
}
delete[] outIdx;
delete[] outDist;
ASSERT_EQ(AF_SUCCESS, af_release_array(query));
ASSERT_EQ(AF_SUCCESS, af_release_array(train));
ASSERT_EQ(AF_SUCCESS, af_release_array(idx));
ASSERT_EQ(AF_SUCCESS, af_release_array(dist));
}
/////////////////////////////////////////////////
// SSD
/////////////////////////////////////////////////
TYPED_TEST(NearestNeighbour, NN_SSD_100_1000_Dim0)
{
nearestNeighbourTest<TypeParam>(string(TEST_DIR"/nearest_neighbour/ssd_100_1000_dim0.test"), 0, AF_SSD);
}
TYPED_TEST(NearestNeighbour, NN_SSD_100_1000_Dim1)
{
nearestNeighbourTest<TypeParam>(string(TEST_DIR"/nearest_neighbour/ssd_100_1000_dim1.test"), 1, AF_SSD);
}
TYPED_TEST(NearestNeighbour, NN_SSD_500_5000_Dim0)
{
nearestNeighbourTest<TypeParam>(string(TEST_DIR"/nearest_neighbour/ssd_500_5000_dim0.test"), 0, AF_SSD);
}
TYPED_TEST(NearestNeighbour, NN_SSD_500_5000_Dim1)
{
nearestNeighbourTest<TypeParam>(string(TEST_DIR"/nearest_neighbour/ssd_500_5000_dim1.test"), 1, AF_SSD);
}
/////////////////////////////////////////////////
// SAD
/////////////////////////////////////////////////
TYPED_TEST(NearestNeighbour, NN_SAD_100_1000_Dim0)
{
nearestNeighbourTest<TypeParam>(string(TEST_DIR"/nearest_neighbour/sad_100_1000_dim0.test"), 0, AF_SAD);
}
TYPED_TEST(NearestNeighbour, NN_SAD_100_1000_Dim1)
{
nearestNeighbourTest<TypeParam>(string(TEST_DIR"/nearest_neighbour/sad_100_1000_dim1.test"), 1, AF_SAD);
}
TYPED_TEST(NearestNeighbour, NN_SAD_500_5000_Dim0)
{
nearestNeighbourTest<TypeParam>(string(TEST_DIR"/nearest_neighbour/sad_500_5000_dim0.test"), 0, AF_SAD);
}
TYPED_TEST(NearestNeighbour, NN_SAD_500_5000_Dim1)
{
nearestNeighbourTest<TypeParam>(string(TEST_DIR"/nearest_neighbour/sad_500_5000_dim1.test"), 1, AF_SAD);
}
///////////////////////////////////// CPP ////////////////////////////////
//
TEST(NearestNeighbourSSD, CPP)
{
using af::array;
using af::dim4;
vector<dim4> numDims;
vector<vector<uint> > in;
vector<vector<uint> > tests;
readTests<uint, uint, uint>(TEST_DIR"/nearest_neighbour/ssd_500_5000_dim0.test", numDims, in, tests);
dim4 qDims = numDims[0];
dim4 tDims = numDims[1];
array query(qDims, &(in[0].front()));
array train(tDims, &(in[1].front()));
array idx, dist;
nearestNeighbour(idx, dist, query, train, 0, 1, AF_SSD);
vector<uint> goldIdx = tests[0];
vector<uint> goldDist = tests[1];
size_t nElems = goldIdx.size();
uint *outIdx = new uint[nElems];
uint *outDist = new uint[nElems];
idx.host(outIdx);
dist.host(outDist);
for (size_t elIter=0; elIter<nElems; ++elIter) {
ASSERT_EQ(goldDist[elIter], outDist[elIter])<< "at: " << elIter<< std::endl;
}
delete[] outIdx;
delete[] outDist;
}
TEST(NearestNeighbourSAD, CPP)
{
using af::array;
using af::dim4;
vector<dim4> numDims;
vector<vector<uint> > in;
vector<vector<uint> > tests;
readTests<uint, uint, uint>(TEST_DIR"/nearest_neighbour/sad_100_1000_dim1.test", numDims, in, tests);
dim4 qDims = numDims[0];
dim4 tDims = numDims[1];
array query(qDims, &(in[0].front()));
array train(tDims, &(in[1].front()));
array idx, dist;
nearestNeighbour(idx, dist, query, train, 1, 1, AF_SAD);
vector<uint> goldIdx = tests[0];
vector<uint> goldDist = tests[1];
size_t nElems = goldIdx.size();
uint *outIdx = new uint[nElems];
uint *outDist = new uint[nElems];
idx.host(outIdx);
dist.host(outDist);
for (size_t elIter=0; elIter<nElems; ++elIter) {
ASSERT_EQ(goldDist[elIter], outDist[elIter])<< "at: " << elIter<< std::endl;
}
delete[] outIdx;
delete[] outDist;
}
|