Share Email Print

Proceedings Paper

Target detection and recognition using Markov modeling and probability updating
Author(s): Patrick A. Kelly; Haluk Derin; Renjian Zhao
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

While extract methods (e.g., jump-diffusion algorithms) for performing maximum a posteriori (MAP) target detection and recognition can be very complex and computationally expensive, it is often not clear how to develop effective and less complex suboptimal methods. Also, MAP algorithms typically generate hard decisions, but for fusion applications it would often be more desirable to have probabilities or confidence levels for a range of alternatives. In this paper, we consider the application of a framework called probability propagation in Bayesian networks. This framework organizes computations for iterated approximations to posterior probabilities, and has been used recently by communications researchers to derive very effective iterative decoding algorithms. In this paper, we develop a Bayesian network model for the problem of target detection and recognition, and use it in conjunction with Markov models for target regions to derive a probability propagation algorithm for estimating target shape and label probabilities.

Paper Details

Date Published: 3 April 2000
PDF: 11 pages
Proc. SPIE 4051, Sensor Fusion: Architectures, Algorithms, and Applications IV, (3 April 2000); doi: 10.1117/12.381642
Show Author Affiliations
Patrick A. Kelly, Univ. of Massachusetts/Amherst (United States)
Haluk Derin, Univ. of Massachusetts/Amherst (United States)
Renjian Zhao, Univ. of Massachusetts/Amherst (United States)

Published in SPIE Proceedings Vol. 4051:
Sensor Fusion: Architectures, Algorithms, and Applications IV
Belur V. Dasarathy, 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?