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
|
/*=========================================================================
Program: Insight Segmentation & Registration Toolkit
Module: $RCSfile: itkKdTreeTest2.cxx,v $
Language: C++
Date: $Date: 2008-04-27 12:59:36 $
Version: $Revision: 1.8 $
Copyright (c) Insight Software Consortium. All rights reserved.
See ITKCopyright.txt or http://www.itk.org/HTML/Copyright.htm for details.
This software is distributed WITHOUT ANY WARRANTY; without even
the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
PURPOSE. See the above copyright notices for more information.
=========================================================================*/
#if defined(_MSC_VER)
#pragma warning ( disable : 4786 )
#endif
#include "itkVector.h"
#include "itkListSample.h"
#include "itkKdTree.h"
#include "itkKdTreeGenerator.h"
#include "itkEuclideanDistance.h"
#include <iostream>
#include <fstream>
int itkKdTreeTest2( int argc, char * argv [] )
{
if( argc < 4 )
{
std::cerr << "Missing argument" << std::endl;
std::cerr << "Usage: " << std::endl;
std::cerr << argv[0] << " pointsInputFile bucketSize graphvizDotOutputFile" << std::endl;
return EXIT_FAILURE;
}
const unsigned int Dimension = 2;
typedef float MeasurementValueType;
typedef itk::Vector< MeasurementValueType, Dimension > MeasurementVectorType;
typedef itk::Statistics::ListSample< MeasurementVectorType > SampleType;
SampleType::Pointer 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();
typedef itk::Statistics::KdTreeGenerator< SampleType > TreeGeneratorType;
TreeGeneratorType::Pointer treeGenerator = TreeGeneratorType::New();
const unsigned int bucketSize = atoi( argv[2] );
treeGenerator->SetSample( sample );
treeGenerator->SetBucketSize( bucketSize );
treeGenerator->Update();
typedef TreeGeneratorType::KdTreeType TreeType;
typedef TreeType::NearestNeighbors NeighborsType;
typedef TreeType::KdTreeNodeType NodeType;
bool testFailed = false;
TreeType::Pointer tree = treeGenerator->GetOutput();
typedef itk::Statistics::EuclideanDistance< MeasurementVectorType >
DistanceMetricType;
DistanceMetricType::Pointer 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 > vnl_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;
}
|
