Autonomous single-pass endmember approximation using lattice auto-associative memories

Authors:
Gerhard X. Ritter;Gonzalo Urcid;Mark S. Schmalz
Affiliations:
CISE Department, University of Florida, Gainesville, FL 32611, USA;Optics Department, INAOE, Tonantzintla, Pue 72000, Mexico;CISE Department, University of Florida, Gainesville, FL 32611, USA
Venue:
Neurocomputing
Year:
2009

Citing 5
Cited 17

Geometric methods and applications: for computer science and engineering

Geometric methods and applications: for computer science and engineering
Reconstruction of Patterns from Noisy Inputs Using Morphological Associative Memories

Journal of Mathematical Imaging and Vision
A small part of lattice theory

ACM SIGAPL APL Quote Quad
Morphological associative memories

IEEE Transactions on Neural Networks
Gray-scale morphological associative memories

IEEE Transactions on Neural Networks

Endmember Extraction Methods: A Short Review

KES '08 Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part III
Two lattice computing approaches for the unsupervised segmentation of hyperspectral images

Neurocomputing
Lattice Independent Component Analysis for fMRI Analysis

ICANN '09 Proceedings of the 19th International Conference on Artificial Neural Networks: Part II
A lattice computing approach for on-line fMRI analysis

Image and Vision Computing
Permutation-based finite implicative fuzzy associative memories

Information Sciences: an International Journal
A lattice matrix method for hyperspectral image unmixing

Information Sciences: an International Journal
Morphological perceptrons with competitive learning: Lattice-theoretical framework and constructive learning algorithm

Information Sciences: an International Journal
Lattice independent component analysis for functional magnetic resonance imaging

Information Sciences: an International Journal
High resolution segmentation of csf on phase contrast MRI

IWINAC'11 Proceedings of the 4th international conference on Interplay between natural and artificial computation: new challenges on bioinspired applications - Volume Part II
Exploration of LICA detections in resting state fMRI

IWINAC'11 Proceedings of the 4th international conference on Interplay between natural and artificial computation: new challenges on bioinspired applications - Volume Part II
Experiments on lattice independent component analysis for face recognition

IWINAC'11 Proceedings of the 4th international conference on Interplay between natural and artificial computation: new challenges on bioinspired applications - Volume Part II
Hybrid dendritic computing with kernel-LICA applied to Alzheimer's disease detection in MRI

Neurocomputing
Lattice independent component analysis for mobile robot localization

HAIS'10 Proceedings of the 5th international conference on Hybrid Artificial Intelligence Systems - Volume Part II
Lattice associative memories for segmenting color images in different color spaces

HAIS'10 Proceedings of the 5th international conference on Hybrid Artificial Intelligence Systems - Volume Part II
A comparison of VBM results by SPM, ICA and LICA

HAIS'10 Proceedings of the 5th international conference on Hybrid Artificial Intelligence Systems - Volume Part II
An endmember-based distance for content based hyperspectral image retrieval

Pattern Recognition
Hybrid computational methods for hyperspectral image analysis

HAIS'12 Proceedings of the 7th international conference on Hybrid Artificial Intelligent Systems - Volume Part II

Quantified Score

Hi-index	0.01

Visualization

Abstract

We propose a novel method for the autonomous determination of endmembers that employs recent results from the theory of lattice based auto-associative memories. In contrast to several other existing methods, the endmembers determined by the proposed method are physically linked to the data set spectra. Numerical examples are provided to illustrate lattice theoretical concepts and a hyperspectral image subcube, from the Cuprite site in Nevada, is used to find all endmember candidates in a single pass.