Search

Error bounds for nonlinear filtering are very important for performance evaluation and sensor management. This paper presents a comparative study of three error bounds for tracking filtering, when the detection probability is less than unity. One of these bounds is the random finite set (RFS) bound, which is deduced within the framework of finite set statistics. The others, which are the information reduction factor (IRF) posterior Cramer-Rao lower bound (PCRLB) and enumeration method (ENUM) PCRLB are introduced within the framework of finite vector statistics. In this paper, we deduce two propositions and prove that the RFS bound is equal to the ENUM PCRLB, while it is tighter than the IRF PCRLB, when the target exists from the beginning to the end. Considering the disappearance of existing targets and the appearance of new targets, the RFS bound is tighter than both IRF PCRLB and ENUM PCRLB with time, by introducing the uncertainty of target existence. The theory is illustrated by two nonlinear tracking applications: ballistic object tracking and bearings-only tracking. The simulation studies confirm the theory and reveal the relationship among the three bounds.

Compressive sensing (CS) can effectively recover a signal when it is sparse in some discrete atoms. However, in some applications, signals are sparse in a continuous parameter space, e.g., frequency space, rather than discrete atoms. Usually, we divide the continuous parameter into finite discrete grid points and build a dictionary from these grid points. However, the actual targets may not exactly lie on the grid points no matter how densely the parameter is grided, which introduces mismatch between the predefined dictionary and the actual one. In this article, a novel method, namely adaptive matching pursuit with constrained total least squares (AMP-CTLS), is proposed to find actual atoms even if they are not included in the initial dictionary. In AMP-CTLS, the grid and the dictionary are adaptively updated to better agree with measurements. The convergence of the algorithm is discussed, and numerical experiments demonstrate the advantages of AMP-CTLS. [ABSTRACT FROM AUTHOR]

An algorithm based on matching pursuit (MP) is proposed for inverse synthetic aperture radar (ISAR) two-dimensional (2-D) imaging of uniformly rotating targets. The ISAR echo is decomposed into many subsignals that are generated by discretizing spatial domain and synthesizing the ISAR data for every discretized spatial position. The subsignals that indeed contribute to the ISAR echo are selected by the MP, and their coefficients represent the superresolution image. The target rotation rate is estimated by combining MP with maximum contrast search. [ABSTRACT FROM PUBLISHER]

Abstract: Space–time adaptive processing (STAP) is a well-known technique in detecting slow-moving targets in the clutter-spreading environment. When considering the STAP system with conformal radar array (CFA), the training data are range-dependent, which results in poor detection performance of traditional statistical-based algorithms. Current registration-based compensation (RBC) is implemented based on a sub-snapshot spectrum using temporal smoothing. In this case, the estimation accuracy of the configuration parameters and the clutter power distribution is limited. In this paper, the technique of sparse representation is introduced into the spectral estimation, and a new compensation method is proposed, namely RBC with sparse representation (SR-RBC). This method first establishes the relationship between the clutter covariance matrix (CCM) and the clutter spectral distribution. Based on this, it avoids the problem of lacking stationary training data and converts the CCM estimation into the solving of the underdetermined equation only with the test cell. Then sparse representation method, like iterative reweighted least square (IRLS) is used to guide the solution of the underdetermined equation towards the actual clutter distribution. Finally, the transform matrix is designed using the CCM estimation so that the processed training data behaves nearly stationary with the test cell. Because the configuration parameters and the clutter spectral response are obtained with full-snapshot using sparse representation, SR-RBC provides more accurate clutter spectral estimation, and the transformed training data are more stationary so that better signal-clutter-ratio (SCR) improvement is achieved. [Copyright &y& Elsevier]

Abstract: The main function of Electronic Support Measure (ESM) is to receive, measure and deinterleave pulses, and then identify alternative threat emitters. Among these processes, pulse deinterleaving is vitally important because dense electromagnetic environments could cause an ESM system to receive a seemingly random pulse stream consisting of interleaved pulse trains with high noise levels. Only when we segregate different radar pulse trains from the pulse stream can we proceed with further processing. Traditional deinterleaving algorithms have demonstrated instability in unconventional circumstances (such as agility of pulse repetition interval (PRI), large noise and jitter, missing of intercepted pulses). Based on the dynamic process of different emitters, a new Statistical Association Pulse Deinterleaving (SAPD) approach is proposed based on the Multiple Hypothesis Tracking (MHT) algorithm in Multiple Target Tracking system. Simulation results have shown that the proposed algorithm can successfully identify pulse trains with constant, jittered and staggered PRI, and provide much greater accuracy in PRI estimation and pulse classification than traditional algorithms, with the presence of large noise, frequency jitter, and many missing pulses. [Copyright &y& Elsevier]