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
|
/*=========================================================================
Program: Insight Segmentation & Registration Toolkit
Module: $RCSfile: itkNeighborhoodAlgorithm.txx,v $
Language: C++
Date: $Date: 2004-09-08 14:50:03 $
Version: $Revision: 1.34 $
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.
=========================================================================*/
#ifndef _itkNeighborhoodAlgorithm_txx
#define _itkNeighborhoodAlgorithm_txx
#include "itkNeighborhoodAlgorithm.h"
#include "itkImageRegionIterator.h"
#include "itkImageRegion.h"
#include "itkConstSliceIterator.h"
namespace itk
{
namespace NeighborhoodAlgorithm {
template<class TImage>
typename ImageBoundaryFacesCalculator<TImage>::FaceListType
ImageBoundaryFacesCalculator<TImage>
::operator()(const TImage *img, RegionType regionToProcess, RadiusType radius)
{
unsigned int j, i;
// Analyze the regionToProcess to determine if any of its faces are
// along a buffer boundary (we have no data in the buffer for pixels
// that are outside the boundary, but within the neighborhood radius and will
// have to treat them differently). We also determine the size of the non-
// boundary region that will be processed.
const IndexType bStart = img->GetBufferedRegion().GetIndex();
const SizeType bSize = img->GetBufferedRegion().GetSize();
const IndexType rStart = regionToProcess.GetIndex();
const SizeType rSize = regionToProcess.GetSize();
long overlapLow, overlapHigh;
FaceListType faceList;
IndexType fStart; // Boundary, "face"
SizeType fSize; // region data.
RegionType fRegion;
SizeType nbSize = regionToProcess.GetSize(); // Non-boundary region
IndexType nbStart = regionToProcess.GetIndex(); // data.
RegionType nbRegion;
for (i = 0; i < ImageDimension; ++i)
{
overlapLow = static_cast<long>((rStart[i] - radius[i]) - bStart[i]);
overlapHigh= static_cast<long>((bStart[i] + bSize[i]) - (rStart[i] + rSize[i] + radius[i]));
if (overlapLow < 0) // out of bounds condition, define a region of
{ // iteration along this face
for (j = 0; j < ImageDimension; ++j) // define the starting index
{ // and size of the face region
fStart[j] = rStart[j];
if ( j == i )
{
fSize[j] = -overlapLow;
}
else // NOTE: this algorithm
{ // results in duplicate
fSize[j] = rSize[j]; // pixels at corners between
} // adjacent faces.
// Boundary region cannot be outside the region to process
if (fSize[j] > rSize[j])
{
fSize[j] = rSize[j];
}
}
// avoid unsigned overflow if the non-boundary region is too small to process
if (fSize[i] > nbSize[i])
{
nbSize[i] = 0;
}
else
{
nbSize[i] -= fSize[i];
}
nbStart[i] += -overlapLow;
fRegion.SetIndex(fStart);
fRegion.SetSize(fSize);
faceList.push_back(fRegion);
}
if (overlapHigh < 0)
{
for (j = 0; j < ImageDimension; ++j)
{
if ( j == i )
{
fStart[j] = rStart[j] + static_cast<IndexValueType>(rSize[j]) + overlapHigh;
fSize[j] = -overlapHigh;
// Start of the boundary condition region cannot be to the
// left of the region to process
if (fStart[j] < rStart[j])
{
fStart[j] = rStart[j];
fSize[j] = rSize[j]; // is this the right size?
}
}
else
{
fStart[j] = rStart[j];
fSize[j] = rSize[j];
}
}
// avoid unsigned overflow if the non-boundary region is too small to process
if (fSize[i] > nbSize[i])
{
nbSize[i] = 0;
}
else
{
nbSize[i] -= fSize[i];
}
fRegion.SetIndex(fStart);
fRegion.SetSize(fSize);
faceList.push_back(fRegion);
}
}
nbRegion.SetSize(nbSize);
nbRegion.SetIndex(nbStart);
faceList.push_front(nbRegion);
return faceList;
}
template<class TImage>
typename CalculateOutputWrapOffsetModifiers<TImage>::OffsetType
CalculateOutputWrapOffsetModifiers<TImage>
::operator()(TImage *input, TImage *output) const
{
OffsetType ans;
const Size<TImage::ImageDimension> isz = input->GetBufferedRegion().GetSize();
const Size<TImage::ImageDimension> osz = output->GetBufferedRegion().GetSize();
for (int i=0; i<TImage::ImageDimension; ++i)
{
ans[i] = osz[i] - isz[i];
}
return ans;
}
} // end namespace NeighborhoodAlgorithm
} // end namespace itk
#endif
|
