Error minimizing algorithms for nearest neighbor classifiers

Reid B. Porter; Don Hush; G. Beate Zimmer

doi:10.1117/12.877299

3 February 2011 Error minimizing algorithms for nearest neighbor classifiers

Reid B. Porter, Don Hush, G. Beate Zimmer

Proceedings Volume 7870, Image Processing: Algorithms and Systems IX; 787005 (2011) https://doi.org/10.1117/12.877299
Event: IS&T/SPIE Electronic Imaging, 2011, San Francisco Airport, California, United States

Abstract

Stack Filters define a large class of discrete nonlinear filter first introduced in image and signal processing for noise removal. In recent years we have suggested their application to classification problems, and investigated their relationship to other types of discrete classifiers such as Decision Trees. In this paper we focus on a continuous domain version of Stack Filter Classifiers which we call Ordered Hypothesis Machines (OHM), and investigate their relationship to Nearest Neighbor classifiers. We show that OHM classifiers provide a novel framework in which to train Nearest Neighbor type classifiers by minimizing empirical error based loss functions. We use the framework to investigate a new cost sensitive loss function that allows us to train a Nearest Neighbor type classifier for low false alarm rate applications. We report results on both synthetic data and real-world image data.

Citation Download Citation

Reid B. Porter, Don Hush, and G. Beate Zimmer "Error minimizing algorithms for nearest neighbor classifiers", Proc. SPIE 7870, Image Processing: Algorithms and Systems IX, 787005 (3 February 2011); https://doi.org/10.1117/12.877299

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