1. Track Assembly And Background Suppression Using An Array Processor And Neighborhood Coding
- Author
-
Herbert E. Rauch, Walter G. Eppler, and Oscar Firschein
- Subjects
Engineering ,Data processing ,Signal processing ,Pixel ,business.industry ,Binary data ,Array processing ,Image processing ,Computer vision ,Artificial intelligence ,business ,Coding (social sciences) ,Vector processor - Abstract
A novel method for real time track assembly is presented which identifies new tracks, assigns measurementsto existing tracks, and eliminates false tracks. The method utilizes a sequence of two -dimensional frames ofbinary data from an infrared sensor where binary 1 in a picture element indicates target or noise abovethreshold and binary 0 is below threshold. Successive sets of two -dimensional frames are combined and then screened using a three -by -three pixel window. The track assembly is based upon neighborhood coding and "trackscoring" which uses the binary configuration in the three -by -three window to distinguish between target tracks and noise. The method makes use of successive levels of data processing, and in a cluttered environment(noise in 3% of the pixels) it may be necessary to use three or more levels to eliminate false tracks due to noise. A special coding technique is developed for the Floating Point System AP -120B off - the -shelf array processor to allow processing of 160,000 pixels per second independent of the number of targets. This paperexplains the coding scheme and the array processor mechanization.IntroductionRapid and accurate track assembly is a key aspect of many tracking problems. Representative applicationsinclude air defense against airplanes, ballistic missile defense against reentry vehicles, and ocean sur-veillance of ships. Important requirements for track assembly when there are multiple targets in a clutteredenvironment include initiating new tracks due to unknown targets, associating new measurements with the appro-priate track, and eliminating false tracks due to clutter.There are sophisticated algorithms for tracking of multiple targets, such as those of Reidl, which arecapable of calculating probabilities for various data association hypotheses. A comprehensive set of paperson multiple target tracking is included in the recent survey paper by Bar- Shalom2. The results of extensiveprevious work on automatic track initiation are summarized in the proceedings of a recent NATO Specialists
- Published
- 1980
- Full Text
- View/download PDF