Generation of lattice independent vector sets for pattern recognition applications

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.