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 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274
|
/*=========================================================================
Program: Insight Segmentation & Registration Toolkit
Module: $RCSfile: itkDanielssonDistanceMapImageFilterTest.cxx,v $
Language: C++
Date: $Date: 2005-11-27 22:41:18 $
Version: $Revision: 1.16 $
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.
=========================================================================*/
#if defined(_MSC_VER)
#pragma warning ( disable : 4786 )
#endif
#include <itkImage.h>
#include <itkImageRegionIteratorWithIndex.h>
#include <itkImageSliceConstIteratorWithIndex.h>
#include <itkDanielssonDistanceMapImageFilter.h>
int itkDanielssonDistanceMapImageFilterTest(int, char* [] )
{
std::cout << "Test ITK Danielsson Distance Map" << std::endl << std::endl;
std::cout << "Compute the distance map of a 9x9 image" << std::endl;
std::cout << "with a point at (4,4) (value=1)" << std::endl << std::endl;
std::cout << "with a point at (1,6) (value=2)" << std::endl << std::endl;
typedef itk::Image<float, 2> myImageType2D1;
typedef itk::Image<float, 2> myImageType2D2;
/* Allocate the 2D image */
myImageType2D1::SizeType size2D = {{9,9}};
myImageType2D1::IndexType index2D = {{0,0}};
myImageType2D1::RegionType region2D;
region2D.SetSize( size2D );
region2D.SetIndex( index2D );
myImageType2D1::Pointer inputImage2D = myImageType2D1::New();
inputImage2D->SetLargestPossibleRegion( region2D );
inputImage2D->SetBufferedRegion( region2D );
inputImage2D->SetRequestedRegion( region2D );
inputImage2D->Allocate();
/* Set pixel (4,4) with the value 1
* and pixel (1,6) with the value 2
* The Danielsson Distance is performed for each pixel with a value > 0
* The ClosestPoints computation is based on the value of the pixel.
*/
typedef itk::ImageRegionIteratorWithIndex<myImageType2D1> myIteratorType2D1;
typedef itk::ImageRegionIteratorWithIndex<myImageType2D2> myIteratorType2D2;
myIteratorType2D1 it2D1(inputImage2D,region2D);
// Set the image to 0
while( !it2D1.IsAtEnd() )
{
it2D1.Set( 0 );
++it2D1;
}
index2D[0] = 4;
index2D[1] = 4;
inputImage2D->SetPixel( index2D, 1);
index2D[0] = 1;
index2D[1] = 6;
inputImage2D->SetPixel( index2D, 2);
/* Create Danielsson Distance Map filter */
typedef itk::DanielssonDistanceMapImageFilter<
myImageType2D1,
myImageType2D2 > myFilterType2D;
myFilterType2D::Pointer filter2D = myFilterType2D::New();
filter2D->SetInput( inputImage2D );
myImageType2D2::Pointer outputDistance2D = filter2D->GetOutput();
myImageType2D1::Pointer outputVoronoi2D = filter2D->GetVoronoiMap();
myFilterType2D::VectorImageType::Pointer
outputComponents = filter2D->GetVectorDistanceMap();
filter2D->SetInputIsBinary(true);
filter2D->Update();
/* Show Distance map */
itk::ImageSliceConstIteratorWithIndex<myImageType2D2> it2D2(
outputDistance2D,
outputDistance2D->GetRequestedRegion() );
it2D2.GoToBegin();
it2D2.SetFirstDirection ( 0 );
it2D2.SetSecondDirection( 1 );
while( !it2D2.IsAtEnd() )
{
while( !it2D2.IsAtEndOfSlice() )
{
while( !it2D2.IsAtEndOfLine() )
{
std::cout.width(5);
std::cout << it2D2.Get() << "\t";
++it2D2;
}
std::cout << std::endl;
it2D2.NextLine();
}
it2D2.NextSlice();
}
/* Show Closest Points map */
std::cout << std::endl << std::endl;
std::cout << "Voronoi Map Image 2D" << std::endl << std::endl;
itk::ImageSliceConstIteratorWithIndex< myImageType2D2 > it2D3(
outputVoronoi2D,
outputVoronoi2D->GetRequestedRegion() );
it2D3.SetFirstDirection( 0 );
it2D3.SetSecondDirection( 1 );
while( !it2D3.IsAtEnd() )
{
while( !it2D3.IsAtEndOfSlice() )
{
while( !it2D3.IsAtEndOfLine() )
{
std::cout.width(5);
std::cout << it2D3.Get() << "\t";
++it2D3;
}
std::cout << std::endl;
it2D3.NextLine();
}
it2D3.NextSlice();
}
/* Show VectorsComponents Points map */
std::cout << std::endl << std::endl;
std::cout << "Components Map Image 2D" << std::endl << std::endl;
itk::ImageSliceConstIteratorWithIndex< myFilterType2D::VectorImageType > it2D4(
outputComponents,
outputComponents->GetRequestedRegion() );
it2D4.SetFirstDirection( 0 );
it2D4.SetSecondDirection( 1 );
while( !it2D4.IsAtEnd() )
{
while( !it2D4.IsAtEndOfSlice() )
{
while( !it2D4.IsAtEndOfLine() )
{
std::cout << "[" ;
for (unsigned int i=0;i<2;i++)
{
std::cout << it2D4.Get()[i] ;
if(i==0)
{
std::cout << ",";
}
}
std::cout << "]";
std::cout << "\t" ;
++it2D4;
}
std::cout << std::endl;
it2D4.NextLine();
}
it2D4.NextSlice();
}
/* Test Squared Distance functionality */
myImageType2D2::IndexType index;
index[0] = 0;
index[1] = 0;
const double distance1 = outputDistance2D->GetPixel( index );
filter2D->SetSquaredDistance( true );
filter2D->Update();
const double distance2 = outputDistance2D->GetPixel( index );
if( fabs( distance2 - distance1 * distance1 ) > 1e-5 )
{
std::cerr << "Error in use of the SetSquaredDistance() method" << std::endl;
return EXIT_FAILURE;
}
/* Show Squared Distance map */
std::cout << "Squared Distance Map " << std::endl;
it2D2.GoToBegin();
it2D2.SetFirstDirection ( 0 );
it2D2.SetSecondDirection( 1 );
while( !it2D2.IsAtEnd() )
{
while( !it2D2.IsAtEndOfSlice() )
{
while( !it2D2.IsAtEndOfLine() )
{
std::cout.width(5);
std::cout << it2D2.Get() << "\t";
++it2D2;
}
std::cout << std::endl;
it2D2.NextLine();
}
it2D2.NextSlice();
}
/* Test for images with anisotropic spacing */
myImageType2D1::SpacingType anisotropicSpacing;
anisotropicSpacing[0] = 1.0;
anisotropicSpacing[1] = 5.0;
inputImage2D->SetSpacing( anisotropicSpacing );
inputImage2D->FillBuffer( 0 );
index2D[0] = 4;
index2D[1] = 4;
inputImage2D->SetPixel( index2D, 1);
filter2D->SetInput( inputImage2D );
filter2D->SetInputIsBinary(true);
filter2D->Update();
it2D2.GoToBegin();
it2D2.SetFirstDirection ( 0 );
it2D2.SetSecondDirection( 1 );
while( !it2D2.IsAtEnd() )
{
while( !it2D2.IsAtEndOfSlice() )
{
while( !it2D2.IsAtEndOfLine() )
{
std::cout.width(5);
std::cout << it2D2.Get() << "\t";
++it2D2;
}
std::cout << std::endl;
it2D2.NextLine();
}
it2D2.NextSlice();
}
return EXIT_SUCCESS;
}
|