Using Channel Theory to Account for Graphical Meaning Generations

Author(s):  
Atsushi Shimojima
Keyword(s):  
2021 ◽  
Vol 7 (2) ◽  
Author(s):  
Mohit Kumar Verma ◽  
Permendra Kumar Verma

The enhancement of images is an image processing method that highlights certain image information according to specific needs and, at the same time, weakens or removes unwanted information. In the field of computer and machine vision, haziness and fog lead to degradation of images using different degradation mechanisms, including contrast attenuation, blurring, and degradation of the pixels. This limits machine vision systems efficiency such as video monitoring, target tracking, and recognition. Different dark channel single image dehazing algorithms have been designed quickly and efficiently to address image hazing problems. These algorithms rely on the dark channel theory to estimate the atmospheric light which is a crucial dehazing parameter. In this paper, a review of image dehazing and enhancement has been presented.


2013 ◽  
Vol 20 (1-2) ◽  
Author(s):  
Gerard Allwein ◽  
Yingrui Yang ◽  
William L. Harrison

2021 ◽  
Vol 18 (1) ◽  
pp. 1-24
Author(s):  
Andrew Tedder

Situation theory, and channel theory in particular, have been used to provide motivational accounts of the ternary relation semantics of relevant, substructural, and various non-classical logics. Among the constraints imposed by channel-theory, we must posit a certain existence criterion for situations which result from the composites of multiple channels (this is used in modeling information flow). In associative non-classical logics, it is relatively easy to show that a certain such condition is met, but the problem is trickier in non-associative logics. Following Tedder (2017), where it was shown that the conjunction-conditional fragment of the logic B admits the existence of composite channels, I present a generalised ver- sion of the previous argument, appropriate to logics with disjunction, in the neighbourhood ternary relation semantic framework. I close by suggesting that the logic BB+(^I), which falls between Lavers' system BB+ and B+ , satisfies the conditions for the general argument to go through (and prove that it satisfies all but one of those conditions).


Sign in / Sign up

Export Citation Format

Share Document