Share Email Print

Proceedings Paper

Dynamic programming algorithm for point target detection: practical parameters for DPA
Author(s): Roni Succary; Aliza Cohen; Perry Yaractzi; Stanley R. Rotman
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

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

Paper Details

Date Published: 26 November 2001
PDF: 5 pages
Proc. SPIE 4473, Signal and Data Processing of Small Targets 2001, (26 November 2001); doi: 10.1117/12.492788
Show Author Affiliations
Roni Succary, Ben-Gurion Univ. of the Negev (Israel)
Aliza Cohen, Ben-Gurion Univ. of the Negev (Israel)
Perry Yaractzi, Ben-Gurion Univ. of the Negev (Israel)
Stanley R. Rotman, Ben-Gurion Univ. of the Negev (Israel)

Published in SPIE Proceedings Vol. 4473:
Signal and Data Processing of Small Targets 2001
Oliver E. Drummond, Editor(s)

© SPIE. Terms of Use
Back to Top