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
|
/*=========================================================================
Program: Insight Segmentation & Registration Toolkit
Module: itkMinimumDecisionRuleTest.cxx
Language: C++
Date: $Date$
Version: $Revision$
Copyright (c) Insight Software Consortium. All rights reserved.
See ITKCopyright.txt or http://www.itk.org/HTML/Copyright.htm for details.
This software is distributed WITHOUT ANY WARRANTY; without even
the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
PURPOSE. See the above copyright notices for more information.
=========================================================================*/
#if defined(_MSC_VER)
#pragma warning ( disable : 4786 )
#endif
#include "itkMinimumDecisionRule2.h"
#include "itkObjectFactory.h"
int itkMinimumDecisionRuleTest(int, char* [] )
{
typedef itk::Statistics::MinimumDecisionRule2 MinimumDecisionRuleType;
typedef MinimumDecisionRuleType::MembershipVectorType MembershipVectorType;
MinimumDecisionRuleType::Pointer decisionRule = MinimumDecisionRuleType::New();
std::cout << decisionRule->GetNameOfClass() << std::endl;
std::cout << decisionRule->MinimumDecisionRuleType::Superclass::GetNameOfClass() << std::endl;
decisionRule->Print(std::cout);
MembershipVectorType membershipScoreVector;
double membershipScore1;
membershipScore1 = 1.1;
membershipScoreVector.push_back( membershipScore1 );
double membershipScore2;
membershipScore2 = 0.5;
membershipScoreVector.push_back( membershipScore2 );
double membershipScore3;
membershipScore3 = 1.9;
membershipScoreVector.push_back( membershipScore3 );
// the minimum score is the third component. The decision rule should
// return index ( 2)
if( decisionRule->Evaluate( membershipScoreVector ) != 1 )
{
std::cerr << "Decision rule computation is incorrect!" << std::endl;
return EXIT_FAILURE;
}
return EXIT_SUCCESS;
}
|
