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
|
/*=========================================================================
Program: Insight Segmentation & Registration Toolkit
Module: $RCSfile: itkConnectedComponentAlgorithm.h,v $
Language: C++
Date: $Date: 2006-12-14 10:27:37 $
Version: $Revision: 1.2 $
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 __itkConnectedComponentAlgorithm_h
#define __itkConnectedComponentAlgorithm_h
#include "itkImage.h"
#include "itkConstShapedNeighborhoodIterator.h"
#include "itkShapedNeighborhoodIterator.h"
namespace itk
{
template< class TIterator >
TIterator*
setConnectivity( TIterator* it, bool fullyConnected=false )
{
typename TIterator::OffsetType offset;
it->ClearActiveList();
if( !fullyConnected)
{
// only activate the neighbors that are face connected
// to the current pixel. do not include the center pixel
offset.Fill( 0 );
for( unsigned int d=0; d < TIterator::Dimension; ++d )
{
offset[d] = -1;
it->ActivateOffset( offset );
offset[d] = 1;
it->ActivateOffset( offset );
offset[d] = 0;
}
}
else
{
// activate all neighbors that are face+edge+vertex
// connected to the current pixel. do not include the center pixel
unsigned int centerIndex = it->GetCenterNeighborhoodIndex();
for( unsigned int d=0; d < centerIndex*2 + 1; d++ )
{
offset = it->GetOffset( d );
it->ActivateOffset( offset );
}
offset.Fill(0);
it->DeactivateOffset( offset );
}
return it;
}
template< class TIterator >
TIterator*
setConnectivityPrevious( TIterator* it, bool fullyConnected=false )
{
// activate the "previous" neighbours
typename TIterator::OffsetType offset;
it->ClearActiveList();
if( !fullyConnected)
{
// only activate the neighbors that are face connected
// to the current pixel. do not include the center pixel
offset.Fill( 0 );
for( unsigned int d=0; d < TIterator::Dimension; ++d )
{
offset[d] = -1;
it->ActivateOffset( offset );
// offset[d] = 1;
// it->ActivateOffset( offset );
offset[d] = 0;
}
}
else
{
// activate all neighbors that are face+edge+vertex
// connected to the current pixel. do not include the center pixel
unsigned int centerIndex = it->GetCenterNeighborhoodIndex();
for( unsigned int d=0; d < centerIndex; d++ )
{
offset = it->GetOffset( d );
it->ActivateOffset( offset );
}
offset.Fill(0);
it->DeactivateOffset( offset );
}
return it;
}
template< class TIterator >
TIterator*
setConnectivityLater( TIterator* it, bool fullyConnected=false )
{
// activate the "later" neighbours
typename TIterator::OffsetType offset;
it->ClearActiveList();
if( !fullyConnected)
{
// only activate the neighbors that are face connected
// to the current pixel. do not include the center pixel
offset.Fill( 0 );
for( unsigned int d=0; d < TIterator::Dimension; ++d )
{
offset[d] = 1;
it->ActivateOffset( offset );
offset[d] = 0;
}
}
else
{
// activate all neighbors that are face+edge+vertex
// connected to the current pixel. do not include the center pixel
unsigned int centerIndex = it->GetCenterNeighborhoodIndex();
for( unsigned int d=centerIndex+1; d < 2*centerIndex+1; d++ )
{
offset = it->GetOffset( d );
it->ActivateOffset( offset );
}
offset.Fill(0);
it->DeactivateOffset( offset );
}
return it;
}
}
#endif
|
