Andrea Frosini

Prof. Dr. Andrea Frosini

orcid

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
19 November 2015 in Inverse Problems
Verified
Journal Article
Closed access
PDF file
PDPaolo Dulio
Paolo Dulio
AFAndrea Frosini
Andrea Frosini
SPSilvia M C Pagani
Silvia M C Pagani
In the reconstruction problem of discrete tomography, projections are considered from a finite set of lattice directions. Employing a limited number of projections implies that the injectivity of the Radon transform is lost, and, in general, images consistent with a given set of projections form a huge class. In order to lower the number of allowed solutions, one usually tries to include in the problem some a priori information. This suggests that modelling the tomographic reconstruction problem as a linear system of equations is preferable. In this paper we propose to restrict the usual notion of uniqueness, related to the solutions of the linear system, and to provide, for each set a geometrical characterization of the shape of a lattice subset, say region of uniqueness (ROU), forming a partial, fast reconstructible, solution. Any selected set intrinsically determines its ROU inside an arbitrary lattice grid. For instance, trivially, if the ROU is represented by two rectangles having sizes equal to the absolute values of the entries of the unique direction in and placed at two opposite corners of the chosen grid. Surprisingly, if the problem becomes much more complicated. Our purpose is to provide a geometrical characterization of the ROU. This is based on a double Euclidean division algorithm (DEDA), which runs in polynomial time. It turns out that the ROU is delimited by a zigzag profile obtained by means of numerical relations among the entries of the employed directions. According to different inputs in DEDA, the shape of the ROU can change consistently, as it can be easily observed from the provided examples. Moreover, after selecting a region of interest (ROI) from a given phantom, we exploit DEDA to reconstruct the part of the ROI which falls in the ROU and, with a few further a priori knowledge, even parts of the ROI which are outside the ROU.


16 April 2021 in Theoretical Computer Science
Verified
Journal Article
Closed access
AFAndrea Frosini
Andrea Frosini
CPChristophe Picouleau
Christophe Picouleau
SRSimone Rinaldi
Simone Rinaldi

12 May 2021 in Journal of Combinatorial Optimization
Verified
Journal Article
Open access
PDF file
PDPaolo Dulio
Paolo Dulio
AFAndrea Frosini
Andrea Frosini
SRSimone Rinaldi
Simone Rinaldi
LTLama Tarsissi
Lama Tarsissi
LVLaurent Vuillon
Laurent Vuillon
A remarkable family of discrete sets which has recently attracted the attention of the discrete geometry community is the family of convex polyominoes, that are the discrete counterpart of Euclidean convex sets, and combine the constraints of convexity and connectedness. In this paper we study the problem of their reconstruction from orthogonal projections, relying on the approach defined by Barcucci et al. (Theor Comput Sci 155(2):321–347, 1996). In particular, during the reconstruction process it may be necessary to expand a convex subset of the interior part of the polyomino, say the polyomino kernel, by adding points at specific positions of its contour, without losing its convexity. To reach this goal we consider convexity in terms of certain combinatorial properties of the boundary word encoding the polyomino. So, we first show some conditions that allow us to extend the kernel maintaining the convexity. Then, we provide examples where the addition of one or two points causes a loss of convexity, which can be restored by adding other points, whose number and positions cannot be determined a priori.

12 September 2017 in Fundamenta Informaticae
Verified
Journal Article
Closed access
PDF file
PDPaolo Dulio
Paolo Dulio
SPSilvia M.C. Pagani
Silvia M.C. Pagani
AFAndrea Frosini
Andrea Frosini
In discrete tomographic image reconstruction, projections are taken along a finite set S of valid directions for a working grid 𝒜. In general, uniqueness cannot be achieved in the whole grid 𝒜. Usually, some information on the object to be reconstr

1 August 2023 in Annals of Mathematics and Artificial Intelligence
Verified
Journal Article
Open access
PDF file
NMNiccolò Di Marco
Niccolò Di Marco
APAzzurra Di Palma
Azzurra Di Palma
AFAndrea Frosini
Andrea Frosini
Many recent studies have shown that Fractal Dimension (FD), a ratio for figuring out the complexity of a system given its measurements, can be used as an useful index to provide information about certain brain disease. Our research focuses on the Alzheimer’s disease changes in white and grey brain matters detected through the FD indexes of their contours. Data used in this study were obtained from the Alzheimer’s Disease (AD) Neuroimaging Initiative database (Normal Condition, N = 57, and Alzheimer’s Disease, N = 60). After standard preprocessing pipeline, the white and grey matter 3D FD indexes are computed for the two groups. A statistical analysis shows that only grey matter 3D FD indexes are able to differentiate healthy and AD subjects. Although white matter 3D FD indexes do not, it is remarkable that their presence enhance the separation capability of previous ones. In order to valuate the classification capability of these indexes on healthy and AD subjects, we define several Neural Networks models. The performances of these models vary according to the statistical analysis and reach their best performances when each 3D FD input index is changed into a sequence of 2D FD indexes of (a subset of) the horizontal slices of the white and grey matter volumes.