Proceedings PaperAlgorithm For Subpixel Target Detection Using Cellular Automata
|Format||Member Price||Non-Member Price|
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.