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
|
/*=========================================================================
Program: Insight Segmentation & Registration Toolkit
Module: $RCSfile: itkChainCodeToFourierSeriesPathFilter.txx,v $
Language: C++
Date: $Date: 2007-03-07 14:05:38 $
Version: $Revision: 1.3 $
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 _itkChainCodeToFourierSeriesPathFilter_txx
#define _itkChainCodeToFourierSeriesPathFilter_txx
#include "itkChainCodeToFourierSeriesPathFilter.h"
#include "itkOffset.h"
#include <math.h>
namespace itk
{
/**
* Constructor
*/
template <class TInputChainCodePath, class TOutputFourierSeriesPath>
ChainCodeToFourierSeriesPathFilter<TInputChainCodePath,TOutputFourierSeriesPath>
::ChainCodeToFourierSeriesPathFilter()
{
this->SetNumberOfRequiredInputs( 1 );
m_NumberOfHarmonics = 8;
}
/**
* GenerateData Performs the reflection
*/
template <class TInputChainCodePath, class TOutputFourierSeriesPath>
void
ChainCodeToFourierSeriesPathFilter<TInputChainCodePath,TOutputFourierSeriesPath>
::GenerateData( void )
{
IndexType index;
VectorType indexVector;
VectorType cosCoefficient;
VectorType sinCoefficient;
OutputPathInputType theta;
unsigned int numSteps;
unsigned int numHarmonics = m_NumberOfHarmonics; // private copy
int dimension = OffsetType::GetOffsetDimension();
typename Superclass::InputPathConstPointer inputPtr = this->GetInput();
typename Superclass::OutputPathPointer outputPtr = this->GetOutput(0);
//outputPtr->SetRequestedRegion( inputPtr->GetRequestedRegion() );
//outputPtr->SetBufferedRegion( inputPtr->GetBufferedRegion() );
//outputPtr->SetLargestPossibleRegion( inputPtr->GetLargestPossibleRegion() );
//outputPtr->Allocate(); // Allocate() is an Image function
numSteps = inputPtr->NumberOfSteps();
outputPtr->Clear();
const double nPI = 4.0 * vcl_atan( 1.0 );
// Adjust our private copy of numHarmonics if necessary
if( numHarmonics <= 1 )
numHarmonics = 2;
else if( numHarmonics*2 > numSteps )
numHarmonics = numSteps / 2;
for( unsigned n=0; n<numHarmonics; n++ )
{
index = inputPtr->GetStart();
cosCoefficient.Fill(0.0);
sinCoefficient.Fill(0.0);
for( InputPathInputType step=0; step<numSteps; step++ )
{
index += inputPtr->Evaluate( step );
theta = 2 * n * nPI * (double(step+1)) / numSteps;
// turn the current index into a vector
for( int d=0; d<dimension; d++ )
indexVector[d] = index[d];
cosCoefficient += indexVector * (cos(theta)/numSteps);
sinCoefficient += indexVector * (sin(theta)/numSteps);
}
outputPtr->AddHarmonic( cosCoefficient, sinCoefficient );
}
}
template <class TInputChainCodePath, class TOutputFourierSeriesPath>
void
ChainCodeToFourierSeriesPathFilter<TInputChainCodePath,TOutputFourierSeriesPath>
::PrintSelf(std::ostream& os, Indent indent) const
{
Superclass::PrintSelf(os,indent);
os << indent << "NumberOfHarmonics: " << m_NumberOfHarmonics << std::endl;
}
} // end namespace itk
#endif
|
