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
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
|
/*=========================================================================
Program: Insight Segmentation & Registration Toolkit
Module: $RCSfile: itkMeanShiftModeSeekerBase.txx,v $
Language: C++
Date: $Date: 2009-03-04 15:24:02 $
Version: $Revision: 1.12 $
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.
=========================================================================*/
#ifndef __itkMeanShiftModeSeekerBase_txx
#define __itkMeanShiftModeSeekerBase_txx
namespace itk {
namespace Statistics {
template< class TSample >
MeanShiftModeSeekerBase< TSample >
::MeanShiftModeSeekerBase()
{
m_MaximumIteration = 0;
m_CacheMethod = 0;
}
template< class TSample >
MeanShiftModeSeekerBase< TSample >
::~MeanShiftModeSeekerBase()
{
}
template< class TSample >
void
MeanShiftModeSeekerBase< TSample >
::PrintSelf(std::ostream& os, Indent indent) const
{
Superclass::PrintSelf(os,indent);
os << indent << "InputSample: ";
if ( m_InputSample.IsNotNull() )
{
os << m_InputSample << std::endl;
}
else
{
os << "not set." << std::endl;
}
os << indent << "CacheMethod: ";
if ( m_CacheMethod.IsNotNull() )
{
os << m_CacheMethod << std::endl;
}
else
{
os << "not set." << std::endl;
}
os << indent << "Maximum iterations: " << m_MaximumIteration << std::endl;
}
template< class TSample >
void
MeanShiftModeSeekerBase< TSample >
::SetInputSample(const TSample* sample)
{
if ( m_InputSample != sample )
{
m_InputSample = sample;
this->Modified();
}
}
template< class TSample >
void
MeanShiftModeSeekerBase< TSample >
::SetCacheMethod(CacheMethodType* method)
{
if ( m_CacheMethod != method )
{
m_CacheMethod = method;
this->Modified();
}
}
template< class TSample >
typename MeanShiftModeSeekerBase< TSample >::MeasurementVectorType
MeanShiftModeSeekerBase< TSample >
::Evolve(MeasurementVectorType instance)
{
if( m_InputSample->GetMeasurementVectorSize() )
{
MeasurementVectorTraits::Assert( instance,
m_InputSample->GetMeasurementVectorSize(),
"Length mismatch: MeanShiftModeSeekerBase::Evolve" );
}
MeasurementVectorType queryPoint = instance;
MeasurementVectorType newPoint;
MeasurementVectorType previousPoint = queryPoint;
unsigned int currentIteration = 0;
bool retCode = false;
while ( true )
{
if ( m_MaximumIteration > 0 && currentIteration > m_MaximumIteration )
{
if ( this->GetDebug() )
{
std::cout << "DEBUG: max exceeded." << std::endl;
}
return queryPoint;
}
if ( m_CacheMethod.IsNotNull() )
{
if ( !m_CacheMethod->GetMeasurementVector(queryPoint, newPoint) )
{
retCode = this->ComputeMode( queryPoint, newPoint );
if ( retCode )
{
m_CacheMethod->SetMeasurementVector( queryPoint, newPoint );
}
}
}
else
{
retCode = this->ComputeMode( queryPoint, newPoint );
}
if ( !retCode )
{
return queryPoint;
}
if ( queryPoint != newPoint && newPoint != previousPoint )
{
previousPoint = queryPoint;
queryPoint = newPoint;
}
else
{
return queryPoint;
}
++currentIteration;
} // end of while
return queryPoint; //This is here to avoid compiler warning, but should never occur.
}
} // end of namespace Statistics
} // end of namespace itk
#endif
|
