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
|
/*====================================================================*
- Copyright (C) 2001 Leptonica. All rights reserved.
- This software is distributed in the hope that it will be
- useful, but with NO WARRANTY OF ANY KIND.
- No author or distributor accepts responsibility to anyone for the
- consequences of using this software, or for whether it serves any
- particular purpose or works at all, unless he or she says so in
- writing. Everyone is granted permission to copy, modify and
- redistribute this source code, for commercial or non-commercial
- purposes, with the following restrictions: (1) the origin of this
- source code must not be misrepresented; (2) modified versions must
- be plainly marked as such; and (3) this notice may not be removed
- or altered from any source or modified source distribution.
*====================================================================*/
/*
* morphdwa.c
*
* Binary morphological (dwa) ops with brick Sels
* PIX *pixDilateBrickDwa()
* PIX *pixErodeBrickDwa()
* PIX *pixOpenBrickDwa()
* PIX *pixCloseBrickDwa()
*
* Binary composite morphological (dwa) ops with brick Sels
* PIX *pixDilateCompBrickDwa()
* PIX *pixErodeCompBrickDwa()
* PIX *pixOpenCompBrickDwa()
* PIX *pixCloseCompBrickDwa()
*
* These are higher-level interfaces for dwa morphology with brick Sels.
* Because many morphological operations are performed using
* separable brick Sels, it is useful to have a simple interface
* for this.
*
* We have included all 58 of the brick Sels that are generated
* by selaAddBasic(). These are sufficient for all the decomposable
* bricks up to size 63, which is the limit for dwa Sels with
* origins at the center of the Sel. If you try to apply a
* non-decomposable operation with a Sel size that doesn't exist,
* the default is to call a decomposable operation instead.
*
* We have also included use of all the 76 comb Sels that are generated
* by selaAddDwaCombs(). The generated code is in dwacomb.2.c
* and dwacomblow.2.c. These are used for the composite dwa
* brick operations.
*
* The non-composite brick operations, such as pixDilateBrickDwa(),
* will automatically default to the associated composite
* operation in situations where the requisite brick Sel has
* not been compiled into fmorphgen*.1.c.
*
* If you want to use brick Sels that are not represented in the
* basic set of 58, you must generate the dwa code to implement them.
* You have three choices for how to use these:
*
* (1) Add both the new Sels and the dwa code to the library:
* - For simplicity, add your new brick Sels to those defined
* in selaAddBasic().
* - Recompile the library.
* - Make prog/fmorphautogen.
* - Run prog/fmorphautogen, to generate new versions of the
* dwa code in fmorphgen.1.c and fmorphgenlow.1.c.
* - Copy these two files to src.
* - Recompile the library again.
* - Use the new brick Sels in your program and compile it.
*
* (2) Make both the new Sels and dwa code outside the library,
* and link it directly to an executable:
* - Write a function to generate the new Sels in a Sela, and call
* fmorphautogen(sela, <N>, filename) to generate the code.
* - Compile your program that uses the newly generated function
* pixMorphDwa_<N>(), and link to the two new C files.
*
* (3) Make the new Sels in the library and use the dwa code outside it:
* - Add code in the library to generate your new brick Sels.
* (It is suggested that you NOT add these Sels to the
* selaAddBasic() function; write a new function that generates
* a new Sela.)
* - Recompile the library.
* - Write a small program that generates the Sela and calls
* fmorphautogen(sela, <N>, filename) to generate the code.
* - Compile your program that uses the newly generated function
* pixMorphDwa_<N>(), and link to the two new C files.
* As an example of this approach, see prog/dwamorph*_reg.c:
* - added selaAddDwaLinear() to sel2.c
* - wrote dwamorph1_reg.c, to generate the dwa code.
* - compiled and linked the generated code with the application,
* dwamorph2_reg.c. (Note: because this was a regression test,
* dwamorph1_reg also builds and runs the application program.)
*/
#include <stdio.h>
#include <stdlib.h>
#include "allheaders.h"
#ifndef NO_CONSOLE_IO
#define DEBUG_SEL_LOOKUP 0
#endif /* ~NO_CONSOLE_IO */
/*-----------------------------------------------------------------*
* Binary morphological (dwa) ops with brick Sels *
*-----------------------------------------------------------------*/
/*!
* pixDilateBrickDwa()
*
* Input: pixd (<optional>; this can be null, equal to pixs,
* or different from pixs)
* pixs (1 bpp)
* hsize (width of brick Sel)
* vsize (height of brick Sel)
* Return: pixd
*
* Notes:
* (1) These implement 2D brick Sels, using linear Sels generated
* with selaAddBasic().
* (2) A brick Sel has hits for all elements.
* (3) The origin of the Sel is at (x, y) = (hsize/2, vsize/2)
* (4) Do separably if both hsize and vsize are > 1.
* (5) It is necessary that both horizontal and vertical Sels
* of the input size are defined in the basic sela.
* (6) There are three cases:
* (a) pixd == null (result into new pixd)
* (b) pixd == pixs (in-place; writes result back to pixs)
* (c) pixd != pixs (puts result into existing pixd)
* (7) For clarity, if the case is known, use these patterns:
* (a) pixd = pixDilateBrickDwa(NULL, pixs, ...);
* (b) pixDilateBrickDwa(pixs, pixs, ...);
* (c) pixDilateBrickDwa(pixd, pixs, ...);
* (8) The size of pixd is determined by pixs.
*/
PIX *
pixDilateBrickDwa(PIX *pixd,
PIX *pixs,
l_int32 hsize,
l_int32 vsize)
{
l_int32 found;
char *selnameh, *selnamev;
SELA *sela;
PIX *pixt1, *pixt2, *pixt3;
PROCNAME("pixDilateBrickDwa");
if (!pixs)
return (PIX *)ERROR_PTR("pixs not defined", procName, pixd);
if (pixGetDepth(pixs) != 1)
return (PIX *)ERROR_PTR("pixs not 1 bpp", procName, pixd);
if (hsize < 1 || vsize < 1)
return (PIX *)ERROR_PTR("hsize and vsize not >= 1", procName, pixd);
if (hsize == 1 && vsize == 1)
return pixCopy(pixd, pixs);
sela = selaAddBasic(NULL);
found = TRUE;
if (hsize > 1) {
selnameh = selaGetBrickName(sela, hsize, 1);
if (!selnameh) found = FALSE;
}
if (vsize > 1) {
selnamev = selaGetBrickName(sela, 1, vsize);
if (!selnamev) found = FALSE;
}
selaDestroy(&sela);
if (!found) {
L_INFO("Calling the decomposable dwa function", procName);
if (selnameh) FREE(selnameh);
if (selnamev) FREE(selnamev);
return pixDilateCompBrickDwa(pixd, pixs, hsize, vsize);
}
if (vsize == 1) {
pixt2 = pixMorphDwa_1(NULL, pixs, L_MORPH_DILATE, selnameh);
FREE(selnameh);
}
else if (hsize == 1) {
pixt2 = pixMorphDwa_1(NULL, pixs, L_MORPH_DILATE, selnamev);
FREE(selnamev);
}
else {
pixt1 = pixAddBorder(pixs, 32, 0);
pixt3 = pixFMorphopGen_1(NULL, pixt1, L_MORPH_DILATE, selnameh);
pixFMorphopGen_1(pixt1, pixt3, L_MORPH_DILATE, selnamev);
pixt2 = pixRemoveBorder(pixt1, 32);
pixDestroy(&pixt1);
pixDestroy(&pixt3);
FREE(selnameh);
FREE(selnamev);
}
if (!pixd)
return pixt2;
pixCopy(pixd, pixt2);
pixDestroy(&pixt2);
return pixd;
}
/*!
* pixErodeBrickDwa()
*
* Input: pixd (<optional>; this can be null, equal to pixs,
* or different from pixs)
* pixs (1 bpp)
* hsize (width of brick Sel)
* vsize (height of brick Sel)
* Return: pixd
*
* Notes:
* (1) These implement 2D brick Sels, using linear Sels generated
* with selaAddBasic().
* (2) A brick Sel has hits for all elements.
* (3) The origin of the Sel is at (x, y) = (hsize/2, vsize/2)
* (4) Do separably if both hsize and vsize are > 1.
* (5) It is necessary that both horizontal and vertical Sels
* of the input size are defined in the basic sela.
* (6) Note that we must always set or clear the border pixels
* before each operation, depending on the the b.c.
* (symmetric or asymmetric).
* (7) There are three cases:
* (a) pixd == null (result into new pixd)
* (b) pixd == pixs (in-place; writes result back to pixs)
* (c) pixd != pixs (puts result into existing pixd)
* (8) For clarity, if the case is known, use these patterns:
* (a) pixd = pixErodeBrickDwa(NULL, pixs, ...);
* (b) pixErodeBrickDwa(pixs, pixs, ...);
* (c) pixErodeBrickDwa(pixd, pixs, ...);
* (9) The size of the result is determined by pixs.
*/
PIX *
pixErodeBrickDwa(PIX *pixd,
PIX *pixs,
l_int32 hsize,
l_int32 vsize)
{
l_int32 found;
char *selnameh, *selnamev;
SELA *sela;
PIX *pixt1, *pixt2, *pixt3;
PROCNAME("pixErodeBrickDwa");
if (!pixs)
return (PIX *)ERROR_PTR("pixs not defined", procName, pixd);
if (pixGetDepth(pixs) != 1)
return (PIX *)ERROR_PTR("pixs not 1 bpp", procName, pixd);
if (hsize < 1 || vsize < 1)
return (PIX *)ERROR_PTR("hsize and vsize not >= 1", procName, pixd);
if (hsize == 1 && vsize == 1)
return pixCopy(pixd, pixs);
sela = selaAddBasic(NULL);
found = TRUE;
if (hsize > 1) {
selnameh = selaGetBrickName(sela, hsize, 1);
if (!selnameh) found = FALSE;
}
if (vsize > 1) {
selnamev = selaGetBrickName(sela, 1, vsize);
if (!selnamev) found = FALSE;
}
selaDestroy(&sela);
if (!found) {
L_INFO("Calling the decomposable dwa function", procName);
if (selnameh) FREE(selnameh);
if (selnamev) FREE(selnamev);
return pixErodeCompBrickDwa(pixd, pixs, hsize, vsize);
}
if (vsize == 1) {
pixt2 = pixMorphDwa_1(NULL, pixs, L_MORPH_ERODE, selnameh);
FREE(selnameh);
}
else if (hsize == 1) {
pixt2 = pixMorphDwa_1(NULL, pixs, L_MORPH_ERODE, selnamev);
FREE(selnamev);
}
else {
pixt1 = pixAddBorder(pixs, 32, 0);
pixt3 = pixFMorphopGen_1(NULL, pixt1, L_MORPH_ERODE, selnameh);
pixFMorphopGen_1(pixt1, pixt3, L_MORPH_ERODE, selnamev);
pixt2 = pixRemoveBorder(pixt1, 32);
pixDestroy(&pixt1);
pixDestroy(&pixt3);
FREE(selnameh);
FREE(selnamev);
}
if (!pixd)
return pixt2;
pixCopy(pixd, pixt2);
pixDestroy(&pixt2);
return pixd;
}
/*!
* pixOpenBrickDwa()
*
* Input: pixd (<optional>; this can be null, equal to pixs,
* or different from pixs)
* pixs (1 bpp)
* hsize (width of brick Sel)
* vsize (height of brick Sel)
* Return: pixd
*
* Notes:
* (1) These implement 2D brick Sels, using linear Sels generated
* with selaAddBasic().
* (2) A brick Sel has hits for all elements.
* (3) The origin of the Sel is at (x, y) = (hsize/2, vsize/2)
* (4) Do separably if both hsize and vsize are > 1.
* (5) It is necessary that both horizontal and vertical Sels
* of the input size are defined in the basic sela.
* (6) Note that we must always set or clear the border pixels
* before each operation, depending on the the b.c.
* (symmetric or asymmetric).
* (7) There are three cases:
* (a) pixd == null (result into new pixd)
* (b) pixd == pixs (in-place; writes result back to pixs)
* (c) pixd != pixs (puts result into existing pixd)
* (8) For clarity, if the case is known, use these patterns:
* (a) pixd = pixOpenBrickDwa(NULL, pixs, ...);
* (b) pixOpenBrickDwa(pixs, pixs, ...);
* (c) pixOpenBrickDwa(pixd, pixs, ...);
* (9) The size of the result is determined by pixs.
*/
PIX *
pixOpenBrickDwa(PIX *pixd,
PIX *pixs,
l_int32 hsize,
l_int32 vsize)
{
l_int32 found;
char *selnameh, *selnamev;
SELA *sela;
PIX *pixt1, *pixt2, *pixt3;
PROCNAME("pixOpenBrickDwa");
if (!pixs)
return (PIX *)ERROR_PTR("pixs not defined", procName, pixd);
if (pixGetDepth(pixs) != 1)
return (PIX *)ERROR_PTR("pixs not 1 bpp", procName, pixd);
if (hsize < 1 || vsize < 1)
return (PIX *)ERROR_PTR("hsize and vsize not >= 1", procName, pixd);
if (hsize == 1 && vsize == 1)
return pixCopy(pixd, pixs);
sela = selaAddBasic(NULL);
found = TRUE;
if (hsize > 1) {
selnameh = selaGetBrickName(sela, hsize, 1);
if (!selnameh) found = FALSE;
}
if (vsize > 1) {
selnamev = selaGetBrickName(sela, 1, vsize);
if (!selnamev) found = FALSE;
}
selaDestroy(&sela);
if (!found) {
L_INFO("Calling the decomposable dwa function", procName);
if (selnameh) FREE(selnameh);
if (selnamev) FREE(selnamev);
return pixOpenCompBrickDwa(pixd, pixs, hsize, vsize);
}
pixt1 = pixAddBorder(pixs, 32, 0);
if (vsize == 1) { /* horizontal only */
pixt2 = pixFMorphopGen_1(NULL, pixt1, L_MORPH_OPEN, selnameh);
FREE(selnameh);
}
else if (hsize == 1) { /* vertical only */
pixt2 = pixFMorphopGen_1(NULL, pixt1, L_MORPH_OPEN, selnamev);
FREE(selnamev);
}
else { /* do separable */
pixt3 = pixFMorphopGen_1(NULL, pixt1, L_MORPH_ERODE, selnameh);
pixt2 = pixFMorphopGen_1(NULL, pixt3, L_MORPH_ERODE, selnamev);
pixFMorphopGen_1(pixt3, pixt2, L_MORPH_DILATE, selnameh);
pixFMorphopGen_1(pixt2, pixt3, L_MORPH_DILATE, selnamev);
FREE(selnameh);
FREE(selnamev);
pixDestroy(&pixt3);
}
pixt3 = pixRemoveBorder(pixt2, 32);
pixDestroy(&pixt1);
pixDestroy(&pixt2);
if (!pixd)
return pixt3;
pixCopy(pixd, pixt3);
pixDestroy(&pixt3);
return pixd;
}
/*!
* pixCloseBrickDwa()
*
* Input: pixd (<optional>; this can be null, equal to pixs,
* or different from pixs)
* pixs (1 bpp)
* hsize (width of brick Sel)
* vsize (height of brick Sel)
* Return: pixd
*
* Notes:
* (1) This is a 'safe' closing; we add an extra border of 32 OFF
* pixels for the standard asymmetric b.c.
* (2) These implement 2D brick Sels, using linear Sels generated
* with selaAddBasic().
* (3) A brick Sel has hits for all elements.
* (4) The origin of the Sel is at (x, y) = (hsize/2, vsize/2)
* (5) Do separably if both hsize and vsize are > 1.
* (6) It is necessary that both horizontal and vertical Sels
* of the input size are defined in the basic sela.
* (7) Note that we must always set or clear the border pixels
* before each operation, depending on the the b.c.
* (symmetric or asymmetric).
* (8) There are three cases:
* (a) pixd == null (result into new pixd)
* (b) pixd == pixs (in-place; writes result back to pixs)
* (c) pixd != pixs (puts result into existing pixd)
* (9) For clarity, if the case is known, use these patterns:
* (a) pixd = pixCloseBrickDwa(NULL, pixs, ...);
* (b) pixCloseBrickDwa(pixs, pixs, ...);
* (c) pixCloseBrickDwa(pixd, pixs, ...);
* (10) The size of the result is determined by pixs.
*/
PIX *
pixCloseBrickDwa(PIX *pixd,
PIX *pixs,
l_int32 hsize,
l_int32 vsize)
{
l_int32 bordercolor, bordersize, found;
char *selnameh, *selnamev;
SELA *sela;
PIX *pixt1, *pixt2, *pixt3;
PROCNAME("pixCloseBrickDwa");
if (!pixs)
return (PIX *)ERROR_PTR("pixs not defined", procName, pixd);
if (pixGetDepth(pixs) != 1)
return (PIX *)ERROR_PTR("pixs not 1 bpp", procName, pixd);
if (hsize < 1 || vsize < 1)
return (PIX *)ERROR_PTR("hsize and vsize not >= 1", procName, pixd);
if (hsize == 1 && vsize == 1)
return pixCopy(pixd, pixs);
sela = selaAddBasic(NULL);
found = TRUE;
if (hsize > 1) {
selnameh = selaGetBrickName(sela, hsize, 1);
if (!selnameh) found = FALSE;
}
if (vsize > 1) {
selnamev = selaGetBrickName(sela, 1, vsize);
if (!selnamev) found = FALSE;
}
selaDestroy(&sela);
if (!found) {
L_INFO("Calling the decomposable dwa function", procName);
if (selnameh) FREE(selnameh);
if (selnamev) FREE(selnamev);
return pixCloseCompBrickDwa(pixd, pixs, hsize, vsize);
}
/* For "safe closing" with ASYMMETRIC_MORPH_BC, we always need
* an extra 32 OFF pixels around the image (in addition to
* the 32 added pixels for all dwa operations), whereas with
* SYMMETRIC_MORPH_BC this is not necessary. */
bordercolor = getMorphBorderPixelColor(L_MORPH_ERODE, 1);
if (bordercolor == 0) /* asymmetric b.c. */
bordersize = 64;
else /* symmetric b.c. */
bordersize = 32;
pixt1 = pixAddBorder(pixs, bordersize, 0);
if (vsize == 1) { /* horizontal only */
pixt2 = pixFMorphopGen_1(NULL, pixt1, L_MORPH_CLOSE, selnameh);
FREE(selnameh);
}
else if (hsize == 1) { /* vertical only */
pixt2 = pixFMorphopGen_1(NULL, pixt1, L_MORPH_CLOSE, selnamev);
FREE(selnamev);
}
else { /* do separable */
pixt3 = pixFMorphopGen_1(NULL, pixt1, L_MORPH_DILATE, selnameh);
pixt2 = pixFMorphopGen_1(NULL, pixt3, L_MORPH_DILATE, selnamev);
pixFMorphopGen_1(pixt3, pixt2, L_MORPH_ERODE, selnameh);
pixFMorphopGen_1(pixt2, pixt3, L_MORPH_ERODE, selnamev);
FREE(selnameh);
FREE(selnamev);
pixDestroy(&pixt3);
}
pixt3 = pixRemoveBorder(pixt2, bordersize);
pixDestroy(&pixt1);
pixDestroy(&pixt2);
if (!pixd)
return pixt3;
pixCopy(pixd, pixt3);
pixDestroy(&pixt3);
return pixd;
}
/*-----------------------------------------------------------------*
* Binary composite morphological (dwa) ops with brick Sels *
*-----------------------------------------------------------------*/
/*!
* pixDilateCompBrickDwa()
*
* Input: pixd (<optional>; this can be null, equal to pixs,
* or different from pixs)
* pixs (1 bpp)
* hsize (width of brick Sel)
* vsize (height of brick Sel)
* Return: pixd
*
* Notes:
* (1) These implement a separable composite dilation with 2D brick Sels.
* (2) For efficiency, it may decompose each linear morphological
* operation into two (brick + comb).
* (3) A brick Sel has hits for all elements.
* (4) The origin of the Sel is at (x, y) = (hsize/2, vsize/2)
* (5) Do separably if both hsize and vsize are > 1.
* (6) It is necessary that both horizontal and vertical Sels
* of the input size are defined in the basic sela.
* (7) There are three cases:
* (a) pixd == null (result into new pixd)
* (b) pixd == pixs (in-place; writes result back to pixs)
* (c) pixd != pixs (puts result into existing pixd)
* (8) For clarity, if the case is known, use these patterns:
* (a) pixd = pixDilateCompBrickDwa(NULL, pixs, ...);
* (b) pixDilateCompBrickDwa(pixs, pixs, ...);
* (c) pixDilateCompBrickDwa(pixd, pixs, ...);
* (9) The size of pixd is determined by pixs.
* (10) CAUTION: both hsize and vsize are being decomposed.
* The decomposer chooses a product of sizes (call them
* 'terms') for each that is close to the input size,
* but not necessarily equal to it. It attempts to optimize:
* (a) for consistency with the input values: the product
* of terms is close to the input size
* (b) for efficiency of the operation: the sum of the
* terms is small; ideally about twice the square
* root of the input size.
* So, for example, if the input hsize = 37, which is
* a prime number, the decomposer will break this into two
* terms, 6 and 6, so that the net result is a dilation
* with hsize = 36.
*/
PIX *
pixDilateCompBrickDwa(PIX *pixd,
PIX *pixs,
l_int32 hsize,
l_int32 vsize)
{
char *selnameh1, *selnameh2, *selnamev1, *selnamev2;
l_int32 hsize1, hsize2, vsize1, vsize2;
PIX *pixt1, *pixt2, *pixt3;
PROCNAME("pixDilateCompBrickDwa");
if (!pixs)
return (PIX *)ERROR_PTR("pixs not defined", procName, pixd);
if (pixGetDepth(pixs) != 1)
return (PIX *)ERROR_PTR("pixs not 1 bpp", procName, pixd);
if (hsize < 1 || vsize < 1)
return (PIX *)ERROR_PTR("hsize and vsize not >= 1", procName, pixd);
if (hsize > 63 || vsize > 63)
return (PIX *)ERROR_PTR("hsize and vsize not <= 63", procName, pixd);
if (hsize == 1 && vsize == 1)
return pixCopy(pixd, pixs);
hsize1 = hsize2 = vsize1 = vsize2 = 1;
selnameh1 = selnameh2 = selnamev1 = selnamev2 = NULL;
if (hsize > 1)
getCompositeParameters(hsize, &hsize1, &hsize2, &selnameh1,
&selnameh2, NULL, NULL);
if (vsize > 1)
getCompositeParameters(vsize, &vsize1, &vsize2, NULL, NULL,
&selnamev1, &selnamev2);
#if DEBUG_SEL_LOOKUP
fprintf(stderr, "nameh1=%s, nameh2=%s, namev1=%s, namev2=%s\n",
selnameh1, selnameh2, selnamev1, selnamev2);
fprintf(stderr, "hsize1=%d, hsize2=%d, vsize1=%d, vsize2=%d\n",
hsize1, hsize2, vsize1, vsize2);
#endif /* DEBUG_SEL_LOOKUP */
pixt1 = pixAddBorder(pixs, 64, 0);
if (vsize == 1) {
if (hsize2 == 1)
pixt2 = pixFMorphopGen_1(NULL, pixt1, L_MORPH_DILATE, selnameh1);
else {
pixt3 = pixFMorphopGen_1(NULL, pixt1, L_MORPH_DILATE, selnameh1);
pixt2 = pixFMorphopGen_2(NULL, pixt3, L_MORPH_DILATE, selnameh2);
pixDestroy(&pixt3);
}
}
else if (hsize == 1) {
if (vsize2 == 1)
pixt2 = pixFMorphopGen_1(NULL, pixt1, L_MORPH_DILATE, selnamev1);
else {
pixt3 = pixFMorphopGen_1(NULL, pixt1, L_MORPH_DILATE, selnamev1);
pixt2 = pixFMorphopGen_2(NULL, pixt3, L_MORPH_DILATE, selnamev2);
pixDestroy(&pixt3);
}
}
else { /* vsize and hsize both > 1 */
if (hsize2 == 1)
pixt3 = pixFMorphopGen_1(NULL, pixt1, L_MORPH_DILATE, selnameh1);
else {
pixt2 = pixFMorphopGen_1(NULL, pixt1, L_MORPH_DILATE, selnameh1);
pixt3 = pixFMorphopGen_2(NULL, pixt2, L_MORPH_DILATE, selnameh2);
pixDestroy(&pixt2);
}
if (vsize2 == 1)
pixt2 = pixFMorphopGen_1(NULL, pixt3, L_MORPH_DILATE, selnamev1);
else {
pixt2 = pixFMorphopGen_1(NULL, pixt3, L_MORPH_DILATE, selnamev1);
pixFMorphopGen_2(pixt2, pixt2, L_MORPH_DILATE, selnamev2);
}
pixDestroy(&pixt3);
}
pixDestroy(&pixt1);
pixt1 = pixRemoveBorder(pixt2, 64);
pixDestroy(&pixt2);
if (selnameh1) FREE(selnameh1);
if (selnameh2) FREE(selnameh2);
if (selnamev1) FREE(selnamev1);
if (selnamev2) FREE(selnamev2);
if (!pixd)
return pixt1;
pixCopy(pixd, pixt1);
pixDestroy(&pixt1);
return pixd;
}
/*!
* pixErodeCompBrickDwa()
*
* Input: pixd (<optional>; this can be null, equal to pixs,
* or different from pixs)
* pixs (1 bpp)
* hsize (width of brick Sel)
* vsize (height of brick Sel)
* Return: pixd
*
* Notes:
* (1) These implement a separable composite erosion with 2D brick Sels.
* (2) For efficiency, it may decompose each linear morphological
* operation into two (brick + comb).
* (3) A brick Sel has hits for all elements.
* (4) The origin of the Sel is at (x, y) = (hsize/2, vsize/2)
* (5) Do separably if both hsize and vsize are > 1.
* (6) It is necessary that both horizontal and vertical Sels
* of the input size are defined in the basic sela.
* (7) There are three cases:
* (a) pixd == null (result into new pixd)
* (b) pixd == pixs (in-place; writes result back to pixs)
* (c) pixd != pixs (puts result into existing pixd)
* (8) For clarity, if the case is known, use these patterns:
* (a) pixd = pixErodeCompBrickDwa(NULL, pixs, ...);
* (b) pixErodeCompBrickDwa(pixs, pixs, ...);
* (c) pixErodeCompBrickDwa(pixd, pixs, ...);
* (9) The size of pixd is determined by pixs.
* (10) CAUTION: both hsize and vsize are being decomposed.
* The decomposer chooses a product of sizes (call them
* 'terms') for each that is close to the input size,
* but not necessarily equal to it. It attempts to optimize:
* (a) for consistency with the input values: the product
* of terms is close to the input size
* (b) for efficiency of the operation: the sum of the
* terms is small; ideally about twice the square
* root of the input size.
* So, for example, if the input hsize = 37, which is
* a prime number, the decomposer will break this into two
* terms, 6 and 6, so that the net result is a dilation
* with hsize = 36.
*/
PIX *
pixErodeCompBrickDwa(PIX *pixd,
PIX *pixs,
l_int32 hsize,
l_int32 vsize)
{
char *selnameh1, *selnameh2, *selnamev1, *selnamev2;
l_int32 hsize1, hsize2, vsize1, vsize2;
PIX *pixt1, *pixt2, *pixt3;
PROCNAME("pixErodeCompBrickDwa");
if (!pixs)
return (PIX *)ERROR_PTR("pixs not defined", procName, pixd);
if (pixGetDepth(pixs) != 1)
return (PIX *)ERROR_PTR("pixs not 1 bpp", procName, pixd);
if (hsize < 1 || vsize < 1)
return (PIX *)ERROR_PTR("hsize and vsize not >= 1", procName, pixd);
if (hsize > 63 || vsize > 63)
return (PIX *)ERROR_PTR("hsize and vsize not <= 63", procName, pixd);
if (hsize == 1 && vsize == 1)
return pixCopy(pixd, pixs);
hsize1 = hsize2 = vsize1 = vsize2 = 1;
selnameh1 = selnameh2 = selnamev1 = selnamev2 = NULL;
if (hsize > 1)
getCompositeParameters(hsize, &hsize1, &hsize2, &selnameh1,
&selnameh2, NULL, NULL);
if (vsize > 1)
getCompositeParameters(vsize, &vsize1, &vsize2, NULL, NULL,
&selnamev1, &selnamev2);
pixt1 = pixAddBorder(pixs, 64, 0);
if (vsize == 1) {
if (hsize2 == 1)
pixt2 = pixFMorphopGen_1(NULL, pixt1, L_MORPH_ERODE, selnameh1);
else {
pixt3 = pixFMorphopGen_1(NULL, pixt1, L_MORPH_ERODE, selnameh1);
pixt2 = pixFMorphopGen_2(NULL, pixt3, L_MORPH_ERODE, selnameh2);
pixDestroy(&pixt3);
}
}
else if (hsize == 1) {
if (vsize2 == 1)
pixt2 = pixFMorphopGen_1(NULL, pixt1, L_MORPH_ERODE, selnamev1);
else {
pixt3 = pixFMorphopGen_1(NULL, pixt1, L_MORPH_ERODE, selnamev1);
pixt2 = pixFMorphopGen_2(NULL, pixt3, L_MORPH_ERODE, selnamev2);
pixDestroy(&pixt3);
}
}
else { /* vsize and hsize both > 1 */
if (hsize2 == 1)
pixt3 = pixFMorphopGen_1(NULL, pixt1, L_MORPH_ERODE, selnameh1);
else {
pixt2 = pixFMorphopGen_1(NULL, pixt1, L_MORPH_ERODE, selnameh1);
pixt3 = pixFMorphopGen_2(NULL, pixt2, L_MORPH_ERODE, selnameh2);
pixDestroy(&pixt2);
}
if (vsize2 == 1)
pixt2 = pixFMorphopGen_1(NULL, pixt3, L_MORPH_ERODE, selnamev1);
else {
pixt2 = pixFMorphopGen_1(NULL, pixt3, L_MORPH_ERODE, selnamev1);
pixFMorphopGen_2(pixt2, pixt2, L_MORPH_ERODE, selnamev2);
}
pixDestroy(&pixt3);
}
pixDestroy(&pixt1);
pixt1 = pixRemoveBorder(pixt2, 64);
pixDestroy(&pixt2);
if (selnameh1) FREE(selnameh1);
if (selnameh2) FREE(selnameh2);
if (selnamev1) FREE(selnamev1);
if (selnamev2) FREE(selnamev2);
if (!pixd)
return pixt1;
pixCopy(pixd, pixt1);
pixDestroy(&pixt1);
return pixd;
}
/*!
* pixOpenCompBrickDwa()
*
* Input: pixd (<optional>; this can be null, equal to pixs,
* or different from pixs)
* pixs (1 bpp)
* hsize (width of brick Sel)
* vsize (height of brick Sel)
* Return: pixd
*
* Notes:
* (1) These implement a separable composite opening with 2D brick Sels.
* (2) For efficiency, it may decompose each linear morphological
* operation into two (brick + comb).
* (3) A brick Sel has hits for all elements.
* (4) The origin of the Sel is at (x, y) = (hsize/2, vsize/2)
* (5) Do separably if both hsize and vsize are > 1.
* (6) It is necessary that both horizontal and vertical Sels
* of the input size are defined in the basic sela.
* (7) There are three cases:
* (a) pixd == null (result into new pixd)
* (b) pixd == pixs (in-place; writes result back to pixs)
* (c) pixd != pixs (puts result into existing pixd)
* (8) For clarity, if the case is known, use these patterns:
* (a) pixd = pixOpenCompBrickDwa(NULL, pixs, ...);
* (b) pixOpenCompBrickDwa(pixs, pixs, ...);
* (c) pixOpenCompBrickDwa(pixd, pixs, ...);
* (9) The size of pixd is determined by pixs.
* (10) CAUTION: both hsize and vsize are being decomposed.
* The decomposer chooses a product of sizes (call them
* 'terms') for each that is close to the input size,
* but not necessarily equal to it. It attempts to optimize:
* (a) for consistency with the input values: the product
* of terms is close to the input size
* (b) for efficiency of the operation: the sum of the
* terms is small; ideally about twice the square
* root of the input size.
* So, for example, if the input hsize = 37, which is
* a prime number, the decomposer will break this into two
* terms, 6 and 6, so that the net result is a dilation
* with hsize = 36.
*/
PIX *
pixOpenCompBrickDwa(PIX *pixd,
PIX *pixs,
l_int32 hsize,
l_int32 vsize)
{
char *selnameh1, *selnameh2, *selnamev1, *selnamev2;
l_int32 hsize1, hsize2, vsize1, vsize2;
PIX *pixt1, *pixt2, *pixt3;
PROCNAME("pixOpenCompBrickDwa");
if (!pixs)
return (PIX *)ERROR_PTR("pixs not defined", procName, pixd);
if (pixGetDepth(pixs) != 1)
return (PIX *)ERROR_PTR("pixs not 1 bpp", procName, pixd);
if (hsize < 1 || vsize < 1)
return (PIX *)ERROR_PTR("hsize and vsize not >= 1", procName, pixd);
if (hsize > 63 || vsize > 63)
return (PIX *)ERROR_PTR("hsize and vsize not <= 63", procName, pixd);
if (hsize == 1 && vsize == 1)
return pixCopy(pixd, pixs);
hsize1 = hsize2 = vsize1 = vsize2 = 1;
selnameh1 = selnameh2 = selnamev1 = selnamev2 = NULL;
if (hsize > 1)
getCompositeParameters(hsize, &hsize1, &hsize2, &selnameh1,
&selnameh2, NULL, NULL);
if (vsize > 1)
getCompositeParameters(vsize, &vsize1, &vsize2, NULL, NULL,
&selnamev1, &selnamev2);
pixt1 = pixAddBorder(pixs, 64, 0);
if (vsize == 1) {
if (hsize2 == 1) {
pixt3 = pixFMorphopGen_1(NULL, pixt1, L_MORPH_ERODE, selnameh1);
pixt2 = pixFMorphopGen_1(NULL, pixt3, L_MORPH_DILATE, selnameh1);
}
else {
pixt3 = pixFMorphopGen_1(NULL, pixt1, L_MORPH_ERODE, selnameh1);
pixt2 = pixFMorphopGen_2(NULL, pixt3, L_MORPH_ERODE, selnameh2);
pixFMorphopGen_1(pixt3, pixt2, L_MORPH_DILATE, selnameh1);
pixFMorphopGen_2(pixt2, pixt3, L_MORPH_DILATE, selnameh2);
}
}
else if (hsize == 1) {
if (vsize2 == 1) {
pixt3 = pixFMorphopGen_1(NULL, pixt1, L_MORPH_ERODE, selnamev1);
pixt2 = pixFMorphopGen_1(NULL, pixt3, L_MORPH_DILATE, selnamev1);
}
else {
pixt3 = pixFMorphopGen_1(NULL, pixt1, L_MORPH_ERODE, selnamev1);
pixt2 = pixFMorphopGen_2(NULL, pixt3, L_MORPH_ERODE, selnamev2);
pixFMorphopGen_1(pixt3, pixt2, L_MORPH_DILATE, selnamev1);
pixFMorphopGen_2(pixt2, pixt3, L_MORPH_DILATE, selnamev2);
}
}
else { /* vsize and hsize both > 1 */
if (hsize2 == 1 && vsize2 == 1) {
pixt3 = pixFMorphopGen_1(NULL, pixt1, L_MORPH_ERODE, selnameh1);
pixt2 = pixFMorphopGen_1(NULL, pixt3, L_MORPH_ERODE, selnamev1);
pixFMorphopGen_1(pixt3, pixt2, L_MORPH_DILATE, selnameh1);
pixFMorphopGen_1(pixt2, pixt3, L_MORPH_DILATE, selnamev1);
}
else if (vsize2 == 1) {
pixt3 = pixFMorphopGen_1(NULL, pixt1, L_MORPH_ERODE, selnameh1);
pixt2 = pixFMorphopGen_2(NULL, pixt3, L_MORPH_ERODE, selnameh2);
pixFMorphopGen_1(pixt3, pixt2, L_MORPH_ERODE, selnamev1);
pixFMorphopGen_1(pixt2, pixt3, L_MORPH_DILATE, selnameh1);
pixFMorphopGen_2(pixt3, pixt2, L_MORPH_DILATE, selnameh2);
pixFMorphopGen_1(pixt2, pixt3, L_MORPH_DILATE, selnamev1);
}
else if (hsize2 == 1) {
pixt3 = pixFMorphopGen_1(NULL, pixt1, L_MORPH_ERODE, selnameh1);
pixt2 = pixFMorphopGen_1(NULL, pixt3, L_MORPH_ERODE, selnamev1);
pixFMorphopGen_2(pixt3, pixt2, L_MORPH_ERODE, selnamev2);
pixFMorphopGen_1(pixt2, pixt3, L_MORPH_DILATE, selnameh1);
pixFMorphopGen_1(pixt3, pixt2, L_MORPH_DILATE, selnamev1);
pixFMorphopGen_2(pixt2, pixt3, L_MORPH_DILATE, selnamev2);
}
else { /* both directions are combed */
pixt3 = pixFMorphopGen_1(NULL, pixt1, L_MORPH_ERODE, selnameh1);
pixt2 = pixFMorphopGen_2(NULL, pixt3, L_MORPH_ERODE, selnameh2);
pixFMorphopGen_1(pixt3, pixt2, L_MORPH_ERODE, selnamev1);
pixFMorphopGen_2(pixt2, pixt3, L_MORPH_ERODE, selnamev2);
pixFMorphopGen_1(pixt3, pixt2, L_MORPH_DILATE, selnameh1);
pixFMorphopGen_2(pixt2, pixt3, L_MORPH_DILATE, selnameh2);
pixFMorphopGen_1(pixt3, pixt2, L_MORPH_DILATE, selnamev1);
pixFMorphopGen_2(pixt2, pixt3, L_MORPH_DILATE, selnamev2);
}
}
pixDestroy(&pixt3);
pixDestroy(&pixt1);
pixt1 = pixRemoveBorder(pixt2, 64);
pixDestroy(&pixt2);
if (selnameh1) FREE(selnameh1);
if (selnameh2) FREE(selnameh2);
if (selnamev1) FREE(selnamev1);
if (selnamev2) FREE(selnamev2);
if (!pixd)
return pixt1;
pixCopy(pixd, pixt1);
pixDestroy(&pixt1);
return pixd;
}
/*!
* pixCloseCompBrickDwa()
*
* Input: pixd (<optional>; this can be null, equal to pixs,
* or different from pixs)
* pixs (1 bpp)
* hsize (width of brick Sel)
* vsize (height of brick Sel)
* Return: pixd
*
* Notes:
* (1) This implements a separable composite safe closing with 2D
* brick Sels.
* (2) For efficiency, it may decompose each linear morphological
* operation into two (brick + comb).
* (3) A brick Sel has hits for all elements.
* (4) The origin of the Sel is at (x, y) = (hsize/2, vsize/2)
* (5) Do separably if both hsize and vsize are > 1.
* (6) It is necessary that both horizontal and vertical Sels
* of the input size are defined in the basic sela.
* (7) There are three cases:
* (a) pixd == null (result into new pixd)
* (b) pixd == pixs (in-place; writes result back to pixs)
* (c) pixd != pixs (puts result into existing pixd)
* (8) For clarity, if the case is known, use these patterns:
* (a) pixd = pixCloseCompBrickDwa(NULL, pixs, ...);
* (b) pixCloseCompBrickDwa(pixs, pixs, ...);
* (c) pixCloseCompBrickDwa(pixd, pixs, ...);
* (9) The size of pixd is determined by pixs.
* (10) CAUTION: both hsize and vsize are being decomposed.
* The decomposer chooses a product of sizes (call them
* 'terms') for each that is close to the input size,
* but not necessarily equal to it. It attempts to optimize:
* (a) for consistency with the input values: the product
* of terms is close to the input size
* (b) for efficiency of the operation: the sum of the
* terms is small; ideally about twice the square
* root of the input size.
* So, for example, if the input hsize = 37, which is
* a prime number, the decomposer will break this into two
* terms, 6 and 6, so that the net result is a dilation
* with hsize = 36.
*/
PIX *
pixCloseCompBrickDwa(PIX *pixd,
PIX *pixs,
l_int32 hsize,
l_int32 vsize)
{
char *selnameh1, *selnameh2, *selnamev1, *selnamev2;
l_int32 hsize1, hsize2, vsize1, vsize2;
PIX *pixt1, *pixt2, *pixt3;
PROCNAME("pixCloseCompBrickDwa");
if (!pixs)
return (PIX *)ERROR_PTR("pixs not defined", procName, pixd);
if (pixGetDepth(pixs) != 1)
return (PIX *)ERROR_PTR("pixs not 1 bpp", procName, pixd);
if (hsize < 1 || vsize < 1)
return (PIX *)ERROR_PTR("hsize and vsize not >= 1", procName, pixd);
if (hsize > 63 || vsize > 63)
return (PIX *)ERROR_PTR("hsize and vsize not <= 63", procName, pixd);
if (hsize == 1 && vsize == 1)
return pixCopy(pixd, pixs);
hsize1 = hsize2 = vsize1 = vsize2 = 1;
selnameh1 = selnameh2 = selnamev1 = selnamev2 = NULL;
if (hsize > 1)
getCompositeParameters(hsize, &hsize1, &hsize2, &selnameh1,
&selnameh2, NULL, NULL);
if (vsize > 1)
getCompositeParameters(vsize, &vsize1, &vsize2, NULL, NULL,
&selnamev1, &selnamev2);
pixt3 = NULL;
pixt1 = pixAddBorder(pixs, 64, 0);
if (vsize == 1) {
if (hsize2 == 1)
pixt2 = pixFMorphopGen_1(NULL, pixt1, L_MORPH_CLOSE, selnameh1);
else {
pixt3 = pixFMorphopGen_1(NULL, pixt1, L_MORPH_DILATE, selnameh1);
pixt2 = pixFMorphopGen_2(NULL, pixt3, L_MORPH_DILATE, selnameh2);
pixFMorphopGen_1(pixt3, pixt2, L_MORPH_ERODE, selnameh1);
pixFMorphopGen_2(pixt2, pixt3, L_MORPH_ERODE, selnameh2);
}
}
else if (hsize == 1) {
if (vsize2 == 1)
pixt2 = pixFMorphopGen_1(NULL, pixt1, L_MORPH_CLOSE, selnamev1);
else {
pixt3 = pixFMorphopGen_1(NULL, pixt1, L_MORPH_DILATE, selnamev1);
pixt2 = pixFMorphopGen_2(NULL, pixt3, L_MORPH_DILATE, selnamev2);
pixFMorphopGen_1(pixt3, pixt2, L_MORPH_ERODE, selnamev1);
pixFMorphopGen_2(pixt2, pixt3, L_MORPH_ERODE, selnamev2);
}
}
else { /* vsize and hsize both > 1 */
if (hsize2 == 1 && vsize2 == 1) {
pixt3 = pixFMorphopGen_1(NULL, pixt1, L_MORPH_DILATE, selnameh1);
pixt2 = pixFMorphopGen_1(NULL, pixt3, L_MORPH_DILATE, selnamev1);
pixFMorphopGen_1(pixt3, pixt2, L_MORPH_ERODE, selnameh1);
pixFMorphopGen_1(pixt2, pixt3, L_MORPH_ERODE, selnamev1);
}
else if (vsize2 == 1) {
pixt3 = pixFMorphopGen_1(NULL, pixt1, L_MORPH_DILATE, selnameh1);
pixt2 = pixFMorphopGen_2(NULL, pixt3, L_MORPH_DILATE, selnameh2);
pixFMorphopGen_1(pixt3, pixt2, L_MORPH_DILATE, selnamev1);
pixFMorphopGen_1(pixt2, pixt3, L_MORPH_ERODE, selnameh1);
pixFMorphopGen_2(pixt3, pixt2, L_MORPH_ERODE, selnameh2);
pixFMorphopGen_1(pixt2, pixt3, L_MORPH_ERODE, selnamev1);
}
else if (hsize2 == 1) {
pixt3 = pixFMorphopGen_1(NULL, pixt1, L_MORPH_DILATE, selnameh1);
pixt2 = pixFMorphopGen_1(NULL, pixt3, L_MORPH_DILATE, selnamev1);
pixFMorphopGen_2(pixt3, pixt2, L_MORPH_DILATE, selnamev2);
pixFMorphopGen_1(pixt2, pixt3, L_MORPH_ERODE, selnameh1);
pixFMorphopGen_1(pixt3, pixt2, L_MORPH_ERODE, selnamev1);
pixFMorphopGen_2(pixt2, pixt3, L_MORPH_ERODE, selnamev2);
}
else { /* both directions are combed */
pixt3 = pixFMorphopGen_1(NULL, pixt1, L_MORPH_DILATE, selnameh1);
pixt2 = pixFMorphopGen_2(NULL, pixt3, L_MORPH_DILATE, selnameh2);
pixFMorphopGen_1(pixt3, pixt2, L_MORPH_DILATE, selnamev1);
pixFMorphopGen_2(pixt2, pixt3, L_MORPH_DILATE, selnamev2);
pixFMorphopGen_1(pixt3, pixt2, L_MORPH_ERODE, selnameh1);
pixFMorphopGen_2(pixt2, pixt3, L_MORPH_ERODE, selnameh2);
pixFMorphopGen_1(pixt3, pixt2, L_MORPH_ERODE, selnamev1);
pixFMorphopGen_2(pixt2, pixt3, L_MORPH_ERODE, selnamev2);
}
}
pixDestroy(&pixt3);
pixDestroy(&pixt1);
pixt1 = pixRemoveBorder(pixt2, 64);
pixDestroy(&pixt2);
if (selnameh1) FREE(selnameh1);
if (selnameh2) FREE(selnameh2);
if (selnamev1) FREE(selnamev1);
if (selnamev2) FREE(selnamev2);
if (!pixd)
return pixt1;
pixCopy(pixd, pixt1);
pixDestroy(&pixt1);
return pixd;
}
|
