Simple Generalized Matched Filters

H. J. Caulfield; Robert Haimes

doi:10.1117/12.958300

29 February 1980 Simple Generalized Matched Filters

H. J. Caulfield, Robert Haimes

Proceedings Volume 0209, Optical Signal Processing for C3I; (1980) https://doi.org/10.1117/12.958300
Event: Optical Signal Processing for C3l, 1979, Boston, United States

Abstract

In several recent papers we have described a new kind of signal processing pattern recognition filter designed to be used exactly as matched filters are presently used. The new filter is usually superior to the matched filter in terms of both between-class discrimination and within-class tolerance. Because it has these properties and reduces to the matched filter for simple enough cases, the new filter is called the generalized matched filter (GMF). In this paper we give further detail on GMF derivation and operation. Particular stress is laid on the effects of the difference in optimization criteria for those simple cases for which both the matched filter and the GMF are defined.

Citation Download Citation

H. J. Caulfield and Robert Haimes "Simple Generalized Matched Filters", Proc. SPIE 0209, Optical Signal Processing for C3I, (29 February 1980); https://doi.org/10.1117/12.958300

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