(p,q)-logical completeness for output-coherent sets of (p,q)-logical functions and an application of the set to image processing (Q1092009)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: (p,q)-logical completeness for output-coherent sets of (p,q)-logical functions and an application of the set to image processing |
scientific article; zbMATH DE number 4012496
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | (p,q)-logical completeness for output-coherent sets of (p,q)-logical functions and an application of the set to image processing |
scientific article; zbMATH DE number 4012496 |
Statements
(p,q)-logical completeness for output-coherent sets of (p,q)-logical functions and an application of the set to image processing (English)
0 references
1986
0 references
We have peviously 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.
0 references
p-valued input, q-valued output threshold logic
0 references
(p,q)-logical completeness
0 references
(p,q)-logical functions
0 references
image processing
0 references
restoration scheme
0 references
random noise
0 references
0 references
