Multivariate Data Retrieval Modified by Random Noise using Lattice Autoassociative Memories with Eroded or Dilated Input Residuals

Lattice associative memories were proposed as an alternative approach to work with a set of associated vector pairs for which the storage and retrieval stages are based in the theory of algebraic lattices. Several techniques have been established to deal with the problem of binary or real valued vec...

Full description

Bibliographic Details
Main Authors: Urcid Gonzalo, Morales-Salgado Rocío, Nieves-VázquezsJosé-Angel
Format: Article
Language:English
Published: EDP Sciences 2019-01-01
Series:MATEC Web of Conferences
Online Access:https://www.matec-conferences.org/articles/matecconf/pdf/2019/41/matecconf_cscc2019_04007.pdf
id doaj-13974404e8544f3e833a7dd2335404e2
record_format Article
spelling doaj-13974404e8544f3e833a7dd2335404e22021-02-02T07:04:53ZengEDP SciencesMATEC Web of Conferences2261-236X2019-01-012920400710.1051/matecconf/201929204007matecconf_cscc2019_04007Multivariate Data Retrieval Modified by Random Noise using Lattice Autoassociative Memories with Eroded or Dilated Input ResidualsUrcid Gonzalo0Morales-Salgado Rocío1Nieves-VázquezsJosé-Angel21Optics Department, INAOE2Information Technology and Data Science Department, UPAEP3Engineering Division, ITSSAT, Matacapan 95804Lattice associative memories were proposed as an alternative approach to work with a set of associated vector pairs for which the storage and retrieval stages are based in the theory of algebraic lattices. Several techniques have been established to deal with the problem of binary or real valued vector recall from corrupted inputs. This paper presents a thresholding technique coupled with statistical correlation pattern index search to enhance the recall performance of lattice auto-associative memories for multivariate data inputs degraded by random noise. By thresholding a given noisy input, a lower bound is generated to produce an eroded noisy version used to boost the min-lattice auto-associative memory inherent retrieval capability. Similarly, an upper bound is generated to obtain a dilated noisy version used to enhance the max-lattice auto-associave memory response. A self contained theoretical foundation is provided including a visual example of a multivariate data set composed of grayscale images that show the increased retrieval capability of this type of associative memories.https://www.matec-conferences.org/articles/matecconf/pdf/2019/41/matecconf_cscc2019_04007.pdf
collection DOAJ
language English
format Article
sources DOAJ
author Urcid Gonzalo
Morales-Salgado Rocío
Nieves-VázquezsJosé-Angel
spellingShingle Urcid Gonzalo
Morales-Salgado Rocío
Nieves-VázquezsJosé-Angel
Multivariate Data Retrieval Modified by Random Noise using Lattice Autoassociative Memories with Eroded or Dilated Input Residuals
MATEC Web of Conferences
author_facet Urcid Gonzalo
Morales-Salgado Rocío
Nieves-VázquezsJosé-Angel
author_sort Urcid Gonzalo
title Multivariate Data Retrieval Modified by Random Noise using Lattice Autoassociative Memories with Eroded or Dilated Input Residuals
title_short Multivariate Data Retrieval Modified by Random Noise using Lattice Autoassociative Memories with Eroded or Dilated Input Residuals
title_full Multivariate Data Retrieval Modified by Random Noise using Lattice Autoassociative Memories with Eroded or Dilated Input Residuals
title_fullStr Multivariate Data Retrieval Modified by Random Noise using Lattice Autoassociative Memories with Eroded or Dilated Input Residuals
title_full_unstemmed Multivariate Data Retrieval Modified by Random Noise using Lattice Autoassociative Memories with Eroded or Dilated Input Residuals
title_sort multivariate data retrieval modified by random noise using lattice autoassociative memories with eroded or dilated input residuals
publisher EDP Sciences
series MATEC Web of Conferences
issn 2261-236X
publishDate 2019-01-01
description Lattice associative memories were proposed as an alternative approach to work with a set of associated vector pairs for which the storage and retrieval stages are based in the theory of algebraic lattices. Several techniques have been established to deal with the problem of binary or real valued vector recall from corrupted inputs. This paper presents a thresholding technique coupled with statistical correlation pattern index search to enhance the recall performance of lattice auto-associative memories for multivariate data inputs degraded by random noise. By thresholding a given noisy input, a lower bound is generated to produce an eroded noisy version used to boost the min-lattice auto-associative memory inherent retrieval capability. Similarly, an upper bound is generated to obtain a dilated noisy version used to enhance the max-lattice auto-associave memory response. A self contained theoretical foundation is provided including a visual example of a multivariate data set composed of grayscale images that show the increased retrieval capability of this type of associative memories.
url https://www.matec-conferences.org/articles/matecconf/pdf/2019/41/matecconf_cscc2019_04007.pdf
work_keys_str_mv AT urcidgonzalo multivariatedataretrievalmodifiedbyrandomnoiseusinglatticeautoassociativememorieswitherodedordilatedinputresiduals
AT moralessalgadorocio multivariatedataretrievalmodifiedbyrandomnoiseusinglatticeautoassociativememorieswitherodedordilatedinputresiduals
AT nievesvazquezsjoseangel multivariatedataretrievalmodifiedbyrandomnoiseusinglatticeautoassociativememorieswitherodedordilatedinputresiduals
_version_ 1724299966060429312