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
|
#include <flann/mpi/queries.h>
#include <flann/mpi/index.h>
#include <stdio.h>
#include <sys/time.h>
#include <boost/thread/thread.hpp>
#define IF_RANK0 if (world.rank()==0)
timeval start_time_;
void start_timer(const std::string& message = "")
{
if (!message.empty()) {
printf("%s", message.c_str());
fflush(stdout);
}
gettimeofday(&start_time_,NULL);
}
double stop_timer()
{
timeval end_time;
gettimeofday(&end_time,NULL);
return double(end_time.tv_sec-start_time_.tv_sec)+ double(end_time.tv_usec-start_time_.tv_usec)/1000000;
}
float compute_precision(const flann::Matrix<int>& match, const flann::Matrix<int>& indices)
{
int count = 0;
assert(match.rows == indices.rows);
size_t nn = std::min(match.cols, indices.cols);
for(size_t i=0; i<match.rows; ++i) {
for (size_t j=0;j<nn;++j) {
for (size_t k=0;k<nn;++k) {
if (match[i][j]==indices[i][k]) {
count ++;
}
}
}
}
return float(count)/(nn*match.rows);
}
void search(flann::mpi::Index<flann::L2<float> >* index)
{
boost::mpi::communicator world;
int nn = 1;
flann::Matrix<float> query;
flann::Matrix<int> match;
// flann::Matrix<float> gt_dists;
IF_RANK0 {
flann::load_from_file(query, "sift100K.h5","query");
flann::load_from_file(match, "sift100K.h5","match");
// flann::load_from_file(gt_dists, "sift100K.h5","dists");
}
boost::mpi::broadcast(world, query, 0);
boost::mpi::broadcast(world, match, 0);
flann::Matrix<int> indices(new int[query.rows*nn], query.rows, nn);
flann::Matrix<float> dists(new float[query.rows*nn], query.rows, nn);
IF_RANK0 {
indices = flann::Matrix<int>(new int[query.rows*nn], query.rows, nn);
dists = flann::Matrix<float>(new float[query.rows*nn], query.rows, nn);
}
// do a knn search, using 128 checks0
IF_RANK0 start_timer("Performing search...\n");
index->knnSearch(query, indices, dists, nn, flann::SearchParams(128));
IF_RANK0 {
printf("Search done (%g seconds)\n", stop_timer());
printf("Indices size: (%d,%d)\n", (int)indices.rows, (int)indices.cols);
printf("Checking results\n");
float precision = compute_precision(match, indices);
printf("Precision is: %g\n", precision);
}
delete[] query.ptr();
delete[] match.ptr();
IF_RANK0 {
delete[] indices.ptr();
delete[] dists.ptr();
}
}
int main(int argc, char** argv)
{
boost::mpi::environment env(argc, argv);
boost::mpi::communicator world;
//flann::Matrix<float> dataset;
IF_RANK0 start_timer("Loading data...\n");
// construct an randomized kd-tree index using 4 kd-trees
flann::mpi::Index<flann::L2<float> > index("sift100K.h5", "dataset", flann::KDTreeIndexParams(4));
//flann::load_from_file(dataset, "sift100K.h5","dataset");
//flann::Index<flann::L2<float> > index( dataset, flann::KDTreeIndexParams(4));
world.barrier();
IF_RANK0 printf("Loading data done (%g seconds)\n", stop_timer());
IF_RANK0 printf("Index size: (%d,%d)\n", index.size(), index.veclen());
start_timer("Building index...\n");
index.buildIndex();
printf("Building index done (%g seconds)\n", stop_timer());
world.barrier();
printf("Searching...\n");
boost::thread t(boost::bind(search, &index));
t.join();
boost::thread t2(boost::bind(search, &index));
for(;;){};
return 0;
}
|
