Evolutionary computation can increase the speed and accuracy of pattern recognition in multispectral images, for
example, in automatic target tracking. The first method treats the clustering process. It determines a cluster of pixels
around specified reference pixels so that the entire cluster is increasingly representative of the search object. An initial
population (of clusters) evolves into populations of new clusters, with each cluster having an assigned fitness score. This
population undergoes iterative mutation and selection. Mutation operators alter both the pixel cluster set cardinality and
composition. Several stopping criteria can be applied to terminate the evolution. An advantage of this evolutionary
cluster formulation is that the resulting cluster may have an arbitrary shape so that it most nearly fits the search pattern.
The second algorithm automates the selection of features (the
center-frequency and the bandwidth) for each population
member. For each pixel in the image and for each population member, the Mahalanobis distance to the reference set is
calculated and a decision is made whether or not this pixel belongs to a target. The sum of correct and false decisions
defines a Receiver Operating Curve, which is used to measure the fitness of a population member. Based on this fitness,
the algorithm decides which population members to use as parents for the next iteration.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.