In this work we introduce a novel track formation procedure to overcome the performance losses of the two-stage track-before-detect architecture in [1] when targets are closely-spaced. The proposed strategy adopts a dynamic programming algorithm which successively estimates the trajectories of prospective targets and removes the corresponding measurements from the input data, and which does not need a discretization of the state space. Experimental results demonstrate that its detection capabilities are almost independent of the mutual distance of the targets and equal to those of the system in [1] when targets are widely-spaced.

A track-before-detect algorithm with successive track cancellation

LOPS, Marco;
2013

Abstract

In this work we introduce a novel track formation procedure to overcome the performance losses of the two-stage track-before-detect architecture in [1] when targets are closely-spaced. The proposed strategy adopts a dynamic programming algorithm which successively estimates the trajectories of prospective targets and removes the corresponding measurements from the input data, and which does not need a discretization of the state space. Experimental results demonstrate that its detection capabilities are almost independent of the mutual distance of the targets and equal to those of the system in [1] when targets are widely-spaced.
978-1-4673-3144-9
File in questo prodotto:
File Dimensione Formato  
CAMSAP_2013.pdf

non disponibili

Dimensione 414.97 kB
Formato Adobe PDF
414.97 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.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11588/750534
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 1
  • ???jsp.display-item.citation.isi??? 0
social impact