Share Email Print

Proceedings Paper

Algorithm For Subpixel Target Detection Using Cellular Automata
Author(s): Kendall Preston
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 17 May 1989
PDF: 5 pages
Proc. SPIE 1058, High Speed Computing II, (17 May 1989); doi: 10.1117/12.951661
Show Author Affiliations
Kendall Preston, Carnegie-Mellon University (United States)

Published in SPIE Proceedings Vol. 1058:
High Speed Computing II
Keith Bromley, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?