In this paper we address the problem of multi-frame detection (MFD) of a Markov target observed through noisy measurements. To limit the system complexity, we gate the detector with a pre-processing stage which discards unreliable observations in each frame. A novel dynamic programming algorithm is introduced, which applies a track-before-detect (TBD) logic to declare the presence of the target and jointly estimate its position. The closed-form complexity analysis and the numerical examples show that advantageous complexity-performance tradeoff's can be obtained with respect to the single-frame detector and with respect to other strategies already present in the literature.
A track-before-detect algorithm for the detection of a Markov target in the presence of missing observations / Grossi, E.; Lops, M.; Venturino, L.. - (2013), pp. 6382-6386. ( 2013 IEEE International Conference on Acoustics, Speech, and Signal Processing Vancouver, Canada 26-31 May 2013) [10.1109/ICASSP.2013.6638894].
A track-before-detect algorithm for the detection of a Markov target in the presence of missing observations
Lops M.;
2013
Abstract
In this paper we address the problem of multi-frame detection (MFD) of a Markov target observed through noisy measurements. To limit the system complexity, we gate the detector with a pre-processing stage which discards unreliable observations in each frame. A novel dynamic programming algorithm is introduced, which applies a track-before-detect (TBD) logic to declare the presence of the target and jointly estimate its position. The closed-form complexity analysis and the numerical examples show that advantageous complexity-performance tradeoff's can be obtained with respect to the single-frame detector and with respect to other strategies already present in the literature.| File | Dimensione | Formato | |
|---|---|---|---|
|
ICASSP2013.pdf
non disponibili
Dimensione
647.57 kB
Formato
Adobe PDF
|
647.57 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.


