A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
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 thresholddoi:10.1109/t-c.1974.223858 fatcat:b5o4zwnyuzd6tjkmmwxbvifuxq