1 minute read
Plithogeny & Image Processing
where p + r + s = n ≥ 4, we may have when all n subcomponents Tj, Ik, Fl for all j, k, l, are totally independent, the sum:
T1 + T2 +...+ Tp + I1 + I2 +...+ Ir + F1 + F2 + ... + Fl ≤ n, therefore the sum may be between [0, n], where n can be 3, 4, ..., 1000, etc. Therefore we can go above 3. We can also go to the sum above 3, for three neutrosophic components only, if we consider the neutrosophic oversets, where the membership may be > 1.
Advertisement
Plithogeny & Image Processing
To Yanhui Guo I think this book below will be helpful in many-color image processing. Reference: Florentin Smarandache, Plithogeny, Plithogenic Set, Logic, Probability, and Statistics, 141 pages, Pons, Brussels, Belgium, 2017; http://fs.unm.edu/Plithogeny.pdf, http://arxiv.org/abs/1808.03948. First, I observed the following: let ∧N = neutrosophic intersection, ∨N = neutrosophic union, while ∧F = fuzzy intersection (t-norm), ∨F = fuzzy union (t-conorm). Then the neutrosophic conjunction (as used today by most researchers) is: (t1, i1, f1) ∧N (t2, i2, f2) = (t1 ∧F t2, i1 ∨F i2, f1 ∨F f2),
