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
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
|
/*=========================================================================
Program: Insight Segmentation & Registration Toolkit
Module: itkOptMorphologicalGradientImageFilter.txx
Language: C++
Date: $Date$
Version: $Revision$
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 __itkOptMorphologicalGradientImageFilter_txx
#define __itkOptMorphologicalGradientImageFilter_txx
#include "itkMorphologicalGradientImageFilter.h"
#include "itkNumericTraits.h"
#include "itkProgressAccumulator.h"
#include <string>
namespace itk {
template<class TInputImage, class TOutputImage, class TKernel>
MorphologicalGradientImageFilter<TInputImage, TOutputImage, TKernel>
::MorphologicalGradientImageFilter()
{
m_BasicDilateFilter = BasicDilateFilterType::New();
m_BasicErodeFilter = BasicErodeFilterType::New();
m_HistogramFilter = HistogramFilterType::New();
m_AnchorDilateFilter = AnchorDilateFilterType::New();
m_AnchorErodeFilter = AnchorErodeFilterType::New();
m_VanHerkGilWermanDilateFilter = VHGWDilateFilterType::New();
m_VanHerkGilWermanErodeFilter = VHGWErodeFilterType::New();
m_Algorithm = HISTO;
}
template< class TInputImage, class TOutputImage, class TKernel>
void
MorphologicalGradientImageFilter< TInputImage, TOutputImage, TKernel>
::SetKernel( const KernelType& kernel )
{
const FlatKernelType * flatKernel = NULL;
try
{ flatKernel = dynamic_cast< const FlatKernelType* >( & kernel ); }
catch( ... ) {}
if( flatKernel != NULL && flatKernel->GetDecomposable() )
{
m_AnchorDilateFilter->SetKernel( *flatKernel );
m_AnchorErodeFilter->SetKernel( *flatKernel );
m_Algorithm = ANCHOR;
}
else if( m_HistogramFilter->GetUseVectorBasedAlgorithm() )
{
// histogram based filter is as least as good as the basic one, so always use it
m_Algorithm = HISTO;
m_HistogramFilter->SetKernel( kernel );
}
else
{
// basic filter can be better than the histogram based one
// apply a poor heuristic to find the best one. What is very important is to
// select the histogram for large kernels
// we need to set the kernel on the histogram filter to compare basic and histogram algorithm
m_HistogramFilter->SetKernel( kernel );
if( this->GetKernel().Size() < m_HistogramFilter->GetPixelsPerTranslation() * 4.0 )
{
m_BasicDilateFilter->SetKernel( kernel );
m_BasicErodeFilter->SetKernel( kernel );
m_Algorithm = BASIC;
}
else
{
m_Algorithm = HISTO;
}
}
Superclass::SetKernel( kernel );
}
template< class TInputImage, class TOutputImage, class TKernel>
void
MorphologicalGradientImageFilter< TInputImage, TOutputImage, TKernel>
::SetAlgorithm( int algo )
{
const FlatKernelType * flatKernel = NULL;
try
{ flatKernel = dynamic_cast< const FlatKernelType* >( & this->GetKernel() ); }
catch( ... ) {}
if( m_Algorithm != algo )
{
if( algo == BASIC )
{
m_BasicDilateFilter->SetKernel( this->GetKernel() );
m_BasicErodeFilter->SetKernel( this->GetKernel() );
}
else if( algo == HISTO )
{
m_HistogramFilter->SetKernel( this->GetKernel() );
}
else if( flatKernel != NULL && flatKernel->GetDecomposable() && algo == ANCHOR )
{
m_AnchorDilateFilter->SetKernel( *flatKernel );
m_AnchorErodeFilter->SetKernel( *flatKernel );
}
else if( flatKernel != NULL && flatKernel->GetDecomposable() && algo == VHGW )
{
m_VanHerkGilWermanDilateFilter->SetKernel( *flatKernel );
m_VanHerkGilWermanErodeFilter->SetKernel( *flatKernel );
}
else
{ itkExceptionMacro( << "Invalid algorithm" ); }
m_Algorithm = algo;
this->Modified();
}
}
template<class TInputImage, class TOutputImage, class TKernel>
void
MorphologicalGradientImageFilter<TInputImage, TOutputImage, TKernel>
::GenerateData()
{
// Create a process accumulator for tracking the progress of this minipipeline
ProgressAccumulator::Pointer progress = ProgressAccumulator::New();
progress->SetMiniPipelineFilter(this);
// Allocate the output
this->AllocateOutputs();
// Delegate to a dilate filter.
if( m_Algorithm == BASIC )
{
// std::cout << "BasicDilateImageFilter" << std::endl;
m_BasicDilateFilter->SetInput( this->GetInput() );
progress->RegisterInternalFilter( m_BasicDilateFilter, 0.4f );
m_BasicErodeFilter->SetInput( this->GetInput() );
progress->RegisterInternalFilter( m_BasicErodeFilter, 0.4f );
typename SubtractFilterType::Pointer sub = SubtractFilterType::New();
sub->SetInput1( m_BasicDilateFilter->GetOutput() );
sub->SetInput2( m_BasicErodeFilter->GetOutput() );
progress->RegisterInternalFilter( sub, 0.1f );
sub->GraftOutput( this->GetOutput() );
sub->Update();
this->GraftOutput( sub->GetOutput() );
}
else if( m_Algorithm == HISTO )
{
// std::cout << "MovingHistogramDilateImageFilter" << std::endl;
m_HistogramFilter->SetInput( this->GetInput() );
progress->RegisterInternalFilter( m_HistogramFilter, 1.0f );
m_HistogramFilter->GraftOutput( this->GetOutput() );
m_HistogramFilter->Update();
this->GraftOutput( m_HistogramFilter->GetOutput() );
}
else if( m_Algorithm == ANCHOR )
{
// std::cout << "AnchorDilateImageFilter" << std::endl;
m_AnchorDilateFilter->SetInput( this->GetInput() );
progress->RegisterInternalFilter( m_AnchorDilateFilter, 0.4f );
m_AnchorErodeFilter->SetInput( this->GetInput() );
progress->RegisterInternalFilter( m_AnchorErodeFilter, 0.4f );
typename SubtractFilterType::Pointer sub = SubtractFilterType::New();
sub->SetInput1( m_AnchorDilateFilter->GetOutput() );
sub->SetInput2( m_AnchorErodeFilter->GetOutput() );
progress->RegisterInternalFilter( sub, 0.1f );
sub->GraftOutput( this->GetOutput() );
sub->Update();
this->GraftOutput( sub->GetOutput() );
}
else if( m_Algorithm == VHGW )
{
// std::cout << "VanHerkGilWermanDilateImageFilter" << std::endl;
m_VanHerkGilWermanDilateFilter->SetInput( this->GetInput() );
progress->RegisterInternalFilter( m_VanHerkGilWermanDilateFilter, 0.4f );
m_VanHerkGilWermanErodeFilter->SetInput( this->GetInput() );
progress->RegisterInternalFilter( m_VanHerkGilWermanErodeFilter, 0.4f );
typename SubtractFilterType::Pointer sub = SubtractFilterType::New();
sub->SetInput1( m_VanHerkGilWermanDilateFilter->GetOutput() );
sub->SetInput2( m_VanHerkGilWermanErodeFilter->GetOutput() );
progress->RegisterInternalFilter( sub, 0.1f );
sub->GraftOutput( this->GetOutput() );
sub->Update();
this->GraftOutput( sub->GetOutput() );
}
}
template<class TInputImage, class TOutputImage, class TKernel>
void
MorphologicalGradientImageFilter<TInputImage, TOutputImage, TKernel>
::Modified() const
{
Superclass::Modified();
m_BasicDilateFilter->Modified();
m_BasicErodeFilter->Modified();
m_HistogramFilter->Modified();
m_AnchorDilateFilter->Modified();
m_AnchorErodeFilter->Modified();
m_VanHerkGilWermanDilateFilter->Modified();
m_VanHerkGilWermanErodeFilter->Modified();
}
template<class TInputImage, class TOutputImage, class TKernel>
void
MorphologicalGradientImageFilter<TInputImage, TOutputImage, TKernel>
::PrintSelf(std::ostream &os, Indent indent) const
{
Superclass::PrintSelf(os, indent);
os << indent << "Algorithm: " << m_Algorithm << std::endl;
}
}// end namespace itk
#endif
|
