Explore the vast range of titles available.

This paper concerns direction of arrival (DOA) estimation based on a sparse Bayesian learning (SBL) approach. We address two inherent problems of this class of DOA estimation methods: (i) a predefined dictionary can generate off-grid problems to a SBL DOA estimator; (ii) a parametric prior generally enforces the solution to be sparse, but the existence of noise can greatly affect the sparsity of the solution. Both of these issues may have a negative impact on the estimation accuracy. In this paper, we propose an improved root SBL (IRSBL) method for off-grid DOA estimation that adopts a coarse grid to generate an initial dictionary. To reduce the bias caused by dictionary mismatch, we integrate the polynomial rooting approach into the SBL method to refine the spatial angle grid. Then, we integrate a constant false alarm rate rule in the SBL framework to enforce sparsity and improve computational efficiency. Finally, we generalize the IRSBL method to the case of non-uniform linear arrays. Numerical analysis demonstrates that the proposed IRSBL method provides improved performance in terms of both estimation accuracy and computational complexity over the most relevant existing method.

This paper deals with the problem of estimating the directions of arrival (DOA) of multiple source signals from a single observation vector of an array data. In particular, four estimation algorithms based on the theory of compressed sensing (CS), i.e., the classical ℓ 1 minimization (or Least Absolute Shrinkage and Selection Operator, LASSO), the fast smooth ℓ 0 minimization, and the Sparse Iterative Covariance-Based Estimator, SPICE and the Iterative Adaptive Approach for Amplitude and Phase Estimation, IAA-APES algorithms, are analyzed, and their statistical properties are investigated and compared with the classical Fourier beamformer (FB) in different simulated scenarios. We show that unlike the classical FB, a CS-based beamformer (CSB) has some desirable properties typical of the adaptive algorithms (e.g., Capon and MUSIC) even in the single snapshot case. Particular attention is devoted to the super-resolution property. Theoretical arguments and simulation analysis provide evidence that a CS-based beamformer can achieve resolution beyond the classical Rayleigh limit. Finally, the theoretical findings are validated by processing a real sonar dataset.

This paper deals with the problem of estimating the parameters of heavy-tailed sea clutter in high-resolution radar, when the clutter is modeled by the correlated Pareto type II distribution. Existing estimators based on the maximum likelihood (ML) approach, integer-order moments (IOM) approach, fractional-order moments (FOM), and log-moments (log-MoM) have shown to be sensitive to changes in data correlation. In this work, we resort to a deep learning (DL) approach based on a multi-headed architecture to overcome this problem. Offline training of the artificial neural networks (ANN) is carried out by using several combinations of the clutter parameters, with different correlation degrees. To assess the performance of the proposed estimator, we resort to Monte Carlo simulation, and we observed that it has superior performance over existing approaches in terms of estimation mean square error (MSE) and robustness to changes of the clutter correlation coefficient.

This work addresses the problem of target detection for multistatic radars. We propose an algorithm that is able to keep constant the false alarm rate, when the disturbance samples associated with each receiver-transmitter pair are distributed according to a compound Gaussian model. The performance of the proposed detection algorithm are analysed to assess the impact of clutter diversity on detection performance. The results show that clutter statistical diversity has a strong impact on detection performance. The performance of both single-channel and multichannel detection schemes are evaluated by processing real sea clutter data collected by the NetRAD nodes, in order to evaluate which of the two channels, i.e. the bistatic and monostatic channels, is more favourable for target detection. Furthermore, the gain achieved by using a multistatic detection algorithm is also analysed.

Reproducible research results become more and more an important issue as systems under investigation are growing permanently in complexity, and it becomes thus almost impossible to judge the accuracy of research results merely on the bare paper presentation. Peer Reviewed

Scatter matrix estimation and hypothesis testing are fundamental inference problems in a wide variety of signal processing applications. In this paper, we investigate and compare the matched, mismatched, and robust approaches to solve these problems in the context of the complex elliptically symmetric (CES) distributions. The matched approach is when the estimation and detection algorithms are tailored on the correct data distribution, whereas the mismatched approach refers to the case when the scatter matrix estimator and the decision rule are derived under a model assumption that is not correct. The robust approach aims at providing good estimation and detection performance, even if suboptimal, over a large set of possible data models, irrespective of the actual data distribution. Specifically, due to its central importance in both the statistical and engineering applications, we assume for the input data a complex t -distribution. We analyze scatter matrix estimators derived under the three different approaches and compare their mean square error (MSE) with the constrained Cramér-Rao bound (CCRB) and the constrained misspecified Cramér-Rao bound (CMCRB). In addition, the detection performance and false alarm rate (FAR) of the various detection algorithms are compared with that of the clairvoyant optimum detector.

An important prerequisite for successful multisensor integration is that the data from the reporting sensors are transformed to a common reference frame free of systematic or registration bias errors. The relative sensor registration (or grid-locking) process aligns remote data to local data under the assumption that the local data are bias free and that all biases reside with the remote sensor. In this study, an algorithm based on the expectation-maximisation approach is proposed to estimate all the registration errors involved in the grid-locking problem, that is, attitude, measurement and position biases. Its statistical performance is investigated by Monte Carlo simulation and compared with that of a previously derived linear least squares estimator and to the hybrid Cramér–Rao lower bound.

The ability to recognise quickly and reliably non-cooperative targets is a primary issue in modern radar systems. The use of multistatic radars has already been demonstrated to improve sensibly the recognition capacity of a radar system, through the exploitation of its inherent spatial diversity, given by the presence of multiple observation channels. This calls for the development of suitable fusion strategies for efficiently combining the signals arising from multiple channels of the network. In this study, the authors define a multistatic classification algorithm where the information on the target class is provided by the sensors of the system and the final decision is made using a fusion rule that combines the decisions coming from each channel of the radar network. A suitable selection is made to favour the channels with better performance. The numerical analysis demonstrates the superior performance of the proposed algorithm over the classical fusion rule, that takes into account only the effect of the energy path loss, in terms of probability of correct classification.

This paper deals with the problem of estimating the directions of arrival (DOA) of multiple source signals from a single observation vector of an array data. In particular, four estimation algorithms based on the theory of compressed sensing (CS), i.e., the classical ^sub 1^ minimization (or Least Absolute Shrinkage and Selection Operator, LASSO), the fast smooth ^sub 0^ minimization, and the Sparse Iterative Covariance-Based Estimator, SPICE and the Iterative Adaptive Approach for Amplitude and Phase Estimation, IAA-APES algorithms, are analyzed, and their statistical properties are investigated and compared with the classical Fourier beamformer (FB) in different simulated scenarios. We show that unlike the classical FB, a CS-based beamformer (CSB) has some desirable properties typical of the adaptive algorithms (e.g., Capon and MUSIC) even in the single snapshot case. Particular attention is devoted to the super-resolution property. Theoretical arguments and simulation analysis provide evidence that a CS-based beamformer can achieve resolution beyond the classical Rayleigh limit. Finally, the theoretical findings are validated by processing a real sonar dataset.[PUBLICATION ABSTRACT]