MCPcopy Create free account
hub / github.com/davisking/dlib / perform_test

Method perform_test

dlib/test/kernel_matrix.cpp:36–150  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

34
35
36 void perform_test (
37 )
38 {
39 print_spinner();
40
41 typedef matrix<double,0,1> sample_type;
42 typedef radial_basis_kernel<sample_type> kernel_type;
43 kernel_type kern(0.1);
44
45 std::vector<sample_type> vect1;
46 std::vector<sample_type> vect2;
47
48 const sample_type samp = randm(4,1);
49 sample_type samp2, samp3;
50
51 vect1.push_back(randm(4,1));
52 vect1.push_back(randm(4,1));
53 vect1.push_back(randm(4,1));
54 vect1.push_back(randm(4,1));
55
56 vect2.push_back(randm(4,1));
57 vect2.push_back(randm(4,1));
58 vect2.push_back(randm(4,1));
59 vect2.push_back(randm(4,1));
60 vect2.push_back(randm(4,1));
61
62 matrix<double> K;
63
64 K.set_size(vect1.size(), vect2.size());
65 for (long r = 0; r < K.nr(); ++r)
66 {
67 for (long c = 0; c < K.nc(); ++c)
68 {
69 K(r,c) = kern(vect1[r], vect2[c]);
70 }
71 }
72 DLIB_TEST(equal(K, kernel_matrix(kern, vect1, vect2)));
73 DLIB_TEST(equal(K, kernel_matrix(kern, mat(vect1), mat(vect2))));
74
75
76 K.set_size(vect2.size(), vect1.size());
77 for (long r = 0; r < K.nr(); ++r)
78 {
79 for (long c = 0; c < K.nc(); ++c)
80 {
81 K(r,c) = kern(vect2[r], vect1[c]);
82 }
83 }
84 DLIB_TEST(equal(K, kernel_matrix(kern, vect2, vect1)));
85 DLIB_TEST(equal(K, tmp(kernel_matrix(kern, vect2, vect1))));
86 DLIB_TEST(equal(K, kernel_matrix(kern, mat(vect2), mat(vect1))));
87
88
89 K.set_size(vect1.size(), vect1.size());
90 for (long r = 0; r < K.nr(); ++r)
91 {
92 for (long c = 0; c < K.nc(); ++c)
93 {

Callers

nothing calls this directly

Calls 12

print_spinnerFunction · 0.85
kernel_matrixFunction · 0.85
tmpFunction · 0.85
randmFunction · 0.70
equalFunction · 0.50
matFunction · 0.50
transFunction · 0.50
push_backMethod · 0.45
set_sizeMethod · 0.45
sizeMethod · 0.45
nrMethod · 0.45
ncMethod · 0.45

Tested by

no test coverage detected