Paper
17 September 2007 Generation of lattice independent vector sets for pattern recognition applications
Author Affiliations +
Abstract
Lattice independence and strong lattice independence of a set of pattern vectors are fundamental mathematical properties that lie at the core of pattern recognition applications based on lattice theory. Specifically, the development of morphological associative memories robust to inputs corrupted by random noise are based on strong lattice independent sets, and real world problems, such as, autonomous endmember detection in hyperspectral imagery, use auto-associative morphological memories as detectors of lattice independence. In this paper, we present a unified mathematical framework that develops the relationship between different notions of lattice independence currently used in the literature. Computational procedures are provided to test if a given set of pattern vectors is lattice independent or strongly lattice independent; in addition, different techniques are fully described that can be used to generate sets of vectors with the aforementioned lattice properties.
© (2007) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Gonzalo Urcid-S. and Juan-Carlos Valdiviezo-N. "Generation of lattice independent vector sets for pattern recognition applications", Proc. SPIE 6700, Mathematics of Data/Image Pattern Recognition, Compression, Coding, and Encryption X, with Applications, 67000C (17 September 2007); https://doi.org/10.1117/12.731925
Lens.org Logo
CITATIONS
Cited by 16 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Transform theory

Pattern recognition

Detection and tracking algorithms

Laser imaging

Hyperspectral imaging

Lithium

Matrices

Back to Top