-
Notifications
You must be signed in to change notification settings - Fork 0
/
entropy_optimiser.hpp
186 lines (169 loc) · 4.32 KB
/
entropy_optimiser.hpp
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
#ifndef ENTROPY_OPTIMISER_HEADER
#define ENTROPY_OPTIMISER_HEADER
#include "symbolstats.hpp"
#include "entropy_estimation.hpp"
#include "table_encode.hpp"
#include "numerics.hpp"
/*
heuristic for entropy mapping
*/
uint8_t entropy_map_initial(
uint8_t* in_bytes,
uint32_t range,
uint32_t width,
uint32_t height,
uint8_t*& entropy_image,
uint32_t& entropyWidth,
uint32_t& entropyHeight,
uint32_t entropyWidth_block,
uint32_t entropyHeight_block,
uint8_t contextNumber
){
if(entropyWidth_block == 0){
entropyWidth_block = 8;
}
if(entropyHeight_block == 0){
entropyHeight_block = 8;
}
entropyWidth = (width + entropyWidth_block - 1)/entropyWidth_block;
entropyHeight = (height + entropyWidth_block - 1)/entropyWidth_block;
if(contextNumber == 0){
if(((width + height) + 255)/256 > 255){
contextNumber = 255;
}
else{
contextNumber = ((width + height) + 255)/256;
}
}
SymbolStats defaultFreqs;
defaultFreqs.count_freqs(in_bytes, width*height);
double* costTable = entropyLookup(defaultFreqs,width*height);
double entropyMap[entropyWidth*entropyHeight];
double sortedEntropies[entropyWidth*entropyHeight];
for(size_t i=0;i<entropyWidth*entropyHeight;i++){
double region = regionalEntropy(
in_bytes,
costTable,
i,
width,
height,
entropyWidth_block,
entropyHeight_block
);
entropyMap[i] = region;
sortedEntropies[i] = region;
}
delete[] costTable;
qsort(sortedEntropies, entropyWidth*entropyHeight, sizeof(double), compare);
double pivots[contextNumber];
for(size_t i=0;i<contextNumber;i++){
pivots[i] = sortedEntropies[(entropyWidth*entropyHeight * (i+1))/contextNumber - 1];
}
entropy_image = new uint8_t[entropyWidth*entropyHeight];
for(size_t i=0;i<entropyWidth*entropyHeight;i++){
for(size_t j=0;j<contextNumber;j++){
if(entropyMap[i] <= pivots[j]){
entropy_image[i] = j;
break;
}
}
}
return contextNumber;
}
/*
try shuffling blocks around
returns the new number of contexts
modifies the entropy image and the stats
*/
uint32_t entropy_redistribution_pass(
uint8_t* in_bytes,
uint32_t range,
uint32_t width,
uint32_t height,
uint8_t*& entropy_image,
uint32_t contexts,
uint32_t entropy_width,
uint32_t entropy_height,
SymbolStats* entropy_stats
){
uint32_t entropy_width_block = (width + entropy_width - 1)/entropy_width;
uint32_t entropy_height_block = (height + entropy_height - 1)/entropy_height;
double* costTables[contexts];
for(size_t i=0;i<contexts;i++){
costTables[i] = entropyLookup(entropy_stats[i]);
}
size_t contextsUsed[contexts];
for(size_t i=0;i<contexts;i++){
contextsUsed[i] = 0;
}
for(size_t i=0;i<entropy_width*entropy_height;i++){
double regions[contexts];
for(size_t pred=0;pred<contexts;pred++){
regions[pred] = regionalEntropy(
in_bytes,
costTables[pred],
i,
width,
height,
entropy_width_block,
entropy_height_block
);
}
double best = regions[0];
entropy_image[i] = 0;
for(size_t pred=1;pred<contexts;pred++){
if(regions[pred] < best){
best = regions[pred];
entropy_image[i] = pred;
}
}
contextsUsed[entropy_image[i]]++;
}
//free memory
for(size_t i=0;i<contexts;i++){
delete[] costTables[i];
}
//update stats
for(size_t context = 0;context < contexts;context++){
for(size_t i=0;i<256;i++){
entropy_stats[context].freqs[i] = 0;
}
}
for(size_t i=0;i<width*height;i++){
uint8_t cntr = entropy_image[tileIndexFromPixel(
i,
width,
entropy_width,
entropy_width_block,
entropy_height_block
)];
entropy_stats[cntr].freqs[in_bytes[i]]++;
}
//shrink symbol stats available
uint32_t index = 0;
uint8_t mapping[contexts];
for(size_t i=0;i<contexts;i++){
mapping[i] = index;
if(contextsUsed[i]){
entropy_stats[index++] = entropy_stats[i];
}
}
for(size_t i=0;i<entropy_width*entropy_height;i++){
entropy_image[i] = mapping[entropy_image[i]];
}
return index;//new number of contexts
}
/* check impact of merging two contexts. negative means they will benefit from merging */
double context_merging(
SymbolStats stats1,
SymbolStats stats2,
uint32_t range
){
double initial = estimateEntropy_overhead(stats1, range) + estimateEntropy_overhead(stats2, range);
SymbolStats merged;
for(size_t i=0;i<256;i++){
merged.freqs[i] = stats1.freqs[i] + stats2.freqs[i];
}
return estimateEntropy_overhead(merged, range) - initial;
}
#endif //ENTROPY_OPTIMISER