Mercurial > hg > wm
annotate Meerwald/wm_bruyn_d.c @ 18:3bdb67e76858
mse opt.
| author | Peter Meerwald <pmeerw@cosy.sbg.ac.at> |
|---|---|
| date | Fri, 30 Jan 2009 12:46:49 +0100 |
| parents | 4987db85cfae |
| children | bd669312f068 |
| rev | line source |
|---|---|
| 0 | 1 #include "wm.h" |
| 2 #include "signature.h" | |
| 3 #include "coord.h" | |
| 4 #include "gray.h" | |
| 5 #include "sort.h" | |
| 6 #include "bruyn_common.h" | |
| 7 #include "pgm.h" | |
| 8 | |
| 9 char *progname; | |
| 10 | |
| 11 // prints out program's parameters | |
| 12 void usage(void) { | |
| 13 fprintf(stderr, "usage: %s [-b n] [-h] [-k] [-n n] [-o file] [-pP n] [-q n] [-tT n] [-v n] -s file file\n", progname); | |
| 14 fprintf(stderr, "\t-b n\t\tblock size\n"); | |
| 15 fprintf(stderr, "\t-h\t\tprint usage\n"); | |
| 16 fprintf(stderr, "\t-k\t\tdisable block skipping\n"); | |
| 17 fprintf(stderr, "\t-n n\t\tnumber of signature bits to detect\n"); | |
| 18 fprintf(stderr, "\t-o file\t\textracted signature file\n"); | |
| 19 fprintf(stderr, "\t-p n\t\tpattern type for zone 1\n"); | |
| 20 fprintf(stderr, "\t-P n\t\tpattern type for zone 2\n"); | |
| 21 fprintf(stderr, "\t-q n\t\tsignature strength\n"); | |
| 22 fprintf(stderr, "\t-s file\t\tembedded signature\n"); | |
| 23 fprintf(stderr, "\t-t n\t\tthreshold for noise\n"); | |
| 24 fprintf(stderr, "\t-T n\t\tthreshold for slope\n"); | |
| 25 fprintf(stderr, "\t-v n\t\tverbosity level\n"); | |
| 26 exit(0); | |
| 27 } | |
| 28 | |
| 29 int main(int argc, char *argv[]) { | |
| 30 FILE *in = stdin; | |
| 31 FILE *out = stdout; | |
| 32 FILE *sig = NULL; | |
| 33 | |
| 34 gray** image; | |
| 35 gray **block; | |
| 36 gray **zone; | |
| 37 gray **category1, **category2; | |
| 38 gray maxval; | |
| 39 double *slope; | |
| 8 | 40 int rows, cols, format; |
| 0 | 41 int c; |
| 42 int i, j; | |
| 43 int n; | |
| 44 int col, row; | |
| 45 int n_block; | |
| 46 | |
| 47 char signature_name[MAXPATHLEN]; | |
| 48 char input_name[MAXPATHLEN] = "(stdin)"; | |
| 49 char output_name[MAXPATHLEN] = "(stdout)"; | |
| 50 | |
| 51 double quality = 0.0; | |
| 52 double threshold_noise = 0.0; | |
| 53 double threshold_slope = 0.0; | |
| 54 int pattern1 = 0; | |
| 55 int pattern2 = 0; | |
| 56 int blocksize = 0; | |
| 57 int seed; | |
| 58 | |
| 59 int verbose = 0; | |
| 60 int skipping = 0; | |
| 61 | |
| 62 struct coords *coords; | |
| 63 | |
| 64 progname = argv[0]; | |
| 65 | |
| 66 pgm_init(&argc, argv); wm_init2(); | |
| 67 | |
| 68 // parse command line and set options | |
| 69 while ((c = getopt(argc, argv, "b:h?n:o:p:P:q:s:t:T:v:k")) != EOF) { | |
| 70 switch (c) { | |
| 71 case 'h': | |
| 72 case '?': | |
| 73 usage(); | |
| 74 break; | |
| 75 case 'k': | |
| 76 skipping = 1; | |
| 77 break; | |
| 78 case 'n': | |
| 79 nbit_signature = atoi(optarg); | |
| 80 if (nbit_signature <= 0 || nbit_signature > NBITSIGNATURE) { | |
| 81 fprintf(stderr, "%s: invalid signature length %d\n", progname, nbit_signature); | |
| 82 exit(1); | |
| 83 } | |
| 84 break; | |
| 85 case 'o': | |
| 86 if ((out = fopen(optarg, "wb")) == NULL) { | |
| 87 fprintf(stderr, "%s: unable to open output file %s\n", progname, optarg); | |
| 88 exit(1); | |
| 89 } | |
| 90 strcpy(output_name, optarg); | |
| 91 break; | |
| 92 case 'p': | |
| 93 pattern1 = atoi(optarg); | |
| 94 if (pattern1 <= 0 || pattern1 > NPATTERN) { | |
| 95 fprintf(stderr, "%s: pattern type out of range\n", progname); | |
| 96 exit(1); | |
| 97 } | |
| 98 break; | |
| 99 case 'P': | |
| 100 pattern2 = atoi(optarg); | |
| 101 if (pattern2 <= 0 || pattern2 > 3) { | |
| 102 fprintf(stderr, "%s: pattern type out of range\n", progname); | |
| 103 exit(1); | |
| 104 } | |
| 105 break; | |
| 106 case 'q': | |
| 107 quality = atof(optarg); | |
| 108 if (quality <= 0) { | |
| 109 fprintf(stderr, "%s: quality factor %f out of range\n", progname, quality); | |
| 110 } | |
| 111 break; | |
| 112 case 's': | |
| 113 if ((sig = fopen(optarg, "r")) == NULL) { | |
| 114 fprintf(stderr, "%s: unable to open signature file %s\n", progname, optarg); | |
| 115 exit(1); | |
| 116 } | |
| 117 strcpy(signature_name, optarg); | |
| 118 break; | |
| 119 case 't': | |
| 120 threshold_noise = atof(optarg); | |
| 121 if (threshold_noise <= 0) { | |
| 122 fprintf(stderr, "%s: noise threshold %f out of range\n", progname, threshold_noise); | |
| 123 } | |
| 124 break; | |
| 125 case 'T': | |
| 126 threshold_slope = atof(optarg); | |
| 127 if (threshold_slope <= 0) { | |
| 128 fprintf(stderr, "%s: slope threshold %f out of range\n", progname, threshold_slope); | |
| 129 } | |
| 130 break; | |
| 131 case 'v': | |
| 132 verbose = atoi(optarg); | |
| 133 if (verbose < 0) { | |
| 134 fprintf(stderr, "%s: verbosity level %d out of range\n",progname, verbose); | |
| 135 exit(1); | |
| 136 } | |
| 137 break; | |
| 138 } | |
| 139 } | |
| 140 | |
| 141 argc -= optind; | |
| 142 argv += optind; | |
| 143 | |
| 144 if (argc > 1) { | |
| 145 usage(); | |
| 146 exit(1); | |
| 147 } | |
| 148 | |
| 149 // open input image file or read from stdin | |
| 8 | 150 if (argc == 1 && *argv[0] != '-') { |
| 0 | 151 if ((in = fopen(argv[0], "rb")) == NULL) { |
| 152 fprintf(stderr, "%s: unable to open input file %s\n", progname, argv[0]); | |
| 153 exit(1); | |
| 154 } | |
| 155 else | |
| 156 strcpy(input_name, argv[0]); | |
| 8 | 157 } |
| 0 | 158 |
| 159 // read signature file and set options | |
| 160 // command line options override signature file options | |
| 161 if (sig) { | |
| 8 | 162 char line[1024]; |
| 0 | 163 fgets(line, sizeof(line), sig); |
| 164 if (strspn(line, "BRSG") >= 4) { | |
| 165 if (nbit_signature == 0) | |
| 166 fscanf(sig, "%d\n", &nbit_signature); | |
| 167 else | |
| 168 fscanf(sig, "%*d\n"); | |
| 169 if (skipping == 0) | |
| 170 fscanf(sig, "%d\n", &skipping); | |
| 171 else | |
| 172 fscanf(sig, "%*d\n"); | |
| 173 if (pattern1 == 0) | |
| 174 fscanf(sig, "%d\n", &pattern1); | |
| 175 else | |
| 176 fscanf(sig, "%*d\n"); | |
| 177 if (pattern2 == 0) | |
| 178 fscanf(sig, "%d\n", &pattern2); | |
| 179 else | |
| 180 fscanf(sig, "%*d\n"); | |
| 181 if (quality == 0.0) | |
| 182 fscanf(sig, "%lf\n", &quality); | |
| 183 else | |
|
16
4987db85cfae
fix another scanf() warning
Peter Meerwald <pmeerw@cosy.sbg.ac.at>
parents:
8
diff
changeset
|
184 fscanf(sig, "%*f\n"); |
| 0 | 185 if (threshold_noise == 0.0) |
| 186 fscanf(sig, "%lf\n", &threshold_noise); | |
| 187 else | |
|
16
4987db85cfae
fix another scanf() warning
Peter Meerwald <pmeerw@cosy.sbg.ac.at>
parents:
8
diff
changeset
|
188 fscanf(sig, "%*f\n"); |
| 0 | 189 if (threshold_slope == 0.0) |
| 190 fscanf(sig, "%lf\n", &threshold_slope); | |
| 191 else | |
|
16
4987db85cfae
fix another scanf() warning
Peter Meerwald <pmeerw@cosy.sbg.ac.at>
parents:
8
diff
changeset
|
192 fscanf(sig, "%*f\n"); |
| 0 | 193 if (blocksize == 0) |
| 194 fscanf(sig, "%d\n", &blocksize); | |
| 195 else | |
| 196 fscanf(sig, "%*d\n"); | |
| 197 fscanf(sig, "%d\n", &seed); | |
| 198 srandom(seed); | |
| 199 n_signature = NBITSTOBYTES(nbit_signature); | |
| 200 fread(signature, sizeof(char), n_signature, sig); | |
| 201 init_signature_bits(); | |
| 202 fscanf(sig, "\n"); | |
| 203 } | |
| 204 else { | |
| 205 fprintf(stderr, "%s: invalid signature file %s\n", progname, signature_name); | |
| 206 exit(1); | |
| 207 } | |
| 208 fclose(sig); | |
| 209 } | |
| 210 else { | |
| 211 fprintf(stderr, "%s: signature file not specified, use -s file option\n", progname); | |
| 212 exit(1); | |
| 213 } | |
| 214 | |
| 215 if (pattern1 <= 0 || pattern2 <= 0 || pattern1 > NPATTERN || pattern2 > NPATTERN) { | |
| 8 | 216 fprintf(stderr, "%s: invalid pattern type specified\n", progname); |
| 0 | 217 exit(1); |
| 218 } | |
| 219 | |
| 220 // read dimensions of input image file | |
| 221 pgm_readpgminit(in, &cols, &rows, &maxval, &format); | |
| 222 | |
| 223 // see if we can extract all signature bits | |
| 224 // we want at least half of the blocks untouched | |
| 225 if (((rows / blocksize) * (cols / blocksize)) < nbit_signature / 2) { | |
| 226 fprintf(stderr, "%s: image not large enough to contain %d bits of signature\n", progname, nbit_signature); | |
| 227 exit(1); | |
| 228 } | |
| 229 n_block = blocksize * blocksize; | |
| 230 | |
| 231 // allocate structure to remember which blocks we already touched, | |
| 232 // allow plenty of room to skip over blocks | |
| 8 | 233 if ((coords = alloc_coords(nbit_signature * 16)) == NULL) { |
| 0 | 234 fprintf(stderr, "%s: unable to allocate memory\n", progname); |
| 235 exit(1); | |
| 236 } | |
| 237 | |
| 238 // read in input image file | |
| 239 image = pgm_allocarray(cols, rows); | |
| 240 for (row = 0; row < rows; row++) | |
| 241 pgm_readpgmrow(in, image[row], cols, maxval, format); | |
| 242 | |
| 243 fclose(in); | |
| 244 | |
| 245 row = 0; | |
| 246 col = 0; | |
| 247 | |
| 248 // allocate memory for one block | |
| 249 block = alloc_grays(blocksize, blocksize); | |
| 250 | |
| 251 // allocate memory for zone classification | |
| 252 zone = alloc_grays(blocksize, blocksize); | |
| 253 | |
| 254 // allocate memory for category classification | |
| 255 category1 = alloc_grays(blocksize, blocksize); | |
| 256 category2 = alloc_grays(blocksize, blocksize); | |
| 257 | |
| 258 // set up category classification array according to | |
| 259 // pattern type parameter | |
| 260 for (i = 0; i < blocksize; i++) | |
| 261 for (j = 0; j < blocksize; j++) { | |
| 262 category1[j][i] = lookup_pattern(pattern1, i, j); | |
| 263 category2[j][i] = lookup_pattern(pattern2, i, j); | |
| 264 } | |
| 265 | |
| 266 // allocate memory for slope calculation | |
| 267 slope = malloc(sizeof(double) * n_block); | |
| 268 | |
| 269 fprintf(out, "BRWM\n"); | |
| 270 fprintf(out, "%d\n", nbit_signature); | |
| 271 | |
| 272 // extract all the signature bits, one by one | |
| 273 n = 0; | |
| 274 while (n < nbit_signature) { | |
| 275 int xb; | |
| 276 int yb; | |
| 277 int blocktype; | |
| 278 double smax; | |
| 279 int alpha, beta_minus, beta_plus; | |
| 280 double mean_1A, mean_1B, mean_2A, mean_2B, mean_1, mean_2; | |
| 281 int n_1A, n_1B, n_2A, n_2B, n_1, n_2; | |
| 282 double sigma, sigma_1, sigma_2; | |
| 283 int zone1_ok, zone2_ok; | |
| 284 | |
| 285 // find an unused block randomly, depending on seed | |
| 286 do { | |
| 287 xb = random() % (cols / blocksize); | |
| 288 yb = random() % (rows / blocksize); | |
| 289 } while (add_coord(coords, xb, yb) < 0); | |
| 290 | |
| 291 // copy image block | |
| 8 | 292 fprintf(stderr, "XXX1 %d %d %d\n", xb*blocksize, yb*blocksize, blocksize); |
| 0 | 293 copy_grays_to_block(block, image, xb * blocksize, yb * blocksize, blocksize, blocksize); |
| 8 | 294 fprintf(stderr, "XXX2\n"); |
| 295 | |
| 0 | 296 if (verbose > 0) |
| 297 fprintf(stderr, "detecting bit #%d in block at (%d/%d)\n", n, xb * blocksize, yb * blocksize); | |
| 298 | |
| 299 // sort luminance values in block to represent increasing function F | |
| 300 sort_grays(block[0], n_block); | |
| 301 | |
| 302 // calculate slopes of F and determine smax, the max. slope of F | |
| 303 // the index where smax occures is called alpha | |
| 304 alpha = 0; | |
| 305 smax = 0.0; | |
| 306 for (i = 0; i < n_block - 1; i++) { | |
| 307 slope[i] = block[0][i + 1] - block[0][i]; | |
| 308 if (slope[i] > smax) { | |
| 309 smax = slope[i]; | |
| 310 alpha = i; | |
| 311 } | |
| 312 } | |
| 313 slope[n_block - 1] = 0; | |
| 314 | |
| 315 // block type classification | |
| 316 blocktype = BLOCKTYPE_UNKNOWN; | |
| 317 | |
| 318 if (smax < threshold_noise) { | |
| 319 // block has noise contrast | |
| 320 beta_minus = beta_plus = alpha; | |
| 321 blocktype = BLOCKTYPE_NOISE; | |
| 322 } | |
| 323 else { | |
| 324 // block has progressive or hard contrast, let's find out... | |
| 325 | |
| 326 beta_minus = alpha - 1; | |
| 327 while (beta_minus >= 0 && smax - slope[beta_minus] <= threshold_slope) | |
| 328 beta_minus--; | |
| 329 | |
| 330 beta_plus = alpha + 1; | |
| 331 while (beta_plus < n_block && smax - slope[beta_plus] <= threshold_slope) | |
| 332 beta_plus++; | |
| 333 | |
| 334 if (beta_minus + 1 == alpha && beta_plus - 1 == alpha) | |
| 335 blocktype = BLOCKTYPE_HARD; | |
| 336 else | |
| 337 blocktype = BLOCKTYPE_PROGRESSIVE; | |
| 338 } | |
| 339 | |
| 340 if (verbose > 1) { | |
| 341 fprintf(stderr, "blocktype: %d\n", blocktype); | |
| 342 fprintf(stderr, "Smax = %lf, alpha = %d, beta- = %d, beta+ = %d\n", smax, alpha, beta_minus, beta_plus); | |
| 343 } | |
| 344 | |
| 345 // block pixel classification | |
| 346 for (i = 0; i < blocksize; i++) | |
| 347 for (j = 0; j < blocksize; j++) { | |
| 348 gray pixel = image[yb * blocksize + j][xb * blocksize + i]; | |
| 349 zone[j][i] = ZONE_VOID; | |
| 350 switch (blocktype) { | |
| 351 case BLOCKTYPE_PROGRESSIVE: | |
| 352 case BLOCKTYPE_HARD: | |
| 353 if (pixel < block[0][beta_minus]) | |
| 354 zone[j][i] = ZONE_1; | |
| 355 else if (pixel > block[0][beta_plus]) | |
| 356 zone[j][i] = ZONE_2; | |
| 357 break; | |
| 358 case BLOCKTYPE_NOISE: | |
| 359 if (pixel < block[0][n_block / 2]) | |
| 360 zone[j][i] = ZONE_1; | |
| 361 else if (pixel > block[0][n_block / 2]) | |
| 362 zone[j][i] = ZONE_2; | |
| 363 break; | |
| 364 default: | |
| 365 fprintf(stderr, "%s: invalid block type\n", progname); | |
| 366 break; | |
| 367 } | |
| 368 } | |
| 369 | |
| 370 // calculate mean values for zone/categories | |
| 371 mean_1A = mean_1B = mean_2A = mean_2B = mean_1 = mean_2 = 0.0; | |
| 372 n_1A = n_1B = n_2A = n_2B = n_1 = n_2 = 0; | |
| 373 for (i = 0; i < blocksize; i++) | |
| 374 for (j = 0; j < blocksize; j++) { | |
| 375 gray pixel = image[yb * blocksize + j][xb * blocksize + i]; | |
| 376 int pixel_zone = zone[j][i]; | |
| 377 int pixel_category = CATEGORY_VOID; | |
| 378 if (pixel_zone == ZONE_1) | |
| 379 pixel_category = category1[j][i]; | |
| 380 else if (pixel_zone == ZONE_2) | |
| 381 pixel_category = category2[j][i]; | |
| 382 | |
| 383 switch (pixel_zone | pixel_category) { | |
| 384 case CLASSIFICATION_1A: | |
| 385 n_1++; | |
| 386 n_1A++; | |
| 387 mean_1A += pixel; | |
| 388 mean_1 += pixel; | |
| 389 break; | |
| 390 case CLASSIFICATION_1B: | |
| 391 n_1++; | |
| 392 n_1B++; | |
| 393 mean_1B += pixel; | |
| 394 mean_1 += pixel; | |
| 395 break; | |
| 396 case CLASSIFICATION_2A: | |
| 397 n_2++; | |
| 398 n_2A++; | |
| 399 mean_2A += pixel; | |
| 400 mean_2 += pixel; | |
| 401 break; | |
| 402 case CLASSIFICATION_2B: | |
| 403 n_2++; | |
| 404 n_2B++; | |
| 405 mean_2B += pixel; | |
| 406 mean_2 += pixel; | |
| 407 break; | |
| 408 } | |
| 409 } | |
| 410 | |
| 411 if (n_1 && n_1A && n_1B) { | |
| 412 mean_1 /= (double) n_1; | |
| 413 mean_1A /= (double) n_1A; | |
| 414 mean_1B /= (double) n_1B; | |
| 415 zone1_ok = 1; | |
| 416 } | |
| 417 else { | |
| 418 mean_1 = mean_1A = mean_1B = 0.0; | |
| 419 zone1_ok = 0; | |
| 420 if (verbose > 0) | |
| 421 fprintf(stderr, "zone 1 unusable\n"); | |
| 422 } | |
| 423 | |
| 424 if (n_2 && n_2A && n_2B) { | |
| 425 mean_2 /= (double) n_2; | |
| 426 mean_2A /= (double) n_2A; | |
| 427 mean_2B /= (double) n_2B; | |
| 428 zone2_ok = 1; | |
| 429 } | |
| 430 else { | |
| 431 mean_2 = mean_2A = mean_2B = 0.0; | |
| 432 zone2_ok = 0; | |
| 433 if (verbose > 0) | |
| 434 fprintf(stderr, "zone 2 unusable\n"); | |
| 435 } | |
| 436 | |
| 437 // bit extraction | |
| 438 if (zone1_ok && zone2_ok) { | |
| 439 sigma_1 = mean_1A - mean_1B; | |
| 440 sigma_2 = mean_2A - mean_2B; | |
| 441 | |
| 442 if (verbose > 2) { | |
| 443 fprintf(stderr, "m_1A = %lf, m_1B = %lf\n", mean_1A, mean_1B); | |
| 444 fprintf(stderr, "m_2A = %lf, m_2B = %lf\n", mean_2A, mean_2B); | |
| 445 fprintf(stderr, "sigma1 = %lf, sigma2 = %lf\n", sigma_1, sigma_2); | |
| 446 } | |
| 447 | |
| 448 #define EPSILON 0.001 | |
| 449 if (fabs(sigma_1 * sigma_2) < EPSILON) { | |
| 450 // case 3 | |
| 451 sigma = MAX(fabs(sigma_1), fabs(sigma_2)); | |
| 452 set_signature_bit(n, sigma > 0.0); | |
| 453 if (verbose > 0) | |
| 454 fprintf(stderr, "case 3, bit #%d = %d\n", n, sigma > 0.0); | |
| 455 } | |
| 456 else if (sigma_1 * sigma_2 > 0.0) { | |
| 457 // case 1 | |
| 458 set_signature_bit(n, sigma_1 > 0.0); | |
| 459 if (verbose > 0) | |
| 460 fprintf(stderr, "case 1, bit #%d = %d\n", n, sigma_1 > 0.0); | |
| 461 } | |
| 462 else if (sigma_1 * sigma_2 < 0.0) { | |
| 463 // case 2 | |
| 464 sigma = (double) (n_1A + n_1B) * sigma_1 + (double) (n_2A + n_2B) * sigma_2; | |
| 465 set_signature_bit(n, sigma > 0.0); | |
| 466 if (verbose > 0) | |
| 467 fprintf(stderr, "case 2, bit #%d = %d\n", n, sigma > 0.0); | |
| 468 } | |
| 469 } | |
| 470 else if (zone1_ok) { | |
| 471 set_signature_bit(n, mean_1A > mean_1B); | |
| 472 if (verbose > 0) | |
| 473 fprintf(stderr, "case 4, bit #%d = %d\n", n, mean_1A > mean_1B); | |
| 474 } | |
| 475 else if (zone2_ok) { | |
| 476 set_signature_bit(n, mean_2A > mean_2B); | |
| 477 if (verbose > 0) | |
| 478 fprintf(stderr, "case 5, bit #%d = %d\n", n, mean_2A > mean_2B); | |
| 479 } | |
| 480 else { | |
| 481 // pathological case - can it ever happen? | |
| 482 if (verbose > 0) | |
| 483 fprintf(stderr, "block skipped\n"); | |
| 484 if (!skipping) continue; | |
| 485 } | |
| 486 | |
| 487 n++; | |
| 488 } | |
| 489 | |
| 490 free_grays(category2); | |
| 491 free_grays(category1); | |
| 492 free_grays(zone); | |
| 493 free_grays(block); | |
| 494 | |
| 495 // write extracted signature | |
| 496 | |
| 497 fwrite(signature, sizeof(char), n_signature, out); | |
| 498 fclose(out); | |
| 499 | |
| 500 pgm_freearray(image, rows); | |
| 501 | |
| 502 exit(0); | |
| 503 } |