Pith. sign in

REVIEW 4 major objections 6 minor 35 references

VesselGPT: Autoregressive Modeling of Vascular Geometry

T0 review · 4 major / 6 minor · reviewed 2026-08-15 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Blood-vessel trees can be synthesized autoregressively by tokenizing vessel geometry and sampling new trees token by token with a transformer.

desk verdict First autoregressive vascular-tree generator, with a clean VQ-VAE/GPT-2 pipeline and B-spline cross-sections; evaluation gaps and an unvalidated absent-node threshold keep it from being trustworthy yet. read the letter →

arxiv 2505.13318 v2 pith:QYSRCDLL submitted 2025-05-19 cs.CV cs.LGeess.IV

Paula Feldman , Martin Sinnona , Claudio Delrieux , Viviana Siless , Emmanuel Iarussi This is my paper · ORCID
classification cs.CVcs.LGeess.IV
keywords autoregressivegenerationvasculargeometrybloodvesselsynthesisVQ-VAEtokenizationB-splinecross-sectionsanatomicaltrees3Dmesh
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

VesselGPT is designed to show that blood-vessel trees can be generated as ordered token sequences rather than through hand-coded branching rules. The central claim is that a VQ-VAE can convert vessel-node geometry into a learned discrete codebook, after which a GPT-2-style transformer can generate new trees by predicting the next codebook token. The representation differs from earlier centerline-and-radius methods because each node also carries B-spline weights describing the vessel cross-section, so non-circular shapes and aneurysms can be captured. The paper reports that generated trees closely match real vascular distributions in tortuosity and total length, and that the pipeline reconstructs high-fidelity geometry from compact discrete tokens. A sympathetic reader would take this as evidence that autoregressive token prediction is a viable route to anatomical tree generation.

What carries the argument

The machinery is a two-stage token pipeline. Stage one is a vector-quantized autoencoder whose codebook replaces raw continuous node attributes, namely coordinates plus B-spline coefficients and control points, with discrete embedding indices; the encoder and decoder each contain a transformer layer, and training uses a reconstruction loss plus commitment losses with a stop-gradient operator. Stage two is a decoder-only GPT-2 transformer trained to maximize the log-probability of the next codebook index conditioned on previous tokens, then sampled with beam search from a start token to a stop token. The decoded token sequence is turned into a mesh by fitting B-splines along each centerline branch, building a signed distance field by interpolating cross-sections, and applying marching cubes.

What would settle it

Take a set of vessel trees with known topology, encode and decode them through the VQ-VAE, and count how often the fixed 1e-2 threshold misclassifies an absent child as present or vice versa; if the error rate is non-negligible, topology errors are being silently injected into every generated tree.

Watch

Extended reading notes

Core claim

On the paper's own terms, the finding is that vascular anatomy can be reduced to an ordered sequence of discrete tokens without losing its branching structure: each binary tree is serialized in preorder, absent children are marked by zero vectors, and a VQ-VAE learns a codebook such that the sequence of codebook indices can be predicted autoregressively. Generated token sequences are decoded back into spline coefficients, and a signed-distance-field meshing step turns them into 3D surfaces. The cross-sectional B-splines are the key to preserving morphology that a single radius value would discard. The paper presents this as the first autoregressive blood-vessel generator, with reconstruction and distributional matches obtained on a public dataset of 100 patient-derived vessel segments.

Load-bearing premise

The load-bearing premise is that a fixed numerical cutoff of 1e-2 cleanly separates absent tree nodes from real ones after VQ-VAE decoding, even though the authors note that zero placeholder vectors are often mapped to inconsistent token sequences.

Editorial extensions

If this is right

  • A compact discrete codebook (16 tokens per node, 64-dimensional vectors) is enough to reconstruct vessel geometry at high fidelity, so vascular models could be stored or transmitted as token streams.
  • Because cross-sections are represented by B-splines instead of a single radius, shapes that deviate from circular tubes, including aneurysms, are representable in the generated output.
  • The pipeline scales to tree heights that break the recursive baseline, since the transformer processes the full serialized sequence rather than recursing level by level.
  • Generated trees match real data on tortuosity (cosine similarity 0.97) and total length (0.88), which the paper reads as evidence of anatomical realism beyond point-cloud metrics.
  • The same preorder serialization and zero-vector placeholder scheme could apply to other anatomical trees such as airways and renal tubules, which the paper names as targets.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • One direction the paper leaves open is conditional generation: conditioning the same GPT-2 backbone on a requested length, caliber, or diagnosis could sample trees for a specific clinical context, but the paper does not explore this.
  • The fixed threshold for identifying absent children is a silent risk in deeper trees; a robustness study across vessel sizes would show whether small decoding errors accumulate into topology corruption.
  • If the tokenization transfers, the two-stage design could be trained on other tubular structures such as airways, ducts, or plant roots, since the method itself is not vessel-specific.
  • The B-spline cross-sections offer a natural path to pathology generation: encoding aneurysm-like bulges as codebook patterns could synthesize pathological variants for data augmentation, though the paper stops at morphology matching and does not validate clinical utility.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 6 minor

