Abstract
A Dynamic Programming Algorithm (DPA) is a useful technique for a Track Before Detect (TBD) architecture implementation, designed to track and detect dim maneuvering targets from an image sequence under low SNR conditions. It especially suits real infrared clutter conditions and target behaviors that can be described as first order Markovian. The DPA does a search over all the possible state sequences, marking probable tracks by scanning each pixel in each frame, and determining where it was likely to originate from in the previous image, assuming it is the true target. Each transition receives a score based on its probability of being a target track. The scores are functions of the pixels intensity, transition velocity and direction and are given while considering their surrounding and a-priori restrictions such as the allowed maneuvering. In this paper we describe two tests obtained to set practical score parameters for such an algorithm. The achieved results for real infrared image sequences are shown.
| Original language | English |
|---|---|
| Pages (from-to) | 96-100 |
| Number of pages | 5 |
| Journal | Proceedings of SPIE - The International Society for Optical Engineering |
| Volume | 4473 |
| DOIs | |
| State | Published - 1 Dec 2001 |
| Event | Signal and Data Processing of Small Targets 2001 - San Diego, CA, United States Duration: 30 Jul 2001 → 2 Aug 2001 |
Keywords
- Dynamic Programming
- Infrared Images
- Track Before Detect
ASJC Scopus subject areas
- Electronic, Optical and Magnetic Materials
- Condensed Matter Physics
- Computer Science Applications
- Applied Mathematics
- Electrical and Electronic Engineering