-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathframeSign.cpp
More file actions
405 lines (380 loc) · 15.5 KB
/
frameSign.cpp
File metadata and controls
405 lines (380 loc) · 15.5 KB
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
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
//
// Created by Occulticplus on 2019/11/12.
//
#define debug_msg1
#define debug_bound1
#include "frameSign.h"
namespace frameSign {
int debug_list[] = {1, 2, 3, 4, 5, 6, 7};
int debug_list_len = 7;
int debug_list_counter = 0;
float msk[8][8] = {{16, 11, 10, 16, 24, 40, 51, 61},
{12, 12, 14, 19, 26, 58, 60, 55},
{14, 13, 16, 24, 40, 57, 69, 56},
{14, 17, 22, 29, 51, 87, 80, 62},
{18, 22, 37, 56, 68, 109, 103, 77},
{24, 35, 55, 64, 81, 104, 113, 92},
{49, 64, 78, 87, 103, 121, 120, 101},
{72, 92, 95, 98, 112, 100, 103, 99}};
float pi = acos(-1.0);
float A[8][8], At[8][8];
pixel grab_msg[1000], join_msg[1000];
int grab_counter = 0, join_counter = 0;
const int max_append_zero_len = 8 * 8 - 1;
void initDctMat() //计算8x8块的离散余弦变换系数
{
for (int i = 0; i < 8; ++i) {
for (int j = 0; j < 8; ++j) {
float a;
if (i == 0)
a = sqrt(1.0 / 8.0);
else
a = sqrt(2.0 / 8.0);
At[j][i] = A[i][j] = a * cos((j + 0.5) * pi * i / 8);
}
}
}
void mat_mul(float *A, float *B, float *res, int a, int b, int c) { // Mat A(a*b) multiple with Mat B (b*c)
int linelen = c;
for (int i = 0; i < a; i++) {
for (int j = 0; j < c; j++) {
at(res, i, j) = 0;
for (int k = 0; k < b; k++) {
at(res, i, j) += at(A, i, k) * at(B, k, j);
}
}
}
}
void split_pixel(pixel *inl, pixel *outl, int bitlen, int bits = 2, int bounds = INF, int bits_for_input = 8) {
pixel counter = 0, p = 0;
while (counter < bitlen) {
pixel pini = counter % bits_for_input, pino = counter % bits;
pixel v = inl[counter / bits_for_input] & (1 << pini);
if (counter % bits == 0) {
p++;
if (p >= bounds) {
cerr << "Error: split_pixel() out of bounds!" << endl;
return;
}
outl[p] = 0;
}
outl[p] += (v << pino);
counter++;
}
}
void comb_pixel(pixel *inl, pixel *outl, int bitlen, int bits = 2, int bounds = INF) {
split_pixel(inl, outl, bitlen, 8, INF, bits);
}
pixel bit_message(pixel *inl, int counter) {
// little-endian order.
pixel a = counter / 8, b = counter % 8;
return (inl[a] & (1 << b)) > 0 ? 1 : 0;
}
// void solve(float *inp, pixel msg, bool isend = false, int linelen = 8, int bits = 2) {
// int layer = 14 - bits;
// for (int i = layer; i >= 0; i--) {
// if (layer - i >= 8 || i >= 8) continue;
// if (msg ==)
// }
// }
void dct_frame(float *inp, int height, int width, bool isgrab = false) {
#ifdef debug_msg
debug_list_counter = 0;
#endif
float res[8][8];
float slice[8][8];
int __height = (height >> 3) << 3, __width = (width >> 3) << 3;
int linelen = width;
int wtf = 0;
for (int i = 0; i < __height; i += 8) {
for (int j = 0; j < __width; j += 8) {
for (int ii = 0; ii < 8; ii++) {
for (int jj = 0; jj < 8; jj++) {
slice[ii][jj] = at(inp, i + ii, j + jj);
}
}
#ifdef debug_msg
static int check_grab_counter0 = 0;
if (debug_list_counter < debug_list_len &&
(!isgrab && check_grab_counter0 == debug_list[debug_list_counter])) {
cout << "debug block INIT " << check_grab_counter0 << endl;
for (int ii = 0; ii < 8; ii++) {
for (int jj = 0; jj < 8; jj++) {
cout << slice[ii][jj] << " , ";
}
cout << endl;
}
if (!isgrab) debug_list_counter++;
}
if (!isgrab) check_grab_counter0++;
#endif
mat_mul((float *) A, (float *) slice, (float *) res, 8, 8, 8);
mat_mul((float *) res, (float *) At, (float *) slice, 8, 8, 8);
#ifdef debug_msg
static int check_counter = 0;
static int check_grab_counter = 0;
if (debug_list_counter < debug_list_len &&
(isgrab && check_grab_counter == debug_list[debug_list_counter])) {
cout << "debug block " << check_grab_counter << endl;
for (int ii = 0; ii < 8; ii++) {
for (int jj = 0; jj < 8; jj++) {
cout << slice[ii][jj] << ' ';
}
cout << endl;
}
debug_list_counter++;
}
if (isgrab) check_grab_counter++;
#endif
if (isgrab) {
float a = 0, b = 0;
int layer = 7;
for (int ii = layer; ii >= 4; ii--) {
a += slice[layer - ii][ii];
}
for (int ii = 3; ii >= 0; ii--) {
b += slice[layer - ii][ii];
}
#ifdef debug_msg
cout << "Get sum " << grab_counter << ": " << a << " , " << b << endl;
#endif
#ifdef mode_EOF
if (a - b < 4 && b - a < 4) {
// read EOF.
isgrab = false;
} else {
if (a - b > 8) {
grab_msg[grab_counter++] = 1;
} else if (b - a > 8) {
grab_msg[grab_counter++] = 0;
} else {
grab_counter++;
cerr << "cannot understand message." << endl;
}
}
#else // mode_zeros
if (a - b > 0) {
grab_msg[grab_counter++] = 1;
if (wtf >= max_append_zero_len) {
// read ...0001, which is end of message.
// cout << "read the end of message" << endl;
if (grab_counter % 8 != 0) {
cout << "Error: the message does not align to 8." << endl;
cout << "Get Total bits: " << grab_counter << endl;
}
isgrab = false;
}
wtf = 0;
} else if (b - a > 0) {
grab_msg[grab_counter++] = 0;
wtf++;
} else {
grab_counter++;
cerr << "cannot understand message." << endl;
}
#endif
#ifdef debug_msg
cout << grab_counter - 1 << ": " << (int) grab_msg[grab_counter - 1] << endl;
#endif
}
for (int ii = 0; ii < 8; ii++) {
for (int jj = 0; jj < 8; jj++) {
at(inp, i + ii, j + jj) = slice[ii][jj];
}
}
}
}
}
void idct_frame(float *inp, int height, int width, bool isjoin = false, pixel *join_msg = nullptr, int msglen = 0) {
#ifdef debug_msg
debug_list_counter = 0;
#endif
float res[8][8];
float slice[8][8];
int __height = (height >> 3) << 3, __width = (width >> 3) << 3;
int linelen = width;
for (int i = 0; i < __height; i += 8) {
for (int j = 0; j < __width; j += 8) {
for (int ii = 0; ii < 8; ii++) {
for (int jj = 0; jj < 8; jj++) {
slice[ii][jj] = at(inp, i + ii, j + jj);
}
}
#ifdef debug_msg
static int check_counter = 0;
if (debug_list_counter < debug_list_len && check_counter == debug_list[debug_list_counter]) {
cout << "debug block " << check_counter << endl;
for (int ii = 0; ii < 8; ii++) {
for (int jj = 0; jj < 8; jj++) {
cout << slice[ii][jj] << ' ';
}
cout << endl;
}
debug_list_counter++;
}
check_counter++;
#endif
if (isjoin) {
const int layer = 7;
float a = 0, b = 0;
for (int ii = layer; ii >= 4; ii--) {
a += slice[layer - ii][ii];
b += slice[layer + 4 - ii][ii - 4];
}
if (join_counter == msglen) {
#ifdef mode_EOF
// insert EOF
static int EOF_counter = 0;
cout << "insert EOF " << EOF_counter << endl;
if (a > b) {
int des = floor((a - b) / 8);
for (int ii = layer; ii >= 4; ii--) {
slice[layer - ii][ii] -= des;
slice[layer + 4 - ii][ii - 4] += des;
}
} else {
int des = floor((b - a) / 8);
for (int ii = layer; ii >= 4; ii--) {
slice[layer - ii][ii] += des;
slice[layer + 4 - ii][ii - 4] -= des;
}
}
#ifdef debug_msg
for (int ii = layer; ii >= 0; ii--) {
cout << slice[layer - ii][ii] << ' ';
}
cout << endl;
float a1 = 0, b1 = 0;
for (int ii = layer; ii >= 4; ii--) {
a1 += slice[layer - ii][ii];
b1 += slice[layer + 4 - ii][ii - 4];
}
cout << "EOF sum is :" << a1 << " " << b1 << endl;
#endif
#endif
isjoin = false;
} else {
grab_msg[join_counter] = bit_message(join_msg, join_counter);
// cout << "insert message bit " << join_counter << ':'
// << (int) bit_message(join_msg, join_counter) << endl;
int des = 0;
if (bit_message(join_msg, join_counter) == 1) {
// cout << a << ' ' << b << endl;
if (a - b < -32) {
des = ceil((64 - (a - b)) / 8);
// cout << "des1 is " << des << endl;
for (int ii = layer; ii >= 4; ii--) {
slice[layer - ii][ii] += des;
slice[layer + 4 - ii][ii - 4] -= des;
}
} else if (a - b < 16) {
des = ceil((16 - (a - b)) / 8);
// cout << "des1 is " << des << endl;
for (int ii = layer; ii >= 4; ii--) {
slice[layer - ii][ii] += des;
slice[layer + 4 - ii][ii - 4] -= des;
}
}
} else {
// cout << a << ' ' << b << endl;
if (b - a < -32) {
des = ceil((64 - (b - a)) / 8);
// cout << "des0 is " << des << endl;
for (int ii = layer; ii >= 4; ii--) {
slice[layer - ii][ii] -= des;
slice[layer + 4 - ii][ii - 4] += des;
}
} else if (b - a < 16) {
des = ceil((16 - (b - a)) / 8);
// cout << "des0 is " << des << endl;
for (int ii = layer; ii >= 4; ii--) {
slice[layer - ii][ii] -= des;
slice[layer + 4 - ii][ii - 4] += des;
}
}
}
#ifdef debug_bound
#endif
}
join_counter++;
}
mat_mul((float *) At, (float *) slice, (float *) res, 8, 8, 8);
mat_mul((float *) res, (float *) A, (float *) slice, 8, 8, 8);
for (int ii = 0; ii < 8; ii++) {
for (int jj = 0; jj < 8; jj++) {
if (slice[ii][jj] < 0) at(inp, i + ii, j + jj) = 0;
else if (slice[ii][jj] > 255) at(inp, i + ii, j + jj) = 255;
else
at(inp, i + ii, j + jj) = slice[ii][jj];
}
}
}
}
}
void join_message(AVFrame *frame, pixel *sign, int height, int width, pixel *join_msg, int msglen) {
#ifdef debug_msg
debug_list_counter = 0;
for (int i = 0; i < 20; i++) {
cout << (int) join_msg[i] << ' ';
}
#endif
initDctMat();
join_counter = 0;
msglen *= 8; // input msglen is bytes long. This module uses as bits long.
pixel *mat = frame->data[0];
float *precise_mat = new float[height * width];
int linelen = width;
for (int i = 0; i < height; i++) {
for (int j = 0; j < width; j++) {
at(precise_mat, i, j) = (float) at(mat, i, j);
}
}
dct_frame((float *) precise_mat, height, width);
idct_frame((float *) precise_mat, height, width, true, join_msg,
msglen); // join message write in idct_frame, because grabbing message do not affect message.
#ifdef debug_msg
cout << "join message:" << endl;
for (int i = 0; i < join_counter; i++) {
cout << (int) grab_msg[i] << ' ';
}
cout << endl;
#endif
for (int i = 0; i < height; i++) {
for (int j = 0; j < width; j++) {
at(mat, i, j) = at(precise_mat, i, j);
}
}
}
pixel *grab_message(AVFrame *frame, pixel *out, int height, int width) {
#ifdef debug_msg
debug_list_counter = 0;
#endif
initDctMat();
grab_counter = 0;
pixel *mat = frame->data[0];
float *precise_mat = new float[height * width];
int linelen = width;
for (int i = 0; i < height; i++) {
for (int j = 0; j < width; j++) {
at(precise_mat, i, j) = (float) at(mat, i, j);
}
}
dct_frame((float *) precise_mat, height, width, true);
int p = 0;
for (int i = 0; i < grab_counter; i++) {
if (i % 8 == 0 && i > 0) {
p++;
}
out[p] += ((grab_msg[i] & 1) << (i % 8));
#ifdef debug_msg
cout << (int) grab_msg[i] << ' ';
#endif
}
// cout << endl;
join_counter = p + 1;
return out;
}
int grab_message_length() {
return join_counter;
}
}