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
|
/*=========================================================================
Program: Visualization Toolkit
Module: vtkImageSpatialAlgorithm.cxx
Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
All rights reserved.
See Copyright.txt or http://www.kitware.com/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 notice for more information.
=========================================================================*/
#include "vtkImageSpatialAlgorithm.h"
#include "vtkDataArray.h"
#include "vtkImageData.h"
#include "vtkInformation.h"
#include "vtkInformationVector.h"
#include "vtkObjectFactory.h"
#include "vtkPointData.h"
#include "vtkStreamingDemandDrivenPipeline.h"
#include <math.h>
vtkStandardNewMacro(vtkImageSpatialAlgorithm);
//----------------------------------------------------------------------------
// Construct an instance of vtkImageSpatialAlgorithm fitler.
vtkImageSpatialAlgorithm::vtkImageSpatialAlgorithm()
{
this->KernelSize[0] = this->KernelSize[1] = this->KernelSize[2] = 1;
this->KernelMiddle[0] = this->KernelMiddle[1] = this->KernelMiddle[2] = 0;
this->HandleBoundaries = 1;
}
//----------------------------------------------------------------------------
void vtkImageSpatialAlgorithm::PrintSelf(ostream& os, vtkIndent indent)
{
this->Superclass::PrintSelf(os, indent);
int idx;
os << indent << "KernelSize: (" << this->KernelSize[0];
for (idx = 1; idx < 3; ++idx)
{
os << ", " << this->KernelSize[idx];
}
os << ").\n";
os << indent << "KernelMiddle: (" << this->KernelMiddle[0];
for (idx = 1; idx < 3; ++idx)
{
os << ", " << this->KernelMiddle[idx];
}
os << ").\n";
}
//----------------------------------------------------------------------------
int vtkImageSpatialAlgorithm::RequestInformation (
vtkInformation *vtkNotUsed(request),
vtkInformationVector **inputVector,
vtkInformationVector *outputVector)
{
vtkInformation *inInfo = inputVector[0]->GetInformationObject(0);
vtkInformation *outInfo = outputVector->GetInformationObject(0);
// Take this opportunity to override the defaults.
int extent[6];
inInfo->Get(vtkStreamingDemandDrivenPipeline::WHOLE_EXTENT(), extent);
this->ComputeOutputWholeExtent(extent, this->HandleBoundaries);
outInfo->Set(vtkStreamingDemandDrivenPipeline::WHOLE_EXTENT(), extent, 6);
return 1;
}
//----------------------------------------------------------------------------
// A helper method to compute output image extent
void vtkImageSpatialAlgorithm::ComputeOutputWholeExtent(int extent[6],
int handleBoundaries)
{
int idx;
if ( ! handleBoundaries)
{
// Make extent a little smaller because of the kernel size.
for (idx = 0; idx < 3; ++idx)
{
extent[idx*2] += this->KernelMiddle[idx];
extent[idx*2+1] -= (this->KernelSize[idx]-1) - this->KernelMiddle[idx];
}
}
}
//----------------------------------------------------------------------------
// This method computes the extent of the input region necessary to generate
// an output region. Before this method is called "region" should have the
// extent of the output region. After this method finishes, "region" should
// have the extent of the required input region.
int vtkImageSpatialAlgorithm::RequestUpdateExtent(
vtkInformation *vtkNotUsed(request),
vtkInformationVector **inputVector,
vtkInformationVector *outputVector)
{
int wholeExtent[6], extent[6], inExtent[6];
vtkInformation *inInfo = inputVector[0]->GetInformationObject(0);
vtkInformation *outInfo = outputVector->GetInformationObject(0);
inInfo->Get(vtkStreamingDemandDrivenPipeline::WHOLE_EXTENT(), wholeExtent);
outInfo->Get(vtkStreamingDemandDrivenPipeline::UPDATE_EXTENT(), inExtent);
this->InternalRequestUpdateExtent(extent, inExtent, wholeExtent);
inInfo->Set(vtkStreamingDemandDrivenPipeline::UPDATE_EXTENT(), extent, 6);
return 1;
}
//----------------------------------------------------------------------------
void vtkImageSpatialAlgorithm::InternalRequestUpdateExtent(int *extent,
int *inExtent,
int *wholeExtent)
{
int idx;
for (idx = 0; idx < 3; ++idx)
{
// Magnify by strides
extent[idx*2] = inExtent[idx*2];
extent[idx*2+1] = inExtent[idx*2+1];
// Expand to get inRegion Extent
extent[idx*2] -= this->KernelMiddle[idx];
extent[idx*2+1] += (this->KernelSize[idx]-1) - this->KernelMiddle[idx];
// If the expanded region is out of the IMAGE Extent (grow min)
if (extent[idx*2] < wholeExtent[idx*2])
{
if (this->HandleBoundaries)
{
// shrink the required region extent
extent[idx*2] = wholeExtent[idx*2];
}
else
{
vtkWarningMacro(<< "Required region is out of the image extent.");
}
}
// If the expanded region is out of the IMAGE Extent (shrink max)
if (extent[idx*2+1] > wholeExtent[idx*2+1])
{
if (this->HandleBoundaries)
{
// shrink the required region extent
extent[idx*2+1] = wholeExtent[idx*2+1];
}
else
{
vtkWarningMacro(<< "Required region is out of the image extent.");
}
}
}
}
|