Summary. The paper proposes VesselGPT, a two-stage generative model for 3D vascular trees. Stage 1 trains a vector-quantized autoencoder (VQ-VAE) to map a preorder-serialized sequence of vessel nodes into a discrete codebook; each node encodes 3D coordinates and B-spline cross-section parameters, with zero vectors marking absent child nodes so that the binary tree structure can be restored. Stage 2 trains a GPT-2-style decoder-only transformer to predict codebook indices autoregressively. A generated token sequence is decoded by the VQ-VAE decoder, and a centerline-fitting / SDF / marching-cubes pipeline turns the decoded parameters into a mesh. Experiments on the Aneurisk dataset use 528 binary trees obtained by augmentation from 100 meshes, with quantitative evaluation via MMD, COV, 1-NNA, and cosine similarity of length and tortuosity histograms. The authors report high-fidelity reconstruction and claim that this is the first autoregressive method for blood vessel generation.

Significance. VesselGPT is a sensible and potentially valuable application of discrete token-sequence modeling to anatomical trees. The paper has clear strengths: it uses a public dataset, releases code, proposes a compact discrete representation, and explicitly models non-circular cross-sections with B-splines, which is a genuinely useful departure from the common single-radius parameterization. If the topology-reconstruction and evaluation issues raised below are resolved, the method would be a meaningful contribution to generative geometry and medical image computing. At present, however, the quantitative evidence is partially inconsistent with the paper's claims, and the robustness of the binary-tree reconstruction is not established.

major comments (4)
  1. [Section 3, Implementation details] The fixed 1e-2 threshold used to restore absent child nodes is load-bearing and is not validated. The text concedes that zero placeholder vectors 'are often mapped to different token sequences' and that values below 10^-2 are thresholded to zero after decoding, but no experiment reports node-existence precision/recall, exact tree-structure match, or validity of thresholded generated trees. Since every mesh is built from the thresholded binary tree, any misclassification of thin branches or small spline weights directly corrupts the generated topology. Please add a quantitative topology-reconstruction evaluation, a sensitivity analysis for the threshold, or replace the heuristic with an explicit existence bit/token so that node absence is learned rather than assumed.
  2. [Table 1] Table 1 is incomplete and therefore cannot support the comparative claims: the 1-NNA entries for Sinha et al. appear as truncated '0.' values for both heights, and no standard deviations, confidence intervals, or significance tests are reported for any method. Because the claims about outperforming baselines rest on this table, the authors should either provide the missing entries or remove the corresponding comparative statements, and should report repeated-generation statistics with multiple seeds.
  3. [Table 1 and Section 4] The quantitative results are mixed with respect to the stated advantages. At height 15, VesselVAE achieves lower MMD (0.014 vs 0.14) and higher COV (0.49 vs 0.31); at height 20 it achieves lower MMD (0.013 vs 0.14) and comparable COV (0.45 vs 0.41). The paper explains this only qualitatively, and the 1-NNA interpretation is confusing because the caption says the optimal value is 0.5 while the text appears to treat lower values as better. Please report a properly interpreted 1-NNA comparison and either demonstrate a statistically significant advantage on the primary metrics or reframe the claims accordingly.
  4. [Section 4, Metrics] The description of point-based metric computation is ambiguous: 'we randomly sample 1000 points from all baseline generated meshes' suggests that the reference set used for MMD/COV/1-NNA is not specified. Additionally, no train/validation/test split or evaluation protocol is described for the 528 trees, so it is unclear whether the reported numbers are on held-out samples. Please specify the exact protocol for both the point-based and vessel-specific metrics.
