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
162
163
164
165
166
167
168
169
170
171
172
173
174
175
|
/*=========================================================================
Program: Insight Segmentation & Registration Toolkit
Module: $RCSfile: itkVotingBinaryIterativeHoleFillingImageFilter.h,v $
Language: C++
Date: $Date: 2006-04-04 13:13:51 $
Version: $Revision: 1.4 $
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 __itkVotingBinaryIterativeHoleFillingImageFilter_h
#define __itkVotingBinaryIterativeHoleFillingImageFilter_h
#include "itkVotingBinaryHoleFillingImageFilter.h"
namespace itk
{
/** \class VotingBinaryIterativeHoleFillingImageFilter
* \brief Fills in holes and cavities by iteratively applying a voting operation.
*
* This filter uses internally the VotingBinaryHoleFillingImageFilter, and runs
* it iteratively until no pixels are being changed or until it reaches the
* maximum number of iterations. The purpose of the filter is to fill in holes
* of medium size (tens of pixels in radius). In principle the number of
* iterations is related to the size of the holes to be filled in. The larger
* the holes, the more iteration must be run with this filter in order to fill
* in the full hole. The size of the neighborhood is also related to the
* curvature of the hole borders and therefore the hole size. Note that as a
* colateral effect this filter may also fill in cavities in the external side
* of structures.
*
* This filter is templated over a single image type because the output image
* type must be the same as the input image type. This is required in order to
* make the iterations possible, since the output image of one iteration is
* taken as the input image for the next iteration.
*
* \sa Image
* \sa VotingBinaryImageFilter
* \sa VotingBinaryHoleFillingImageFilter
* \sa Neighborhood
* \sa NeighborhoodOperator
* \sa NeighborhoodIterator
*
* \ingroup IntensityImageFilters
*/
template <class TImage >
class ITK_EXPORT VotingBinaryIterativeHoleFillingImageFilter :
public ImageToImageFilter< TImage, TImage >
{
public:
/** Convenient typedefs for simplifying declarations. */
typedef TImage InputImageType;
typedef TImage OutputImageType;
/** Standard class typedefs. */
typedef VotingBinaryIterativeHoleFillingImageFilter Self;
typedef ImageToImageFilter< InputImageType, OutputImageType> 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(VotingBinaryIterativeHoleFillingImageFilter, ImageToImageFilter);
/** Type of the internal Voting filter that is going to be executed iteratively */
typedef VotingBinaryHoleFillingImageFilter<
InputImageType,
OutputImageType
> VotingFilterType;
/** Image typedef support. */
typedef typename InputImageType::PixelType InputPixelType;
typedef typename OutputImageType::PixelType OutputPixelType;
typedef typename InputImageType::RegionType InputImageRegionType;
typedef typename OutputImageType::RegionType OutputImageRegionType;
typedef typename InputImageType::SizeType InputSizeType;
/** Maximum number of iterations. This filter is executed iteratively as
* long as at least one pixel has changed in a previous iteration, or until
* the maximum number of iterations has been reached. */
itkGetConstReferenceMacro(MaximumNumberOfIterations, unsigned int);
itkSetMacro(MaximumNumberOfIterations, unsigned int);
/** Number of iterations executed at any given time. This is useful at the
* end of the execution in order to verify how many iterations were
* performed. */
itkGetConstReferenceMacro(CurrentNumberOfIterations, unsigned int);
itkSetMacro(CurrentNumberOfIterations, unsigned int);
/** Set the radius of the neighborhood used to compute the median. */
itkSetMacro(Radius, InputSizeType);
/** Get the radius of the neighborhood used to compute the median */
itkGetConstReferenceMacro(Radius, InputSizeType);
/** Set the value associated with the Foreground (or the object) on
the binary input image and the Background . */
itkSetMacro(BackgroundValue, InputPixelType);
itkSetMacro(ForegroundValue, InputPixelType);
/** Get the value associated with the Foreground (or the object) on the
binary input image and the Background . */
itkGetConstReferenceMacro(BackgroundValue, InputPixelType);
itkGetConstReferenceMacro(ForegroundValue, InputPixelType);
/** Majority threshold. It is the number of pixels over 50% that will decide
* whether an OFF pixel will become ON or not. For example, if the
* neighborhood of a pixel has 124 pixels (excluding itself), the 50% will be
* 62, and if you set upd a Majority threshold of 5, that means that the
* filter will require 67 or more neighbor pixels to be ON in order to switch
* the current OFF pixel to ON. The default value is 1. */
itkGetConstReferenceMacro( MajorityThreshold, unsigned int );
itkSetMacro( MajorityThreshold, unsigned int );
/** Returns the number of pixels that changed when the filter was executed. */
itkGetConstReferenceMacro( NumberOfPixelsChanged, unsigned int );
#ifdef ITK_USE_CONCEPT_CHECKING
/** Begin concept checking */
itkConceptMacro(InputEqualityComparableCheck,
(Concept::EqualityComparable<InputPixelType>));
itkConceptMacro(InputOStreamWritableeCheck,
(Concept::OStreamWritable<InputPixelType>));
/** End concept checking */
#endif
protected:
VotingBinaryIterativeHoleFillingImageFilter();
virtual ~VotingBinaryIterativeHoleFillingImageFilter() {}
void PrintSelf(std::ostream& os, Indent indent) const;
/**
* \sa ImageToImageFilter::ThreadedGenerateData(),
* ImageToImageFilter::GenerateData() */
void GenerateData();
private:
VotingBinaryIterativeHoleFillingImageFilter(const Self&); //purposely not implemented
void operator=(const Self&); //purposely not implemented
InputSizeType m_Radius;
InputPixelType m_ForegroundValue;
InputPixelType m_BackgroundValue;
unsigned int m_MaximumNumberOfIterations;
unsigned int m_CurrentNumberOfIterations;
unsigned int m_MajorityThreshold;
unsigned int m_NumberOfPixelsChanged;
};
} // end namespace itk
#ifndef ITK_MANUAL_INSTANTIATION
#include "itkVotingBinaryIterativeHoleFillingImageFilter.txx"
#endif
#endif
|
