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
|
/*=========================================================================
*
* Copyright NumFOCUS
*
* 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
*
* https://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.
*
*=========================================================================*/
#include "itkMinimumDecisionRule.h"
#include "itkObjectFactory.h"
int
itkMinimumDecisionRuleTest(int, char *[])
{
using MinimumDecisionRuleType = itk::Statistics::MinimumDecisionRule;
using MembershipVectorType = MinimumDecisionRuleType::MembershipVectorType;
auto 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;
}
|
