This class offers static methods for computation of standard ICP registration. More...

Static Public Member Functions
static bool	StandardICPPointRegisterAlgorithm (mitk::PointSet::Pointer MovingSet, mitk::PointSet::Pointer StaticSet, double Threshold, itk::Matrix< double, 3, 3 > &TransformationR, itk::Vector< double, 3 > &TransformationT, double &FRE, int &n, std::string &ErrorMessage, int max_iterations=100)
	This method executes the standard iterative closest point algorithm to register a moving pointset X onto a static point set Y.

static bool	StandardICPPointRegisterAlgorithm (vtkSmartPointer< vtkPolyData > MovingSurface, vtkSmartPointer< vtkPolyData > StaticSurface, double Threshold, itk::Matrix< double, 3, 3 > &TransformationR, itk::Vector< double, 3 > &TransformationT, double &FRE, int &n, std::string &ErrorMessage, int max_iterations=100)
	This method executes the standard iterative closest point algorithm to register a moving pointset X onto a static point set Y.

Static Protected Member Functions
static vtkSmartPointer< vtkPolyData >	convertPointSetToVtkPolyData (mitk::PointSet::Pointer PointSet)

Detailed Description

This class offers static methods for computation of standard ICP registration.

Documentation

Member Function Documentation

vtkSmartPointer< vtkPolyData > mitk::StandardICPPointRegister::convertPointSetToVtkPolyData ( mitk::PointSet::Pointer PointSet )

staticprotected

bool mitk::StandardICPPointRegister::StandardICPPointRegisterAlgorithm	(	mitk::PointSet::Pointer	MovingSet,
		mitk::PointSet::Pointer	StaticSet,
		double	Threshold,
		itk::Matrix< double, 3, 3 > &	TransformationR,
		itk::Vector< double, 3 > &	TransformationT,
		double &	FRE,
		int &	n,
		std::string &	ErrorMessage,
		int	max_iterations = 100 )

static

This method executes the standard iterative closest point algorithm to register a moving pointset X onto a static point set Y.

Parameters

MovingSet	This is the moving point set, which is registered to the static point set (StaticSet).
StaticSet	This is the static point set to which the moving set is registered. The static set must have the same number of points like the moving set.
Threshold	This is the size of change of the moving set above which the iteration continues.
max_iterations	Maximum iterations until the algorithm terminates. Default value is 100.
TransformationR	Return value: This parameter is a reference to place where the return value "R-component of the transformation" will be saved.
TransformationT	Return value: This parameter is a reference to place where the return value "t-component of the transformation" will be saved.
FRE	Return value: Here the FRE of the transformation will be saved.
n	Return value: Here the number of iterations will be saved.

Returns: Returns true if the algorithm was completed successfully, false if not.

bool mitk::StandardICPPointRegister::StandardICPPointRegisterAlgorithm	(	vtkSmartPointer< vtkPolyData >	MovingSurface,
		vtkSmartPointer< vtkPolyData >	StaticSurface,
		double	Threshold,
		itk::Matrix< double, 3, 3 > &	TransformationR,
		itk::Vector< double, 3 > &	TransformationT,
		double &	FRE,
		int &	n,
		std::string &	ErrorMessage,
		int	max_iterations = 100 )

static

This method executes the standard iterative closest point algorithm to register a moving pointset X onto a static point set Y.

Parameters

MovingSurface	This is the moving surface, which is registered to the static surface (StaticSet).
StaticSurface	This is the static surface to which the moving set is registered. The static surface must have the same number of points like the moving set.
Threshold	This is the size of change of the moving set above which the iteration continues.
max_iterations	Maximum iterations until the algorithm terminates. Default value is 100.
TransformationR	Return value: This parameter is a reference to place where the return value "R-component of the transformation" will be saved.
TransformationT	Return value: This parameter is a reference to place where the return value "t-component of the transformation" will be saved.
FRE	Return value: Here the FRE of the transformation will be saved.
n	Return value: Here the number of iterations will be saved.

Returns: Returns true if the algorithm was completed successfully, false if not.

The documentation for this class was generated from the following files:

Plugins/org.mitk.gui.qt.igtexamples/src/internal/mitkStandardICPPointRegister.h
Plugins/org.mitk.gui.qt.igtexamples/src/internal/mitkStandardICPPointRegister.cpp