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 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349
|
/*=========================================================================
*
* Copyright UMC Utrecht and contributors
*
* 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.
*
*=========================================================================*/
#ifndef elxFullSearchOptimizer_hxx
#define elxFullSearchOptimizer_hxx
#include "elxFullSearchOptimizer.h"
#include <itkDeref.h>
#include <iomanip>
#include <sstream>
#include <string>
#include <vnl/vnl_math.h>
namespace elastix
{
/**
* ********************* Constructor ****************************
*/
template <class TElastix>
FullSearch<TElastix>::FullSearch()
{
this->m_OptimizationSurface = nullptr;
} // end Constructor
/**
* ***************** BeforeRegistration ***********************
*/
template <class TElastix>
void
FullSearch<TElastix>::BeforeRegistration()
{
/** Add the target cells "ItNr" and "Metric" to IterationInfo. */
this->AddTargetCellToIterationInfo("2:Metric");
/** Format the metric as floats. */
this->GetIterationInfoAt("2:Metric") << std::showpoint << std::fixed;
} // end BeforeRegistration
/**
* ***************** BeforeEachResolution ***********************
*/
template <class TElastix>
void
FullSearch<TElastix>::BeforeEachResolution()
{
/** Get the current resolution level.*/
unsigned int level = static_cast<unsigned int>(this->m_Registration->GetAsITKBaseType()->GetCurrentLevel());
const Configuration & configuration = itk::Deref(Superclass2::GetConfiguration());
/** Read FullSearchRange from the parameter file. */
/** declare variables */
std::string name("");
unsigned int param_nr = 0;
double minimum = 0;
double maximum = 0;
double stepsize = 0;
const std::string prefix = "FS";
unsigned int entry_nr = 0;
unsigned int nrOfSearchSpaceDimensions = 0;
bool found = true;
bool realGood = true;
std::ostringstream makeString;
/** Create fullFieldName, which is "FullSearchSpace0" at level 0. */
makeString << "FullSearchSpace" << level;
std::string fullFieldName = makeString.str();
/** Loop as long as search ranges are defined. */
while (found)
{
/** Try to read (silently) from the parameter file. */
/** \todo check earlier, in BeforeAll, if the searchspace has been defined. */
if (realGood && found)
{
found = configuration.ReadParameter(name, fullFieldName, entry_nr, false);
realGood = this->CheckSearchSpaceRangeDefinition(fullFieldName, found, entry_nr);
++entry_nr;
}
if (realGood && found)
{
found = configuration.ReadParameter(param_nr, fullFieldName, entry_nr, false);
realGood = this->CheckSearchSpaceRangeDefinition(fullFieldName, found, entry_nr);
++entry_nr;
}
if (realGood && found)
{
found = configuration.ReadParameter(minimum, fullFieldName, entry_nr, false);
realGood = this->CheckSearchSpaceRangeDefinition(fullFieldName, found, entry_nr);
++entry_nr;
}
if (realGood && found)
{
found = configuration.ReadParameter(maximum, fullFieldName, entry_nr, false);
realGood = this->CheckSearchSpaceRangeDefinition(fullFieldName, found, entry_nr);
++entry_nr;
}
if (realGood && found)
{
found = configuration.ReadParameter(stepsize, fullFieldName, entry_nr, false);
realGood = this->CheckSearchSpaceRangeDefinition(fullFieldName, found, entry_nr);
++entry_nr;
}
/** Setup this search range. */
if (realGood && found)
{
/** Setup the Superclass */
this->AddSearchDimension(param_nr, minimum, maximum, stepsize);
/** Create name of this dimension. */
makeString.str("");
makeString << prefix << ((entry_nr / 5) - 1) << ":" << name << ":" << param_nr;
/** Store the name and create a column in IterationInfo. */
this->m_SearchSpaceDimensionNames[param_nr] = makeString.str();
this->AddTargetCellToIterationInfo(makeString.str().c_str());
/** Format this xout iteration column as float. */
this->GetIterationInfoAt(makeString.str().c_str()) << std::showpoint << std::fixed;
}
} // end while
if (realGood)
{
/** The number of dimensions. */
nrOfSearchSpaceDimensions = this->GetNumberOfSearchSpaceDimensions();
/** Create the image that will store the results of the full search. */
this->m_OptimizationSurface = NDImageType::NewNDImage(nrOfSearchSpaceDimensions);
this->m_OptimizationSurface->CreateNewImage();
/** \todo don't do this if more than max allowable dimensions. */
/** Set the correct size and allocate memory. */
this->m_OptimizationSurface->SetRegions(this->GetSearchSpaceSize());
this->m_OptimizationSurface->Allocate();
/** \todo try/catch block around Allocate? */
if (const std::string outputDirectoryPath = configuration.GetCommandLineArgument("-out");
!outputDirectoryPath.empty())
{
/** Set the name of this image on disk. */
std::string resultImageFormat = "mhd";
configuration.ReadParameter(resultImageFormat, "ResultImageFormat", 0, false);
makeString.str("");
makeString << outputDirectoryPath << "OptimizationSurface." << configuration.GetElastixLevel() << ".R" << level
<< "." << resultImageFormat;
this->m_OptimizationSurface->SetOutputFileName(makeString.str().c_str());
}
log::info(std::ostringstream{} << "Total number of iterations needed in this resolution: "
<< this->GetNumberOfIterations() << ".");
}
else
{
itkExceptionMacro("ERROR: elastix found an error in the search space definition, and is quiting.");
}
} // end BeforeEachResolution()
/**
* ***************** AfterEachIteration *************************
*/
template <class TElastix>
void
FullSearch<TElastix>::AfterEachIteration()
{
/** Print some information. */
this->GetIterationInfoAt("2:Metric") << this->GetValue();
this->m_OptimizationSurface->SetPixel(this->GetCurrentIndexInSearchSpace(), this->GetValue());
SearchSpacePointType currentPoint = this->GetCurrentPointInSearchSpace();
unsigned int nrOfSSDims = currentPoint.GetSize();
NameIteratorType name_it = this->m_SearchSpaceDimensionNames.begin();
for (unsigned int dim = 0; dim < nrOfSSDims; ++dim)
{
this->GetIterationInfoAt(name_it->second.c_str()) << currentPoint[dim];
++name_it;
}
} // end AfterEachIteration()
/**
* ***************** AfterEachResolution *************************
*/
template <class TElastix>
void
FullSearch<TElastix>::AfterEachResolution()
{
const Configuration & configuration = itk::Deref(Superclass2::GetConfiguration());
// enum StopConditionType {FullRangeSearched, MetricError };
std::string stopcondition;
switch (this->GetStopCondition())
{
case FullRangeSearched:
stopcondition = "The full range has been searched";
break;
case MetricError:
stopcondition = "Error in metric";
break;
default:
stopcondition = "Unknown";
break;
}
/** Print the stopping condition */
log::info(std::ostringstream{} << "Stopping condition: " << stopcondition << ".");
/** Write the optimization surface to disk */
bool writeSurfaceEachResolution = false;
configuration.ReadParameter(writeSurfaceEachResolution, "WriteOptimizationSurfaceEachResolution", 0, false);
if (writeSurfaceEachResolution && !configuration.GetCommandLineArgument("-out").empty())
{
try
{
this->m_OptimizationSurface->Write();
log::info(std::ostringstream{} << "\nThe scanned optimization surface is saved as: "
<< this->m_OptimizationSurface->GetOutputFileName());
}
catch (const itk::ExceptionObject & err)
{
log::error(std::ostringstream{} << "ERROR: Saving " << this->m_OptimizationSurface->GetOutputFileName()
<< " failed.\n"
<< err);
// do not throw an error, since we would like to go on.
}
}
/** Print the best metric value */
log::info(std::ostringstream{} << '\n' << "Best metric value in this resolution = " << this->GetBestValue());
/** Print the best index and point */
SearchSpaceIndexType bestIndex = this->GetBestIndexInSearchSpace();
SearchSpacePointType bestPoint = this->GetBestPointInSearchSpace();
unsigned int nrOfSSDims = bestIndex.GetSize();
std::ostringstream outputStringStream;
outputStringStream << "Index of the point in the optimization surface image that has the best metric value: [ ";
for (unsigned int dim = 0; dim < nrOfSSDims; ++dim)
{
outputStringStream << bestIndex[dim] << " ";
}
outputStringStream << "]\n"
<< "The corresponding parameter values: [ ";
for (unsigned int dim = 0; dim < nrOfSSDims; ++dim)
{
outputStringStream << bestPoint[dim] << " ";
}
outputStringStream << "]\n";
log::info(outputStringStream.str());
/** Remove the columns from IterationInfo. */
NameIteratorType name_it = this->m_SearchSpaceDimensionNames.begin();
for (unsigned int dim = 0; dim < nrOfSSDims; ++dim)
{
this->RemoveTargetCellFromIterationInfo(name_it->second.c_str());
++name_it;
}
/** Clear the dimension names of the previous resolution's search space. */
this->m_SearchSpaceDimensionNames.clear();
/** Clear the full search ranges */
this->SetSearchSpace(nullptr);
} // end AfterEachResolution()
/**
* ******************* AfterRegistration ************************
*/
template <class TElastix>
void
FullSearch<TElastix>::AfterRegistration()
{
/** Print the best metric value. */
double bestValue = this->GetBestValue();
log::info(std::ostringstream{} << '\n' << "Final metric value = " << bestValue);
} // end AfterRegistration()
/**
* ************ CheckSearchSpaceRangeDefinition *****************
*/
template <class TElastix>
bool
FullSearch<TElastix>::CheckSearchSpaceRangeDefinition(const std::string & fullFieldName,
const bool found,
const unsigned int entry_nr) const
{
/** Complain if not at least one search space dimension has been found,
* or if a search dimension is not fully specified.
*/
if (!found && (entry_nr == 0 || (entry_nr % 5 != 0)))
{
log::error(std::ostringstream{} << "ERROR:\nNo (valid) range specified for the full search optimizer!\n"
<< "Please define the field (" << fullFieldName
<< " \"name\" parameter_nr min max stepsize) correctly in the parameter file");
return false;
}
return true;
} // end CheckSearchSpaceRangeDefinition()
} // end namespace elastix
#endif // end #ifndef elxFullSearchOptimizer_hxx
|