Gaetano Zanghirati
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Gaetano Zanghirati has a total of 40 co-authors. Here are the top co-authors by number of shared publications:
- Luca Zanni
Department of Physics, Informatics and Mathematics, University of Modena and Reggio Emilia, Modena, Italy
8 shared publications - Tatiana A. Bubba
University of Ferrara
4 shared publications - Federica Porta
Department of Physics, Informatics and Mathematics, University of Modena and Reggio Emilia, Modena, Italy
3 shared publications - Silvia Bonettini
Dipartimento di Scienze Fisiche, Informatiche e Matematiche, Università di Modena e Reggio Emilia, Via Campi 213/b, 41125 Modena, Italy
3 shared publications - Demetrio Labate
Department of Applied Mathematics, University of Houston, Houston, TX 77204-3008, USA
2 shared publications - Giacomo Frassoldati
Department of Pure and Applied Mathematics, University of Modena and Reggio Emilia, via Campi 213/b, 41100 Modena, Italy
2 shared publications
Latest Publications
- Open Access
- 1 January 2026
- Published by Tech Science Press in Computer Modeling in Engineering & Sciences
- Vol. 148 (3) , 1-10
EPITIME: A Computational Framework for Integral Epidemic Models with Structure-Preserving Discretizations
EPITIME, a computational framework for the simulation of two classes of integral epidemic models, namely an age of infection model and an information-dependent behavioural model, is presented. The main contributions of this work are the design and implementation of a modular MATLAB/Python software environment built upon previously developed structure-preserving non-standard finite difference discretizations. The solvers are complemented by input parsing and validation routines, performance indicators, reproducibility tools and user-oriented graphical interfaces. The preserved structures are specific to the underlying model and include positivity, monotonicity, final-size behaviour and extinction of infectivity for the age of infection model, and positivity, boundedness, positively invariant regions and equilibrium/threshold structure for the behavioural model. The numerical schemes for both model classes and their main analytical properties, including first-order convergence, are outlined. The software architecture is then described and its use is illustrated through numerical experiments on asymptotic behaviour, inverse reconstruction of an infectivity kernel from COVID-19 incidence data, and behavioural dynamics under different memory kernels. Performance, scalability and computational complexity analyses, together with comparisons against quadrature-based approaches, are also presented. Overall, EPITIME provides a reliable and accessible computational environment for the numerical study of renewal epidemic models.
- 1 January 2026
- Published by Tech Science Press in Computer Modeling in Engineering & Sciences
- Vol. 148 (3) , 1-10
Open AccessEPITIME: A Computational Framework for Integral Epidemic Models with Structure-Preserving Discretizations
EPITIME, a computational framework for the simulation of two classes of integral epidemic models, namely an age of infection model and an information-dependent behavioural model, is presented. The main contributions of this work are the design and implementation of a modular MATLAB/Python software environment built upon previously developed structure-preserving non-standard finite difference discretizations. The solvers are complemented by input parsing and validation routines, performance indicators, reproducibility tools and user-oriented graphical interfaces. The preserved structures are specific to the underlying model and include positivity, monotonicity, final-size behaviour and extinction of infectivity for the age of infection model, and positivity, boundedness, positively invariant regions and equilibrium/threshold structure for the behavioural model. The numerical schemes for both model classes and their main analytical properties, including first-order convergence, are outlined. The software architecture is then described and its use is illustrated through numerical experiments on asymptotic behaviour, inverse reconstruction of an infectivity kernel from COVID-19 incidence data, and behavioural dynamics under different memory kernels. Performance, scalability and computational complexity analyses, together with comparisons against quadrature-based approaches, are also presented. Overall, EPITIME provides a reliable and accessible computational environment for the numerical study of renewal epidemic models.
- 21 May 2018
- Published by EDP Sciences in Mathematical Modelling of Natural Phenomena
- Vol. 13 (4) , 34
Shearlet-based regularized reconstruction in region-of-interest computed tomography
Region of interest (ROI) tomography has gained increasing attention in recent years due to its potential to reducing radiation exposure and shortening the scanning time. However, tomographic reconstruction from ROI-focused illumination involves truncated projection data and typically results in higher numerical instability even when the reconstruction problem has unique solution. To address this problem, bothad hocanalytic formulas and iterative numerical schemes have been proposed in the literature. In this paper, we introduce a novel approach for ROI tomographic reconstruction, formulated as a convex optimization problem with a regularized term based on shearlets. Our numerical implementation consists of an iterative scheme based on the scaled gradient projection method and it is tested in the context of fan-beam CT. Our results show that our approach is essentially insensitive to the location of the ROI and remains very stable also when the ROI size is rather small.
- 21 May 2018
- Published by EDP Sciences in Mathematical Modelling of Natural Phenomena
- Vol. 13 (4) , 34
Shearlet-based regularized reconstruction in region-of-interest computed tomography
Region of interest (ROI) tomography has gained increasing attention in recent years due to its potential to reducing radiation exposure and shortening the scanning time. However, tomographic reconstruction from ROI-focused illumination involves truncated projection data and typically results in higher numerical instability even when the reconstruction problem has unique solution. To address this problem, bothad hocanalytic formulas and iterative numerical schemes have been proposed in the literature. In this paper, we introduce a novel approach for ROI tomographic reconstruction, formulated as a convex optimization problem with a regularized term based on shearlets. Our numerical implementation consists of an iterative scheme based on the scaled gradient projection method and it is tested in the context of fan-beam CT. Our results show that our approach is essentially insensitive to the location of the ROI and remains very stable also when the ROI size is rather small.
- 1 February 2018
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 318, 131-152
A nonsmooth regularization approach based on shearlets for Poisson noise removal in ROI tomography
- 1 February 2018
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 318, 131-152
A nonsmooth regularization approach based on shearlets for Poisson noise removal in ROI tomography
- Open Access
- 7 October 2016
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 756 (1) , 012009
The ROI CT problem: a shearlet-based regularization approach
The possibility to significantly reduce the X-ray radiation dose and shorten the scanning time is particularly appealing, especially for the medical imaging community. Region- of-interest Computed Tomography (ROI CT) has this potential and, for this reason, is currently receiving increasing attention. Due to the truncation of projection images, ROI CT is a rather challenging problem. Indeed, the ROI reconstruction problem is severely ill-posed in general and naive local reconstruction algorithms tend to be very unstable. To obtain a stable and reliable reconstruction, under suitable noise circumstances, we formulate the ROI CT problem as a convex optimization problem with a regularization term based on shearlets, and possibly nonsmooth. For the solution, we propose and analyze an iterative approach based on the variable metric inexact line-search algorithm (VMILA). The reconstruction performance of VMILA is compared against different regularization conditions, in the case of fan-beam CT simulated data. The numerical tests show that our approach is insensitive to the location of the ROI and remains very stable also when the ROI size is rather small.
- 7 October 2016
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 756 (1) , 012009
Open AccessThe ROI CT problem: a shearlet-based regularization approach
The possibility to significantly reduce the X-ray radiation dose and shorten the scanning time is particularly appealing, especially for the medical imaging community. Region- of-interest Computed Tomography (ROI CT) has this potential and, for this reason, is currently receiving increasing attention. Due to the truncation of projection images, ROI CT is a rather challenging problem. Indeed, the ROI reconstruction problem is severely ill-posed in general and naive local reconstruction algorithms tend to be very unstable. To obtain a stable and reliable reconstruction, under suitable noise circumstances, we formulate the ROI CT problem as a convex optimization problem with a regularization term based on shearlets, and possibly nonsmooth. For the solution, we propose and analyze an iterative approach based on the variable metric inexact line-search algorithm (VMILA). The reconstruction performance of VMILA is compared against different regularization conditions, in the case of fan-beam CT simulated data. The numerical tests show that our approach is insensitive to the location of the ROI and remains very stable also when the ROI size is rather small.
- Open Access
- 24 August 2015
- Published by SPIE-Intl Soc Optical Eng
- Vol. 9597, 95970K-95970K-11
Shearlet-based regularized ROI reconstruction in fan beam computed tomography
Region-of-interest (ROT) reconstruction in computed tomography (CT) is a problem receiving increasing attention in the medical imaging community, due to its potential to lower exposure to X-ray radiation and to reduce the scanning time. Since the ROT reconstruction problem requires to deal with truncated projection images, classical CT reconstruction algorithms tend to become very unstable and the solution of this problem requires either ad hoc analytic formulas or more sophisticated numerical schemes. In this paper, we introduce a novel approach for ROT CT reconstruction, formulated as a convex optimization problem with a regularized functional based on shearlets or wavelets. Our numerical implementation consists of an iterative algorithm based on the scaled gradient projection method. As illustrated by numerical tests in the context of fan beam CT, our algorithm is insensitive to the location of the ROT and remains very stable also when the ROT size is rather small
- 24 August 2015
- Published by SPIE-Intl Soc Optical Eng
- Vol. 9597, 95970K-95970K-11
Open AccessShearlet-based regularized ROI reconstruction in fan beam computed tomography
Region-of-interest (ROT) reconstruction in computed tomography (CT) is a problem receiving increasing attention in the medical imaging community, due to its potential to lower exposure to X-ray radiation and to reduce the scanning time. Since the ROT reconstruction problem requires to deal with truncated projection images, classical CT reconstruction algorithms tend to become very unstable and the solution of this problem requires either ad hoc analytic formulas or more sophisticated numerical schemes. In this paper, we introduce a novel approach for ROT CT reconstruction, formulated as a convex optimization problem with a regularized functional based on shearlets or wavelets. Our numerical implementation consists of an iterative algorithm based on the scaled gradient projection method. As illustrated by numerical tests in the context of fan beam CT, our algorithm is insensitive to the location of the ROT and remains very stable also when the ROT size is rather small
- 1 April 2015
- Published by Elsevier in Communications in Nonlinear Science and Numerical Simulation
- Vol. 21 (1-3) , 112-127
Limited-memory scaled gradient projection methods for real-time image deconvolution in microscopy
- 1 April 2015
- Published by Elsevier in Communications in Nonlinear Science and Numerical Simulation
- Vol. 21 (1-3) , 112-127
Limited-memory scaled gradient projection methods for real-time image deconvolution in microscopy
- Open Access
- 28 August 2013
- Published by Springer Nature in Scientific Reports
- Vol. 3 (1) , srep02523
Towards real-time image deconvolution: application to confocal and STED microscopy
Although deconvolution can improve the quality of any type of microscope, the high computational time required has so far limited its massive spreading. Here we demonstrate the ability of the scaled-gradient-projection (SGP) method to provide accelerated versions of the most used algorithms in microscopy. To achieve further increases in efficiency, we also consider implementations on graphic processing units (GPUs). We test the proposed algorithms both on synthetic and real data of confocal and STED microscopy. Combining the SGP method with the GPU implementation we achieve a speed-up factor from about a factor 25 to 690 (with respect the conventional algorithm). The excellent results obtained on STED microscopy images demonstrate the synergy between super-resolution techniques and image-deconvolution. Further, the real-time processing allows conserving one of the most important property of STED microscopy, i.e the ability to provide fast sub-diffraction resolution recordings.
- 28 August 2013
- Published by Springer Nature in Scientific Reports
- Vol. 3 (1) , srep02523
Open AccessTowards real-time image deconvolution: application to confocal and STED microscopy
Although deconvolution can improve the quality of any type of microscope, the high computational time required has so far limited its massive spreading. Here we demonstrate the ability of the scaled-gradient-projection (SGP) method to provide accelerated versions of the most used algorithms in microscopy. To achieve further increases in efficiency, we also consider implementations on graphic processing units (GPUs). We test the proposed algorithms both on synthetic and real data of confocal and STED microscopy. Combining the SGP method with the GPU implementation we achieve a speed-up factor from about a factor 25 to 690 (with respect the conventional algorithm). The excellent results obtained on STED microscopy images demonstrate the synergy between super-resolution techniques and image-deconvolution. Further, the real-time processing allows conserving one of the most important property of STED microscopy, i.e the ability to provide fast sub-diffraction resolution recordings.
- 10 May 2010
- Published by Cambridge University Press (CUP) in Acta Numerica
- Vol. 19, 121-158
Binary separation and training support vector machines
We introduce basic ideas of binary separation by a linear hyperplane, which is a technique exploited in thesupport vector machine(SVM) concept. This is a decision-making tool for pattern recognition and related problems. We describe a fundamentalstandard problem(SP) and show how this is used in most existing research to develop a dual-based algorithm for its solution. This algorithm is shown to be deficient in certain aspects, and we develop a new primal-based SQP-like algorithm, which has some interesting features. Most practical SVM problems are not adequately handled by a linear hyperplane. We describe thenonlinear SVMtechnique, which enables a nonlinear separating surface to be computed, and we propose a new primal algorithm based on the use of low-rank Cholesky factors.It may be, however, that exact separation is not desirable due to the presence of uncertain or mislabelled data. Dealing with this situation is the main challenge in developing suitable algorithms. Existing dual-based algorithms use the idea ofL1penalties, which has merit. We suggest how penalties can be incorporated into a primal-based algorithm. Another aspect of practical SVM problems is often the huge size of the data set, which poses severe challenges both for software package development and for control of ill-conditioning. We illustrate some of these issues with numerical experiments on a range of problems.
- 10 May 2010
- Published by Cambridge University Press (CUP) in Acta Numerica
- Vol. 19, 121-158
Binary separation and training support vector machines
We introduce basic ideas of binary separation by a linear hyperplane, which is a technique exploited in thesupport vector machine(SVM) concept. This is a decision-making tool for pattern recognition and related problems. We describe a fundamentalstandard problem(SP) and show how this is used in most existing research to develop a dual-based algorithm for its solution. This algorithm is shown to be deficient in certain aspects, and we develop a new primal-based SQP-like algorithm, which has some interesting features. Most practical SVM problems are not adequately handled by a linear hyperplane. We describe thenonlinear SVMtechnique, which enables a nonlinear separating surface to be computed, and we propose a new primal algorithm based on the use of low-rank Cholesky factors.It may be, however, that exact separation is not desirable due to the presence of uncertain or mislabelled data. Dealing with this situation is the main challenge in developing suitable algorithms. Existing dual-based algorithms use the idea ofL1penalties, which has merit. We suggest how penalties can be incorporated into a primal-based algorithm. Another aspect of practical SVM problems is often the huge size of the data set, which poses severe challenges both for software package development and for control of ill-conditioning. We illustrate some of these issues with numerical experiments on a range of problems.
- Open Access
- 13 March 2009
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 25 (11) , 1440-1441
A novel parallel approach to the likelihood-based estimation of admixture in population genetics
Summary: Inferring population admixture from genetic data and quantifying it is a difficult but crucial task in evolutionary and conservation biology. Unfortunately state-of-the-art probabilistic approaches are computationally demanding. Effectively exploiting the computational power of modern multiprocessor systems can thus have a positive impact to Monte Carlo-based simulation of admixture modeling. A novel parallel approach is briefly described and promising results on its message passing interface (MPI)-based C++ implementation are reported. Availability: The software package parLEA is freely available at http://dm.unife.it/parlea. Contact:ambra.giovannini@unife.it Supplementary information: Additional information, including instructions for installation/use the original sequential LEA code and the data used in this paper, are also available in the web site.
- 13 March 2009
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 25 (11) , 1440-1441
Open AccessA novel parallel approach to the likelihood-based estimation of admixture in population genetics
Summary: Inferring population admixture from genetic data and quantifying it is a difficult but crucial task in evolutionary and conservation biology. Unfortunately state-of-the-art probabilistic approaches are computationally demanding. Effectively exploiting the computational power of modern multiprocessor systems can thus have a positive impact to Monte Carlo-based simulation of admixture modeling. A novel parallel approach is briefly described and promising results on its message passing interface (MPI)-based C++ implementation are reported. Availability: The software package parLEA is freely available at http://dm.unife.it/parlea. Contact:ambra.giovannini@unife.it Supplementary information: Additional information, including instructions for installation/use the original sequential LEA code and the data used in this paper, are also available in the web site.