Nonlinear discriminant adaptive nearest neighbor classifiers

Peng Zhang; Jing Peng; S. Richard F. Sims

doi:10.1117/12.604150

19 May 2005 Nonlinear discriminant adaptive nearest neighbor classifiers

Peng Zhang, Jing Peng, S. Richard F. Sims

Author Affiliations +

Proceedings Volume 5807, Automatic Target Recognition XV; (2005) https://doi.org/10.1117/12.604150
Event: Defense and Security, 2005, Orlando, Florida, United States

Abstract

Nearest neighbor classifiers are one of most common techniques for classification and ATR applications. Hastie and Tibshirani propose a discriminant adaptive nearest neighbor (DANN) rule for computing a distance metric locally so that posterior probabilities tend to be homogeneous in the modified neighborhoods. The idea is to enlongate or constrict the neighborhood along the direction that is parallel or perpendicular to the decision boundary between two classes. DANN morphs a neighborhood in a linear fashion. In this paper, we extend it to the nonlinear case using the kernel trick. We demonstrate the efficacy of our kernel DANN in the context of ATR applications using a number of data sets.

Citation Download Citation

Peng Zhang, Jing Peng, and S. Richard F. Sims "Nonlinear discriminant adaptive nearest neighbor classifiers", Proc. SPIE 5807, Automatic Target Recognition XV, (19 May 2005); https://doi.org/10.1117/12.604150

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