Abstract
In recent years, lattice computing has emerged as a new paradigm for processing lattice ordered data such as intervals, Type-1 and Type-2 fuzzy sets, vectors, images, symbols, graphs, etc. Here, the word “lattice” refers to a mathematical structure that is defined as a special type of a partially ordered set (poset). In particular, a complete lattice is a poset that contains the infimum as well as the supremum of each of its subsets. In this paper, we introduce the quantale-based associative memory (QAM), where the notion of a quantale is defined as a complete lattice together with a binary operation that commutes with the supremum operator. We show that QAMs can be effectively used for the storage and the recall of color images.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
