Optimum discrimination problem and one solution to it

H. John Caulfield

doi:10.1117/12.326787

9 October 1998 Optimum discrimination problem and one solution to it

H. John Caulfield

Proceedings Volume 3466, Algorithms, Devices, and Systems for Optical Information Processing II; (1998) https://doi.org/10.1117/12.326787
Event: SPIE's International Symposium on Optical Science, Engineering, and Instrumentation, 1998, San Diego, CA, United States

Abstract

Fourier optical pattern recognition has wonderful properties (high speed, space-invariant operation, low power consumption, target location) and one terrible property (It can work perfectly only for the rare, uninteresting case of two linearly separable categories). More powerful discrimination methods lack the other wonderful properties. I show here how to have it both ways at once. By using roughly the Vapnik- Chervonenkis (VC) dimension number of properly trained Fourier filters in parallel and performing pixel-by-pixel thresholding on the output planes, we can assemble a net output plane which achieves provably optimum, predictable discrimination on any sets.

Citation Download Citation

H. John Caulfield "Optimum discrimination problem and one solution to it", Proc. SPIE 3466, Algorithms, Devices, and Systems for Optical Information Processing II, (9 October 1998); https://doi.org/10.1117/12.326787

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