19 #ifndef __mitkRigidICPDefaultRegistrationAlgorithm_PROFILE_RESOURCE_H
20 #define __mitkRigidICPDefaultRegistrationAlgorithm_PROFILE_RESOURCE_H
23 #include "mapExceptionObject.h"
24 #include "mapAlgorithmProfileHelper.h"
31 const char *
const mitkRigidICPDefaultRegistrationAlgorithm_profile =
"<Profile>;<Description>Simple 3D rigid (translation and euler angles) registration algorithm using point sets and the iterative closesed points scheme. It tries to minimize the minimal point distance errors (no point paires are assumed). Remark: at least 6 points per point sets are needed</Description>;<Description> the number must not equal.</Description>;<Contact>Ralf Floca; mitk-users@lists.sourceforge.net</Contact>;<Citation>P.J. Besl, N.D. McKay.: A Method for Registration of 3-D Shapes. IEEE Trans. on Pattern Analysis and Machine Intelligence. Vol. 14 2. pp. 239-256. 1992. doi:10.1109/34.121791.</Citation>;<Characteristics>;<DataType>Points</DataType>;<ComputationStyle>iterative</ComputationStyle>;<Deterministic/>;<ResolutionStyle>Single</ResolutionStyle>;<DimMoving>3</DimMoving>;<ModalityMoving>any</ModalityMoving>;<DimTarget>3</DimTarget>;<ModalityTarget>any</ModalityTarget>;<Subject>any</Subject>;<Object>any</Object>;<TransformModel>rigid</TransformModel>;<TransformDomain>global</TransformDomain>;</Characteristics>;<Keywords>;<Keyword>basic</Keyword>;<Keyword>point sets</Keyword>;<Keyword>ICP</Keyword>;<Keyword>rigid</Keyword>;</Keywords>;</Profile>";
36 static ::map::algorithm::UID::Pointer
UID()
38 ::map::core::OStringStream stream;
39 stream << __DATE__ <<
" " << __TIME__ <<
"; MAP "<<MAP_FULL_VERSION_STRING<<
"; ITK "<<ITK_VERSION_MAJOR<<
"."<<ITK_VERSION_MINOR<<
"."<<ITK_VERSION_PATCH;
40 ::map::core::String tag = stream.str();
41 ::map::algorithm::UID::Pointer spResult = ::map::algorithm::UID::New(
"org.mitk",
"RigidICP.3D.default",
"1.0.0",tag);
48 return ::map::algorithm::profile::getDescription(tmpProfile);