Share Email Print

Proceedings Paper

Algorithms for adaptive nonlinear pattern recognition
Author(s): Mark S. Schmalz; Gerhard X. Ritter; Eric Hayden; Gary Key
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

In Bayesian pattern recognition research, static classifiers have featured prominently in the literature. A static classifier is essentially based on a static model of input statistics, thereby assuming input ergodicity that is not realistic in practice. Classical Bayesian approaches attempt to circumvent the limitations of static classifiers, which can include brittleness and narrow coverage, by training extensively on a data set that is assumed to cover more than the subtense of expected input. Such assumptions are not realistic for more complex pattern classification tasks, for example, object detection using pattern classification applied to the output of computer vision filters. In contrast, we have developed a two step process, that can render the majority of static classifiers adaptive, such that the tracking of input nonergodicities is supported. Firstly, we developed operations that dynamically insert (or resp. delete) training patterns into (resp. from) the classifier's pattern database, without requiring that the classifier's internal representation of its training database be completely recomputed. Secondly, we developed and applied a pattern replacement algorithm that uses the aforementioned pattern insertion/deletion operations. This algorithm is designed to optimize the pattern database for a given set of performance measures, thereby supporting closed-loop, performance-directed optimization. This paper presents theory and algorithmic approaches for the efficient computation of adaptive linear and nonlinear pattern recognition operators that use our pattern insertion/deletion technology - in particular, tabular nearest-neighbor encoding (TNE) and lattice associative memories (LAMs). Of particular interest is the classification of nonergodic datastreams that have noise corruption with time-varying statistics. The TNE and LAM based classifiers discussed herein have been successfully applied to the computation of object classification in hyperspectral remote sensing and target recognition applications. The authors' recent research in the development of adaptive TNE and adaptive LAMs is overviewed, with experimental results that show utility for a wide variety of pattern classification applications. Performance results are presented in terms of measured computational cost, noise tolerance, and classification accuracy.

Paper Details

Date Published: 29 September 2011
PDF: 12 pages
Proc. SPIE 8136, Mathematics of Data/Image Pattern Coding, Compression, and Encryption with Applications XIII, 813603 (29 September 2011); doi: 10.1117/12.896561
Show Author Affiliations
Mark S. Schmalz, Univ. of Florida (United States)
Gerhard X. Ritter, Univ. of Florida (United States)
Eric Hayden, Univ. of Florida (United States)
Gary Key, Frontier Technology, Inc. (United States)

Published in SPIE Proceedings Vol. 8136:
Mathematics of Data/Image Pattern Coding, Compression, and Encryption with Applications XIII
Mark S. Schmalz; Gerhard X. Ritter; Junior Barrera; Jaakko T. Astola, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?