Hello Marie, The Amoeba (downhill simplex) method is an unconstrained optimization method and therefore will allow for any real value. An artificial way that may work is that your similarity measure return itk::NumericTraits<float>::max() when one of the parameters is outside the valid range. I am assuming here you are minimizing the function and using float. This is breaking the heuristic underlying the downhill simplex method, but it may get you what you want.
If you are using the ITK3.2 registration framework (still part of the 4.x releases) there are two optimizers that accommodate simple bound constraints: http://www.itk.org/Doxygen/html/classitk_1_1LBFGSBOptimizer.html http://www.itk.org/Doxygen/html/classitk_1_1ParticleSwarmOptimizer.html If using the ITK4 registration framework there is: http://www.itk.org/Doxygen/html/classitk_1_1LBFGSBOptimizerv4.html Please take care to read the correct documentation when selecting an optimizer. Those that are part of the v4 registration framework have “v4” appended to their name (see the LBFGSB optimizers above). hope this helps Ziv
_______________________________________________ Powered by www.kitware.com Visit other Kitware open-source projects at http://www.kitware.com/opensource/opensource.html Kitware offers ITK Training Courses, for more information visit: http://kitware.com/products/protraining.php Please keep messages on-topic and check the ITK FAQ at: http://www.itk.org/Wiki/ITK_FAQ Follow this link to subscribe/unsubscribe: http://public.kitware.com/mailman/listinfo/insight-developers
