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
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
|
/*=========================================================================
Program: Visualization Toolkit
Module: vtkLabelMapLookup.h
Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
All rights reserved.
See Copyright.txt or http://www.kitware.com/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 notice for more information.
=========================================================================*/
/**
* @class vtkLabelMapLookup
* @brief provide an efficient numeric label lookup
*
*
* vtkLabelMapLookup is a helper object that enables faster lookup of
* a segmentation label from a set of labels. It uses caching, and
* different strategies depending on the size of the set of labels.
*
* @sa
* vtkSurfaceNets2D vtkSurfaceNets3D vtkDiscreteFlyingEdgesClipper2D
*/
#ifndef vtkLabelMapLookup_h
#define vtkLabelMapLookup_h
#include "vtkCommonDataModelModule.h"
#include <unordered_set>
#include <vector>
VTK_ABI_NAMESPACE_BEGIN
// Determine whether an image label/object has been specified for output.
// This requires looking up an image pixel/scalar value and determining
// whether it's part of a segmented object. Since this can be relatively
// expensive when performed many times, different lookup classes are used
// depending on the number of labels specified. A cache is used for the
// common case of repeated queries for the same label value.
template <typename T>
struct vtkLabelMapLookup
{
T CachedValue;
T CachedOutValue;
bool CachedOutValueInitialized;
vtkLabelMapLookup(const double* values, int vtkNotUsed(numValues))
{
this->CachedValue = static_cast<T>(values[0]);
this->CachedOutValue = static_cast<T>(values[0]);
this->CachedOutValueInitialized = false;
}
virtual ~vtkLabelMapLookup() = default;
virtual bool IsLabelValue(T label) = 0;
bool IsLabelValueInCache(T label, bool& inLabelSet)
{
if (label == this->CachedValue)
{
inLabelSet = true;
return true;
}
else if (this->CachedOutValueInitialized && label == this->CachedOutValue)
{
inLabelSet = false;
return true;
}
else
{
return false;
}
}
// A little factor for creating the right type of label map based on the
// number of labels in the set.
static vtkLabelMapLookup<T>* CreateLabelLookup(const double* values, vtkIdType numLabels);
}; // vtkLabelMapLookup
// Cache a single contour value
template <typename T>
struct SingleLabelValue : public vtkLabelMapLookup<T>
{
SingleLabelValue(const double* values)
: vtkLabelMapLookup<T>(values, 1)
{
}
bool IsLabelValue(T label) override { return label == this->CachedValue; }
}; // SingleLabelValue
// Represent a few contour values with a std::vector<>
template <typename T>
struct LabelVector : public vtkLabelMapLookup<T>
{
std::vector<T> Map;
LabelVector(const double* values, int numValues)
: vtkLabelMapLookup<T>(values, numValues)
{
for (int vidx = 0; vidx < numValues; vidx++)
{
Map.push_back(static_cast<T>(values[vidx]));
}
}
bool IsLabelValue(T label) override
{
bool inLabelSet;
// Check the cache
if (this->IsLabelValueInCache(label, inLabelSet))
{
return inLabelSet;
}
// Not in the cache, check the vector
if (std::find(this->Map.begin(), this->Map.end(), label) != this->Map.end())
{
this->CachedValue = label;
return true;
}
else
{
this->CachedOutValue = label;
this->CachedOutValueInitialized = true;
return false;
}
}
}; // LabelVector
// Represent many contour values with a std::set<>
template <typename T>
struct LabelSet : public vtkLabelMapLookup<T>
{
std::unordered_set<T> Map;
LabelSet(const double* values, int numValues)
: vtkLabelMapLookup<T>(values, numValues)
{
for (int vidx = 0; vidx < numValues; vidx++)
{
Map.insert(static_cast<T>(values[vidx]));
}
}
bool IsLabelValue(T label) override
{
bool inLabelSet;
// Check the cache
if (this->IsLabelValueInCache(label, inLabelSet))
{
return inLabelSet;
}
// Not in cache, check the map
if (this->Map.find(label) != this->Map.end())
{
this->CachedValue = label;
return true;
}
else
{
this->CachedOutValue = label;
this->CachedOutValueInitialized = true;
return false;
}
}
}; // LabelSet
// Given a list of label values (represented generically as doubles),
// create the appropriate lookup class and add the label values to
// the collection of labels.
template <typename T>
vtkLabelMapLookup<T>* vtkLabelMapLookup<T>::CreateLabelLookup(
const double* values, vtkIdType numLabels)
{
// These cutoffs are empirical and can be changed.
if (numLabels == 1)
{
return new SingleLabelValue<T>(values);
}
else if (numLabels < 20)
{
return new LabelVector<T>(values, numLabels);
}
else
{
return new LabelSet<T>(values, numLabels);
}
}
VTK_ABI_NAMESPACE_END
#endif
// VTK-HeaderTest-Exclude: vtkLabelMapLookup.h
|
