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
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
|
/*=========================================================================
*
* Copyright Insight Software Consortium
*
* 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
*
* http://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 "itkNeighborhoodAlgorithm.h"
#include "itkConstNeighborhoodIterator.h"
template<typename TImage>
bool ImageBoundaryFaceCalculatorTest(TImage * image, typename TImage::RegionType & region, const typename TImage::SizeType & radius)
{
typedef itk::NeighborhoodAlgorithm::ImageBoundaryFacesCalculator<TImage> FaceCalculatorType;
typedef typename FaceCalculatorType::FaceListType FaceListType;
FaceCalculatorType faceCalculator;
FaceListType faceList;
faceList = faceCalculator(image, region, radius);
for(typename FaceListType::iterator fit = faceList.begin(); fit != faceList.end(); ++fit)
{
std::cout<<"Number of pixels : "<<fit->GetNumberOfPixels()<<std::endl;
std::cout<<*fit<<std::endl;
if( !region.IsInside( *fit ) && (*fit).GetNumberOfPixels() > 0 )
{
std::cerr<<"face region is outside of requestToProcessRegion "<<std::endl;
return false;
}
}
if( !faceList.size() )
return true;
image->FillBuffer(0);
for(typename FaceListType::iterator fit = faceList.begin(); fit != faceList.end(); ++fit)
{
if (fit == faceList.begin())
{
typedef itk::ConstNeighborhoodIterator<TImage> NeighborhoodIteratorType;
NeighborhoodIteratorType nIt(radius, image, *fit);
// a neighborhood iterator with radius and the first region should never overlap the boundary of the image
if (!nIt.InBounds() && fit->GetNumberOfPixels() > 0)
{
std::cerr << "Error! Violation of the constraint that a neighborhood iterator of radius "
<< radius << " constructed from the first region (\n" << *fit
<< ") returned by the boundary face calculator should never overlap the boundary of the image.\n";
image->Print(std::cerr);
return false;
}
}
itk::ImageRegionIterator<TImage> it(image, *fit);
for(it.GoToBegin(); !it.IsAtEnd(); ++it)
{
it.Value()++;
}
}
//to test the case that region is outside of bufferedRegion
region.Crop(image->GetBufferedRegion());
itk::ImageRegionIterator<TImage> iter1(image, region);
for(iter1.GoToBegin(); !iter1.IsAtEnd(); ++iter1)
{
if(iter1.Get() != 1)
{
std::cerr<<"pixel at Duplication or empty region found, pixel = "<<iter1.Get()<<std::endl;
return false;
}
}
return true;
}
template<typename TPixel, unsigned int VDimension>
bool NeighborhoodAlgorithmTest()
{
typedef itk::Image<TPixel, VDimension> ImageType;
typedef typename ImageType::RegionType RegionType;
typedef typename ImageType::IndexType IndexType;
typedef typename ImageType::SizeType SizeType;
IndexType ind;
ind.Fill(0);
SizeType size;
size.Fill(5);
SizeType radius;
radius.Fill(1);
RegionType region(ind, size);
typename ImageType::Pointer image = ImageType::New();
image->SetRegions(region);
image->Allocate();
//test 1: requestToProcessRegion match the bufferedRegion
if ( !ImageBoundaryFaceCalculatorTest( image.GetPointer(), region, radius ))
return false;
ind.Fill(1);
size.Fill(4);
region.SetIndex(ind);
region.SetSize(size);
//test 2: requestToProcessRegion is part of bufferedRegion
if ( !ImageBoundaryFaceCalculatorTest( image.GetPointer(), region, radius ))
return false;
ind.Fill(0);
region.SetIndex(ind);
size.Fill(5);
if (VDimension > 1)
{
size[VDimension-1] = 1;
}
region.SetSize(size);
image->Initialize();
image->SetRegions(region);
image->Allocate();
//test 3: requestToProcessRegion match the bufferedRegion, but all the bufferedRegion is inside the boundary
if ( !ImageBoundaryFaceCalculatorTest( image.GetPointer(), region, radius ))
return false;
size.Fill(5);
region.SetSize(size);
image->Initialize();
image->SetRegions(region);
image->Allocate();
ind.Fill(1);
size.Fill(6);
region.SetIndex(ind);
region.SetSize(size);
//test 4: bufferedRegion is part of the requestToProcessRegion
if ( !ImageBoundaryFaceCalculatorTest( image.GetPointer(), region, radius ))
return false;
ind.Fill(0);
size.Fill(10);
region.SetIndex(ind);
region.SetSize(size);
image->Initialize();
image->SetRegions(region);
image->Allocate();
radius.Fill(4);
ind.Fill(1);
size.Fill(2);
region.SetIndex(ind);
region.SetSize(size);
//test 5: requestToProcessRegion is part of boundary of bufferedRegion
if ( !ImageBoundaryFaceCalculatorTest( image.GetPointer(), region, radius ))
return false;
if (VDimension == 2)
{
ind[0] = 0;
ind[1] = 249;
size[0] = 256;
size[1] = 7;
region.SetIndex(ind);
region.SetSize(size);
image->Initialize();
image->SetRegions(region);
image->Allocate();
ind[1] = 253;
size[1] = 3;
region.SetIndex(ind);
region.SetSize(size);
radius.Fill(4);
// test 6: test condition encountered by BoxMeanImageFilterTest with 24 threads
if (!ImageBoundaryFaceCalculatorTest(image.GetPointer(), region, radius))
return false;
}
return true;
}
int itkNeighborhoodAlgorithmTest(int, char * [] )
{
if( !NeighborhoodAlgorithmTest<int, 1>( ) )
return EXIT_FAILURE;
if( !NeighborhoodAlgorithmTest<int, 2>( ) )
return EXIT_FAILURE;
if( !NeighborhoodAlgorithmTest<int, 3>( ) )
return EXIT_FAILURE;
if( !NeighborhoodAlgorithmTest<int, 4>( ) )
return EXIT_FAILURE;
return EXIT_SUCCESS;
}
|
