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
|
/*=========================================================================
Program: Insight Segmentation & Registration Toolkit
Module: $RCSfile: itkChainCodePath2D.cxx,v $
Language: C++
Date: $Date: 2006-03-18 20:14:09 $
Version: $Revision: 1.6 $
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 "itkChainCodePath2D.h"
#include "itkNumericTraits.h"
#include <string>
namespace itk
{
ChainCodePath2D::OutputType
ChainCodePath2D
::Evaluate( const InputType & input ) const
{
return DecodeOffset( m_Chain2D[input] );
}
ChainCodePath2D::IndexType
ChainCodePath2D
::EvaluateToIndex( const InputType & input ) const
{
IndexType index = GetStart();
// Iterate through the chaincode, summing the offsets as we go.
for(InputType i=0; i<input; i++)
{
index += DecodeOffset( m_Chain2D[i] );
}
return index;
}
ChainCodePath2D::OffsetType
ChainCodePath2D
::IncrementInput( InputType & input ) const
{
if( input < NumberOfSteps() )
{
return DecodeOffset( m_Chain2D[input++] );
}
else
{
return this->GetZeroOffset();
}
}
std::string
ChainCodePath2D
::GetChainCodeAsString(void) const
{
std::string printableChain;
for(unsigned int i=0; i<m_Chain2D.size(); i++)
{
// Make a single char string out of the current step
OStringStream printableStep;
printableStep << m_Chain2D[i];
// Append the new step (in string form) to the main string of steps
printableChain.insert( i, printableStep.str() );
}
return printableChain;
}
/** Constructor */
ChainCodePath2D
::ChainCodePath2D()
{
// Most of the work is done in the parent constructor.
OffsetType offset;
// Initialize the lookup tables m_FreemanCode and m_ReverseFreemanCode:
offset[0]=0;
offset[1]=0;
m_FreemanCode[ offset[0] + 1 ][ offset[1] + 1 ] = 0;
m_ReverseFreemanCode[ 0 ] = offset;
offset[0]=0;
offset[1]=1;
m_FreemanCode[ offset[0] + 1 ][ offset[1] + 1 ] = 1;
m_ReverseFreemanCode[ 1 ] = offset;
offset[0]=1;
offset[1]=1;
m_FreemanCode[ offset[0] + 1 ][ offset[1] + 1 ] = 2;
m_ReverseFreemanCode[ 2 ] = offset;
offset[0]=1;
offset[1]=0;
m_FreemanCode[ offset[0] + 1 ][ offset[1] + 1 ] = 3;
m_ReverseFreemanCode[ 3 ] = offset;
offset[0]=1;
offset[1]=-1;
m_FreemanCode[ offset[0] + 1 ][ offset[1] + 1 ] = 4;
m_ReverseFreemanCode[ 4 ] = offset;
offset[0]=0;
offset[1]=-1;
m_FreemanCode[ offset[0] + 1 ][ offset[1] + 1 ] = 5;
m_ReverseFreemanCode[ 5 ] = offset;
offset[0]=-1;
offset[1]=-1;
m_FreemanCode[ offset[0] + 1 ][ offset[1] + 1 ] = 6;
m_ReverseFreemanCode[ 6 ] = offset;
offset[0]=-1;
offset[1]=0;
m_FreemanCode[ offset[0] + 1 ][ offset[1] + 1 ] = 7;
m_ReverseFreemanCode[ 7 ] = offset;
offset[0]=-1;
offset[1]=1;
m_FreemanCode[ offset[0] + 1 ][ offset[1] + 1 ] = 8;
m_ReverseFreemanCode[ 8 ] = offset;
}
ChainCodePath2D::~ChainCodePath2D()
{
}
/** Standard "PrintSelf" method */
void
ChainCodePath2D
::PrintSelf( std::ostream& os, Indent indent) const
{
Superclass::PrintSelf( os, indent );
os << indent << "Chain code 2D: " << GetChainCodeAsString() << std::endl;
}
} // end namespace itk
|
