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
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
|
/*********************************************************************
binary -- Work on binary (0 and 1 valued) datasets.
This is part of GNU Astronomy Utilities (Gnuastro) package.
Original author:
Mohammad Akhlaghi <mohammad@akhlaghi.org>
Contributing author(s):
Copyright (C) 2016-2024 Free Software Foundation, Inc.
Gnuastro 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.
Gnuastro 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 Gnuastro. If not, see <http://www.gnu.org/licenses/>.
**********************************************************************/
#include <config.h>
#include <stdio.h>
#include <errno.h>
#include <error.h>
#include <stdlib.h>
#include <string.h>
#include <gnuastro/fits.h>
#include <gnuastro/tile.h>
#include <gnuastro/blank.h>
#include <gnuastro/binary.h>
#include <gnuastro/pointer.h>
#include <gnuastro/dimension.h>
/*********************************************************************/
/***************** Erosion and dilation ********************/
/*********************************************************************/
static void
binary_erode_dilate_1d(gal_data_t *input, int dilate0_erode1)
{
size_t i, nr=input->dsize[0];
uint8_t f, b, *pt, *fpt, *byt=input->array;
/* Do a sanity check: */
if(dilate0_erode1!=1 && dilate0_erode1!=0)
error(EXIT_FAILURE, 0, "%s: a bug! Please contact us at %s so we can "
"fix this problem. The value to 'dilate0_erode1' is %u while it "
"should be 0 or 1", __func__, PACKAGE_BUGREPORT, dilate0_erode1);
/* Set the foreground and background values. */
if(dilate0_erode1==0) {f=1; b=0;}
else {f=0; b=1;}
/* Check the two extremes. */
if(byt[0]==b && byt[1]==f ) byt[0]=GAL_BINARY_TMP_VALUE;
if(nr>2)
if(byt[nr-1]==b && byt[nr-2]==f) byt[nr-1] = GAL_BINARY_TMP_VALUE;
/* Go over the full array. */
for(i=1;i<nr;++i)
if( byt[i]==b && ( byt[i-1]==f || byt[i+1]==f ) )
byt[i]=GAL_BINARY_TMP_VALUE;
/* Set all the changed pixels to the proper values: */
fpt=(pt=byt)+nr;
do *pt = *pt==GAL_BINARY_TMP_VALUE ? f : *pt; while(++pt<fpt);
}
static void
binary_erode_dilate_2d_4con(gal_data_t *input, int dilate0_erode1)
{
uint8_t f, b, *pt, *fpt, *byt=input->array;
size_t i, j, ind, nr=input->dsize[0], nc=input->dsize[1];
/* Do a sanity check: */
if(dilate0_erode1!=1 && dilate0_erode1!=0)
error(EXIT_FAILURE, 0, "%s: a bug! Please contact us at %s so we can "
"fix this problem. The value to 'dilate0_erode1' is %u while it "
"should be 0 or 1", __func__, PACKAGE_BUGREPORT, dilate0_erode1);
/* Set the foreground and background values. */
if(dilate0_erode1==0) {f=1; b=0;}
else {f=0; b=1;}
/* Check the 4 corners: */
if(byt[0]==b && (byt[1]==f || byt[nc]==f) )
byt[0]=GAL_BINARY_TMP_VALUE;
if(byt[nc-1]==b && (byt[nc-2]==f || byt[2*nc-1]==f))
byt[nc-1]=GAL_BINARY_TMP_VALUE;
if(byt[(nr-1)*nc]==b
&& (byt[(nr-2)*nc]==f || byt[(nr-1)*nc+1]==f) )
byt[(nr-1)*nc]=GAL_BINARY_TMP_VALUE;
if(byt[nr*nc-1]==b
&& (byt[nr*nc-2]==f || byt[nr*nc-1-nc]==f) )
byt[nr*nc-1]=GAL_BINARY_TMP_VALUE;
/* Check the 4 sides: */
for(j=1;j<nc-1;++j)
if(byt[j]==b
&& (byt[j+1]==f || byt[j-1]==f || byt[j+nc]==f) )
byt[j]=GAL_BINARY_TMP_VALUE;
for(j=1;j<nc-1;++j)
{
ind=(nr-1)*nc+j;
if(byt[ind]==b
&& (byt[ind+1]==f || byt[ind-1]==f || byt[ind-nc]==f) )
byt[ind]=GAL_BINARY_TMP_VALUE;
}
for(i=1;i<nr-1;++i)
{
ind=i*nc;
if(byt[ind]==b
&& (byt[ind+1]==f || byt[ind+nc]==f || byt[ind-nc]==f) )
byt[ind]=GAL_BINARY_TMP_VALUE;
}
for(i=1;i<nr-1;++i)
{
ind=(i+1)*nc-1;
if(byt[ind]==b
&& (byt[ind-1]==f || byt[ind+nc]==f || byt[ind-nc]==f) )
byt[ind]=GAL_BINARY_TMP_VALUE;
}
/* Check the body: */
for(i=1;i<nr-1;++i)
for(j=1;j<nc-1;++j)
{
ind=i*nc+j;
if(byt[ind]==b
&& (byt[ind-1]==f || byt[ind+1]==f
|| byt[ind+nc]==f || byt[ind-nc]==f) )
byt[ind]=GAL_BINARY_TMP_VALUE;
}
/* Set all the changed pixels to the proper values: */
fpt=(pt=byt)+nr*nc;
do *pt = *pt==GAL_BINARY_TMP_VALUE ? f : *pt; while(++pt<fpt);
}
/* 8 connected dilation and erosion. b0_f1==0: Dilate the
foreground. b0_f1==1: Erode the foreground. */
static void
binary_erode_dilate_2d_8con(gal_data_t *input, unsigned char dilate0_erode1)
{
uint8_t f, b, *pt, *fpt, *byt=input->array;
size_t i, j, ind, nr=input->dsize[0], nc=input->dsize[1];
/* Do a sanity check: */
if(dilate0_erode1!=1 && dilate0_erode1!=0)
error(EXIT_FAILURE, 0, "%s: a bug! Please contact us at %s so we can fix "
"this problem. The value to dilate0_erode1 is %u while it should "
"be 0 or 1", __func__, PACKAGE_BUGREPORT, dilate0_erode1);
/* Set the foreground and background values: */
if(dilate0_erode1==0) {f=1; b=0;}
else {f=0; b=1;}
/* Check the 4 corners: */
if(byt[0]==b && (byt[1]==f
|| byt[nc]==f || byt[nc+1]==f) )
byt[0]=GAL_BINARY_TMP_VALUE;
if(byt[nc-1]==b && (byt[nc-2]==f
|| byt[2*nc-1]==f
|| byt[2*nc-2]==f) )
byt[nc-1]=GAL_BINARY_TMP_VALUE;
if(byt[(nr-1)*nc]==b
&& ( byt[(nr-2)*nc]==f || byt[(nr-1)*nc+1]==f
|| byt[(nr-2)*nc+1]==f) )
byt[(nr-1)*nc]=GAL_BINARY_TMP_VALUE;
if(byt[nr*nc-1]==b
&& ( byt[nr*nc-2]==f || byt[nr*nc-1-nc]==f
|| byt[nr*nc-2-nc]==f) )
byt[nr*nc-1]=GAL_BINARY_TMP_VALUE;
/* Check the 4 sides: */
for(j=1;j<nc-1;++j)
if(byt[j]==b
&& ( byt[j+1]==f || byt[j-1]==f || byt[j+nc]==f
|| byt[j-1+nc]==f || byt[j+1+nc]==f) )
byt[j]=GAL_BINARY_TMP_VALUE;
for(j=1;j<nc-1;++j)
{
ind=(nr-1)*nc+j;
if(byt[ind]==b
&& ( byt[ind+1]==f || byt[ind-1]==f || byt[ind-nc]==f
|| byt[ind-1-nc]==f || byt[ind+1-nc]==f) )
byt[ind]=GAL_BINARY_TMP_VALUE;
}
for(i=1;i<nr-1;++i)
{
ind=i*nc;
if(byt[ind]==b
&& ( byt[ind+1]==f || byt[ind+nc]==f || byt[ind-nc]==f
|| byt[ind+1-nc]==f || byt[ind+1+nc]==f) )
byt[ind]=GAL_BINARY_TMP_VALUE;
}
for(i=1;i<nr-1;++i)
{
ind=(i+1)*nc-1;
if(byt[ind]==b
&& (byt[ind-1]==f || byt[ind+nc]==f || byt[ind-nc]==f
|| byt[ind-1-nc]==f || byt[ind-1+nc]==f) )
byt[ind]=GAL_BINARY_TMP_VALUE;
}
/* Check the body: */
for(i=1;i<nr-1;++i)
for(j=1;j<nc-1;++j)
{
ind=i*nc+j;
if(byt[ind]==b
&& (byt[ind-1]==f || byt[ind+1]==f
|| byt[ind+nc]==f || byt[ind-nc]==f
|| byt[ind-1-nc]==f || byt[ind+1+nc]==f
|| byt[ind-1+nc]==f || byt[ind+1-nc]==f) )
byt[ind]=GAL_BINARY_TMP_VALUE;
}
/* Set all the changed pixels to the proper values: */
fpt=(pt=byt)+nr*nc;
do *pt = *pt==GAL_BINARY_TMP_VALUE ? f : *pt; while(++pt<fpt);
}
/* This is a general erosion and dilation function. It is less efficient
than the more specialized cases above. */
static void
binary_erode_dilate_general(gal_data_t *input, unsigned char dilate0_erode1,
int connectivity)
{
uint8_t f, b, *pt, *fpt, *byt=input->array;
size_t i, *dinc=gal_dimension_increment(input->ndim, input->dsize);
/* Do a sanity check: */
if(dilate0_erode1!=1 && dilate0_erode1!=0)
error(EXIT_FAILURE, 0, "%s: a bug! Please contact us at %s so we can fix "
"this problem. The value to dilate0_erode1 is %u while it should "
"be 0 or 1", __func__, PACKAGE_BUGREPORT, dilate0_erode1);
/* Set the foreground and background values: */
if(dilate0_erode1==0) {f=1; b=0;}
else {f=0; b=1;}
/* Go over the neighbors of each pixel. */
for(i=0;i<input->size;++i)
if(byt[i]==b)
GAL_DIMENSION_NEIGHBOR_OP(i, input->ndim, input->dsize, connectivity,
dinc,{
if(byt[i]!=GAL_BINARY_TMP_VALUE
&& byt[nind]==f)
byt[i]=GAL_BINARY_TMP_VALUE;
});
/* Set all the changed pixels to the proper values: */
fpt=(pt=byt)+input->size;
do *pt = *pt==GAL_BINARY_TMP_VALUE ? f : *pt; while(++pt<fpt);
}
/* Erode a binary dataset any number of times. If 'inplace' is given a
value of '1', then do the erosion within the already allocated space,
otherwise, allocate a new array and save the result into that.
This function will only work on the elements with a value of 1 or 0. It
will leave all the rest unchanged. Also note that it only works on
'uint8_t' type datasets. So if the input doesn't have that type, it is
going to copy it this type and return the newlyallocated dataset. So
when the input's type isn't 'uint8_t', 'inplace' is irrelevant. */
static gal_data_t *
binary_erode_dilate(gal_data_t *input, size_t num, int connectivity,
int inplace, int d0e1)
{
size_t counter;
gal_data_t *binary;
size_t *dinc=gal_dimension_increment(input->ndim, input->dsize);
/* Currently this only works on blocks. */
if(input->block)
error(EXIT_FAILURE, 0, "%s: currently only works on a fully "
"allocated block of memory, but the input is a tile (its 'block' "
"element is not NULL)", __func__);
/* Set the dataset to work on. */
binary = ( (inplace && input->type==GAL_TYPE_UINT8)
? input
: gal_data_copy_to_new_type(input, GAL_TYPE_UINT8) );
/* Go over every element and do the erosion. */
switch(binary->ndim)
{
case 1:
binary_erode_dilate_1d(binary, d0e1);
break;
case 2:
for(counter=0;counter<num;++counter)
switch(connectivity)
{
case 1: binary_erode_dilate_2d_4con(binary, d0e1); break;
case 2: binary_erode_dilate_2d_8con(binary, d0e1); break;
default:
error(EXIT_FAILURE, 0, "%s: %d not acceptable for connectivity "
"in a 2D dataset", __func__, connectivity);
}
break;
case 3:
for(counter=0;counter<num;++counter)
binary_erode_dilate_general(binary, d0e1, connectivity);
break;
default:
error(EXIT_FAILURE, 0, "%s: currently doesn't work on %zu "
"dimensional datasets", __func__, binary->ndim);
}
/* Clean up and return. */
free(dinc);
return binary;
}
gal_data_t *
gal_binary_erode(gal_data_t *input, size_t num, int connectivity,
int inplace)
{
return binary_erode_dilate(input, num, connectivity, inplace, 1);
}
gal_data_t *
gal_binary_dilate(gal_data_t *input, size_t num, int connectivity,
int inplace)
{
return binary_erode_dilate(input, num, connectivity, inplace, 0);
}
gal_data_t *
gal_binary_open(gal_data_t *input, size_t num, int connectivity,
int inplace)
{
gal_data_t *out;
/* First do the necessary number of erosions. */
out=gal_binary_erode(input, num, connectivity, inplace);
/* If 'inplace' was called, then 'out' is the same as 'input', if it
wasn't, then 'out' is a newly allocated array. In any case, we should
dilate in the same allocated space. */
gal_binary_dilate(input, num, connectivity, 1);
/* Return the output dataset. */
return out;
}
/*********************************************************************/
/***************** Neighbors ********************/
/*********************************************************************/
/* This is a general erosion and dilation function. It is less efficient
than the more specialized cases above. */
gal_data_t *
gal_binary_number_neighbors(gal_data_t *input, int connectivity, int inplace)
{
gal_data_t *out;
uint8_t n, *narr, *byt=input->array;
size_t i, *dinc=gal_dimension_increment(input->ndim, input->dsize);
/* Currently this only works on blocks. */
if(input->block)
error(EXIT_FAILURE, 0, "%s: currently only works on a fully "
"allocated block of memory, but the input is a tile (its 'block' "
"element is not NULL)", __func__);
/* The input must have a uint8 datatype. */
if(input->type!=GAL_TYPE_UINT8)
error(EXIT_FAILURE, 0, "%s: input must have an unsigned 8-bit "
"datatype but has a type of %s\n", __func__,
gal_type_name(input->type, 1));
/* Allocate the output dataset. */
out = ( inplace
? input
: gal_data_alloc(NULL, GAL_TYPE_UINT8, input->ndim, input->dsize,
input->wcs, 1, input->minmapsize, input->quietmmap,
NULL, NULL, NULL) );
narr=out->array;
/* Go over the neighbors of each pixel. */
for(i=0;i<input->size;++i)
if(byt[i] && byt[i]!=GAL_BLANK_UINT8)
{
n=0;
GAL_DIMENSION_NEIGHBOR_OP(i, input->ndim, input->dsize, connectivity,
dinc, { n += byt[nind]>0; });
narr[i]=n;
}
/* Return the output dataset. */
return out;
}
/*********************************************************************/
/***************** Connected components ********************/
/*********************************************************************/
/* Find connected components in an intput dataset. */
size_t
gal_binary_connected_components(gal_data_t *binary, gal_data_t **out,
int connectivity)
{
int32_t *l;
uint8_t *b, *bf;
gal_data_t *lab;
size_t p, i, curlab=1;
gal_list_sizet_t *Q=NULL;
size_t *dinc=gal_dimension_increment(binary->ndim, binary->dsize);
/* Two small sanity checks. */
if(binary->type!=GAL_TYPE_UINT8)
error(EXIT_FAILURE, 0, "%s: the input data set type must be 'uint8'",
__func__);
if(binary->block)
error(EXIT_FAILURE, 0, "%s: currently, the input data structure to "
"must not be a tile", __func__);
/* Prepare the dataset for the labels. */
if(*out)
{
/* Use the given dataset. */
lab=*out;
/* Make sure the given dataset has the same size as the input. */
if( gal_dimension_is_different(binary, lab) )
error(EXIT_FAILURE, 0, "%s: the 'binary' and 'out' datasets must "
"have the same size", __func__);
/* Make sure it has a 'int32' type. */
if( lab->type!=GAL_TYPE_INT32 )
error(EXIT_FAILURE, 0, "%s: the 'out' dataset must have 'int32' type"
"but the array you have given is '%s' type", __func__,
gal_type_name(lab->type, 1));
/* Reset all its values to zero. */
memset(lab->array, 0, lab->size * gal_type_sizeof(lab->type));
}
else
lab=*out=gal_data_alloc(NULL, GAL_TYPE_INT32, binary->ndim,
binary->dsize, binary->wcs, 1,
binary->minmapsize, binary->quietmmap,
NULL, "labels", NULL);
/* Initialize the labels array. If we have blank pixels in the byt
array, then give them the blank labeled array. Note that since
their value will not be 0, they will also not be labeled. */
l=lab->array;
bf=(b=binary->array)+binary->size; /* Library must have no side effect:*/
if( gal_blank_present(binary, 0) ) /* blank flag should not be changed.*/
do *l++ = *b==GAL_BLANK_UINT8 ? GAL_BLANK_INT32 : 0; while(++b<bf);
/* Go over all the pixels and do a breadth-first: any pixel that is not
labeled is used to label the full object by checking neighbors before
going onto the next pixels. */
l=lab->array;
b=binary->array;
for(i=0;i<binary->size;++i)
/* Check if this pixel is already labeled. */
if( b[i] && l[i]==0 )
{
/* This is the first pixel of this connected region that we have
got to. */
l[i]=curlab;
/* Add this pixel to the queue of pixels to work with. */
gal_list_sizet_add(&Q, i);
/* While a pixel remains in the queue, continue labelling and
searching for neighbors. */
while(Q!=NULL)
{
/* Pop an element from the queue. */
p=gal_list_sizet_pop(&Q);
/* Go over all its neighbors and add them to the list if they
haven't already been labeled. */
GAL_DIMENSION_NEIGHBOR_OP(p, binary->ndim, binary->dsize,
connectivity, dinc,
{
if( b[ nind ] && l[ nind ]==0 )
{
l[ nind ] = curlab;
gal_list_sizet_add(&Q, nind);
}
} );
}
/* This object has been fully labeled, so increment the current
label. */
++curlab;
}
/* Clean up and return the total number. */
free(dinc);
return curlab-1;
}
/* Put the indexs of connected labels in a list of 'gal_data_t's, each with
a one-dimensional array that has the indexs of that connected
component.*/
#define BINARY_CONINDEX_VAL 2
gal_data_t *
gal_binary_connected_indexs(gal_data_t *binary, int connectivity)
{
uint8_t *b, *bf;
gal_data_t *lines=NULL;
size_t p, i, onelabnum, *onelabarr;
gal_list_sizet_t *Q=NULL, *onelab=NULL;
size_t *dinc=gal_dimension_increment(binary->ndim, binary->dsize);
/* Small sanity checks. */
if(binary->type!=GAL_TYPE_UINT8)
error(EXIT_FAILURE, 0, "%s: the input data set type must be 'uint8'",
__func__);
if(binary->block)
error(EXIT_FAILURE, 0, "%s: currently, the input data structure to "
"must not be a tile", __func__);
/* Go over all the pixels and do a breadth-first search. */
b=binary->array;
for(i=0;i<binary->size;++i)
/* A pixel that has already been recorded is given a value of
'BINARY_CONINDEX_VAL'. */
if( b[i]==1 )
{
/* Add this pixel to the queue of pixels to work with. */
b[i]=BINARY_CONINDEX_VAL;
gal_list_sizet_add(&Q, i);
gal_list_sizet_add(&onelab, i);
/* While a pixel remains in the queue, continue labelling and
searching for neighbors. */
while(Q!=NULL)
{
/* Pop an element from the queue. */
p=gal_list_sizet_pop(&Q);
/* Go over all its neighbors and add them to the list if they
haven't already been labeled. */
GAL_DIMENSION_NEIGHBOR_OP(p, binary->ndim, binary->dsize,
connectivity, dinc,
{
if( b[nind]==1 )
{
b[nind]=BINARY_CONINDEX_VAL;
gal_list_sizet_add(&Q, nind);
gal_list_sizet_add(&onelab, nind);
}
} );
}
/* Parsing has finished, put all the indexs into an array. */
onelabarr=gal_list_sizet_to_array(onelab, 1, &onelabnum);
gal_list_data_add_alloc(&lines, onelabarr, GAL_TYPE_SIZE_T, 1,
&onelabnum, NULL, 0, -1, 1, NULL, NULL,
NULL);
/* Clean up. */
gal_list_sizet_free(onelab);
onelab=NULL;
}
/* Reverse the order. */
gal_list_data_reverse(&lines);
/* For a check
{
gal_data_t *test=lines->next;
size_t *b, *bf;
bf=(b=test->array)+test->size;
do printf("%zu\n", *b++);
while(b<bf);
exit(0);
}
*/
/* Set all the '2' values back to '1'. */
bf=(b=binary->array)+binary->size;
do if(*b==BINARY_CONINDEX_VAL) *b=1; while(++b<bf);
/* Clean up and return the total number. */
free(dinc);
return lines;
}
/* Given an adjacency matrix (which should be binary), find the number of
connected objects and return an array of new labels for each old
label. */
gal_data_t *
gal_binary_connected_adjacency_matrix(gal_data_t *adjacency,
size_t *numconnected)
{
gal_data_t *newlabs_d;
gal_list_sizet_t *Q=NULL;
int32_t *newlabs, curlab=1;
uint8_t *adj=adjacency->array;
size_t i, j, p, num=adjacency->dsize[0];
/* Some small sanity checks. */
if(adjacency->type != GAL_TYPE_UINT8)
error(EXIT_FAILURE, 0, "%s: input must have type 'uint8'. However, the "
"input dataset has type of '%s'", __func__,
gal_type_name(adjacency->type, 1));
if(adjacency->ndim != 2)
error(EXIT_FAILURE, 0, "%s: input must be 2-dimensional (a matrix)."
"However, the input dataset has %zu dimensions", __func__,
adjacency->ndim);
if(adjacency->dsize[0] != adjacency->dsize[1])
error(EXIT_FAILURE, 0, "%s: input must be square (same length in both "
"dimensions). However, the input dataset has a size of %zu x %zu",
__func__, adjacency->dsize[0], adjacency->dsize[1]);
/* Allocate (and clear) the output datastructure. */
newlabs_d=gal_data_alloc(NULL, GAL_TYPE_INT32, 1, &num, NULL, 1,
adjacency->minmapsize, adjacency->quietmmap,
NULL, NULL, NULL);
newlabs=newlabs_d->array;
/* Go over the input matrix and apply the same principle as we used to
identify connected components in an image: through a queue, find those
elements that are connected. */
for(i=1;i<num;++i)
if(newlabs[i]==0)
{
/* Add this old label to the list that must be corrected. */
gal_list_sizet_add(&Q, i);
/* Continue while the list has elements. */
while(Q!=NULL)
{
/* Pop the top old-label from the list. */
p=gal_list_sizet_pop(&Q);
/* If it has already been labeled then ignore it. */
if( newlabs[p]!=curlab )
{
/* Give it the new label. */
newlabs[p]=curlab;
/* Go over the adjacency matrix row for this touching
object and see if there are any not-yet-labeled objects
that are touching it. */
for(j=1;j<num;++j)
if( adj[ p*num+j ] && newlabs[j]==0 )
gal_list_sizet_add(&Q, j);
}
}
/* Increment the current label. */
++curlab;
}
/* For a check.
printf("=== Old labels --> new labels ===\n");
for(i=1;i<num;++i) printf("%zu: %u\n", i, newlabs[i]);
*/
/* Return the output. */
*numconnected = curlab-1;
return newlabs_d;
}
/* List-based adjacency matrix: when the number of points to find adjacent
elements is large, the array-based adjacency solution of
'gal_binary_connected_adjacency_matrix' will consume far too much memory
(since it is a square). In those cases, we need to work based on
lists.
The input is an array of 'size_t' list pointers. Each one points to the
labels that are touching it.
indexs b d
^ ^
indexs a b c a
^ ^ ^ ^
listarr: | * | * | * | * |
*/
gal_data_t *
gal_binary_connected_adjacency_list(gal_list_sizet_t **listarr,
size_t number, size_t minmapsize,
int quietmmap, size_t *numconnected)
{
size_t i, p;
gal_list_sizet_t *tmp;
gal_data_t *newlabs_d;
gal_list_sizet_t *Q=NULL;
int32_t *newlabs, curlab=1;
/* Allocate (and clear) the output datastructure. */
newlabs_d=gal_data_alloc(NULL, GAL_TYPE_INT32, 1, &number, NULL, 1,
minmapsize, quietmmap, NULL, NULL, NULL);
newlabs=newlabs_d->array;
/* Go over the input matrix and apply the same principle as we used to
identify connected components in an image: through a queue, find those
elements that are connected. */
for(i=1;i<number;++i)
if(newlabs[i]==0)
{
/* Add this old label to the list that must be corrected. */
gal_list_sizet_add(&Q, i);
/* Continue while the list has elements. */
while(Q!=NULL)
{
/* Pop the top old-label from the list. */
p=gal_list_sizet_pop(&Q);
/* If it has already been labeled then ignore it. */
if( newlabs[p]!=curlab )
{
/* Give it the new label. */
newlabs[p]=curlab;
/* Go over the adjacency list for this touching object and
see if there are any not-yet-labeled objects that are
touching it. */
for(tmp=listarr[p]; tmp!=NULL; tmp=tmp->next)
if( newlabs[tmp->v]==0 )
gal_list_sizet_add(&Q, tmp->v);
}
}
/* Increment the current label. */
++curlab;
}
/* For a check.
printf("=== Old labels --> new labels ===\n");
for(i=1;i<number;++i) printf("%zu: %u\n", i, newlabs[i]);
*/
/* Return the output. */
*numconnected = curlab-1;
return newlabs_d;
}
/*********************************************************************/
/***************** Fill holes ********************/
/*********************************************************************/
/* Make the array that is the inverse of the input byt of fill
holes. The inverse array will also be 4 pixels larger in both
dimensions. This is because we might also want to fill those holes
that are touching the side of the image. One pixel for a pixel that
is one pixel away from the image border. Another pixel for those
objects that are touching the image border. */
static gal_data_t *
binary_make_padded_inverse(gal_data_t *input, gal_data_t **outtile)
{
uint8_t *in;
size_t i, startind;
gal_data_t *inv, *tile;
size_t *startcoord=gal_pointer_allocate(GAL_TYPE_SIZE_T, input->ndim, 0,
__func__, "startcoord");
size_t *dsize=gal_pointer_allocate(GAL_TYPE_SIZE_T, input->ndim, 0,
__func__, "dsize");
/* Set the size of the padded inverse image and the coordinates of the
start. We want the inverse to be padded on the edges of each dimension
by 2 pixels, so each dimension should be padded by 4 pixels. */
for(i=0;i<input->ndim;++i)
{
startcoord[i]=2;
dsize[i]=input->dsize[i]+4;
}
/* Allocate the inverse dataset and initialize it to 1 (mainly for the
edges, the inner region will be set afterwards).
PADDING MUST BE INITIALIZED WITH 1: This is done so the connected body
of 1 valued pixels (after inversion) gets a label of 1 after labeling
the connected components and any hole, will get a value larger than
1. */
inv=gal_data_alloc(NULL, GAL_TYPE_UINT8, input->ndim, dsize, NULL, 0,
input->minmapsize, input->quietmmap,
"INVERSE", "binary", NULL);
memset(inv->array, 1, inv->size);
/* Define a tile to fill the central regions of the inverse. */
startind=gal_dimension_coord_to_index(input->ndim, inv->dsize, startcoord);
tile=gal_data_alloc(gal_pointer_increment(inv->array, startind, inv->type),
inv->type, input->ndim, input->dsize, NULL, 0, 0, 0,
NULL, NULL, NULL);
*outtile=tile;
tile->block=inv;
/* Put the input's flags into the inverted array and the tile. */
inv->flag = tile->flag = input->flag;
/* Fill the central regions. */
in=input->array;
GAL_TILE_PARSE_OPERATE( tile, NULL, 0, 0,
{*i = *in==GAL_BLANK_UINT8 ? *in : !*in; ++in;} );
/* Clean up and return. */
free(dsize);
free(startcoord);
return inv;
}
gal_data_t *
gal_binary_holes_label(gal_data_t *input, int connectivity,
size_t *numholes)
{
size_t d;
int32_t *lab;
gal_data_t *inv, *tile, *holelabs=NULL;
/* A small sanity check. */
if( input->type != GAL_TYPE_UINT8 )
error(EXIT_FAILURE, 0, "%s: input must have 'uint8' type, but its "
"input dataset has '%s' type", __func__,
gal_type_name(input->type, 1));
/* Make the inverse image. */
inv=binary_make_padded_inverse(input, &tile);
/* Label the holes. Recall that the first label is just the undetected
regions, so we should subtract that from the total number.*/
*numholes=gal_binary_connected_components(inv, &holelabs, connectivity);
*numholes -= 1;
/* Any pixel with a label larger than 1 is a hole in the input image and
we should invert the respective pixel. To do it, we'll use the tile
that was defined before, just change its block and array.*/
tile->array=gal_tile_block_relative_to_other(tile, holelabs);
tile->block=holelabs; /* has to be after correcting 'tile->array'. */
/* The type of the tile is already known (it is 'int32_t') and we have no
output/other, so we'll just put 'int' as a place-holder. In this way
we can avoid the switch statement of GAL_TILE_PARSE_OPERATE, and
directly use the workhorse macro 'GAL_TILE_PO_OISET'. */
lab=(holelabs)->array;
GAL_TILE_PO_OISET(int32_t, int, tile, NULL, 0, 0, {
*lab++ = ( *i
? ( *i==1
? 0 /* Originally, was background. */
: *i-1 ) /* Real label: -1 (background has 1). */
: -1 ); /* Originally, was foreground. */
});
/* Clean up */
tile->array=NULL;
gal_data_free(inv);
gal_data_free(tile);
/* Correct the sizes of the hole labels array. We have already filled the
from the start, effectively removing the paddings. Therefore, ee will
just correct the sizes and we won't bother actually re-allocating the
array size in memory. According to the GNU C library's description
after 'realloc': "In several allocation implementations, making a
block smaller sometimes necessitates copying it, so it can fail if no
other space is available.". The extra padding is only 2 pixels wide,
thus, the extra space is negligible compared to the actual array. So
it isn't worth possibly having to copy the whole array to another
location. Later, when we free the space, the kernel knows how much the
allocated size is. */
for(d=0;d<input->ndim;++d)
holelabs->dsize[d] = input->dsize[d];
holelabs->size=input->size;
/* Return the number of holes. */
return holelabs;
}
/* Fill all the holes in an input unsigned char array.
The basic method is this:
1. An inverse image is created:
* For every pixel in the input that is 1, the inverse is 0.
* The inverse image has two extra pixels on each edge to
ensure that all the inv[i]==1 pixels around the image are
touching each other and a diagonal object passing through
the image does not cause the inv[i]==1 pixels on the edges
of the image to get a different label.
2. The 8 connected regions in this inverse image are found.
3. Since we had a 2 pixel padding on the edges of the image, we
know for sure that all labeled regions with a label of 1 are
actually connected 'holes' in the input image.
Any pixel with a label larger than 1, is therefore a bounded
hole that is not 8-connected to the rest of the holes. */
void
gal_binary_holes_fill(gal_data_t *input, int connectivity, size_t maxsize)
{
uint8_t *in;
uint32_t *i, *fi;
size_t numholes, *sizes;
gal_data_t *inv, *tile, *holelabs=NULL;
/* Small sanity checks. */
if( input->type != GAL_TYPE_UINT8 )
error(EXIT_FAILURE, 0, "%s: input must have 'uint8' type, but its "
"input dataset has '%s' type", __func__,
gal_type_name(input->type, 1));
if(connectivity<1 || connectivity>input->ndim)
error(EXIT_FAILURE, 0, "%s: connectivity value %d is not acceptable. "
"It has to be between 1 and the number of input's dimensions "
"(%zu)", __func__, connectivity, input->ndim);
/* Make the inverse image. */
inv=binary_make_padded_inverse(input, &tile);
/* Label the holes */
numholes=gal_binary_connected_components(inv, &holelabs, connectivity);
/* Any pixel with a label that is not touching the edges is a hole in the
input image and we should invert the respective pixel. To do it, we'll
use the tile that was defined before, just change its block and
array. */
in=input->array;
tile->array=gal_tile_block_relative_to_other(tile, holelabs);
tile->block=holelabs; /* has to be after correcting 'tile->array'. */
/* If the user wants to only fill holes to a certain size, then remove
those with a larger size. */
if(maxsize<-1)
{
/* Allocate space to keep the size of each hole: */
sizes=gal_pointer_allocate(GAL_TYPE_SIZE_T, numholes+1, 1, __func__,
"sizes");
fi=(i=holelabs->array)+holelabs->size; do ++sizes[*i]; while(++i<fi);
/* Set those labels with a larger size to 1 (treat it as
background). */
fi=(i=holelabs->array)+holelabs->size;
do
if(*i!=GAL_BLANK_INT32) *i = sizes[*i]>maxsize ? 1 : *i;
while(++i<fi);
/* Clean up. */
free(sizes);
}
/* The type of the tile is already known (it is 'int32_t') and we have no
output, so we'll just put 'int' as a place-holder. In this way we can
avoid the switch statement of GAL_TILE_PARSE_OPERATE, and directly use
the workhorse macro 'GAL_TILE_PO_OISET'.
For inputs of any dimensionality, the label=1 is not a hole. For 1D
data, the last label is also not a hole (because in 1D the start and
end of the array don't touch).
*/
GAL_TILE_PO_OISET(int32_t, int, tile, NULL, 0, 0, {
*in = ( *i==GAL_BLANK_INT32
|| *i==1
|| (input->ndim==1 && *i==numholes) ) ? *in : 1;
++in;
});
/* Clean up and return. */
tile->array=NULL;
gal_data_free(inv);
gal_data_free(tile);
gal_data_free(holelabs);
}
|
