GGGaetano Giunta

Gaetano Giunta

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Gaetano Giunta has a total of 123 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Effective Lock Detectors Based on Costas Loop Output for SBPSK Mobile Communications

    by D. Ferramola, T. Casilli, S. Pradella, G. Giunta, D. Orlando

    In this manuscript, we address the problem of lock detection at the output of a Costas loop when robust modulations for bandwidth-constrained military communications are used. In this respect, we propose two novel detectors that share the important constant false alarm rate property with respect to the noise power. The first decision scheme is an improvement of the detector proposed in [1], whereas the second architecture is grounded on the likelihood ratio test where in place of the unknown parameters suitable estimates are used. Such estimates are obtained through an iterative strategy relying on the Expectation Maximization algorithm. Moreover, when possible, we provide exact statistical characterizations of the considered decision schemes (including the competitors) or, in the other case, suitable approximations that allow for a straightforward performance evaluation. The numerical examples are obtained by means of simulated data and in comparison with the most common lock detectors for this kind of communications. The numerical results highlight that the proposed detectors represent a viable means to manage real-time lock detection.


  • EM-Based Algorithm for Unsupervised Clustering of Measurements from a Radar Sensor Network

    by Linjie Yan, Pia Addabbo, Nicomino Fiscante, Carmine Clemente, Chengpeng Hao, Gaetano Giunta, Danilo Orlando

    This paper deals with the problem of clustering data returned by a radar sensor network that monitors a region where multiple moving targets are present. The network is formed by nodes with limited functionalities that transmit the estimates of target positions (after a detection) to a fusion center without any association between measurements and targets. To solve the problem at hand, we resort to model-based learning algorithms and instead of applying the plain maximum likelihood approach, due to the related computational requirements, we exploit the latent variable model coupled with the expectation-maximization algorithm. The devised estimation procedure returns posterior probabilities that are used to cluster the huge amount of data collected by the fusion center. Remarkably, we also consider challenging scenarios with an unknown number of targets and estimate it by means of the model order selection rules. The clustering performance of the proposed strategy is compared to that of conventional data-driven methods over synthetic data. The numerical examples point out that the herein proposed solutions can provide reliable clustering performance overcoming the considered competitors.


  • ECCM Strategies for Radar Systems Against Smart Noise-Like Jammers

    by Dario Benvenuti, Pia Addabbo, Gaetano Giunta, Goffredo Foglia, Danilo Orlando

    In this paper, we address the problem of detecting a Noise-Like Jammer (NLJ) that does not quickly transmit all the available power but it gradually increases the transmitted power. This control strategy would prevent conventional electronic counter-countermeasures from revealing the presence of a noise power discontinuity in the window under test. As a consequence, the radar system under attack becomes blind requiring a reaction by an expert operator. In order to face such a situation, we devise two innovative NLJ detection architectures by assuming at the design stage specific models for the NLJ power variation. The first model is based on a linear variation law over the observation time, whereas in the second model, the NLJ power experiences unconstrained fluctuations in the window under test. Under these hypotheses, we resort to ad hoc modifications of the generalized likelihood ratio test, where the unknown parameters are replaced by suitable estimates obtained through iterative procedures. The performance analysis, carried out using synthetic data, shows the effectiveness and superiority of the proposed detectors over the conventional approach.


  • Open Access

    Enhancements of River Water Level Monitoring Method Using COSMO-SkyMed SAR Images

    by Francesco Forlingieri, Filippo Biondi, Nicomino Fiscante, Angelica Tarpanelli, Pia Addabbo, Carmine Clemente, Gaetano Giunta, Danilo Orlando

    The problem of not having persistent river levels monitoring via satellite remote sensing is of considerable importance because the lack of this capability could affect the safety of inhabited areas near rivers. It has been shown that Synthetic Aperture Radar (SAR) interferometry is a valid tool to measure the water surface of the river. Unfortunately, rivers can swell dynamically in less time than between two observations with the same geometric SAR parameters. Therefore, interferometric time series could not be used for effective emergency prevention and continuous monitoring because of geometric constraints. In this paper we propose an improvement of previous research by considering arbitrary geometric SAR acquisitions. The proposed method allows us to increase the possibility of image acquisition in order to drastically reduce the revisit time with respect to an interferometric acquisition strategy. Experimental results are consistent with the water level measurements from the in situ stations. Finally, the proposed procedure can potentially use data from any satellite system positioned in any orbit, not only sun-synchronous, in order to reduce time for more continuous monitoring of river levels.

  • Open Access

    EM-based Algorithm for Unsupervised Clustering of Measurements from a Radar Sensor Network

    by Linjie Yan, Pia Addabbo, Nicomino Fiscante, Carmine Clemente, Chengpeng Hao, Gaetano Giunta, Danilo Orlando

    This paper deals with the problem of clustering data returned by a radar sensor network that monitors a region where multiple moving targets are present. The network is formed by nodes with limited functionalities that transmit the estimates of target positions (after a detection) to a fusion center without any association between measurements and targets. To solve the problem at hand, we resort to model-based learning algorithms and instead of applying the plain maximum likelihood approach, due to the related computational requirements, we exploit the latent variable model coupled with the expectation-maximization algorithm. The devised estimation procedure returns posterior probabilities that are used to cluster the huge amount of data collected by the fusion center. Remarkably, we also consider challenging scenarios with an unknown number of targets and estimate it by means of the model order selection rules. The clustering performance of the proposed strategy is compared to that of conventional data-driven methods over synthetic data. The numerical examples point out that the herein proposed solutions can provide reliable clustering performance overcoming the considered competitors.

  • Robust Target Localization for Multistatic Passive Radar Networks

    by Linjie Yan, Luca Pallotta, Gaetano Giunta, Danilo Orlando

    Passive multistatic radar networks localize a non-cooperative target exploiting the bistatic measurements associated with signals emitted by several transmitters of opportunity and acquired by multiple receivers. However, in realistic scenarios, it might happen that one or more receivers are damaged and/or under malicious attacks with a consequent degradation of the system performance. This paper proposes a procedure to reveal sensors that return anomalous measurements due to an attack or a failure. Specifically, we first detect such measurements by solving a binary hypothesis test, then we cancel them and estimate the final delays as well as the target position. The performance of the overall architecture is assessed using both synthetic data and real-recorded data.


  • Open Access

    Multiple Sub-Pixel Target Detection for Hyperspectral Imaging Systems

    by Pia Addabbo, Nicomino Fiscante, Gaetano Giunta, Danilo Orlando, Giuseppe Ricci, Silvia Liberata Ullo

    Hyperspectral target detection is a task of primary importance in remote sensing since it allows for location and discrimination of target features. To this end, the reflectance maps, which contain the spectral signatures and related abundances of the materials in the observed scene, are often used. However, due to the low spatial resolution of most hyperspectral sensors, targets occupy a fraction of the pixel and, hence, the spectra of different sub-pixel targets (including the background spectrum) are mixed together within the same pixel. To solve this issue, in this paper, we adopt a generalized replacement model accounting for multiple sub-pixel target spectra and formulate the detection problem at hand as a binary hypothesis test where under the alternative hypothesis the target is modeled in terms of a linear combination of endmembers whose coefficients also account for the presence of the background. Then, we devise detection architectures based upon the generalized likelihood ratio test where the unknown parameters are suitably estimated through procedures inspired by the maximum likelihood approach. The performances of the proposed decision schemes are evaluated by means of both synthetic as well as real data and compared with an analogous counterpart by showing the effectiveness of the proposed procedure.


  • Open Access

    Super-Resolution of Synthetic Aperture Radar Complex Data by Deep-Learning

    by Pia Addabbo, Mario Luca Bernardi, Filippo Biondi, Marta Cimitile, Carmine Clemente, Nicomino Fiscante, Gaetano Giunta, Danilo Orlando, Linjie Yan

    One of the greatest limitations of Synthetic Aperture Radar imagery is the capability to obtain an arbitrarily high spatial resolution. Indeed, despite optical sensors, this capability is not just limited by the sensor technology. Instead, improving the SAR spatial resolution requires large transmitted bandwidth and relatively long synthetic apertures that for regulatory and practical reasons are impossible to be met. This issue gets particularly relevant when dealing with Stripmap mode acquisitions and with low carrier frequency sensors (where relatively large bandwidth signals are more difficult to be transmitted). To overcome this limitation, in this paper a deep learning based framework is proposed to enhance the spatial resolution of low-resolution SAR images while retaining the complex image accuracy. Results on simulated and real SAR data demonstrate the effectiveness of the proposed framework.


  • Open Access

    Classification Schemes for the Radar Reference Window: Design and Comparisons

    by Chaoran Yin, Linjie Yan, Chengpeng Hao, Silvia Liberata Ullo, Gaetano Giunta, Alfonso Farina, Danilo Orlando

    In this paper, we address the problem of classifying data within the radar reference window in terms of statistical properties. Specifically, we partition these data into statistically homogeneous subsets by identifying possible clutter power variations with respect to the cells under test (accounting for possible range-spread targets) and/or clutter edges. To this end, we consider different situations of practical interest and formulate the classification problem as multiple hypothesis tests comprising several models for the operating scenario. Then, we solve the hypothesis testing problems by resorting to suitable approximations of the model order selection rules due to the intractable mathematics associated with the maximum likelihood estimation of some parameters. Remarkably, the classification results provided by the proposed architectures represent an advanced clutter map since, besides the estimation of the clutter parameters, they contain a clustering of the range bins in terms of homogeneous subsets. In fact, such information can drive the conventional detectors towards more reliable estimates of the clutter covariance matrix according to the position of the cells under test. The performance analysis confirms that the conceived architectures represent a viable means to recognize the scenario wherein the radar is operating at least for the considered simulation parameters.

  • Classification Schemes for the Radar Reference Window: Design and Comparisons

    by Chaoran Yin, Linjie Yan, Chengpeng Hao, Silvia Liberata Ullo, Gaetano Giunta, Alfonso Farina, Danilo Orlando

    In this paper, we address the problem of classifying data within the radar reference window in terms of statistical properties. Specifically, we partition these data into statistically homogeneous subsets by identifying possible clutter power variations with respect to the cells under test (accounting for possible range-spread targets) and/or clutter edges. To this end, we consider different situations of practical interest and formulate the classification problem as multiple hypothesis tests comprising several models for the operating scenario. Then, we solve the hypothesis testing problems by resorting to suitable approximations of the model order selection rules due to the intractable mathematics associated with the maximum likelihood estimation of some parameters. Remarkably, the classification results provided by the proposed architectures represent an advanced clutter map since, besides the estimation of the clutter parameters, they contain a clustering of the range bins in terms of homogeneous subsets. In fact, such information can drive the conventional detectors towards more reliable estimates of the clutter covariance matrix according to the position of the cells under test. The performance analysis confirms that the conceived architectures represent a viable means to recognize the scenario wherein the radar is operating at least for the considered simulation parameters.