<p>In this thesis, the problem of estimating the clutter spatial intensity function for the multitarget tracking algorithms has been considered. In many scenarios, after the signal detection process, measurement points provided by the sensor (e.g., sonar, infrared sensor, radar) are not distributed uniformly in the surveillance region as assumed by most tracking algorithms. On the other hand, in order to obtain accurate results, the multitarget tracking algorithm requires information about clutter’s spatial intensity. Thus, non-homogeneous clutter spatial intensity has to be estimated from the measurement set and the tracking filter’s output. Also, in order to take advantage of existing tracking algorithms, it is desirable for the clutter estimation method to be integrated into the tracker itself. In this thesis, the clutter is modeled by a non-homogeneous Poisson point (NHPP) process with a spatial intensity function g(z). To calculate the value of the clutter spatial intensity, all we need to do is estimating g(z). First, two new methods for joint spatial clutter intensity estimation and multitarget tracking using the Probability Hypothesis Density (PHD) Filter are presented. Then, based on NHPP process, multitarget multi-Bernoulli processes and set calculus, the approximated Bayesian method is extended to joint the non–homogeneous clutter background estimation and multitarget tracking with standard multitarget tracking algorithms, like the Multiple Hypothesis Tracking (MHT) and the Joint Integrated Probabilistic Data Association (JIPDA) tracker. Finally, a kernel density method is proposed for the clutter spatial intensity estimation problem. Simulation results illustrate the performance of the above algorithms, both in terms of the false track number and the true track initialization speed. All proposed algorithms show the ability to improve the performance of the multitarget tracker in the presence of slowly time varying non–homogeneous clutter background.</p> / Doctor of Philosophy (PhD)

In this dissertation, sparse processing of signals for directions-of-arrival (DoAs) estimation is addressed in the framework of Compressive Sensing (CS). In particular, DoAs estimation problem for different types of sources, systems, and applications are formulated in the CS paradigm. In addition, the fundamental conditions related to the ``Sparsity'' and ``Linearity'' are carefully exploited in order to apply confidently the CS-based methodologies. Moreover, innovative strategies for various systems and applications are developed, validated numerically, and analyzed extensively for different scenarios including signal to noise ratio (SNR), mutual coupling, and polarization loss. The more realistic data from electromagnetic (EM) simulators are often considered for various analysis to validate the potentialities of the proposed approaches. The performances of the proposed estimators are analyzed in terms of standard root-mean-square error (RMSE) with respect to different degrees-of-freedom (DoFs) of DoAs estimation problem including number of elements, number of signals, and signal properties. The outcomes reported in this thesis suggest that the proposed estimators are computationally efficient (i.e., appropriate for real time estimations), robust (i.e., appropriate for different heterogeneous scenarios), and versatile (i.e., easily adaptable for different systems).