minor comments (6)
  1. [Section 1, Abstract] The abstract contains the typo 'previous' methods' instead of 'previous methods'; please correct the apostrophe and grammar.
  2. [Section 4] The sentence 'but faces limitations with deeper trees and simplifies radius parametrization to a single value per centerline point, loosing fine details' uses 'loosing' instead of 'losing'; please revise.
  3. [Section 5, Conclusions] The phrase 'could enhance the and realism of the generated structures' is grammatically incomplete; please revise to 'could enhance the realism'.
  4. [Section 3, Implementation details] The codebook size K and the VQ-VAE commitment weight lambda are not reported in Implementation details, even though they are central to reproducing Stage 1; please add these values.
  5. [Figure 2] The renders in Figure 2 lack scale bars and clear axis information, which makes it difficult to compare tree sizes across methods; please add consistent scale information.
  6. [Section 1, Introduction] The claim 'this work is the first to generate blood vessels in an autoregressive manner' is a strong novelty statement; please clarify the scope relative to prior sequential or token-based generative models, since the comparison with VesselVAE and diffusion baselines does not directly address this claim.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: VesselGPT is a standard VQ-VAE plus autoregressive GPT pipeline whose evaluations test distributional fidelity, not fitted predictions.

full rationale

I walked the derivation chain in Sections 2 and 3. The pipeline is two-stage: (i) a VQ-VAE is trained with the reconstruction objective in Eq. (2) to map node attribute sequences to discrete codebook indices, and (ii) a GPT-2 model is trained with the next-token objective in Eq. (3) on the frozen codebook indices. Both stages are fit to training data in the standard generative-model sense; no target quantity is defined in terms of the model's own output. The reported metrics (MMD, COV, 1-NNA, and cosine similarity of length/tortuosity histograms) compare generated samples against the training distribution, which is a distributional fidelity check rather than a fitted prediction. The only self-citation is Feldman et al. [9] (VesselVAE), used as a baseline for comparison; it is not load-bearing for VesselGPT's architecture, training, or claims. The Section 3 threshold of values below 10^-2 to zero for absent child nodes is a post-hoc heuristic addressing a reconstruction ambiguity the authors explicitly acknowledge (zero vectors 'are often mapped to different token sequences'). This is a correctness and robustness concern, not a circular step: the threshold is applied after decoding, and it does not define any input quantity in terms of the output claim. No uniqueness theorem is imported from prior author work, no ansatz is smuggled in via citation, and no known result is renamed as a new derivation. The central claim (autoregressive generation of vascular geometry) is independently implemented and benchmarked against external baselines and public data, so circularity is not present.

Assumptions & free parameters 5 free parameters · 4 assumptions · 0 invented entities

The paper introduces no new physical or theoretical entities. Its load-bearing choices are representational and architectural: binary tree serialization, VQ-VAE quantization, B-spline cross-sections, and a fixed absent-node threshold. These are the assumptions that determine whether generated trees are topologically and morphologically valid.

free parameters (5)
  • codebook size K
    Number of discrete codebook entries in the VQ-VAE is not stated; it determines the expressiveness of the token vocabulary and all downstream generation.
  • VQ-VAE commitment weight lambda
    Equation 2 includes lambda as a weighting factor between reconstruction and codebook commitment, but no value is reported.
  • centerline advancement ratio = 1.05
    Used for VMTK network extraction; controls sampling density along the centerline and affects all node attributes and spline fits.
  • zero-threshold for absent nodes = 1e-2
    Applied post hoc to decoder outputs to identify non-existing child nodes; no sensitivity analysis is provided.
  • tokens per tree node = 16
    Each node is encoded as 16 codebook tokens; this fixed hyperparameter is not ablated.
assumptions (4)
  • domain assumption Preorder serialization with zero placeholders for absent children is invertible after thresholding.
    The entire tokenization and reconstruction depends on reconstructing binary tree topology from the flattened sequence; the paper itself notes zero vectors map to inconsistent tokens and require a threshold.
  • domain assumption Binary tree representation captures relevant vascular geometry, and loops can be excluded.
    Trees containing loops were excluded and non-binary trees were converted, restricting the representation to acyclic binary structures.
  • domain assumption Point-based metrics (MMD, COV, 1-NNA) and length/tortuosity cosine similarity measure generation quality.
    Evaluation assumes downstream realism is captured by these distribution metrics; the paper admits they fail to capture cross-sectional detail.
  • domain assumption B-spline cross-sections fitted at centerline-perpendicular planes provide an accurate mesh representation.
    The claimed preservation of morphological detail rests on this fitting; at bifurcations the smallest-area cross-section is selected, which is a heuristic.

how reviews work

0 comments
Cite this review

Pith. "Pith review of VesselGPT: Autoregressive Modeling of Vascular Geometry." pith.science (2026). https://pith.science/paper/QYSRCDLL

