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
|
/*=========================================================================
*
* Copyright Insight Software Consortium
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0.txt
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
*=========================================================================*/
#ifndef itkOrthogonalSwath2DPathFilter_h
#define itkOrthogonalSwath2DPathFilter_h
#include "itkPathAndImageToPathFilter.h"
#include "itkOrthogonallyCorrected2DParametricPath.h"
namespace itk
{
/** \class OrthogonalSwath2DPathFilter
* \brief Filter that optimizes a 2D path relative to an image.
*
* OrthogonalSwath2DPathFilter produces an OrthogonallyCorrected2DParametricPath
* representation of a path that is optimal with respect to an image and an
* original Fourier series path (sometimes referred to as an "initial contour").
* Usage is a little complex. The input image must be preprocessed with
* ExtractOrthogonalSwath2DImageFilter (the user may want to smooth the image
* first). The user should then use the resulting swath image to produce a new
* "merit" swath image of the EXACT same size as the swath image produced in the
* preceding step. Each pixel value in the merit swath image indicates the
* local merit of having the path pass through that swath index (taking the
* absolute value of the vertical partial-derivative of the swath image is often
* a good way to do this). Both the merit swath image and the path used to
* extract the swath image should then be passed as inputs to this filter which
* will search through the merit swath image using dynamic programming to find
* the absolutely optimum (in terms of the swath image) path.
*
* The file itkOrthogonalSwath2DPathFilterTest.cxx provides a good usage example
* of itk::OrthogonalSwath2DPathFilter
*
* \ingroup PathFilters
* \ingroup ITKPath
*/
template< typename TFourierSeriesPath, typename TSwathMeritImage >
class ITK_TEMPLATE_EXPORT OrthogonalSwath2DPathFilter:public
PathAndImageToPathFilter< TFourierSeriesPath, TSwathMeritImage,
OrthogonallyCorrected2DParametricPath >
{
public:
/** Standard class typedefs. */
typedef OrthogonalSwath2DPathFilter Self;
typedef PathAndImageToPathFilter< TFourierSeriesPath, TSwathMeritImage,
OrthogonallyCorrected2DParametricPath > Superclass;
typedef SmartPointer< Self > Pointer;
typedef SmartPointer< const Self > ConstPointer;
/** Method for creation through the object factory. */
itkNewMacro(Self);
/** Run-time type information (and related methods). */
itkTypeMacro(OrthogonalSwath2DPathFilter, PathAndImageToPathFilter);
/** Some convenient typedefs. */
typedef TFourierSeriesPath InputPathType;
typedef typename InputPathType::Pointer InputPathPointer;
typedef typename InputPathType::InputType InputPathInputType;
typedef TSwathMeritImage ImageType;
typedef typename ImageType::ConstPointer ImageConstPointer;
typedef OrthogonallyCorrected2DParametricPath OutputPathType;
typedef typename OutputPathType::Pointer OutputPathPointer;
typedef typename OutputPathType::InputType OutputPathInputType;
typedef typename OutputPathType::OrthogonalCorrectionTableType
OrthogonalCorrectionTableType;
typedef typename OutputPathType::OrthogonalCorrectionTablePointer
OrthogonalCorrectionTablePointer;
typedef typename InputPathType::IndexType IndexType;
typedef typename InputPathType::OffsetType OffsetType;
typedef typename ImageType::SizeType SizeType;
protected:
OrthogonalSwath2DPathFilter();
virtual ~OrthogonalSwath2DPathFilter() ITK_OVERRIDE;
void PrintSelf(std::ostream & os, Indent indent) const ITK_OVERRIDE;
void GenerateData(void) ITK_OVERRIDE;
private:
ITK_DISALLOW_COPY_AND_ASSIGN(OrthogonalSwath2DPathFilter);
// Find the "L" for the maximum merit over the range L-1 to L+1 at F & x.
// This value is both returned and stored in m_StepValues.
// The merits for F & x at L-1 to L+1 must have already been calculated.
unsigned int FindAndStoreBestErrorStep(unsigned int x, unsigned int F,
unsigned int L);
// m_StepValues & m_MeritValues are stored as datatype[x][F][L] which requres
// cols*rows*rows bytes of storage where rows and cols are the dimensions of
// the processed image.
//
// This ordering of elements is most efficient when L is incremented in the
// inner-most loop and x is incremented in the outer-most loop.
//
// m_StepValues & m_MeritValues should always be accessed using the
// StepValue()
// and MeritValue() access functions. StepValue() and MeritValue() can each
// be
// used on both the left and right hand of assignments for reads & writes, ex:
// StepValue(1,1,1) = 2+MeritValue(0,0,3);
inline int & StepValue(int f, int l, int x)
{
int rows = m_SwathSize[1];
return m_StepValues[( x * rows * rows ) + ( f * rows ) + ( l )];
}
inline double & MeritValue(int f, int l, int x)
{
int rows = m_SwathSize[1];
return m_MeritValues[( x * rows * rows ) + ( f * rows ) + ( l )];
}
int * m_StepValues; // best y=error coordinate @ x of image for (0,F) ->
// (x+1,L)
double *m_MeritValues;
int * m_OptimumStepsValues; // best step (e value)
// sequence for a
// closed path
OrthogonalCorrectionTablePointer m_FinalOffsetValues;
SizeType m_SwathSize;
};
} // end namespace itk
#ifndef ITK_MANUAL_INSTANTIATION
#include "itkOrthogonalSwath2DPathFilter.hxx"
#endif
#endif
|
