ITK
4.1.0
Insight Segmentation and Registration Toolkit
|
#include <itkRegularStepGradientDescentOptimizer.h>
Public Types | |
typedef SmartPointer< const Self > | ConstPointer |
typedef SmartPointer< Self > | Pointer |
typedef RegularStepGradientDescentOptimizer | Self |
typedef RegularStepGradientDescentBaseOptimizer | Superclass |
Public Member Functions | |
virtual ::itk::LightObject::Pointer | CreateAnother (void) const |
virtual const char * | GetNameOfClass () const |
Static Public Member Functions | |
static Pointer | New () |
Protected Member Functions | |
virtual void | StepAlongGradient (double factor, const DerivativeType &transformedGradient) |
Private Member Functions | |
void | operator= (const Self &) |
RegularStepGradientDescentOptimizer (const Self &) | |
typedef Superclass::CostFunctionType | CostFunctionType |
typedef CostFunctionType::Pointer | CostFunctionPointer |
RegularStepGradientDescentOptimizer () | |
virtual | ~RegularStepGradientDescentOptimizer () |
Implement a gradient descent optimizer.
Definition at line 32 of file itkRegularStepGradientDescentOptimizer.h.
typedef SmartPointer< const Self > itk::RegularStepGradientDescentOptimizer::ConstPointer |
Reimplemented from itk::RegularStepGradientDescentBaseOptimizer.
Definition at line 40 of file itkRegularStepGradientDescentOptimizer.h.
typedef CostFunctionType::Pointer itk::RegularStepGradientDescentOptimizer::CostFunctionPointer |
Cost function typedefs.
Reimplemented from itk::SingleValuedNonLinearOptimizer.
Definition at line 51 of file itkRegularStepGradientDescentOptimizer.h.
Cost function typedefs.
Reimplemented from itk::SingleValuedNonLinearOptimizer.
Definition at line 47 of file itkRegularStepGradientDescentOptimizer.h.
Reimplemented from itk::RegularStepGradientDescentBaseOptimizer.
Definition at line 39 of file itkRegularStepGradientDescentOptimizer.h.
Standard class typedefs.
Reimplemented from itk::RegularStepGradientDescentBaseOptimizer.
Definition at line 37 of file itkRegularStepGradientDescentOptimizer.h.
typedef RegularStepGradientDescentBaseOptimizer itk::RegularStepGradientDescentOptimizer::Superclass |
Reimplemented from itk::RegularStepGradientDescentBaseOptimizer.
Definition at line 38 of file itkRegularStepGradientDescentOptimizer.h.
itk::RegularStepGradientDescentOptimizer::RegularStepGradientDescentOptimizer | ( | ) | [inline, protected] |
Cost function typedefs.
Definition at line 53 of file itkRegularStepGradientDescentOptimizer.h.
virtual itk::RegularStepGradientDescentOptimizer::~RegularStepGradientDescentOptimizer | ( | ) | [inline, protected, virtual] |
Cost function typedefs.
Definition at line 54 of file itkRegularStepGradientDescentOptimizer.h.
itk::RegularStepGradientDescentOptimizer::RegularStepGradientDescentOptimizer | ( | const Self & | ) | [private] |
virtual::itk::LightObject::Pointer itk::RegularStepGradientDescentOptimizer::CreateAnother | ( | void | ) | const [virtual] |
Create an object from an instance, potentially deferring to a factory. This method allows you to create an instance of an object that is exactly the same type as the referring object. This is useful in cases where an object has been cast back to a base class.
Reimplemented from itk::RegularStepGradientDescentBaseOptimizer.
virtual const char* itk::RegularStepGradientDescentOptimizer::GetNameOfClass | ( | ) | const [virtual] |
Run-time type information (and related methods).
Reimplemented from itk::RegularStepGradientDescentBaseOptimizer.
static Pointer itk::RegularStepGradientDescentOptimizer::New | ( | ) | [static] |
Method for creation through the object factory.
Reimplemented from itk::RegularStepGradientDescentBaseOptimizer.
void itk::RegularStepGradientDescentOptimizer::operator= | ( | const Self & | ) | [private] |
Types inherited from the superclass
Reimplemented from itk::RegularStepGradientDescentBaseOptimizer.
virtual void itk::RegularStepGradientDescentOptimizer::StepAlongGradient | ( | double | factor, |
const DerivativeType & | transformedGradient | ||
) | [protected, virtual] |
Advance one step along the corrected gradient taking into account the steplength represented by factor. This method is invoked by AdvanceOneStep. It is expected to be overrided by optimization methods in non-vector spaces