@misc{pith2026250513318,
  author       = {Pith},
  title        = {Pith review of: VesselGPT: Autoregressive Modeling of Vascular Geometry},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/QYSRCDLL}},
  note         = {Machine review of arXiv:2505.13318}
}
read the original abstract

Anatomical trees are critical for clinical diagnosis and treatment planning, yet their complex and diverse geometry make accurate representation a significant challenge. Motivated by the latest advances in large language models, we introduce an autoregressive method for synthesizing anatomical trees. Our approach first embeds vessel structures into a learned discrete vocabulary using a VQ-VAE architecture, then models their generation autoregressively with a GPT-2 model. This method effectively captures intricate geometries and branching patterns, enabling realistic vascular tree synthesis. Comprehensive qualitative and quantitative evaluations reveal that our technique achieves high-fidelity tree reconstruction with compact discrete representations. Moreover, our B-spline representation of vessel cross-sections preserves critical morphological details that are often overlooked in previous' methods parameterizations. To the best of our knowledge, this work is the first to generate blood vessels in an autoregressive manner. Code is available at https://github.com/LIA-DiTella/VesselGPT-MICCAI.

Figures

Figures reproduced from arXiv: 2505.13318 by the authors.

Figure 1
Figure 1. VesselGPT overview. (a) We begin by reparametrizing the blood vessel meshes by computing their centerlines and fitting B-splines to the cross-sections. We store all parameters in a binary tree, where each node represents a centerline sample along with the corresponding weights of its cross-section spline. (b) We flatten the tree using pre￾order traversal, then feed the resulting sequence into a Vector Quantized Vari… view at source ↗
Figure 2
Figure 2. Comparison of vessel geometries generated by VesselGPT (Ours) and baseline methods trained on the Aneurisk dataset. Sinha et al. [27] produce valid vessels but lack diversity, resulting in simpler, shallower structures. Feldman et al. [9] performs well up to height 15 but struggles with deeper trees. In contrast, our method generates more diverse and realistic vessel meshes. To further assess the quality of our gene… view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

35 extracted references · 26 canonical work pages

  1. [1]

    In: Medical Imaging 2022: Image Processing

    Alblas, D., Brune, C., Wolterink, J.M.: Deep-learning-based carotid artery vessel wall segmentation in black-blood mri using anatomical priors. In: Medical Imaging 2022: Image Processing. vol. 12032, pp. 237–244. SPIE (2022)

    work page 2022

  2. [2]

    Web Site (2012)

    Aneurisk-Team: Aneuriskweb project. Web Site (2012)

    work page 2012

  3. [3]

    arXiv preprint arXiv:1308.3432 (2013)

    Bengio, Y., Léonard, N., Courville, A.: Estimating or propagating gradi- ents through stochastic neurons for conditional computation. arXiv preprint arXiv:1308.3432 (2013)

    arXiv 2013

  4. [4]

    Nature Reviews Bioengineering pp

    van Breugel, B., Liu, T., Oglic, D., van der Schaar, M.: Synthetic data in biomedicine via generative artificial intelligence. Nature Reviews Bioengineering pp. 1–14 (2024)

    2024

  5. [5]

    In: Proc

    Bullitt, E., Gerig, G., Aylward, S., Joshi, S., Smith, K., Ewend, M., Lin, W.: Vascular attributes and malignant brain tumors. In: Proc. Med. Image Comput. Comput.-Assist. Interv. (MICCAI). pp. 671–679. Springer (2003)

    work page 2003

  6. [6]

    IEEE transactions on medical imaging 22(9), 1163–1171 (2003)

    Bullitt, E., Gerig, G., Pizer, S.M., Lin, W., Aylward, S.R.: Measuring tortuosity of the intracerebral vasculature from mra images. IEEE transactions on medical imaging 22(9), 1163–1171 (2003)

    work page 2003

  7. [7]

    PLoS computational biology 6(8), e1000877 (2010)

    Cuntz, H., Forstner, F., Borst, A., Häusser, M.: One rule to grow them all: a general theory of neuronal branching and its practical application. PLoS computational biology 6(8), e1000877 (2010)

    work page 2010

  8. [8]

    In: Lecture Notes in Computer Science

    Deo, Y., Lin, F., Dou, H., Cheng, N., Ravikumar, N., Frangi, A., Lassila, T.: Few- shot learning in diffusion models for generating cerebral aneurysm geometries. In: Lecture Notes in Computer Science. Springer Nature (2024)

    work page 2024

