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
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
|
/*=========================================================================
Program: Insight Segmentation & Registration Toolkit
Module: $RCSfile: itkMaximumRatioDecisionRule.cxx,v $
Language: C++
Date: $Date: 2007-12-23 17:59:28 $
Version: $Revision: 1.7 $
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 "itkMaximumRatioDecisionRule.h"
namespace itk {
MaximumRatioDecisionRule::MaximumRatioDecisionRule()
{
}
void MaximumRatioDecisionRule::SetAPriori(APrioriVectorType& values)
{
m_NumberOfClasses = values.size() ;
m_APrioriRatioMatrix.set_size(values.size(), values.size()) ;
APrioriVectorSizeType i, j ;
double APrioriRatio ;
for (i = 0 ; i < m_NumberOfClasses ; i++)
{
for (j = 0 ; j < m_NumberOfClasses ; j++)
{
if ( values[i] > 0 )
{
APrioriRatio = (double)values[j] /
(double)values[i] ;
}
else
{
APrioriRatio = NumericTraits< double >::max() ;
}
m_APrioriRatioMatrix.put(i, j, APrioriRatio) ;
}
}
}
unsigned int
MaximumRatioDecisionRule::Evaluate(const VectorType &discriminantScores) const
{
unsigned int i, j ;
double temp ;
for (i = 0 ; i < m_NumberOfClasses ; i++)
{
j = 0 ;
while ( j < m_NumberOfClasses )
{
if ( j != i )
{
if ( discriminantScores[j] != 0.0 )
{
temp = discriminantScores[i] / discriminantScores[j] ;
}
else
{
temp = NumericTraits< double >::max() ;
}
if ( temp < m_APrioriRatioMatrix.get(i,j) )
{
break ;
}
}
++j ;
if ( j == m_NumberOfClasses )
{
return i ;
}
}
}
return i ;
}
unsigned int
MaximumRatioDecisionRule::Evaluate(const ArrayType &discriminantScores) const
{
unsigned int i, j ;
double temp ;
for (i = 0 ; i < m_NumberOfClasses ; i++)
{
j = 0 ;
while ( j < m_NumberOfClasses )
{
if ( j != i )
{
if ( discriminantScores[j] != 0.0 )
{
temp = discriminantScores[i] / discriminantScores[j] ;
}
else
{
temp = NumericTraits< double >::max() ;
}
if ( temp < m_APrioriRatioMatrix.get(i,j) )
{
break ;
}
}
++j ;
if ( j == m_NumberOfClasses )
{
return i ;
}
}
}
return i ;
}
} // end of namespace
|
