We improve the mathematical contents of two previous papers using the axioms of the basic logic over [0,1] due to Hajek (1998). We make use of the theory of fuzzy relation equations for getting lossy compression and decompression of images. These are understood as two-argument fuzzy matrices of sizes m×n, compressed to two argument fuzzy matrices of sizes h × k, h ⩽ m and k ⩽ n. We are widely inspired from two papers of Nobuhara et al. (2000), but we propose several slight modifications illustrating an algorithm implemented in Java
Compression and decompression of fuzzy relations in the basic logic over [0,1] / V., Loia; Sessa, Salvatore. - STAMPA. - 2:(2001), pp. 693-696. (Intervento presentato al convegno IFSA World Congress and 20th NAFIPS International Conference tenutosi a Vancouver nel 25-28 July 2001) [10.1109/NAFIPS.2001.944686].
Compression and decompression of fuzzy relations in the basic logic over [0,1]
SESSA, SALVATORE
2001
Abstract
We improve the mathematical contents of two previous papers using the axioms of the basic logic over [0,1] due to Hajek (1998). We make use of the theory of fuzzy relation equations for getting lossy compression and decompression of images. These are understood as two-argument fuzzy matrices of sizes m×n, compressed to two argument fuzzy matrices of sizes h × k, h ⩽ m and k ⩽ n. We are widely inspired from two papers of Nobuhara et al. (2000), but we propose several slight modifications illustrating an algorithm implemented in JavaI documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.