/usr/include/ITK-4.5/itkQuaternionRigidTransformGradientDescentOptimizer.h is in libinsighttoolkit4-dev 4.5.0-3.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 | /*=========================================================================
*
* 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.
*
*=========================================================================*/
#ifndef __itkQuaternionRigidTransformGradientDescentOptimizer_h
#define __itkQuaternionRigidTransformGradientDescentOptimizer_h
#include "itkGradientDescentOptimizer.h"
namespace itk
{
/** \class QuaternionRigidTransformGradientDescentOptimizer
* \brief Implement a gradient descent optimizer
*
* QuaternionRigidTransformGradientDescentOptimizer is an extension to the
* simple gradient descent optimizer implmented in GradientDescentOptimizer.
* At each iteration the current position is updated according to
*
* p(n+1) = p(n) + learningRate * d f(p(n)) / d p(n)
*
* \f[
* p_{n+1} = p_n
* + \mbox{learningRate}
* \, \frac{\partial f(p_n) }{\partial p_n}
* \f]
*
* The learning rate is a fixed scalar defined via SetLearningRate().
* The optimizer steps through a user defined number of iterations;
* no convergence checking is done.
* The first four components of p are assumed to be the four components
* of the quaternion. After each update, the quaternion is normalized to
* have a magnitude of one. This ensures the the transform is purely rigid.
*
* \sa GradientDescentOptimizer
* \ingroup Numerics Optimizers
* \ingroup ITKOptimizers
*/
class QuaternionRigidTransformGradientDescentOptimizer:
public GradientDescentOptimizer
{
public:
/** Standard class typedefs. */
typedef QuaternionRigidTransformGradientDescentOptimizer Self;
typedef GradientDescentOptimizer Superclass;
typedef SmartPointer< Self > Pointer;
typedef SmartPointer< const Self > ConstPointer;
/** Method for creation through the object factory. */
itkNewMacro(Self);
/** Run-time type information (and related methods). */
itkTypeMacro(QuaternionRigidTransformGradientDescentOptimizer,
GradientDescentOptimizer);
/** Parameters type.
* It defines a position in the optimization search space. */
typedef Superclass::ParametersType ParametersType;
/** Advance one step following the gradient direction. */
virtual void AdvanceOneStep(void);
protected:
QuaternionRigidTransformGradientDescentOptimizer() {}
virtual ~QuaternionRigidTransformGradientDescentOptimizer() {}
private:
//purposely not implemented
QuaternionRigidTransformGradientDescentOptimizer(const Self &);
void operator=(const Self &);
};
} // end namespace itk
#endif
|