-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathinfo.c
574 lines (480 loc) · 13.7 KB
/
info.c
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
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
/**
* @file info.c
* @brief Information about images
*
* Computes information about images
*
*
*
*/
#define MODULE_SHORTNAME_DEFAULT "info"
#define MODULE_DESCRIPTION "Image information and statistics"
#include "CommandLineInterface/CLIcore.h"
#include "cubeMatchMatrix.h"
#include "cubestats.h"
#include "image_stats.h"
#include "imagemon.h"
#include "improfile.h"
int infoscreen_wcol;
int infoscreen_wrow; // window size
INIT_MODULE_LIB(info)
static errno_t init_module_CLI()
{
cubeMatchMatrix_addCLIcmd();
cubestats_addCLIcmd();
CLIADDCMD_info__imagemon();
image_stats_addCLIcmd();
improfile_addCLIcmd();
return RETURN_SUCCESS;
}
/* number of pixels brighter than value */
/*long brighter(
const char *ID_name,
double value
)
{
imageID ID;
uint32_t naxes[2];
long brighter, fainter;
ID = image_ID(ID_name);
naxes[0] = data.image[ID].md[0].size[0];
naxes[1] = data.image[ID].md[0].size[1];
brighter = 0;
fainter = 0;
for(unsigned long jj = 0; jj < naxes[1]; jj++)
for(unsigned long ii = 0; ii < naxes[0]; ii++)
{
if(data.image[ID].array.F[jj * naxes[0] + ii] > value)
{
brighter++;
}
else
{
fainter++;
}
}
printf("brighter %ld fainter %ld\n", brighter, fainter);
return(brighter);
}
*/
/*
errno_t img_nbpix_flux(
const char *ID_name
)
{
imageID ID;
uint32_t naxes[2];
double value = 0;
double *array;
uint64_t nelements, i;
ID = image_ID(ID_name);
naxes[0] = data.image[ID].md[0].size[0];
naxes[1] = data.image[ID].md[0].size[1];
nelements = naxes[0] * naxes[1];
array = (double *) malloc(naxes[1] * naxes[0] * sizeof(double));
for(unsigned long jj = 0; jj < naxes[1]; jj++)
for(unsigned long ii = 0; ii < naxes[0]; ii++)
{
array[jj * naxes[0] + ii] = data.image[ID].array.F[jj * naxes[0] +
ii];
}
quick_sort_double(array, nelements);
for(i = 0; i < nelements; i++)
{
value += array[i];
printf("%ld %20.18e\n", i, value);
}
free(array);
return RETURN_SUCCESS;
}
*/
/*
errno_t img_histoc_float(
const char *ID_name,
const char *fname
)
{
FILE *fp;
imageID ID;
uint32_t naxes[2];
float value = 0;
float *array;
uint64_t nelements;
ID = image_ID(ID_name);
naxes[0] = data.image[ID].md[0].size[0];
naxes[1] = data.image[ID].md[0].size[1];
nelements = naxes[0] * naxes[1];
array = (float *) malloc(naxes[1] * naxes[0] * sizeof(float));
for(unsigned long jj = 0; jj < naxes[1]; jj++)
for(unsigned long ii = 0; ii < naxes[0]; ii++)
{
array[jj * naxes[0] + ii] = data.image[ID].array.F[jj * naxes[0] +
ii];
}
quick_sort_float(array, nelements);
if((fp = fopen(fname, "w")) == NULL)
{
printf("ERROR: cannot open file \"%s\"\n", fname);
exit(0);
}
value = 0.0;
for(unsigned long ii = 0; ii < nelements; ii++)
{
value += array[ii];
if(ii > 0.99 * nelements)
{
fprintf(fp, "%ld %g %g\n", nelements - ii, value, array[ii]);
}
}
fclose(fp);
free(array);
return RETURN_SUCCESS;
}
errno_t img_histoc_double(
const char *ID_name,
const char *fname
)
{
FILE *fp;
imageID ID;
uint32_t naxes[2];
double value = 0;
double *array;
uint64_t nelements;
ID = image_ID(ID_name);
naxes[0] = data.image[ID].md[0].size[0];
naxes[1] = data.image[ID].md[0].size[1];
nelements = naxes[0] * naxes[1];
array = (double *) malloc(naxes[1] * naxes[0] * sizeof(double));
for(unsigned long jj = 0; jj < naxes[1]; jj++)
for(unsigned long ii = 0; ii < naxes[0]; ii++)
{
array[jj * naxes[0] + ii] = data.image[ID].array.F[jj * naxes[0] +
ii];
}
quick_sort_double(array, nelements);
if((fp = fopen(fname, "w")) == NULL)
{
printf("ERROR: cannot open file \"%s\"\n", fname);
exit(0);
}
value = 0.0;
for(unsigned long ii = 0; ii < nelements; ii++)
{
value += array[ii];
if(ii > 0.99 * nelements)
{
fprintf(fp, "%ld %g %g\n", nelements - ii, value, array[ii]);
}
}
fclose(fp);
free(array);
return RETURN_SUCCESS;
}
*/
/*
errno_t make_histogram(
const char *ID_name,
const char *ID_out_name,
double min,
double max,
long nbsteps
)
{
imageID ID, ID_out;
uint32_t naxes[2];
long n;
ID = image_ID(ID_name);
naxes[0] = data.image[ID].md[0].size[0];
naxes[1] = data.image[ID].md[0].size[1];
create_2Dimage_ID(ID_out_name, nbsteps, 1);
ID_out = image_ID(ID_out_name);
for(unsigned long jj = 0; jj < naxes[1]; jj++)
for(unsigned long ii = 0; ii < naxes[0]; ii++)
{
n = (long)((data.image[ID].array.F[jj * naxes[0] + ii] - min) /
(max - min) * nbsteps);
if((n > 0) && (n < nbsteps))
{
data.image[ID_out].array.F[n] += 1;
}
}
return RETURN_SUCCESS;
}
*/
/*
double ssquare(const char *ID_name)
{
int ID;
uint32_t naxes[2];
double ssquare;
ID = image_ID(ID_name);
naxes[0] = data.image[ID].md[0].size[0];
naxes[1] = data.image[ID].md[0].size[1];
ssquare = 0;
for(unsigned long jj = 0; jj < naxes[1]; jj++)
for(unsigned long ii = 0; ii < naxes[0]; ii++)
{
ssquare = ssquare + data.image[ID].array.F[jj * naxes[0] + ii] *
data.image[ID].array.F[jj * naxes[0] + ii];
}
return(ssquare);
}
double rms_dev(const char *ID_name)
{
int ID;
uint32_t naxes[2];
double ssquare, rms;
double constant;
ID = image_ID(ID_name);
naxes[0] = data.image[ID].md[0].size[0];
naxes[1] = data.image[ID].md[0].size[1];
ssquare = 0;
constant = arith_image_total(ID_name) / naxes[0] / naxes[1];
for(unsigned long jj = 0; jj < naxes[1]; jj++)
for(unsigned long ii = 0; ii < naxes[0]; ii++)
{
ssquare = ssquare + (data.image[ID].array.F[jj * naxes[0] + ii] -
constant) * (data.image[ID].array.F[jj * naxes[0] + ii] - constant);
}
rms = sqrt(ssquare / naxes[1] / naxes[0]);
return(rms);
}
*/
/*
double img_min(const char *ID_name)
{
int ID;
double min;
ID = image_ID(ID_name);
min = data.image[ID].array.F[0];
for(unsigned long ii = 0; ii < data.image[ID].md[0].nelement; ii++)
if(min > data.image[ID].array.F[ii])
{
min = data.image[ID].array.F[ii];
}
return(min);
}
double img_max(const char *ID_name)
{
int ID;
double max;
ID = image_ID(ID_name);
max = data.image[ID].array.F[0];
for(unsigned long ii = 0; ii < data.image[ID].md[0].nelement; ii++)
if(max < data.image[ID].array.F[ii])
{
max = data.image[ID].array.F[ii];
}
return(max);
}
*/
/*
errno_t printpix(
const char *ID_name,
const char *filename
)
{
imageID ID;
// uint64_t nelements;
long nbaxis;
uint32_t naxes[3];
FILE *fp;
long iistep = 1;
long jjstep = 1;
ID = variable_ID("_iistep");
if(ID != -1)
{
iistep = (long)(0.1 + data.variable[ID].value.f);
printf("iistep = %ld\n", iistep);
}
ID = variable_ID("_jjstep");
if(ID != -1)
{
jjstep = (long)(0.1 + data.variable[ID].value.f);
printf("jjstep = %ld\n", jjstep);
}
if((fp = fopen(filename, "w")) == NULL)
{
printf("ERROR: cannot open file \"%s\"\n", filename);
exit(0);
}
ID = image_ID(ID_name);
nbaxis = data.image[ID].md[0].naxis;
if(nbaxis == 2)
{
naxes[0] = data.image[ID].md[0].size[0];
naxes[1] = data.image[ID].md[0].size[1];
//nelements = naxes[0] * naxes[1];
for(unsigned long ii = 0; ii < naxes[0]; ii += iistep)
{
for(unsigned long jj = 0; jj < naxes[1]; jj += jjstep)
{
// fprintf(fp,"%f ",data.image[ID].array.F[jj*naxes[0]+ii]);
fprintf(fp, "%ld %ld %g\n", ii, jj, data.image[ID].array.F[jj *
naxes[0] + ii]);
}
fprintf(fp, "\n");
}
}
if(nbaxis == 3)
{
naxes[0] = data.image[ID].md[0].size[0];
naxes[1] = data.image[ID].md[0].size[1];
naxes[2] = data.image[ID].md[0].size[2];
//nelements = naxes[0] * naxes[1];
for(unsigned long ii = 0; ii < naxes[0]; ii += iistep)
for(unsigned long jj = 0; jj < naxes[1]; jj += jjstep)
for(unsigned long kk = 0; kk < naxes[2]; kk++)
{
fprintf(fp, "%ld %ld %ld %f\n", ii, jj, kk,
data.image[ID].array.F[kk * naxes[1]*naxes[0] + jj
* naxes[0] + ii]);
}
}
fclose(fp);
return RETURN_SUCCESS;
}
*/
/* uses the repartition function F of the normal distribution law */
/* F(0) = 0.5 */
/* F(-0.1 * sig) = 0.460172162723 */
/* F(-0.2 * sig) = 0.420740290562 */
/* F(-0.3 * sig) = 0.382088577811 */
/* F(-0.4 * sig) = 0.34457825839 */
/* F(-0.5 * sig) = 0.308537538726 */
/* F(-0.6 * sig) = 0.27425311775 */
/* F(-0.7 * sig) = 0.241963652223 */
/* F(-0.8 * sig) = 0.211855398584 */
/* F(-0.9 * sig) = 0.184060125347 */
/* F(-1.0 * sig) = 0.158655253931 */
/* F(-1.1 * sig) = 0.135666060946 */
/* F(-1.2 * sig) = 0.115069670222 */
/* F(-1.3 * sig) = 0.0968004845855 */
/*
double background_photon_noise(
const char *ID_name
)
{
imageID ID;
uint32_t naxes[2];
double value1, value2, value3, value;
double *array;
uint64_t nelements;
ID = image_ID(ID_name);
naxes[0] = data.image[ID].md[0].size[0];
naxes[1] = data.image[ID].md[0].size[1];
nelements = naxes[0] * naxes[1];
array = (double *) malloc(naxes[1] * naxes[0] * sizeof(double));
for(unsigned long jj = 0; jj < naxes[1]; jj++)
for(unsigned long ii = 0; ii < naxes[0]; ii++)
{
array[jj * naxes[0] + ii] = data.image[ID].array.F[jj * naxes[0] +
ii];
}
quick_sort_double(array, nelements);
// calculation using F(-0.9*sig) and F(-1.3*sig)
value1 = array[(long)(0.184060125347 * naxes[1] * naxes[0])] -
array[(long)( 0.0968004845855 * naxes[1] * naxes[0])]; value1 /= (1.3 - 0.9);
printf("(-1.3 -0.9) %f\n", value1);
// calculation using F(-0.6*sig) and F(-1.3*sig)
value2 = array[(long)(0.27425311775 * naxes[1] * naxes[0])] - array[(long)(
0.0968004845855 * naxes[1] * naxes[0])];
value2 /= (1.3 - 0.6);
printf("(-1.3 -0.6) %f\n", value2);
// calculation using F(-0.3*sig) and F(-1.3*sig)
value3 = array[(long)(0.382088577811 * naxes[1] * naxes[0])] -
array[(long)( 0.0968004845855 * naxes[1] * naxes[0])]; value3 /= (1.3 - 0.3);
printf("(-1.3 -0.3) %f\n", value3);
value = value3;
free(array);
return(value);
}
*/
/*
errno_t test_structure_function(
const char *ID_name,
long NBpoints,
const char *ID_out
)
{
imageID ID, ID1, ID2;
long ii1, ii2, jj1, jj2, i, ii, jj;
uint32_t naxes[2];
//uint64_t nelements;
double v1, v2;
ID = image_ID(ID_name);
naxes[0] = data.image[ID].md[0].size[0];
naxes[1] = data.image[ID].md[0].size[1];
//nelements = naxes[0]*naxes[1];
ID1 = create_2Dimage_ID("tmp1", naxes[0], naxes[1]);
ID2 = create_2Dimage_ID("tmp2", naxes[0], naxes[1]);
for(i = 0; i < NBpoints; i++)
{
ii1 = (long)(data.INVRANDMAX * rand() * naxes[0]);
jj1 = (long)(data.INVRANDMAX * rand() * naxes[1]);
ii2 = (long)(data.INVRANDMAX * rand() * naxes[0]);
jj2 = (long)(data.INVRANDMAX * rand() * naxes[1]);
v1 = data.image[ID].array.F[jj1 * naxes[0] + ii1];
v2 = data.image[ID].array.F[jj2 * naxes[0] + ii2];
ii = (ii1 - ii2);
if(ii < 0)
{
ii = -ii;
}
jj = (jj1 - jj2);
if(jj < 0)
{
jj = -jj;
}
data.image[ID1].array.F[jj * naxes[0] + ii] += (v1 - v2) * (v1 - v2);
data.image[ID2].array.F[jj * naxes[0] + ii] += 1.0;
}
arith_image_div("tmp1", "tmp2", ID_out);
return RETURN_SUCCESS;
}
imageID full_structure_function(
const char *ID_name,
long NBpoints,
const char *ID_out
)
{
imageID ID, ID1, ID2;
long ii1, ii2, jj1, jj2;
uint32_t naxes[2];
double v1, v2;
long i = 0;
long STEP1 = 2;
long STEP2 = 3;
ID = image_ID(ID_name);
naxes[0] = data.image[ID].md[0].size[0];
naxes[1] = data.image[ID].md[0].size[1];
ID1 = create_2Dimage_ID("tmp1", naxes[0], naxes[1]);
ID2 = create_2Dimage_ID("tmp2", naxes[0], naxes[1]);
for(ii1 = 0; ii1 < naxes[0]; ii1 += STEP1)
{
printf(".");
for(jj1 = 0; jj1 < naxes[1]; jj1 += STEP1)
{
if(i < NBpoints)
{
i++;
fflush(stdout);
for(ii2 = 0; ii2 < naxes[0]; ii2 += STEP2)
for(jj2 = 0; jj2 < naxes[1]; jj2 += STEP2)
if((ii2 > ii1) && (jj2 > jj1))
{
v1 = data.image[ID].array.F[jj1 * naxes[0] + ii1];
v2 = data.image[ID].array.F[jj2 * naxes[0] + ii2];
data.image[ID1].array.F[(jj2 - jj1)*naxes[0] + ii2
- ii1] += (v1 - v2) * (v1 - v2); data.image[ID2].array.F[(jj2 - jj1)*naxes[0] +
ii2 - ii1] += 1.0;
}
}
}
}
printf("\n");
ID = arith_image_div("tmp1", "tmp2", ID_out);
return ID;
}
*/