Two evolutionary algorithms optimize clusters and automate feature selection in multispectral images

George H. Burgin; H. Price Kagey; James C. Jafolla

doi:10.1117/12.732211

17 September 2007 Two evolutionary algorithms optimize clusters and automate feature selection in multispectral images

George H. Burgin, H. Price Kagey, James C. Jafolla

Author Affiliations +

Proceedings Volume 6700, Mathematics of Data/Image Pattern Recognition, Compression, Coding, and Encryption X, with Applications; 67000E (2007) https://doi.org/10.1117/12.732211
Event: Optical Engineering + Applications, 2007, San Diego, California, United States

Abstract

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.

Citation Download Citation

George H. Burgin, H. Price Kagey, and James C. Jafolla "Two evolutionary algorithms optimize clusters and automate feature selection in multispectral images", Proc. SPIE 6700, Mathematics of Data/Image Pattern Recognition, Compression, Coding, and Encryption X, with Applications, 67000E (17 September 2007); https://doi.org/10.1117/12.732211

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

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.

PERSONAL SIGN IN

No SPIE Account? Create one

;

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members: $17.00

Non-members: $21.00 ADD TO CART

PROCEEDINGS
11 PAGES

DOWNLOAD PAPER SAVE TO MY LIBRARY

GET CITATION

RIGHTS & PERMISSIONS

Get copyright permission Get copyright permission on Copyright Marketplace

KEYWORDS

Distance measurement

Evolutionary algorithms

Mahalanobis distance

Multispectral imaging

Detection and tracking algorithms

Feature selection

Pattern recognition

Show All Keywords

Keywords/Phrases

Search In:

Publication Years