Algorithm For Subpixel Target Detection Using Cellular Automata

Kendall Preston

doi:10.1117/12.951661

17 May 1989 Algorithm For Subpixel Target Detection Using Cellular Automata

Kendall Preston

Proceedings Volume 1058, High Speed Computing II; (1989) https://doi.org/10.1117/12.951661
Event: OE/LASE '89, 1989, Los Angeles, CA, United States

Abstract

Modern cellular automata, especially those configured to process the three dimensions of x,y,t (two spatial coordinates and time) are shown to be useful in furnishing several decibels of processing gain against white Gaussian noise while monitoring millions of potential target tracks at several frames per second for the purpose of detecting weak, subpixel targets. Using three-dimensional architectures employing the multidimensional binary ranking filter permits these operations to be executed effectively. Calculations of processing gain are furnished along with a discussion of the three-dimensional cellular automaton architecture itself.

Citation Download Citation

Kendall Preston "Algorithm For Subpixel Target Detection Using Cellular Automata", Proc. SPIE 1058, High Speed Computing II, (17 May 1989); https://doi.org/10.1117/12.951661

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