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
|
/*=========================================================================
*
* 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 itkRankImageFilter_h
#define itkRankImageFilter_h
#include "itkMovingHistogramImageFilter.h"
#include <list>
#include <map>
#include <set>
#include "itkRankHistogram.h"
#include "itkFlatStructuringElement.h"
namespace itk
{
/**
* \class RankImageFilter
* \brief Rank filter of a greyscale image
*
* Nonlinear filter in which each output pixel is a user defined
* rank of input pixels in a user defined neighborhood. The default
* rank is 0.5 (median). The boundary conditions are different to the
* standard itkMedianImageFilter. In this filter the neighborhood is
* cropped at the boundary, and is therefore smaller.
*
* This filter uses a recursive implementation - essentially the one
* by Huang 1979, I believe, to compute the rank,
* and is therefore usually a lot faster than the direct
* implementation. The extensions to Huang are support for arbitrary
* pixel types (using c++ maps) and arbitrary neighborhoods. I presume
* that these are not new ideas.
*
* This filter is based on the sliding window code from the
* consolidatedMorphology package on InsightJournal.
*
* The structuring element is assumed to be composed of binary
* values (zero or one). Only elements of the structuring element
* having values > 0 are candidates for affecting the center pixel.
*
*
* This code was contributed in the Insight Journal paper:
* "Efficient implementation of kernel filtering"
* by Beare R., Lehmann G
* https://hdl.handle.net/1926/555
* http://www.insight-journal.org/browse/publication/160
*
*
* \author Richard Beare
* \ingroup ITKReview
*/
template< typename TInputImage, typename TOutputImage, typename TKernel =
FlatStructuringElement< TInputImage::ImageDimension > >
class RankImageFilter:
public MovingHistogramImageFilter< TInputImage, TOutputImage, TKernel,
Function::RankHistogram< typename TInputImage::PixelType > >
{
public:
/** Standard class typedefs. */
typedef RankImageFilter Self;
typedef SmartPointer< Self > Pointer;
typedef SmartPointer< const Self > ConstPointer;
typedef MovingHistogramImageFilter< TInputImage, TOutputImage, TKernel,
Function::RankHistogram< typename TInputImage::PixelType > > Superclass;
/** Standard New method. */
itkNewMacro(Self);
/** Runtime information support. */
itkTypeMacro(RankImageFilter,
MovingHistogramImageFilter);
/** Image related typedefs. */
typedef TInputImage InputImageType;
typedef TOutputImage OutputImageType;
typedef typename TInputImage::RegionType RegionType;
typedef typename TInputImage::SizeType SizeType;
typedef typename TInputImage::IndexType IndexType;
typedef typename TInputImage::PixelType PixelType;
typedef typename TInputImage::OffsetType OffsetType;
typedef typename Superclass::OutputImageRegionType OutputImageRegionType;
typedef typename TOutputImage::PixelType OutputPixelType;
typedef typename TInputImage::PixelType InputPixelType;
typedef typename Superclass::HistogramType HistogramType;
/** Image related typedefs. */
itkStaticConstMacro(ImageDimension, unsigned int,
TInputImage::ImageDimension);
/** Kernel typedef. */
typedef TKernel KernelType;
/** Kernel (structuring element) iterator. */
typedef typename KernelType::ConstIterator KernelIteratorType;
/** n-dimensional Kernel radius. */
typedef typename KernelType::SizeType RadiusType;
itkSetMacro(Rank, float)
itkGetConstMacro(Rank, float)
bool GetUseVectorBasedAlgorithm()
{
return HistogramType::UseVectorBasedAlgorithm();
}
protected:
RankImageFilter();
~RankImageFilter() {}
void PrintSelf(std::ostream & os, Indent indent) const ITK_OVERRIDE;
virtual void ConfigureHistogram( HistogramType & histogram ) ITK_OVERRIDE;
private:
RankImageFilter(const Self &) ITK_DELETE_FUNCTION;
void operator=(const Self &) ITK_DELETE_FUNCTION;
float m_Rank;
}; // end of class
} // end namespace itk
#ifndef ITK_MANUAL_INSTANTIATION
#include "itkRankImageFilter.hxx"
#endif
#endif
|
