1
#include "perf_precomp.hpp"
6
using std::tr1::make_tuple;
9
typedef perf::TestBaseWithParam<size_t> VectorLength;
11
typedef std::tr1::tuple<int, int> MaxDim_MaxPoints_t;
12
typedef perf::TestBaseWithParam<MaxDim_MaxPoints_t> MaxDim_MaxPoints;
14
PERF_TEST_P(VectorLength, phase32f, testing::Values(128, 1000, 128*1024, 512*1024, 1024*1024))
16
size_t length = GetParam();
17
vector<float> X(length);
18
vector<float> Y(length);
19
vector<float> angle(length);
21
declare.in(X, Y, WARMUP_RNG).out(angle);
23
TEST_CYCLE_N(200) cv::phase(X, Y, angle, true);
25
SANITY_CHECK(angle, 5e-5);
28
PERF_TEST_P( MaxDim_MaxPoints, kmeans,
29
testing::Combine( testing::Values( 16, 32, 64 ),
30
testing::Values( 300, 400, 500) ) )
33
const int MAX_DIM = get<0>(GetParam());
34
const int MAX_POINTS = get<1>(GetParam());
35
const int attempts = 5;
38
int i, N = 0, N0 = 0, K = 0, dims = 0;
39
dims = rng.uniform(1, MAX_DIM+1);
40
N = rng.uniform(1, MAX_POINTS+1);
41
N0 = rng.uniform(1, MAX(N/10, 2));
42
K = rng.uniform(1, N+1);
44
Mat data0(N0, dims, CV_32F);
45
rng.fill(data0, RNG::UNIFORM, -1, 1);
47
Mat data(N, dims, CV_32F);
48
for( i = 0; i < N; i++ )
49
data0.row(rng.uniform(0, N0)).copyTo(data.row(i));
55
kmeans(data, K, labels, TermCriteria(TermCriteria::MAX_ITER+TermCriteria::EPS, 30, 0),
56
attempts, KMEANS_PP_CENTERS, centers);
59
Mat clusterPointsNumber = Mat::zeros(1, K, CV_32S);
61
for( i = 0; i < labels.rows; i++ )
63
int clusterIdx = labels.at<int>(i);
64
clusterPointsNumber.at<int>(clusterIdx)++;
67
Mat sortedClusterPointsNumber;
68
cv::sort(clusterPointsNumber, sortedClusterPointsNumber, cv::SORT_EVERY_ROW + cv::SORT_ASCENDING);
70
SANITY_CHECK(sortedClusterPointsNumber);