Paola Lecca
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
Paola Lecca has a total of 75 co-authors. Here are the top co-authors by number of shared publications:
- Bruno Carpentieri
Faculty of Engineering, Free University of Bozen-Bolzano, 39100 Bolzano, Italy
12 shared publications Angela Re
Department of Applied Science and Technology, Politecnico di Torino, Turin, Italy
5 shared publications- Angela Re
Department of Applied Science and Technology, Politecnico di Torino, Torino, Italy
5 shared publications - Claudio Sorio
Cystic Fibrosis Laboratory “D. Lissandrini”, Department of Medicine, Division of General Pathology, University of Verona, 37134 Verona, Italy
5 shared publications Michela Lecca
Technologies of Vision, Fondazione Bruno Kessler
3 shared publications- Michela Lecca
Fondazione Bruno Kessler
3 shared publications
Latest Publications
- Open Access
- 5 October 2026
- Published by Frontiers Media SA in Frontiers in Bioinformatics
- Vol. 6, 1916468
How AI-based techniques for brain tumour diagnosis can address data variability
Data variability in medical imaging of tumors refers to the inconsistencies in Magnetic Resonance Imaging and Computational Tomography scans caused by heterogeneous tumor biology, varying scanner hardware, and subjective human interpretation. This variability creates significant challenges for accurate diagnoses, treatment tracking, and AI model development. Although the variability in medical imaging data for diagnostic and prognostic purposes is a challenge for AI methods applied to other types of tumors as well, it is particularly problematic when the analysis involves gliomas and glioblastomas. Most gliomas are infiltrative and glioblastomas are highly infiltrative tumors with poorly defined margins. They exhibit significant regional variations, including cystic necrosis, localized hemorrhages, and complex microvascular proliferation. Addressing this variability requires a combination of algorithmic innovation, standardized datasets, and a leading-edge computational pipeline including traditional and AI-based data modelling methodologies to ensure diagnostic and prognostic models are robust. In this article, we will identify some AI methods that show promise in the analysis of brain tumor images and that must overcome the challenges posed by data availability. We will also offer some insights into how these challenges can be overcome and propose a possible computational pipeline that utilizes them.
- 5 October 2026
- Published by Frontiers Media SA in Frontiers in Bioinformatics
- Vol. 6, 1916468
Open AccessHow AI-based techniques for brain tumour diagnosis can address data variability
Data variability in medical imaging of tumors refers to the inconsistencies in Magnetic Resonance Imaging and Computational Tomography scans caused by heterogeneous tumor biology, varying scanner hardware, and subjective human interpretation. This variability creates significant challenges for accurate diagnoses, treatment tracking, and AI model development. Although the variability in medical imaging data for diagnostic and prognostic purposes is a challenge for AI methods applied to other types of tumors as well, it is particularly problematic when the analysis involves gliomas and glioblastomas. Most gliomas are infiltrative and glioblastomas are highly infiltrative tumors with poorly defined margins. They exhibit significant regional variations, including cystic necrosis, localized hemorrhages, and complex microvascular proliferation. Addressing this variability requires a combination of algorithmic innovation, standardized datasets, and a leading-edge computational pipeline including traditional and AI-based data modelling methodologies to ensure diagnostic and prognostic models are robust. In this article, we will identify some AI methods that show promise in the analysis of brain tumor images and that must overcome the challenges posed by data availability. We will also offer some insights into how these challenges can be overcome and propose a possible computational pipeline that utilizes them.
- Open Access
- 20 August 2026
- Published by Public Library of Science (PLoS) in PLOS Computational Biology
- Vol. 22 (8) , e1014668
Ten quick tips for causal analysis of biomedical omics data
- 20 August 2026
- Published by Public Library of Science (PLoS) in PLOS Computational Biology
- Vol. 22 (8) , e1014668
Open AccessTen quick tips for causal analysis of biomedical omics data
- 26 June 2026
- Published by Springer Nature
- p. 172-186
Advanced Statistics and Quantitative Network Biology: an Urgent Convergence Not Without Obstacles and Challenges
- 26 June 2026
- Published by Springer Nature
- p. 172-186
Advanced Statistics and Quantitative Network Biology: an Urgent Convergence Not Without Obstacles and Challenges
- Open Access
- 7 June 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (12) , 2036
Early Prediction of Convergence Outcomes in Parameterized Root-Finding: A Feature-Based Study
We study early prediction of convergence outcomes in parameterized root-finding problems. The analysis focuses on whether short prefixes of solver trajectories contain useful information about convergence within prescribed iteration horizons, without modifying the underlying numerical scheme. To avoid relying on profile-derived targets, we use solver-level success fractions , , and , defined as the fractions of trajectories that satisfy the convergence criterion within 20, 50, and 100 iterations, respectively. Within this setting, we compare several families of early solver-derived features, including residual-based, step-based, and trajectory-derived quantities. We also distinguish between direct-prefix predictors, which use the first N values of a feature family, and scalar summary predictors, in which the same prefix is compressed into a single descriptor. Numerical experiments on controlled parameterized root-finding benchmarks show that simple residual- and step-based summaries provide the strongest within-base predictors among the tested feature families. In particular, mean and median log residual and log step summaries are informative even at short prefixes. More elaborate trajectory-derived descriptors, including the kNN–LLE proxy, are less effective as standalone predictors in the present experiments. The results also show that prediction difficulty depends strongly on the benchmark structure: Dataset 1 leads to near-saturated prediction performance at very short prefixes, whereas the oscillatory Dataset 2A provides a more challenging and discriminative case. In this latter setting, compact scalar summaries at can occasionally match or slightly outperform the corresponding full-prefix predictors, suggesting that scalar compression may suppress part of the transient variability present in the full-prefix representation. Cross-base transfer is substantially more difficult than within-base prediction, indicating that the observed predictive relationships are not uniformly portable across the considered benchmark problems. Overall, the study suggests that, in controlled parameterized settings of the type examined here, convergence outcomes can often be predicted from simple and computationally inexpensive early trajectory summaries. The results should be interpreted as a feature-based early convergence outcome prediction study, rather than as a general diagnostic methodology for nonlinear solvers.- 7 June 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (12) , 2036
Open AccessEarly Prediction of Convergence Outcomes in Parameterized Root-Finding: A Feature-Based Study
We study early prediction of convergence outcomes in parameterized root-finding problems. The analysis focuses on whether short prefixes of solver trajectories contain useful information about convergence within prescribed iteration horizons, without modifying the underlying numerical scheme. To avoid relying on profile-derived targets, we use solver-level success fractions , , and , defined as the fractions of trajectories that satisfy the convergence criterion within 20, 50, and 100 iterations, respectively. Within this setting, we compare several families of early solver-derived features, including residual-based, step-based, and trajectory-derived quantities. We also distinguish between direct-prefix predictors, which use the first N values of a feature family, and scalar summary predictors, in which the same prefix is compressed into a single descriptor. Numerical experiments on controlled parameterized root-finding benchmarks show that simple residual- and step-based summaries provide the strongest within-base predictors among the tested feature families. In particular, mean and median log residual and log step summaries are informative even at short prefixes. More elaborate trajectory-derived descriptors, including the kNN–LLE proxy, are less effective as standalone predictors in the present experiments. The results also show that prediction difficulty depends strongly on the benchmark structure: Dataset 1 leads to near-saturated prediction performance at very short prefixes, whereas the oscillatory Dataset 2A provides a more challenging and discriminative case. In this latter setting, compact scalar summaries at can occasionally match or slightly outperform the corresponding full-prefix predictors, suggesting that scalar compression may suppress part of the transient variability present in the full-prefix representation. Cross-base transfer is substantially more difficult than within-base prediction, indicating that the observed predictive relationships are not uniformly portable across the considered benchmark problems. Overall, the study suggests that, in controlled parameterized settings of the type examined here, convergence outcomes can often be predicted from simple and computationally inexpensive early trajectory summaries. The results should be interpreted as a feature-based early convergence outcome prediction study, rather than as a general diagnostic methodology for nonlinear solvers. - Open Access
- 29 April 2026
- Published by Frontiers Media SA in Frontiers in Systems Biology
- Vol. 6, 1734322
AI-based methods for the assessment of DNA damage and repair mechanisms
In recent years, a growing number of artificial intelligence (AI)–driven approaches have been developed to elucidate chemico-biological interactions associated with DNA damage and oxidative stress. Deep learning–based techniques, in particular, have demonstrated substantial potential within molecular biology and toxicology. As a result, researchers and clinicians alike hold high expectations that AI-enabled tools will soon make meaningful contributions to our understanding of the molecular and cellular mechanisms governing DNA damage and repair. In this article, we present a concise yet comprehensive overview of the computational methodologies underpinning contemporary deep learning approaches. We examine their capacity to support DNA damage assessment by revealing mechanistic insights into damage induction and response pathways. Particular emphasis is placed on deep learning techniques designed to enhance the analysis of complex biological data, including the automated detection and quantification of DNA damage from comet assay images and microscopy-based platforms. Furthermore, we critically assess the extent to which a gap exists between the expectations of researchers, biologists, and clinicians and the current practical capabilities of AI technologies in this domain. Finally, we offer a forward-looking perspective on how this gap might be narrowed, outlining key methodological, data-driven, and translational challenges that must be addressed to fully realize the potential of AI in DNA damage and repair research.
- 29 April 2026
- Published by Frontiers Media SA in Frontiers in Systems Biology
- Vol. 6, 1734322
Open AccessAI-based methods for the assessment of DNA damage and repair mechanisms
In recent years, a growing number of artificial intelligence (AI)–driven approaches have been developed to elucidate chemico-biological interactions associated with DNA damage and oxidative stress. Deep learning–based techniques, in particular, have demonstrated substantial potential within molecular biology and toxicology. As a result, researchers and clinicians alike hold high expectations that AI-enabled tools will soon make meaningful contributions to our understanding of the molecular and cellular mechanisms governing DNA damage and repair. In this article, we present a concise yet comprehensive overview of the computational methodologies underpinning contemporary deep learning approaches. We examine their capacity to support DNA damage assessment by revealing mechanistic insights into damage induction and response pathways. Particular emphasis is placed on deep learning techniques designed to enhance the analysis of complex biological data, including the automated detection and quantification of DNA damage from comet assay images and microscopy-based platforms. Furthermore, we critically assess the extent to which a gap exists between the expectations of researchers, biologists, and clinicians and the current practical capabilities of AI technologies in this domain. Finally, we offer a forward-looking perspective on how this gap might be narrowed, outlining key methodological, data-driven, and translational challenges that must be addressed to fully realize the potential of AI in DNA damage and repair research.
- Open Access
- 4 February 2026
- Published by MDPI AG in Scientia Pharmaceutica
- Vol. 94 (1) , 13
Drug Responsiveness in Patient-Derived Rectal Organoids Correlates with Clinical Response in CF Subjects: A Real-Life Analysis
Pharmacological modulators of CFTR have significantly changed the cystic fibrosis (CF) phenotype of subjects affected by this multi-organ disease. Here, we evaluated the CFTR function analysis (short-circuit chamber in colonoids) in response to Elexacaftor/Tezacaftor/Ivacaftor (ETI) with the clinical benefits of in vivo treatment with ETI in ten CF subjects. We found that the functional response of ETI-corrected PDROS significantly correlated with the absolute change in the sweat chloride test. Thus, our work reinforces the use of organoid-derived human intestinal monolayers to guide clinicians in selecting CFTR-targeted therapies.
- 4 February 2026
- Published by MDPI AG in Scientia Pharmaceutica
- Vol. 94 (1) , 13
Open AccessDrug Responsiveness in Patient-Derived Rectal Organoids Correlates with Clinical Response in CF Subjects: A Real-Life Analysis
Pharmacological modulators of CFTR have significantly changed the cystic fibrosis (CF) phenotype of subjects affected by this multi-organ disease. Here, we evaluated the CFTR function analysis (short-circuit chamber in colonoids) in response to Elexacaftor/Tezacaftor/Ivacaftor (ETI) with the clinical benefits of in vivo treatment with ETI in ten CF subjects. We found that the functional response of ETI-corrected PDROS significantly correlated with the absolute change in the sweat chloride test. Thus, our work reinforces the use of organoid-derived human intestinal monolayers to guide clinicians in selecting CFTR-targeted therapies.
- Open Access
- 3 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. PP, 1
A New Image Sharpening Filter based on Gradient and Retinex-inspired Contrast
Image edges are essential for understanding and processing the content of the acquired scene, but a clear edge detection is not always possible. Unfavorable environmental conditions, poor lighting, incorrect camera settings and/or vibrations may produce blurry or dark images with unclear content and details. Local spatial filters are integrated into many hardware and software as sharpening tools, but choosing the most adequate filter and its parameters is usually non trivial. This work proposes a new filter, whose kernel is computed by comparing over a pre-defined window the image Prewitt gradient with an image contrast measure inspired by Retinex theory. The experiments, carried out on public real-world images with different edge visibility, show that the proposed image-aware filter efficaciously increases the edge visibility with low computational cost and performs better than a standard Laplacian filter. As an usage example, the sharpening filter is here applied to medical images of retinal fundus: improving the clarity and detail of these images is essential for visualizing and analysing anatomical structures, identifying abnormalities, and assisting in diagnosis and treatments. Finally, a hardware architecture of the sharpening filter, partially integrating on-chip the gradient and contrast computation, is outlined. Such an integration could be beneficial for enhancing in real-time the quality of pictures captured by devices with limited power resources, with an average consumption of ∼ 28 μW and ∼ 30 kb of embedded memory in case of a color VGA image. The data obtained in filter validation experiments show a marked increase in the Prewitt’s gradient magnitudes in 100% of cases and in the edge thickness in a percentage ranging from 73.3% to 100% of cases, without visibly affecting the image naturalness.
- 3 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. PP, 1
Open AccessA New Image Sharpening Filter based on Gradient and Retinex-inspired Contrast
Image edges are essential for understanding and processing the content of the acquired scene, but a clear edge detection is not always possible. Unfavorable environmental conditions, poor lighting, incorrect camera settings and/or vibrations may produce blurry or dark images with unclear content and details. Local spatial filters are integrated into many hardware and software as sharpening tools, but choosing the most adequate filter and its parameters is usually non trivial. This work proposes a new filter, whose kernel is computed by comparing over a pre-defined window the image Prewitt gradient with an image contrast measure inspired by Retinex theory. The experiments, carried out on public real-world images with different edge visibility, show that the proposed image-aware filter efficaciously increases the edge visibility with low computational cost and performs better than a standard Laplacian filter. As an usage example, the sharpening filter is here applied to medical images of retinal fundus: improving the clarity and detail of these images is essential for visualizing and analysing anatomical structures, identifying abnormalities, and assisting in diagnosis and treatments. Finally, a hardware architecture of the sharpening filter, partially integrating on-chip the gradient and contrast computation, is outlined. Such an integration could be beneficial for enhancing in real-time the quality of pictures captured by devices with limited power resources, with an average consumption of ∼ 28 μW and ∼ 30 kb of embedded memory in case of a color VGA image. The data obtained in filter validation experiments show a marked increase in the Prewitt’s gradient magnitudes in 100% of cases and in the edge thickness in a percentage ranging from 73.3% to 100% of cases, without visibly affecting the image naturalness.
- Open Access
- 25 June 2025
- Published by Springer Nature in BMC Pharmacology and Toxicology
- Vol. 26 (S1) , 1
Determination of the latent geometry of atorvastatin pharmacokinetics by transfer entropy to identify bottlenecks
Background: In mathematics, a physical network (e.g. biological network, social network, IT network, communication network) is usually represented by a graph. The determination of the metric space (also referred to as latent geometry) of the graph and the disposition of its nodes on it provide important information on the reaction propensity and consequently on the possible presence of bottlenecks in a system of interacting molecules, such as it happens in pharmacokinetics. To determine the latent geometry and the coordinates of nodes, it is necessary to have the dissimilarity or distance matrix of the network, an input that is not always easy to measure in experiments. Results: The main result of this study is the mathematical and computational procedure for determining the distance/dissimilarity matrix between nodes and for identifying the latent network geometry from experimental time series of node concentrations. Specifically, we show how this matrix can be calculated from the transfer entropy between nodes, which is a measure of the flow of information between nodes and thus indirectly of the reaction propensity between them. We implemented a procedure of spectral graph embedding to embed the distance/dissimilarity matrix in flat and curved metric spaces, and consequently to determine the optimal latent geometry of the network. The distances between nodes in the metric space describing the latent geometry can be analyzed to identify bottlenecks in the reaction system. As a case study for this procedure, we consider the pharmacokinetics of atorvastatin, as described by recent studies and experimental time data. Conclusions: The method of determining distances between nodes from temporal measurements of node concentrations through the calculation of transfer entropy makes it possible to incorporate the information of kinetics (inherent in the time series) in the construction of the distance/dissimilarity matrix, and, consequently, in the determination of the network latent geometry, a characterisation of the network itself that is intimately connected to its dynamics, but which has so far been scarcely investigated and taken into account. The results on the case study of the pharmacokinetics of atorvastatin corroborate the usability and reliability of the method within certain limits of the experimental errors on the data.
- 25 June 2025
- Published by Springer Nature in BMC Pharmacology and Toxicology
- Vol. 26 (S1) , 1
Open AccessDetermination of the latent geometry of atorvastatin pharmacokinetics by transfer entropy to identify bottlenecks
Background: In mathematics, a physical network (e.g. biological network, social network, IT network, communication network) is usually represented by a graph. The determination of the metric space (also referred to as latent geometry) of the graph and the disposition of its nodes on it provide important information on the reaction propensity and consequently on the possible presence of bottlenecks in a system of interacting molecules, such as it happens in pharmacokinetics. To determine the latent geometry and the coordinates of nodes, it is necessary to have the dissimilarity or distance matrix of the network, an input that is not always easy to measure in experiments. Results: The main result of this study is the mathematical and computational procedure for determining the distance/dissimilarity matrix between nodes and for identifying the latent network geometry from experimental time series of node concentrations. Specifically, we show how this matrix can be calculated from the transfer entropy between nodes, which is a measure of the flow of information between nodes and thus indirectly of the reaction propensity between them. We implemented a procedure of spectral graph embedding to embed the distance/dissimilarity matrix in flat and curved metric spaces, and consequently to determine the optimal latent geometry of the network. The distances between nodes in the metric space describing the latent geometry can be analyzed to identify bottlenecks in the reaction system. As a case study for this procedure, we consider the pharmacokinetics of atorvastatin, as described by recent studies and experimental time data. Conclusions: The method of determining distances between nodes from temporal measurements of node concentrations through the calculation of transfer entropy makes it possible to incorporate the information of kinetics (inherent in the time series) in the construction of the distance/dissimilarity matrix, and, consequently, in the determination of the network latent geometry, a characterisation of the network itself that is intimately connected to its dynamics, but which has so far been scarcely investigated and taken into account. The results on the case study of the pharmacokinetics of atorvastatin corroborate the usability and reliability of the method within certain limits of the experimental errors on the data.
- Open Access
- 15 December 2023
- Published by Elsevier in Data in Brief
- Vol. 52, 109960
A dataset for illuminant- and device- invariant colour barcode decoding with cameras
- 15 December 2023
- Published by Elsevier in Data in Brief
- Vol. 52, 109960
Open AccessA dataset for illuminant- and device- invariant colour barcode decoding with cameras