Pith. sign in

REVIEW 1 cited by

Data assimilation performed with robust shape registration and graph neural networks: application to aortic coarctation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2502.12097 v1 pith:GJUUYOF2 submitted 2025-02-17 math.NA cs.NA

classification math.NAcs.NA
keywords modelsaorticassimilationcoarctationcomputationalcontextdatagraph
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Image-based, patient-specific modelling of hemodynamics can improve diagnostic capabilities and provide complementary insights to better understand the hemodynamic treatment outcomes. However, computational fluid dynamics simulations remain relatively costly in a clinical context. Moreover, projection-based reduced-order models and purely data-driven surrogate models struggle due to the high variability of anatomical shapes in a population. A possible solution is shape registration: a reference template geometry is designed from a cohort of available geometries, which can then be diffeomorphically mapped onto it. This provides a natural encoding that can be exploited by machine learning architectures and, at the same time, a reference computational domain in which efficient dimension-reduction strategies can be performed. We compare state-of-the-art graph neural network models with recent data assimilation strategies for the prediction of physical quantities and clinically relevant biomarkers in the context of aortic coarctation.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Efficient Numerical Strategies for Entropy-Regularized Semi-Discrete Optimal Transport

    math.NA 2025-07 conditional novelty 6.0 of 10

    Error-controlled truncation, R-tree queries, multilevel hierarchies, and epsilon scheduling make large-scale finite-element entropy-regularized semi-discrete optimal transport practical.

Pith tools