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
|
/*=========================================================================
Program: Insight Segmentation & Registration Toolkit
Module: itkMaximumDecisionRule.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.
=========================================================================*/
#include "itkMaximumDecisionRule.h"
namespace itk{
void
MaximumDecisionRule::PrintSelf(std::ostream& os, Indent indent) const
{
Superclass::PrintSelf(os, indent);
}
unsigned int
MaximumDecisionRule::Evaluate(const VectorType &discriminantScores) const
{
double max = discriminantScores[0];
unsigned int maxIndex = 0;
unsigned int i;
for (i = 1; i < discriminantScores.size(); i++)
{
if (discriminantScores[i] > max)
{
max = discriminantScores[i];
maxIndex = i;
}
}
return maxIndex;
}
unsigned int
MaximumDecisionRule::Evaluate(const ArrayType &discriminantScores) const
{
double max = discriminantScores[0];
unsigned int maxIndex = 0;
unsigned int i;
for (i = 1; i < discriminantScores.Size(); i++)
{
if (discriminantScores[i] > max)
{
max = discriminantScores[i];
maxIndex = i;
}
}
return maxIndex;
}
unsigned int
MaximumDecisionRule::Evaluate(const VariableLengthVectorType &discriminantScores) const
{
double max = discriminantScores[0];
unsigned int maxIndex = 0;
unsigned int i;
for (i = 1; i < discriminantScores.Size(); i++)
{
if (discriminantScores[i] > max)
{
max = discriminantScores[i];
maxIndex = i;
}
}
return maxIndex;
}
} // end of namespace itk
|
