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
|
/*=========================================================================
*
* 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 "itkMath.h"
#include "itkNumericTraits.h"
#include "itkLevelSetContainer.h"
#include "itkLevelSetEquationOverlapPenaltyTerm.h"
#include "itkSinRegularizedHeavisideStepFunction.h"
#include "itkBinaryImageToLevelSetImageAdaptor.h"
int itkLevelSetEquationOverlapPenaltyTermTest( int argc, char* argv[] )
{
if( argc < 1 )
{
std::cerr << "Missing Arguments" << std::endl;
std::cerr << "Program " << argv[0] << std::endl;
return EXIT_FAILURE;
}
const unsigned int Dimension = 2;
typedef unsigned short InputPixelType;
typedef itk::Image< InputPixelType, Dimension > InputImageType;
typedef itk::IdentifierType IdentifierType;
typedef unsigned short InputPixelType;
typedef itk::Image< InputPixelType, Dimension > InputImageType;
typedef float PixelType;
typedef itk::WhitakerSparseLevelSetImage< PixelType, Dimension >
SparseLevelSetType;
typedef itk::BinaryImageToLevelSetImageAdaptor< InputImageType, SparseLevelSetType >
BinaryToSparseAdaptorType;
typedef itk::LevelSetContainer< IdentifierType, SparseLevelSetType > LevelSetContainerType;
typedef itk::LevelSetEquationOverlapPenaltyTerm< InputImageType, LevelSetContainerType >
OverlapPenaltyTermType;
typedef std::list< IdentifierType > IdListType;
typedef itk::Image< IdListType, Dimension > IdListImageType;
typedef itk::Image< short, Dimension > CacheImageType;
typedef itk::LevelSetDomainMapImageFilter< IdListImageType, CacheImageType >
DomainMapImageFilterType;
typedef SparseLevelSetType::OutputRealType LevelSetOutputRealType;
typedef itk::SinRegularizedHeavisideStepFunction< LevelSetOutputRealType, LevelSetOutputRealType >
HeavisideFunctionBaseType;
typedef itk::ImageRegionIteratorWithIndex< InputImageType > InputImageIteratorType;
// load binary mask
InputImageType::SizeType size;
size.Fill( 50 );
InputImageType::PointType origin;
origin[0] = 0.0;
origin[1] = 0.0;
InputImageType::SpacingType spacing;
spacing[0] = 1.0;
spacing[1] = 1.0;
InputImageType::IndexType index;
index.Fill( 0 );
InputImageType::RegionType region;
region.SetIndex( index );
region.SetSize( size );
// Binary initialization
InputImageType::Pointer binary = InputImageType::New();
binary->SetRegions( region );
binary->SetSpacing( spacing );
binary->SetOrigin( origin );
binary->Allocate();
binary->FillBuffer( itk::NumericTraits<InputPixelType>::ZeroValue() );
index.Fill( 10 );
size.Fill( 30 );
region.SetIndex( index );
region.SetSize( size );
InputImageIteratorType iIt( binary, region );
iIt.GoToBegin();
while( !iIt.IsAtEnd() )
{
iIt.Set( itk::NumericTraits<InputPixelType>::OneValue() );
++iIt;
}
// Convert binary mask to sparse level set
BinaryToSparseAdaptorType::Pointer adaptor1 = BinaryToSparseAdaptorType::New();
adaptor1->SetInputImage( binary );
adaptor1->Initialize();
std::cout << "Finished converting levelset1 to sparse format" << std::endl;
// Convert binary mask to sparse level set
BinaryToSparseAdaptorType::Pointer adaptor2 = BinaryToSparseAdaptorType::New();
adaptor2->SetInputImage( binary );
adaptor2->Initialize();
std::cout << "Finished converting levelset2 to sparse format" << std::endl;
SparseLevelSetType::Pointer level_set1 = adaptor1->GetModifiableLevelSet();
SparseLevelSetType::Pointer level_set2 = adaptor2->GetModifiableLevelSet();
IdListType list_ids;
list_ids.push_back( 1 );
list_ids.push_back( 2 );
IdListImageType::Pointer id_image = IdListImageType::New();
id_image->SetRegions( binary->GetLargestPossibleRegion() );
id_image->Allocate();
id_image->FillBuffer( list_ids );
DomainMapImageFilterType::Pointer domainMapFilter = DomainMapImageFilterType::New();
domainMapFilter->SetInput( id_image );
domainMapFilter->Update();
std::cout << "Domain map computed" << std::endl;
// Define the Heaviside function
HeavisideFunctionBaseType::Pointer heaviside = HeavisideFunctionBaseType::New();
heaviside->SetEpsilon( 2.0 );
// Insert the levelsets in a levelset container
LevelSetContainerType::Pointer lscontainer = LevelSetContainerType::New();
lscontainer->SetHeaviside( heaviside );
lscontainer->SetDomainMapFilter( domainMapFilter );
bool LevelSetNotYetAdded = lscontainer->AddLevelSet( 0, level_set1, false );
if ( !LevelSetNotYetAdded )
{
return EXIT_FAILURE;
}
LevelSetNotYetAdded = lscontainer->AddLevelSet( 1, level_set2, false );
if ( !LevelSetNotYetAdded )
{
return EXIT_FAILURE;
}
// Create overlap penalty term
OverlapPenaltyTermType::Pointer penaltyTerm0 = OverlapPenaltyTermType::New();
penaltyTerm0->SetInput( binary );
penaltyTerm0->SetCoefficient( 1000.0 );
penaltyTerm0->SetCurrentLevelSetId( 0 );
penaltyTerm0->SetLevelSetContainer( lscontainer );
OverlapPenaltyTermType::Pointer penaltyTerm1 = OverlapPenaltyTermType::New();
penaltyTerm1->SetInput( binary );
penaltyTerm1->SetCoefficient( 1000.0 );
penaltyTerm1->SetCurrentLevelSetId( 1 );
penaltyTerm1->SetLevelSetContainer( lscontainer );
std::cout << "Penalty terms created" << std::endl;
// Initialize the ChanAndVese term here
penaltyTerm0->InitializeParameters();
penaltyTerm1->InitializeParameters();
InputImageIteratorType it( binary, binary->GetLargestPossibleRegion() );
it.GoToBegin();
while( !it.IsAtEnd() )
{
penaltyTerm0->Initialize( it.GetIndex() );
penaltyTerm1->Initialize( it.GetIndex() );
++it;
}
penaltyTerm0->Update();
penaltyTerm1->Update();
index[0] = 5;
index[1] = 5;
std::cout << penaltyTerm0->Evaluate( index ) << std::endl;
if ( itk::Math::NotAlmostEquals( penaltyTerm0->Evaluate( index ),
itk::NumericTraits< OverlapPenaltyTermType::LevelSetOutputRealType >::ZeroValue() ) )
{
return EXIT_FAILURE;
}
index[0] = 20;
index[1] = 20;
std::cout << penaltyTerm0->Evaluate( index ) << std::endl;
if ( itk::Math::NotAlmostEquals( penaltyTerm0->Evaluate( index ), 1000 ) )
{
return EXIT_FAILURE;
}
return EXIT_SUCCESS;
}
|
