Search

Abstract Coregistration is among the most important and challenging tasks when dealing with multiple synthetic aperture radar (SAR) images, especially when they are acquired at different time instants and characterised by low signal to noise power ratio (SNR) that contributes to their coherence reduction. However, even if some technological expedients could be implemented to maintain the same trajectory and to compensate for these inaccuracies during the acquisition campaign, multitemporal SAR images always need additional registration refinements after compression. Usually, to coregister a series of multitemporal SAR images, one of them is selected as the master, and the remainders are separately registered to it. Differently, in this study, a new strategy is developed to jointly coregister a stack of multitemporal SAR images. It is based on the exploitation of the cross‐correlations in turn computed from each couple of cross‐correlations (a.k.a. cross‐cross‐correlations) of the extracted patches. By doing so, the method is capable of exploiting also the respective misregistration information between the slaves during the estimation process. In this respect, this methodology is applied to enhance the registration capabilities of the constrained Least Squares (CLS) optimisation method, which instead does not account for the reciprocal information related to the slaves. Several tests are performed on multitemporal airborne‐measured SAR data. Obtained results show the effectiveness of the proposed algorithm in terms of achieved root mean square error for images affected by respective rotations also in comparison with the CLS counterpart.

Polarimetric decompositions are used to separate scatterers and identify their physical parameters by analyzing backscattering, coherence, or covariance matrices. Each cell within polarimetric synthetic aperture radar data is seen as a coherent or incoherent combination of different scattering mechanisms. However, targets are not perfectly characterized by these matrices due to the presence of noise components. The main objective of this study is to remedy the latest issue through proper noise effect elimination. Hence, we propose the reestimation of the coherence matrix, by incorporating a processing phase that searches for the number of elementary scattering mechanisms in each cell. This first step is based on the eigenvalues, which exploit the advantage of polarization basis independent of the eigenvectors. In the second step, a reduced space is defined by the eigenvectors selected, according to the cases of the first step, as those contributing to the construction of the target, excluding those judged to contribute to noise. The characteristic vector and the coherence matrix of the average target are then reconstructed in this new space in three different ways: summation of the elementary coherence matrices, applying Bernoulli's probability law, and orthogonal projection on the reduced space. Finally, the Freeman–Durden polarimetric decomposition and the $H$–$\overline{\alpha }$ Wishart classification are used to show the effectiveness of the process in terms of dominant scattering mechanism identification. Their application on simulated data and on fully polarized RadarSat-2 images of the city of Algiers attests to the performance of the proposed methodology to improve the identification of dominant scattering mechanisms.

Space-time adaptive processing (STAP) is a well-known and effective method to detect targets, obscured by interference, from airborne radars that works by coherently combining signals from a phased antenna array (spatial domain) with multiple radar pulses (temporal domain). As widely demonstrated, optimum STAP, in the sense of maximizing the output signal to interference plus noise ratio (SINR), is a coherent, linear, transversal filter (i.e., tapped delay line), that can be synthesized by a complex-valued weight vector. This paper extends previous work that focused on adaptive spatial-only nulling; it derives the optimum phase-only STAP, namely, the optimal weight vector that maximizes the SINR subject to the constraint it belongs to the $N$ -torus of phase-only complex vectors, where $N$ is the number of spatio-temporal degrees of freedom. Because this problem does not admit a closed-form solution, it is solved numerically using the phase-only conjugate gradient method (CGM). The effectiveness of phase-only STAP is demonstrated using both SINR values and receiving beampattern shape, comparing it with the optimum fully-adapted STAP and the nonadapted beam former responses as well as other possible counterparts. Additionally, several analyses of practical utility also demonstrate the benefits provided by phase-only STAP.

This paper considers the problem of censoring outliers from the secondary dataset in a radar scenario where the sample support is limited. To this end, the generalized regularized likelihood function (GRLF) criterion is used and the corresponding regularized maximum likelihood (RML) estimate of the outlier subset is derived. Since the exact RML estimate involves the solution of a combinatorial optimization problem, a reduced complexity but approximate RML (ARML) procedure is also designed. As to the selection of the regularization parameter, both the expected likelihood (EL) principle and the cross-validation (CV) technique are exploited. At the analysis stage, the performance of the RML and ARML procedure is evaluated based on simulated data in comparison with some previously proposed methods. The results highlight that the RML and ARML algorithm achieves, in general, a satisfactory performance level whereas the previously proposed techniques often experience some performance degradation when the volume of training data is dramatically limited.

This study considers censoring outliers in a radar scenario with limited sample support. The problem is formulated as obtaining the regularised maximum likelihood (RML) estimate of the outlier index set. Since the RML estimate involves solving a combinatorial optimisation problem, a reduced complexity but approximate RML (ARML) procedure is also devised. As to the selection of the regularisation parameter, the cross-validation technique is exploited. At the analysis stage, the performance of the RML/ARML procedure is evaluated based both on simulated and challenging knowledge-aided sensor signal processing and expert reasoning data, also in comparison with some other outlier excision methods available in the open literature. The numerical results highlight that the RML/ARML algorithm achieves a satisfactory performance level in the presence of limited as well as sufficient sample supports whereas the other counterparts often experience a certain performance degradation for the insufficient training volume.