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
193
194
195
196
197
198
199
200
|
/*=========================================================================
Program: GDCM (Grassroots DICOM). A DICOM library
Copyright (c) 2006-2011 Mathieu Malaterre
All rights reserved.
See Copyright.txt or http://gdcm.sourceforge.net/Copyright.html 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.
=========================================================================*/
#include "gdcmSegmentedPaletteColorLookupTable.h"
#include "gdcmDataSet.h"
// http://blog.goo.ne.jp/satomi_takeo/e/3643e5249b2a9650f9e10ef1c830e8b8
//
#include <map>
#include <algorithm>
#include <iterator>
#include <vector>
#include <deque>
namespace gdcm
{
// abstract class for segment.
template <typename EntryType>
class Segment {
public:
virtual ~Segment() = default;
using SegmentMap = std::map<const EntryType *, const Segment *>;
virtual bool Expand(const SegmentMap& instances,
std::vector<EntryType>& expanded) const = 0;
const EntryType* First() const { return _first; }
const EntryType* Last() const { return _last; }
struct ToMap {
std::pair<
typename SegmentMap::key_type,
typename SegmentMap::mapped_type
>
operator()(const Segment* segment) const
{ return std::make_pair(segment->First(), segment); }
};
protected:
Segment(const EntryType* first, const EntryType* last) {
_first = first; _last = last;
}
const EntryType* _first;
const EntryType* _last;
};
// discrete segment (opcode = 0)
template <typename EntryType>
class DiscreteSegment : public Segment<EntryType> {
public:
using SegmentMap = typename Segment<EntryType>::SegmentMap;
DiscreteSegment(const EntryType* first)
: Segment<EntryType>(first, first+2+*(first+1)) {}
bool Expand(const SegmentMap&,
std::vector<EntryType>& expanded) const override
{
std::copy(this->_first + 2, this->_last, std::back_inserter(expanded));
return true;
}
};
// linear segment (opcode = 1)
template <typename EntryType>
class LinearSegment : public Segment<EntryType> {
public:
using SegmentMap = typename Segment<EntryType>::SegmentMap;
LinearSegment(const EntryType* first)
: Segment<EntryType>(first, first+3) {}
bool Expand(const SegmentMap&,
std::vector<EntryType>& expanded) const override
{
if ( expanded.empty() ) {
// linear segment can't be the first segment.
return false;
}
EntryType length = *(this->_first + 1);
EntryType y0 = expanded.back();
EntryType y1 = *(this->_first + 2);
double y01 = y1 - y0;
for ( EntryType i = 0; i <length; ++i ) {
double value_float
= static_cast<double>(y0)
+ (static_cast<double>(i)/static_cast<double>(length)) * y01;
EntryType value_int = static_cast<EntryType>(value_float + 0.5);
expanded.push_back(value_int);
}
return true;
}
};
// indirect segment (opcode = 2)
template <typename EntryType>
class IndirectSegment : public Segment<EntryType> {
public:
using SegmentMap = typename Segment<EntryType>::SegmentMap;
IndirectSegment(const EntryType* first)
: Segment<EntryType>(first, first+2+4/sizeof(EntryType)) {}
bool Expand(const SegmentMap& instances,
std::vector<EntryType>& expanded) const override
{
if ( instances.empty() ) {
// some other segments are required as references.
return false;
}
const EntryType* first_segment = instances.begin()->first;
const unsigned short* pOffset
= reinterpret_cast<const unsigned short*>(this->_first + 2);
unsigned long offsetBytes
= (*pOffset) | (static_cast<unsigned long>(*(pOffset + 1)) << 16);
const EntryType* copied_part_head
= first_segment + offsetBytes / sizeof(EntryType);
typename SegmentMap::const_iterator ppHeadSeg = instances.find(copied_part_head);
if ( ppHeadSeg == instances.end() ) {
// referred segment not found
return false;
}
EntryType nNumCopies = *(this->_first + 1);
typename SegmentMap::const_iterator ppSeg = ppHeadSeg;
while ( std::distance(ppHeadSeg, ppSeg) <nNumCopies ) {
assert( ppSeg != instances.end() );
ppSeg->second->Expand(instances, expanded);
++ppSeg;
}
return true;
}
};
template <typename EntryType>
void ExpandPalette(const EntryType* raw_values, uint32_t length,
std::vector<EntryType>& palette)
{
using SegmentList = std::deque<Segment<EntryType> *>;
SegmentList segments;
const EntryType* raw_seg = raw_values;
while ( (std::distance(raw_values, raw_seg) * sizeof(EntryType)) <length ) {
Segment<EntryType>* segment = nullptr;
if ( *raw_seg == 0 ) {
segment = new DiscreteSegment<EntryType>(raw_seg);
} else if ( *raw_seg == 1 ) {
segment = new LinearSegment<EntryType>(raw_seg);
} else if ( *raw_seg == 2 ) {
segment = new IndirectSegment<EntryType>(raw_seg);
}
if ( segment ) {
segments.push_back(segment);
raw_seg = segment->Last();
} else {
// invalid opcode
break;
}
}
typename Segment<EntryType>::SegmentMap instances;
std::transform(segments.begin(), segments.end(),
std::inserter(instances, instances.end()), typename Segment<EntryType>::ToMap());
typename SegmentList::iterator ppSeg = segments.begin();
typename SegmentList::iterator endOfSegments = segments.end();
for ( ; ppSeg != endOfSegments; ++ppSeg ) {
(*ppSeg)->Expand(instances, palette);
}
ppSeg = segments.begin();
for ( ; ppSeg != endOfSegments; ++ppSeg ) {
delete *ppSeg;
}
}
SegmentedPaletteColorLookupTable::SegmentedPaletteColorLookupTable()
= default;
SegmentedPaletteColorLookupTable::~SegmentedPaletteColorLookupTable()
= default;
void SegmentedPaletteColorLookupTable::SetLUT(LookupTableType type, const unsigned char *array,
unsigned int length)
{
if( BitSample == 8 )
{
assert(0); // TODO
}
else if( BitSample == 16 )
{
const uint16_t *array16 = (const uint16_t*)(const void*)array;
const uint16_t *segment_values = array16;
std::vector<uint16_t> palette;
unsigned int num_entries = GetLUTLength(type);
palette.reserve(num_entries);
assert( length % 2 == 0 );
// FIXME: inplace byteswapping (BAD!)
SwapperNoOp::SwapArray(const_cast<uint16_t*>(segment_values),length/2);
ExpandPalette(segment_values, length, palette);
LookupTable::SetLUT(type, (unsigned char*)&palette[0], (unsigned int)(palette.size() * 2));
}
}
} // end namespace gdcm
|
