(p, q)-Logical completeness for output-coherent sets of (p, q)-Logical functions and an application of the set to image processing
暂无分享,去创建一个
Abstract We have previously proposed an idea of p -valued input, q -valued output threshold logic to synthesize many-valued, p -valued, logical networks, and derived the condition for ( p , q )-logical completeness for the output-closed set of ( p , q )-logical functions. In this paper, the condition for ( p , q )-logical completeness for the output-coherent set F of ( p , q )-logical functions is described, and the proof is given in almost the same way as for the output-closed set. The output-coherent set F is applied to image processing. That is, a restoration scheme is described for images to which normal random noise is added.
[1] Teruo Fukumura,et al. The p-valued-input, q-valued-output threshold logic and the (p, q)-polypheck-like function , 1986, Inf. Sci..
[2] Teruo Fukumura,et al. The p-valued-input, q-valued-output threshold logic and its application to the synthesis of p-valued logical networks , 1984, Inf. Sci..
[3] Kenneth C. Smith. The Prospects for Multivalued Logic: A Technology and Applications View , 1981, IEEE Transactions on Computers.
[4] T. Higuchi,et al. Image Processing Algorithms for a Multiple-Valued Array Processor, , 1983 .