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
|
/*=========================================================================
*
* Copyright NumFOCUS
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* https://www.apache.org/licenses/LICENSE-2.0.txt
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
*=========================================================================*/
#include "itkListSample.h"
#include "itkKdTreeGenerator.h"
#include "itkTestingMacros.h"
#include <iostream>
#include <fstream>
int
itkKdTreeTest2(int argc, char * argv[])
{
if (argc < 4)
{
std::cerr << "Missing parameters." << std::endl;
std::cerr << "Usage: " << itkNameOfTestExecutableMacro(argv);
std::cerr << " pointsInputFile bucketSize graphvizDotOutputFile" << std::endl;
return EXIT_FAILURE;
}
constexpr unsigned int Dimension = 2;
using MeasurementValueType = float;
using MeasurementVectorType = itk::Vector<MeasurementValueType, Dimension>;
using SampleType = itk::Statistics::ListSample<MeasurementVectorType>;
auto sample = SampleType::New();
sample->SetMeasurementVectorSize(Dimension);
MeasurementVectorType mv;
MeasurementVectorType queryPoint;
std::ifstream pntFile;
pntFile.open(argv[1], std::ios_base::in | std::ios_base::binary);
pntFile >> mv[0] >> mv[1];
do
{
sample->PushBack(mv);
pntFile >> mv[0] >> mv[1];
} while (!pntFile.eof());
pntFile.close();
using TreeGeneratorType = itk::Statistics::KdTreeGenerator<SampleType>;
auto treeGenerator = TreeGeneratorType::New();
const unsigned int bucketSize = std::stoi(argv[2]);
treeGenerator->SetSample(sample);
treeGenerator->SetBucketSize(bucketSize);
treeGenerator->Update();
using TreeType = TreeGeneratorType::KdTreeType;
bool testFailed = false;
TreeType::Pointer tree = treeGenerator->GetOutput();
using DistanceMetricType = itk::Statistics::EuclideanDistanceMetric<MeasurementVectorType>;
auto distanceMetric = DistanceMetricType::New();
DistanceMetricType::OriginType origin(Dimension);
//
// Print out the tree structure to the console
//
tree->PrintTree(std::cout);
for (unsigned int k = 0; k < sample->Size(); ++k)
{
queryPoint = sample->GetMeasurementVector(k);
for (unsigned int i = 0; i < sample->GetMeasurementVectorSize(); ++i)
{
origin[i] = queryPoint[i];
}
std::cout << "----------------------------------" << std::endl;
std::cout << "Origin = " << origin << std::endl;
distanceMetric->SetOrigin(origin);
unsigned int numberOfNeighbors = 1;
TreeType::InstanceIdentifierVectorType neighbors;
tree->Search(queryPoint, numberOfNeighbors, neighbors);
std::cout << "kd-tree knn search result:" << std::endl
<< "query point = [" << queryPoint << ']' << std::endl
<< "k = " << numberOfNeighbors << std::endl;
std::cout << "measurement vector : distance" << std::endl;
for (unsigned int i = 0; i < numberOfNeighbors; ++i)
{
const double distance = distanceMetric->Evaluate(tree->GetMeasurementVector(neighbors[i]));
std::cout << '[' << tree->GetMeasurementVector(neighbors[i]) << "] : " << distance << std::endl;
if (distance > itk::Math::eps)
{
testFailed = true;
}
}
}
//
// Plot out the tree structure to the console in the format used by Graphviz dot
//
std::ofstream plotFile;
plotFile.open(argv[3]);
tree->PlotTree(plotFile);
plotFile.close();
if (testFailed)
{
std::cerr << "Incorrect distance was found" << std::endl;
return EXIT_FAILURE;
}
return EXIT_SUCCESS;
}
|