Show all 35 references
  1. [9]

    In: International Con- ference on Medical Image Computing and Computer-Assisted Intervention

    Feldman, P., Fainstein, M., Siless, V., Delrieux, C., Iarussi, E.: Vesselvae: Recur- sive variational autoencoders for 3d blood vessel synthesis. In: International Con- ference on Medical Image Computing and Computer-Assisted Intervention. pp. 67–76. Springer (2023) 10 Paula F...

    2023

  2. [10]

    Ferrero-Aprato, C.: Impact of circular cross-section idealization in image-based computational hemodynamic models of coronary arteries. Ph.D. thesis, Politecnico di Torino (2019)

    2019

  3. [11]

    Computer- ized medical imaging and graphics34(8), 605–616 (2010)

    Hamarneh, G., Jassi, P.: Vascusynth: Simulating vascular trees for generating vol- umetric image data with ground-truth segmentation and tree analysis. Computer- ized medical imaging and graphics34(8), 605–616 (2010)

    2010

  4. [12]

    In: Medical Imaging with Deep Learning (2024)

    Kuipers, T.P., Konduri, P.R., Marquering, H., Bekkers, E.J.: Generating cerebral vessel trees of acute ischemic stroke patients using conditional set-diffusion. In: Medical Imaging with Deep Learning (2024)

    2024

  5. [13]

    Lan,H.,Updegrove,A.,Wilson,N.M.,Maher,G.D.,Shadden,S.C.,Marsden,A.L.: A re-engineered software interface and workflow for the open-source simvascular cardiovascular modeling package. J. Biomech. Eng.140(2), 024501 (2018)

    2018

  6. [14]

    Microvascular research84(3), 314–322 (2012)

    Lang, S., Müller, B., Dominietto, M.D., Cattin, P.C., Zanette, I., Weitkamp, T., Hieber, S.E.: Three-dimensional quantification of capillary networks in healthy and cancerous tissues of two mice. Microvascular research84(3), 314–322 (2012)

    2012

  7. [15]

    Lawaetz, J., Kristensen, J.S.S., Nayahangan, L.J., Van Herzeele, I., Konge, L., Eiberg, J.P.: Simulation based training and assessment in open vascular surgery: a systematic review. Eur. J. Vasc. Endovasc. Surg.61(3), 502–509 (2021)

    2021

  8. [16]

    Journal of Neuroradiology (2023)

    Le Bras, A., Boustia, F., Janot, K., Le Pabic, E., Ouvrard, M., Fougerou-Leurent, C., Ferre, J.C., Gauvrit, J.Y., Eugene, F.: Rehearsals using patient-specific 3d- printed aneurysm models for simulation of endovascular embolization of complex intracranial aneurysms: 3d sim stu...

    2023

  9. [17]

    ACM Transactions on Graphics43(1), 1–16 (2023)

    Lee, J.J., Li, B., Benes, B.: Latent l-systems: Transformer-based tree generator. ACM Transactions on Graphics43(1), 1–16 (2023)

    2023

  10. [18]

    In: Seminal graphics: pioneering efforts that shaped the field, pp

    Lorensen, W.E., Cline, H.E.: Marching cubes: A high resolution 3d surface con- struction algorithm. In: Seminal graphics: pioneering efforts that shaped the field, pp. 347–353 (1998)

    1998

  11. [19]

    IEEE Trans

    Mou, L., Lin, J., Zhao, Y., Liu, Y., Ma, S., Zhang, J., Lv, W., Zhou, T., Frangi, A.F., Zhao, Y.: Costa: A multi-center multi-vendor tof-mra dataset and a novel cerebrovascular segmentation network. IEEE Trans. Med. Imaging (2024)

    2024

  12. [20]

    JACC Cardiovasc

    Murthy,V.L.,Naya,M.,Foster,C.R.,Hainer,J.,Gaber,M.,Dorbala,S.,Charytan, D.M., Blankstein, R., Di Carli, M.F.: Coronary vascular dysfunction and prognosis in patients with chronic kidney disease. JACC Cardiovasc. Imaging5(10) (2012)

    2012

  13. [21]

    arXiv preprint arXiv:2407.05842 (2024)

    Prabhakar, C., Shit, S., Musio, F., Yang, K., Amiranashvili, T., Paetzold, J.C., Li, H.B., Menze, B.: 3d vessel graph generation using denoising diffusion. arXiv preprint arXiv:2407.05842 (2024)

    2024 arXiv

  14. [22]

    OpenAI blog1(8), 9 (2019)

    Radford,A.,Wu,J.,Child,R.,Luan,D.,Amodei,D.,Sutskever,I.,etal.:Language models are unsupervised multitask learners. OpenAI blog1(8), 9 (2019)

    2019

  15. [23]

    In: Theisel, H., Wimmer, M

    Rauch, N., Harders, M.: Interactive Synthesis of 3D Geometries of Blood Vessels. In: Theisel, H., Wimmer, M. (eds.) Eurographics 2021 - Short Papers. The Euro- graphics Association (2021)

    2021

  16. [24]

    Hypertension59(1), 29–35 (2012)

    Roman, M.J., Kizer, J.R., Best, L.G., Lee, E.T., Howard, B.V., Shara, N.M., Dev- ereux,R.B.:Vascularbiomarkersinthepredictionofclinicalcardiovasculardisease: the strong heart study. Hypertension59(1), 29–35 (2012)

    2012

  17. [25]

    Medical image analysis16(7), 1397–1414 (2012)

    Schneider, M., Reichold, J., Weber, B., Székely, G., Hirsch, S.: Tissue metabolism driven arterial tree generation. Medical image analysis16(7), 1397–1414 (2012)

    2012

  18. [26]

    In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition

    Siddiqui, Y., Alliegro, A., Artemov, A., Tommasi, T., Sirigatti, D., Rosov, V., Dai, A., Nießner, M.: Meshgpt: Generating triangle meshes with decoder-only trans- formers. In: Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. pp. 19615–19625 (2...

    2024

  19. [27]

    arXiv preprint arXiv:2403.08974 (2024)

    Sinha, A., Hamarneh, G.: Representing anatomical trees by denoising diffusion of implicit neural fields. arXiv preprint arXiv:2403.08974 (2024)

    2024 arXiv

  20. [28]

    arXiv preprint arXiv:2406.14272 (2024)

    Sung-Bin, K., Chae-Yeon, L., Son, G., Hyun-Bin, O., Ju, J., Nam, S., Oh, T.H.: Multitalk: Enhancing 3d talking head generation across languages with multilin- gual video dataset. arXiv preprint arXiv:2406.14272 (2024)

    2024 arXiv

  21. [29]

    Scientific Reports 11(1), 1–22 (2021)

    Talou, G.D.M., Safaei, S., Hunter, P.J., Blanco, P.J.: Adaptive constrained con- structive optimisation for complex vascularisation processes. Scientific Reports 11(1), 1–22 (2021)

    2021

  22. [30]

    Computer Methods in Applied Mechanics and Engineering417, 116414 (2023)

    Taylor, C.A., Petersen, K., Xiao, N., Sinclair, M., Bai, Y., Lynch, S.R., UpdePac, A., Schaap, M.: Patient-specific modeling of blood flow in the coronary arteries. Computer Methods in Applied Mechanics and Engineering417, 116414 (2023)

    2023

  23. [31]

    Advances in neural information processing systems30 (2017)

    Van Den Oord, A., Vinyals, O., et al.: Neural discrete representation learning. Advances in neural information processing systems30 (2017)

    2017

  24. [32]

    Advances in neural information pro- cessing systems 30 (2017)

    Vaswani,A.,Shazeer,N.,Parmar,N.,Uszkoreit,J.,Jones,L.,Gomez,A.N.,Kaiser, Ł., Polosukhin, I.: Attention is all you need. Advances in neural information pro- cessing systems 30 (2017)

    2017

  25. [33]

    arXiv preprint arXiv:1804.04381 (2018)

    Wolterink, J.M., Leiner, T., Isgum, I.: Blood vessel geometry synthesis using gen- erative adversarial networks. arXiv preprint arXiv:1804.04381 (2018)

    2018 arXiv

  26. [34]

    Computerized Medical Imaging and Graphics37(1), 4–14 (2013)

    Wu, J., Hu, Q., Ma, X.: Comparative study of surface modeling methods for vas- cular structures. Computerized Medical Imaging and Graphics37(1), 4–14 (2013)

    2013

  27. [35]

    In: Proceedings of the IEEE/CVF international conference on computer vision

    Yang, G., Huang, X., Hao, Z., Liu, M.Y., Belongie, S., Hariharan, B.: Pointflow: 3d point cloud generation with continuous normalizing flows. In: Proceedings of the IEEE/CVF international conference on computer vision. pp. 4541–4550 (2019)

    2019

Pith tools

Reviewed August 15, 2026 · model on record in the stance chip above.