A Threshold Selection Technique

J.S. Weszka, R.N. Nagel, A. Rosenfeld
1974 IEEE transactions on computers  
1 Flg 16 Iconv(A, E ) for A > B case lconv(A, B ) =1 is the result. It is easily seen that A = B makes Iconv(A, B ) = l . APPENDIX B PROOF FOR (23) Let PN be the number of logical operations needed for constructing all lconv tables for an N bit image. We denote such a lconv table as LCTABLE( N ) . PN can be calculated on the basis of PNcorresponding to LCTABLE( N -1). The first row in the LCTABLE( N ) requires N more logical operations than Phijust for a given first bit of the N-bit threshold
more » ... e N-bit threshold value. There are two cases (either "0" or "1") for such. So we have p~ = 2( P N -I -t N ) , and we easily see that The solution for this PN is From the previous example, we find that the liveness is not conserved because the transition 1, has more than one input place (in this case, to has two input places, p4 and p s ) . Then the transition to can not have more than one input place in GRSN-1T and 3T. The modifications are given to the ID and OD in GRSN-1T and 3T as follows. In GRSN-1 T, the condition a) GRSN-2T.
doi:10.1109/t-c.1974.223858 fatcat:b5o4zwnyuzd6tjkmmwxbvifuxq