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
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
|
/*
//
// Copyright 1997-2011 Torsten Rohlfing
//
// Copyright 2004-2011 SRI International
//
// This file is part of the Computational Morphometry Toolkit.
//
// http://www.nitrc.org/projects/cmtk/
//
// The Computational Morphometry Toolkit is free software: you can
// redistribute it and/or modify it under the terms of the GNU General Public
// License as published by the Free Software Foundation, either version 3 of
// the License, or (at your option) any later version.
//
// The Computational Morphometry Toolkit is distributed in the hope that it
// will be useful, but WITHOUT ANY WARRANTY; without even the implied
// warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License along
// with the Computational Morphometry Toolkit. If not, see
// <http://www.gnu.org/licenses/>.
//
// $Revision: 5436 $
//
// $LastChangedDate: 2018-12-10 19:01:20 -0800 (Mon, 10 Dec 2018) $
//
// $LastChangedBy: torstenrohlfing $
//
*/
#include <Base/cmtkTypedArray.h>
#include <Base/cmtkTemplateArray.h>
#include <math.h>
namespace
cmtk
{
/** \addtogroup Base */
//@{
void
TypedArray
::RescaleToRange( const Types::DataItemRange& toRange )
{
const Types::DataItemRange fromRange = this->GetRange();
const Types::DataItem scale = toRange.Width() / fromRange.Width();
const Types::DataItem offset = toRange.m_LowerBound - (fromRange.m_LowerBound * scale);
this->Rescale( scale, offset );
}
void
TypedArray
::BlockSwap
( const size_t fromOffset, const size_t toOffset, const size_t blockLength )
{
char buffer[2048];
size_t itemSize = this->GetItemSize();
char *dataPtr = static_cast<char*>( this->GetDataPtr() );
size_t bytesToGo = itemSize * blockLength;
char *fromPtr = dataPtr + itemSize * fromOffset;
char *toPtr = dataPtr + itemSize * toOffset;
while ( bytesToGo > sizeof( buffer ) )
{
memcpy( buffer, toPtr, sizeof( buffer ) );
memcpy( toPtr, fromPtr, sizeof( buffer ) );
memcpy( fromPtr, buffer, sizeof( buffer ) );
fromPtr += sizeof( buffer );
toPtr += sizeof( buffer );
bytesToGo -= sizeof( buffer );
}
if ( bytesToGo )
{
memcpy( buffer, toPtr, bytesToGo );
memcpy( toPtr, fromPtr, bytesToGo );
memcpy( fromPtr, buffer, bytesToGo );
}
}
void
TypedArray
::BlockReverse
( const size_t fromOffset, const size_t blockLength )
{
// we get into trouble here for item sizes > 128 bits.
char buffer[16];
size_t itemSize = this->GetItemSize();
char *dataPtr = static_cast<char*>( this->GetDataPtr() );
char *fromPtr = dataPtr + fromOffset * itemSize;
char *toPtr = fromPtr + (blockLength-1) * itemSize;
for ( size_t itemsToGo = blockLength / 2; itemsToGo; --itemsToGo )
{
memcpy( buffer, toPtr, itemSize );
memcpy( toPtr, fromPtr, itemSize );
memcpy( fromPtr, buffer, itemSize );
fromPtr += itemSize;
toPtr -= itemSize;
}
}
TypedArray::SmartPtr
TypedArray
::Create
( const ScalarDataType dtype, void *const data, const size_t size, const bool paddingFlag, const void* paddingData, const Memory::DeallocatorFunctionPointer deallocator )
{
switch (dtype)
{
case TYPE_BYTE:
return Self::SmartPtr( new ByteArray( data, size, paddingFlag, paddingData, deallocator ) );
break;
case TYPE_CHAR:
return Self::SmartPtr( new CharArray( data, size, paddingFlag, paddingData, deallocator ) );
break;
case TYPE_SHORT:
return Self::SmartPtr( new ShortArray( data, size, paddingFlag, paddingData, deallocator ) );
break;
case TYPE_USHORT:
return Self::SmartPtr( new UShortArray( data, size, paddingFlag, paddingData, deallocator ) );
break;
case TYPE_INT:
return Self::SmartPtr( new IntArray( data, size, paddingFlag, paddingData, deallocator ) );
break;
case TYPE_UINT:
return Self::SmartPtr( new UIntArray( data, size, paddingFlag, paddingData, deallocator ) );
break;
case TYPE_FLOAT:
return Self::SmartPtr( new FloatArray( data, size, paddingFlag, paddingData, deallocator ) );
break;
case TYPE_DOUBLE:
return Self::SmartPtr( new DoubleArray( data, size, paddingFlag, paddingData, deallocator ) );
break;
default:
break;
}
fprintf(stderr,"TypedArray::Create - Data type %d unknown.",dtype);
return Self::SmartPtr();
}
TypedArray::SmartPtr
TypedArray
::Create( const ScalarDataType dtype, const size_t size )
{
switch ( dtype )
{
case TYPE_BYTE:
return Self::SmartPtr( new ByteArray( size ) );
break;
case TYPE_CHAR:
return Self::SmartPtr( new CharArray( size ) );
break;
case TYPE_SHORT:
return Self::SmartPtr( new ShortArray( size ) );
break;
case TYPE_USHORT:
return Self::SmartPtr( new UShortArray( size ) );
break;
case TYPE_INT:
return Self::SmartPtr( new IntArray( size ) );
break;
case TYPE_UINT:
return Self::SmartPtr( new UIntArray( size ) );
break;
case TYPE_FLOAT:
return Self::SmartPtr( new FloatArray( size ) );
break;
case TYPE_DOUBLE:
return Self::SmartPtr( new DoubleArray( size ) );
break;
default:
break;
}
fprintf( stderr, "TypedArray::Create - Data type %d unknown.", dtype );
return Self::SmartPtr();
}
void
TypedArray
::PruneHistogram
( const bool pruneHi, const bool pruneLo, const size_t numberOfBinsTarget, const size_t numberOfBinsInternal )
{
Histogram<unsigned int>::SmartPtr originalHistogram( this->GetHistogram( numberOfBinsInternal ) );
const size_t oneBinFraction = this->GetDataSize() / numberOfBinsTarget;
const Types::DataItemRange range = this->GetRange();
Types::DataItem min = range.m_LowerBound;
Types::DataItem max = range.m_UpperBound;
if ( pruneHi )
{
size_t accumulatedNumberOfSamples = 0;
for ( size_t binIdx = numberOfBinsInternal-1; binIdx > 0; --binIdx )
{
accumulatedNumberOfSamples += (*originalHistogram)[binIdx];
if ( accumulatedNumberOfSamples > oneBinFraction )
{
max = range.m_LowerBound + range.Width()/numberOfBinsInternal*binIdx;
break;
}
}
}
if ( pruneLo )
{
size_t accumulatedNumberOfSamples = 0;
for ( size_t binIdx = 0; binIdx < numberOfBinsInternal; ++binIdx )
{
accumulatedNumberOfSamples += (*originalHistogram)[binIdx];
if ( accumulatedNumberOfSamples > oneBinFraction )
{
min = range.m_LowerBound + range.Width()/numberOfBinsInternal*binIdx;
break;
}
}
}
this->Threshold( Types::DataItemRange( min, max ) );
}
} // namespace cmtk
|
