High dimensional data computational demand minimization

Wendy L. Poston; David J. Marchette

doi:10.1117/12.323864

18 September 1998 High dimensional data computational demand minimization

Wendy L. Poston, David J. Marchette

Author Affiliations +

Proceedings Volume 3371, Automatic Target Recognition VIII; (1998) https://doi.org/10.1117/12.323864
Event: Aerospace/Defense Sensing and Controls, 1998, Orlando, FL, United States

Abstract

Dimensionality reduction is one way to reduce the computational load before analysis is attempted on massive high-dimensional data sets. It would be beneficial to have dimensionality reduction methods where the transformation can be updated recursively based on either known or partially identified data. This paper documents some of our recent work in dimensionality reduction that has applications to real-time automatic pattern recognition systems. Fisher's Linear Discriminant (FLD) is one method of reducing the dimensionality in pattern recognition applications where the covariances of each target group are the same. We develop two recursive versions of the FLD that are appropriate for the two-class case. The first is based on the assumption that it is known which class each new data point belongs to. This could be used with massive data sets where each observation is labeled with the true class and must be processed as it is obtained to build the classifiers. The other version recursively updates the FLD based on partially classified data. The FLD and other reduction methods such as principal component analysis offer global dimensionality reduction within the framework of linear algebra applied to covariance matrices. In this presentation, we describe local methods that use both mixture models and nearest neighbor calculations to construct local versions of these methods. These new versions for local dimensionality reduction provide increased classification accuracy in lower dimensions.

Citation Download Citation

Wendy L. Poston and David J. Marchette "High dimensional data computational demand minimization", Proc. SPIE 3371, Automatic Target Recognition VIII, (18 September 1998); https://doi.org/10.1117/12.323864

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
9 PAGES

DOWNLOAD PAPER SAVE TO MY LIBRARY

GET CITATION

RIGHTS & PERMISSIONS

Get copyright permission Get copyright permission on Copyright Marketplace

KEYWORDS

Ferroelectric LCDs

Expectation maximization algorithms

Monte Carlo methods

Matrices

Pattern recognition

Principal component analysis

Data centers

Show All Keywords

Keywords/Phrases

Search In:

Publication Years