Performance analysis of reconstruction algorithms for breast microwave imaging

The problem of localizing a scatterer, which represents a tumor, in a homogeneous circular domain, which represents a breast, is addressed. A breast imaging method based on microwaves is considered. The microwave imaging involves to several techniques for detecting, localizing and characterizing tumors in breast tissues. In all such methods an electromagnetic inverse scattering problem exists. For the scattering detection method, an algorithm based on a linear procedure solution, inspired by MUltiple SIgnal Classification algorithm (MUSIC) and Time Reversal method (TR), is implemented. The algorithm returns a reconstructed image of the investigation domain in which it is detected the scatterer position. This image is called pseudospectrum. A preliminary performance analysis of the algorithm vying the working frequency is performed: the resolution and the signal-to-noise ratio of the pseudospectra are improved if a multi-frequency approach is considered. The Geometrical Mean-MUSIC algorithm (GM- MUSIC) is proposed as multi-frequency method. The performance of the GMMUSIC is tested in different real life computer simulations. The performed analysis shows that the algorithm detects the scatterer until the electrical parameters of the breast are known. This is an evident limit, since, in a real life situation, the anatomy of the breast is unknown. An improvement in GM-MUSIC is proposed: the Eye-GMMUSIC algorithm. Eye-GMMUSIC algorithm needs no a priori information on the electrical parameters of the breast. It is an optimizing algorithm based on the pattern search algorithm: it searches the breast parameters which minimize the Signal-to-Clutter Mean Ratio (SCMR) in the signal. Finally, the GM-MUSIC and the Eye-GMMUSIC algorithms are tested on a microwave breast cancer detection system consisting of an dipole antenna, a Vector Network Analyzer and a novel breast phantom built at University of Bologna. The reconstruction of the experimental data confirm the GM-MUSIC ability to localize a scatterer in a homogeneous medium.

Estimation of the satellite ephemerides of Saturn using optical navigation pictures of Cassini

The goal of this dissertation thesis is the estimation of the Saturnian satellites ephemerides using optical data of Cassini. In the first part we describe the software employed for the reduction of the images showing its main features and the accuracy that can be achieved comparing the results with published astrometry. Afterwards we describe the orbit determination problem (ODP) with particular focus on the weights selection for the estimation process. The third chapter describes the dynamical model used and the sources of potential errors in the residuals. The model have been validated trying to replicate JPL's published ephemerides SAT365, SAT375, SAT389 and SAT409. The final part investigates the residuals and the estimated ephemerides with particular focus on the giant moon Titan, the only in the solar system with an atmosphere other than the Earth. No astrometry have been retrieved in literature of Titan using optical observables, thus this represents one of the first investigations of the giant.

Estimation of the ephemerides and gravity fields of the Galilean moons through orbit determination of the JUICE mission

Jupiter and its moons are a complex dynamical system that include several phenomenon like tides interactions, moon's librations and resonances. One of the most interesting characteristics of the Jovian system is the presence of the Laplace resonance, where the orbital periods of Ganymede, Europa and Io maintain a 4:2:1 ratio respectively. It is interesting to study the role of the Laplace Resonance in the dynamic of the system, especially regarding the dissipative nature of the tidal interaction between Jupiter and its closest moon, Io. Numerous theories have been proposed regarding the orbital evolution of the Galilean satellites, but they disagree about the amount of dissipation of the system, therefore about the magnitude and the direction of the evolution of the system, mainly because of the lack of experimental data. The future JUICE space mission is a great opportunity to solve this dispute. JUICE is an ESA (European Space Agency) L-class mission (the largest category of missions in the ESA Cosmic Vision) that, at the beginning of 2030, will be inserted in the Jovian system and that will perform several flybys of the Galilean satellites, with the exception of Io. Subsequently, during the last part of the mission, it will orbit around Ganymede for nine months, with a possible extension of the mission. The data that JUICE will collect during the mission will have an exceptional accuracy, allowing to investigate several aspects of the dynamics the system, especially, the evolution of Laplace Resonance of the Galilean moons and its stability. This thesis will focus on the JUICE mission, in particular in the gravity estimation and orbit reconstruction of the Galilean satellites during the Jovian orbital phase using radiometric data. This is accomplished through an orbit determination technique called multi-arc approach, using the JPL's orbit determination software MONTE (Mission-analysis, Operations and Navigation Tool-kit Environment).

Bayesian Linear Regression for estimation of the Fractal Dimension of the Cerebral Cortex

The cerebral cortex presents self-similarity in a proper interval of spatial scales, a property typical of natural objects exhibiting fractal geometry. Its complexity therefore can be characterized by the value of its fractal dimension (FD). In the computation of this metric, it has usually been employed a frequentist approach to probability, with point estimator methods yielding only the optimal values of the FD. In our study, we aimed at retrieving a more complete evaluation of the FD by utilizing a Bayesian model for the linear regression analysis of the box-counting algorithm. We used T1-weighted MRI data of 86 healthy subjects (age 44.2 ± 17.1 years, mean ± standard deviation, 48% males) in order to gain insights into the confidence of our measure and investigate the relationship between mean Bayesian FD and age. Our approach yielded a stronger and significant (P < .001) correlation between mean Bayesian FD and age as compared to the previous implementation. Thus, our results make us suppose that the Bayesian FD is a more truthful estimation for the fractal dimension of the cerebral cortex compared to the frequentist FD.

Analysis of Tracking Algorithms for Extended Target Radar Problems

This work proposes the analysis of tracking algorithms for point objects and extended targets particle filter on a radar application problem. Through simulations, the number of particles, the process and measurement noise of particle filter have been optimized. Four different scenarios have been considered in this work: point object with linear trajectory, point object with non-linear trajectory, extended object with linear trajectory, extended object with non-linear trajectory. The extended target has been modelled as an ellipse parametrized by the minor and major axes, the orientation angle, and the center coordinates (5 parameters overall).

Energy consumption of parallel algorithms for solving linear systems on HPC architecture

Modern High-Performance Computing HPC systems are gradually increasing in size and complexity due to the correspondent demand of larger simulations requiring more complicated tasks and higher accuracy. However, as side effects of the Dennard’s scaling approaching its ultimate power limit, the efficiency of software plays also an important role in increasing the overall performance of a computation. Tools to measure application performance in these increasingly complex environments provide insights into the intricate ways in which software and hardware interact. The monitoring of the power consumption in order to save energy is possible through processors interfaces like Intel Running Average Power Limit RAPL. Given the low level of these interfaces, they are often paired with an application-level tool like Performance Application Programming Interface PAPI. Since several problems in many heterogeneous fields can be represented as a complex linear system, an optimized and scalable linear system solver algorithm can decrease significantly the time spent to compute its resolution. One of the most widely used algorithms deployed for the resolution of large simulation is the Gaussian Elimination, which has its most popular implementation for HPC systems in the Scalable Linear Algebra PACKage ScaLAPACK library. However, another relevant algorithm, which is increasing in popularity in the academic field, is the Inhibition Method. This thesis compares the energy consumption of the Inhibition Method and Gaussian Elimination from ScaLAPACK to profile their execution during the resolution of linear systems above the HPC architecture offered by CINECA. Moreover, it also collates the energy and power values for different ranks, nodes, and sockets configurations. The monitoring tools employed to track the energy consumption of these algorithms are PAPI and RAPL, that will be integrated with the parallel execution of the algorithms managed with the Message Passing Interface MPI.