<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article article-type="research-article" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xml:lang="EN">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Cardiovasc. Med.</journal-id>
<journal-title>Frontiers in Cardiovascular Medicine</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Cardiovasc. Med.</abbrev-journal-title>
<issn pub-type="epub">2297-055X</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.3389/fcvm.2024.1384421</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Cardiovascular Medicine</subject>
<subj-group>
<subject>Original Research</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>Cardiac ultrasound simulation for autonomous ultrasound navigation</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author" corresp="yes"><name><surname>Amadou</surname><given-names>Abdoul Aziz</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<xref ref-type="aff" rid="aff2"><sup>2</sup></xref>
<xref ref-type="corresp" rid="cor1">&#x002A;</xref><uri xlink:href="https://loop.frontiersin.org/people/2647588/overview"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/>
<role content-type="https://credit.niso.org/contributor-roles/visualization/"/>
<role content-type="https://credit.niso.org/contributor-roles/validation/"/>
<role content-type="https://credit.niso.org/contributor-roles/software/"/>
<role content-type="https://credit.niso.org/contributor-roles/resources/"/>
<role content-type="https://credit.niso.org/contributor-roles/methodology/"/>
<role content-type="https://credit.niso.org/contributor-roles/investigation/"/>
<role content-type="https://credit.niso.org/contributor-roles/formal-analysis/"/>
<role content-type="https://credit.niso.org/contributor-roles/data-curation/"/>
<role content-type="https://credit.niso.org/contributor-roles/conceptualization/"/>
</contrib>
<contrib contrib-type="author"><name><surname>Peralta</surname><given-names>Laura</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref><uri xlink:href="https://loop.frontiersin.org/people/1870902/overview" />
<role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/>
<role content-type="https://credit.niso.org/contributor-roles/validation/"/>
<role content-type="https://credit.niso.org/contributor-roles/supervision/"/>
<role content-type="https://credit.niso.org/contributor-roles/methodology/"/>
</contrib>
<contrib contrib-type="author"><name><surname>Dryburgh</surname><given-names>Paul</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/>
<role content-type="https://credit.niso.org/contributor-roles/supervision/"/>
<role content-type="https://credit.niso.org/contributor-roles/methodology/"/>
<role content-type="https://credit.niso.org/contributor-roles/formal-analysis/"/>
</contrib>
<contrib contrib-type="author"><name><surname>Klein</surname><given-names>Paul</given-names></name>
<xref ref-type="aff" rid="aff3"><sup>3</sup></xref>
<role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/>
<role content-type="https://credit.niso.org/contributor-roles/data-curation/"/>
</contrib>
<contrib contrib-type="author"><name><surname>Petkov</surname><given-names>Kaloian</given-names></name>
<xref ref-type="aff" rid="aff3"><sup>3</sup></xref>
<role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/>
<role content-type="https://credit.niso.org/contributor-roles/methodology/"/>
</contrib>
<contrib contrib-type="author"><name><surname>Housden</surname><given-names>R. James</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/>
<role content-type="https://credit.niso.org/contributor-roles/supervision/"/>
<role content-type="https://credit.niso.org/contributor-roles/methodology/"/>
</contrib>
<contrib contrib-type="author"><name><surname>Singh</surname><given-names>Vivek</given-names></name>
<xref ref-type="aff" rid="aff3"><sup>3</sup></xref><uri xlink:href="https://loop.frontiersin.org/people/1341636/overview" />
<role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/>
<role content-type="https://credit.niso.org/contributor-roles/supervision/"/>
<role content-type="https://credit.niso.org/contributor-roles/methodology/"/>
<role content-type="https://credit.niso.org/contributor-roles/investigation/"/>
<role content-type="https://credit.niso.org/contributor-roles/formal-analysis/"/>
</contrib>
<contrib contrib-type="author"><name><surname>Liao</surname><given-names>Rui</given-names></name>
<xref ref-type="aff" rid="aff3"><sup>3</sup></xref>
<xref ref-type="author-notes" rid="an1"><sup>&#x2020;</sup></xref>
<role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/>
<role content-type="https://credit.niso.org/contributor-roles/supervision/"/>
<role content-type="https://credit.niso.org/contributor-roles/methodology/"/>
</contrib>
<contrib contrib-type="author"><name><surname>Kim</surname><given-names>Young-Ho</given-names></name>
<xref ref-type="aff" rid="aff3"><sup>3</sup></xref><uri xlink:href="https://loop.frontiersin.org/people/387620/overview" />
<role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/>
<role content-type="https://credit.niso.org/contributor-roles/methodology/"/>
</contrib>
<contrib contrib-type="author"><name><surname>Ghesu</surname><given-names>Florin C.</given-names></name>
<xref ref-type="aff" rid="aff4"><sup>4</sup></xref>
<role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/>
<role content-type="https://credit.niso.org/contributor-roles/methodology/"/>
<role content-type="https://credit.niso.org/contributor-roles/investigation/"/>
</contrib>
<contrib contrib-type="author"><name><surname>Mansi</surname><given-names>Tommaso</given-names></name>
<xref ref-type="aff" rid="aff3"><sup>3</sup></xref>
<xref ref-type="author-notes" rid="an1"><sup>&#x2020;</sup></xref>
<role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/>
<role content-type="https://credit.niso.org/contributor-roles/supervision/"/>
<role content-type="https://credit.niso.org/contributor-roles/methodology/"/>
</contrib>
<contrib contrib-type="author"><name><surname>Rajani</surname><given-names>Ronak</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref><uri xlink:href="https://loop.frontiersin.org/people/1373685/overview" />
<role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/>
<role content-type="https://credit.niso.org/contributor-roles/supervision/"/>
</contrib>
<contrib contrib-type="author"><name><surname>Young</surname><given-names>Alistair</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref><uri xlink:href="https://loop.frontiersin.org/people/704510/overview" />
<role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/>
<role content-type="https://credit.niso.org/contributor-roles/validation/"/>
<role content-type="https://credit.niso.org/contributor-roles/methodology/"/>
</contrib>
<contrib contrib-type="author"><name><surname>Rhode</surname><given-names>Kawal</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref><uri xlink:href="https://loop.frontiersin.org/people/28475/overview" />
<role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/>
<role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/>
<role content-type="https://credit.niso.org/contributor-roles/validation/"/>
<role content-type="https://credit.niso.org/contributor-roles/supervision/"/>
<role content-type="https://credit.niso.org/contributor-roles/resources/"/>
<role content-type="https://credit.niso.org/contributor-roles/methodology/"/>
</contrib>
</contrib-group>
<aff id="aff1"><label><sup>1</sup></label><institution>Department of Surgical &#x0026; Interventional Engineering, King&#x2019;s College London, School of Biomedical Engineering &#x0026; Imaging Sciences</institution>, <addr-line>London</addr-line>, <country>United Kingdom</country></aff>
<aff id="aff2"><label><sup>2</sup></label><institution>Digital Technology and Innovation, Siemens Healthcare Limited</institution>, <addr-line>Camberley</addr-line>, <country>United Kingdom</country></aff>
<aff id="aff3"><label><sup>3</sup></label><institution>Siemens Healthineers, Digital Technology and Innovation</institution>, <addr-line>Princeton, NJ</addr-line>, <country>United States</country></aff>
<aff id="aff4"><label><sup>4</sup></label><institution>Siemens Healthineers AG, Digital Technology and Innovation</institution>, <addr-line>Erlangen</addr-line>, <country>Germany</country></aff>
<author-notes>
<fn fn-type="edited-by"><p><bold>Edited by:</bold> Omneya Attallah, Arab Academy for Science, Technology and Maritime Transport (AASTMT), Egypt</p></fn>
<fn fn-type="edited-by"><p><bold>Reviewed by:</bold> Oliver Zettinig, ImFusion GmbH, Germany</p>
<p>Bishesh Khanal, NepAl Applied Mathematics and Informatics Institute for Research, Nepal</p>
<p>RabinAdhikari, NepAl Applied Mathematics and Informatics Institute for Research, Nepal, in collaboration with reviewer BK</p></fn>
<corresp id="cor1"><label>&#x002A;</label><bold>Correspondence:</bold> Abdoul Aziz Amadou <email>abdoul.a.amadou@kcl.ac.uk</email></corresp>
<fn fn-type="equal" id="an1"><label><sup>&#x2020;</sup></label><p>Work done while at Siemens Healthineers, Digital Technology and Innovation, Princeton, NJ, United States</p></fn>
</author-notes>
<pub-date pub-type="epub"><day>13</day><month>08</month><year>2024</year></pub-date>
<pub-date pub-type="collection"><year>2024</year></pub-date>
<volume>11</volume><elocation-id>1384421</elocation-id>
<history>
<date date-type="received"><day>15</day><month>02</month><year>2024</year></date>
<date date-type="accepted"><day>19</day><month>07</month><year>2024</year></date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2024 Amadou, Peralta, Dryburgh, Klein, Petkov, Housden, Singh, Liao, Kim, Ghesu, Mansi, Rajani, Young and Rhode.</copyright-statement>
<copyright-year>2024</copyright-year><copyright-holder>Amadou, Peralta, Dryburgh, Klein, Petkov, Housden, Singh, Liao, Kim, Ghesu, Mansi, Rajani, Young and Rhode</copyright-holder><license license-type="open-access" xlink:href="http://creativecommons.org/licenses/by/4.0/">
<p>This is an open-access article distributed under the terms of the <ext-link ext-link-type="uri" xlink:href="http://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution License (CC BY)</ext-link>. The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.</p></license>
</permissions>
<abstract>
<sec><title>Introduction</title>
<p>Ultrasound is well-established as an imaging modality for diagnostic and interventional purposes. However, the image quality varies with operator skills as acquiring and interpreting ultrasound images requires extensive training due to the imaging artefacts, the range of acquisition parameters and the variability of patient anatomies. Automating the image acquisition task could improve acquisition reproducibility and quality but training such an algorithm requires large amounts of navigation data, not saved in routine examinations.</p>
</sec>
<sec><title>Methods</title>
<p>We propose a method to generate large amounts of ultrasound images from other modalities and from arbitrary positions, such that this pipeline can later be used by learning algorithms for navigation. We present a novel simulation pipeline which uses segmentations from other modalities, an optimized volumetric data representation and GPU-accelerated Monte Carlo path tracing to generate view-dependent and patient-specific ultrasound images.</p>
</sec>
<sec><title>Results</title>
<p>We extensively validate the correctness of our pipeline with a phantom experiment, where structures&#x0027; sizes, contrast and speckle noise properties are assessed. Furthermore, we demonstrate its usability to train neural networks for navigation in an echocardiography view classification experiment by generating synthetic images from more than 1,000 patients. Networks pre-trained with our simulations achieve significantly superior performance in settings where large real datasets are not available, especially for under-represented classes.</p>
</sec>
<sec><title>Discussion</title>
<p>The proposed approach allows for fast and accurate patient-specific ultrasound image generation, and its usability for training networks for navigation-related tasks is demonstrated.</p>
</sec>
</abstract>
<kwd-group>
<kwd>ultrasound</kwd>
<kwd>Monte-Carlo integration</kwd>
<kwd>path tracing</kwd>
<kwd>simulation</kwd>
<kwd>echocardiography</kwd>
</kwd-group>
<contract-num rid="cn001">WT203148/Z/16/Z</contract-num>
<contract-sponsor id="cn001">Wellcome Trust</contract-sponsor>
<counts>
<fig-count count="10"/>
<table-count count="5"/><equation-count count="232"/><ref-count count="43"/><page-count count="17"/><word-count count="0"/></counts><custom-meta-wrap><custom-meta><meta-name>section-at-acceptance</meta-name><meta-value>Cardiovascular Imaging</meta-value></custom-meta></custom-meta-wrap>
</article-meta>
</front>
<body>
<sec id="s1" sec-type="intro"><label>1</label><title>Introduction</title>
<p>Ultrasound (US) is pivotal in the diagnosis, treatment and follow-up of patients in several medical specialities such as cardiology, obstetrics, gynaecology and hepatology. However, the quality of acquired images varies greatly depending on operators&#x2019; skills, which can impact diagnostic and interventional outcomes (<xref ref-type="bibr" rid="B1">1</xref>).</p>
<p>Providing guidance or automation for the image acquisition process would allow for reproducible imaging, increase both the workflow efficiency and throughput of echo departments and improve access to ultrasound examinations. This requires an intelligent system, capable of acquiring images by taking into consideration the high variability of patient anatomies.</p>
<p>Several works are investigating US acquisition automation but commercially available systems do not go beyond teleoperated ultrasound (<xref ref-type="bibr" rid="B2">2</xref>). Recent research towards autonomous navigation has used imitation learning (<xref ref-type="bibr" rid="B3">3</xref>) and deep reinforcement learning (<xref ref-type="bibr" rid="B4">4</xref>, <xref ref-type="bibr" rid="B5">5</xref>). While these methods achieve varying degrees of success, they struggle to adapt to unseen anatomies, can only manage simple scanning patterns or are tested on small datasets.</p>
<p>The main advantage of a simulation environment is the ability to generate views that occur when operators navigate to a given standard view or anatomical landmark but are not saved in clinical routine. These datasets, which we call navigation data, can also contain imaging artefacts (e.g. shadowing caused by ribs). Hence, recent ultrasound image synthesis methods using neural networks (<xref ref-type="bibr" rid="B6">6</xref>, <xref ref-type="bibr" rid="B7">7</xref>) face significant challenges in generating these views due to the necessity of comprehending ultrasound physics and the unavailability of large-scale datasets of complete ultrasound acquisitions. Besides, learning-based approaches for navigation (<xref ref-type="bibr" rid="B5">5</xref>) require a large number of images for training, including non-standard views, which are not available in classical ultrasound training datasets.</p>
<p>Using a simulation environment to train such a system would have several benefits. The trained model could learn while being exposed to a varying range of anatomies and image qualities, hence improving its robustness, and the training could be done safely, preventing the wear of mechanical components and potential injuries. This simulation environment should be: (1) Fast, to enable the use of state-of-the-art reinforcement learning algorithms. (2) Reproduce patients&#x2019; anatomies with high fidelity. (3) Recreate attenuation artefacts such as shadowing. Moreover, exposing the system to a wide range of anatomies requires large-scale data generation capabilities, meaning the pre-processing of data must be streamlined.</p>
<p>This paper presents an ultrasound simulation pipeline using Graphical Processing Unit (GPU) based ray tracing on NVIDIA OptiX (<xref ref-type="bibr" rid="B8">8</xref>), capable of generating US images in less than a second. By combining networks capable of segmenting a wide range of tissues and a volumetric data representation, we overcome the scene modelling limitations of previous mesh-based simulation methods, enabling efficient processing of numerous datasets from different modalities. Our pipeline, described in <xref ref-type="fig" rid="F1">Figure&#x00A0;1</xref> takes as input segmentations of the organs of interest and, coupled with user-defined transducer and tissue properties, generates a simulated US by combining Monte Carlo path tracing (MCPT) and convolutional approaches.</p>
<fig id="F1" position="float"><label>Figure 1</label>
<caption><p>Simulation Pipeline. Using input segmentations from other modalities, transducer and tissue acoustic properties (<bold>A</bold>), we convert the segmentation to a NanoVDB volume (<bold>B.1</bold>) for ray tracing on the GPU. (<bold>B.2</bold>) shows a volume rendering of the ray tracing scene with various organs and the transducer&#x2019;s fan geometry. We model the sound waves as rays and perform ray tracing to simulate their propagation (<bold>C.1</bold>). We then generate a scattering volume (<bold>C.2</bold>) and compute the RF lines (<bold>C.3</bold>). Time-gain compensation and scan conversion are performed to yield the final simulation (<bold>D</bold>). A real ultrasound is shown for qualitative comparison (<bold>E</bold>).</p></caption>
<graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="fcvm-11-1384421-g001.tif"/>
</fig>
<p>Our contributions are the following:
<list list-type="simple">
<list-item><label>&#x2022;</label><p>Our pipeline is able to generate images from a large number of datasets from other modalities. Using an efficient GPU volumetric representation that allows for the modelling of arbitrary patient anatomies, and a Monte Carlo path tracing algorithm, we are able to synthesize more than 10,000 images per hour using a NVIDIA Quadro K5000 GPU. Furthermore, we demonstrate scalability by generating images from 1,000 CT patient datasets in our experiments. In contrast, existing ray tracing methods limit their experiments to datasets one or two orders of magnitude smaller.</p></list-item>
<list-item><label>&#x2022;</label><p>We extensively validate the ability of our pipeline to preserve anatomical features through a phantom experiment by looking at distances and contrast between structures. Ultrasound image properties are further assessed by looking at first-order speckle statistics.</p></list-item>
<list-item><label>&#x2022;</label><p>We demonstrate the usability of our pipeline in training neural networks for transthoracic echocardiography (TTE) standard view classification, a task critical in ultrasound navigation guidance. The neural networks were initially pre-trained on synthetic images and subsequently fine-tuned using varying amounts of real data. With around half of the real samples, fine-tuned networks reach a performance level comparable to those trained with all the real data. We also report an improved classification performance when using pre-trained networks, particularly for under-represented classes.</p></list-item>
</list></p>
<p>This paper is organised in the following way: In <xref ref-type="sec" rid="s2a">Section 2.1</xref>, we provide an overview of relevant ultrasound simulation methods and highlight their limitations in terms of suitability as simulation environments. The next subsections in <xref ref-type="sec" rid="s2">Section 2</xref>. detail our simulation implementation. Experimental results using a virtual phantom and a view classification network are shown in <xref ref-type="sec" rid="s3">Section 3</xref>. This is followed by a discussion and a conclusion.</p>
</sec>
<sec id="s2" sec-type="methods"><label>2</label><title>Methods</title>
<sec id="s2a"><label>2.1</label><title>Related work</title>
<p>Early methods were attempting to simulate the US image formation process by solving the wave equation using various strategies (<xref ref-type="bibr" rid="B9">9</xref>&#x2013;<xref ref-type="bibr" rid="B13">13</xref>). While being accurate, these methods take a substantial amount of time to generate images [in the order of several minutes to hours (<xref ref-type="bibr" rid="B9">9</xref>&#x2013;<xref ref-type="bibr" rid="B12">12</xref>)], which is not scalable for large-scale training.</p>
<p>The COLE Algorithm developed by Gao et al. (<xref ref-type="bibr" rid="B14">14</xref>) is at the core of Convolutional Ray Tracing (CRT) methods. This approach allows for a fast simulation of ultrasound images with speckle noise by convolving a separable Point-Spread Function (PSF) with a scatterer distribution. Methods in (<xref ref-type="bibr" rid="B15">15</xref>&#x2013;<xref ref-type="bibr" rid="B17">17</xref>) replace the ray casting by ray tracing and combine it with the COLE algorithm to simulate images on the GPU. These methods follow a similar methodology where the input volumes are segmented and acoustic properties from the literature are assigned to each tissue. Scatterers amplitude are hyperparameters chosen such that the generated ultrasounds look plausible. Ray tracing is used to model large-scale effects at boundaries (reflection and refraction) and attenuation within tissue. Finally, the COLE algorithm is applied to yield the final image. The method developed in Mattausch et al. (<xref ref-type="bibr" rid="B17">17</xref>) distinguishes itself by employing Monte-Carlo Path Tracing (MCPT) to approximate the ray intensity at given points by taking into account contributions from multiple directions.</p>
<p>CRT methods enable fast simulations and the recreation of imaging artefacts. Methods in (<xref ref-type="bibr" rid="B15">15</xref>, <xref ref-type="bibr" rid="B17">17</xref>) both make use of meshes to represent the boundaries between organs. However, using meshes comes with a set of issues as specific pre-processing and algorithms are needed to manage overlapping boundaries. This can lead to the erroneous rendering of tissues, hence limiting the type of scene that can be modelled, as reported in Mattausch et al. (<xref ref-type="bibr" rid="B17">17</xref>). A further limitation of CRT methods lies in tissue parameterization, where scatterers belonging to the same tissue have similar properties, preventing the modelling of fine-tissue variations, and thus limiting the realism of the images.</p>
<p>Another line of work generates synthetic ultrasound images by directly sampling scatterers&#x2019; intensities from template ultrasound images and using electromechanical models to apply cardiac motion (<xref ref-type="bibr" rid="B18">18</xref>, <xref ref-type="bibr" rid="B19">19</xref>). These are different from our line of work as they require pre-existing ultrasound recordings for a given patient, while we generate synthetic images from other modalities, which also enables us to simulate different types of organs other than the heart.</p>
<p>Finally, as deep learning has become increasingly popular, the field shifted towards the use of generative adversarial networks (GAN) or diffusion models for image synthesis. These generative models have been used in several ways for image simulation: Either for generating images directly from segmentations (<xref ref-type="bibr" rid="B6">6</xref>, <xref ref-type="bibr" rid="B7">7</xref>, <xref ref-type="bibr" rid="B20">20</xref>), calibrated coordinates (<xref ref-type="bibr" rid="B21">21</xref>), or for improving the quality of images generated from CRT simulators (<xref ref-type="bibr" rid="B22">22</xref>&#x2013;<xref ref-type="bibr" rid="B24">24</xref>). However, using GANs comes with several challenges: For instance, authors in Hu et al. (<xref ref-type="bibr" rid="B21">21</xref>) report mode collapse when generating images for poses where training data was not available and authors in Gilbert et al. (<xref ref-type="bibr" rid="B6">6</xref>) report hallucination of structures if anatomical structures are not equally represented in datasets. This suggests generative neural networks would struggle in generating out-of-distribution views or with image artefacts such as shadowing. This would be problematic for ultrasound navigation guidance as out-of-distribution views are frequently encountered before reaching a desired standard view.</p>
<p>Methods taking as input low-quality images from CRT simulators seem the most promising, but several works report issues in preventing the GANs from distorting the anatomy (<xref ref-type="bibr" rid="B24">24</xref>) or introducing unrealistic image artefacts (<xref ref-type="bibr" rid="B22">22</xref>). While CRT methods are limited in realism, they match our requirements (speed, artefacts recreation, anatomical fidelity through accurate geometry) to train navigation/guidance algorithms.</p>
</sec>
<sec id="s2b"><label>2.2</label><title>Pre-processing pipeline</title>
<p>This section presents our novel pre-processing pipeline, shown in <xref ref-type="fig" rid="F1">Figure&#x00A0;1</xref>, which enables large-scale data generation by avoiding technical pitfalls caused by the use of meshes (<xref ref-type="bibr" rid="B17">17</xref>), thus allowing us to model any anatomy. Besides, the use of segmentations is essential to implement constraints on the environment for navigation tasks.</p>
<p>Input volumes (<xref ref-type="fig" rid="F1">Figure&#x00A0;1A</xref>) are segmentations obtained from either CT or Magnetic Resonance Imaging (MRI) datasets, which are processed by a four chamber (<xref ref-type="bibr" rid="B25">25</xref>) and multi-organ segmentation algorithm (<xref ref-type="bibr" rid="B26">26</xref>). The segmentation output contains all the structures relevant for echocardiography, e.g. individual ribs, sternum, heart chambers, aorta, and lungs.</p>
<p>During ray tracing, voxels need to be accessed at random. The access speed is highly dependent on the memory layout of the data. This problem has been addressed by OpenVDB (<xref ref-type="bibr" rid="B27">27</xref>) with its optimized B&#x002B; tree data structure and by its compacted, read-only and GPU-compatible version, NanoVDB (<xref ref-type="bibr" rid="B28">28</xref>). Data in Open/NanoVDB are stored in grids. These grids can be written together into a single file, which we call an Open/NanoVDB volume. We convert the segmentation volumes into NanoVDB volumes (<xref ref-type="fig" rid="F1">Figure&#x00A0;1B</xref>) as described below.</p>
<p>A detailed overview of the pre-processing pipeline is shown in <xref ref-type="fig" rid="F2">Figure&#x00A0;2</xref>. Firstly, the segmentation volume with all labels is converted to a NanoVDB grid (<xref ref-type="fig" rid="F2">Figure&#x00A0;2iii-1</xref>). This grid is used during ray tracing to access a label associated with a given voxel. Then, for each label in the segmentation volume, a narrow-band signed distance function (SDF) is computed such that the distance from voxels in the neighbourhood of the organ to its boundary is known (<xref ref-type="fig" rid="F2">Figure&#x00A0;2ii</xref>). Blue (resp. red) bands represent the voxels with negative (resp. positive) distance to that boundary, i.e. inside (resp. outside) it. The SDF grids are written to the output volume (<xref ref-type="fig" rid="F2">Figure&#x00A0;2iii-3</xref>) and are later used during traversal to compute smooth surface normals by looking at the SDF&#x2019;s gradient (<xref ref-type="fig" rid="F2">Figure&#x00A0;2v</xref>).</p>
<fig id="F2" position="float"><label>Figure 2</label>
<caption><p>Overview of the pre-processing pipeline. A segmentation volume containing <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM1"><mml:mi>N</mml:mi></mml:math></inline-formula> labels (one for each organ) is converted to a NanoVDB volume (iii) for use on the GPU. On the one hand, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM2"><mml:mi>S</mml:mi></mml:math></inline-formula> is directly converted to a grid containing all the labels (iii-1). On the other hand, for each label, an OpenVDB grid (i) containing only voxels belonging to the given label is created. In (ii), the SDF w.r.t the organ boundary is computed and used later during traversal to obtain surface normals. The blue and red bands represent negative (resp. positive) values of the SDF. (v) The final NanoVDB volume contains for each label, the corresponding voxel (iii-2) and SDF (iii-3) grids. Pointers to each grid are stored in the Shader Binding Table for access on the GPU (iv).</p></caption>
<graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="fcvm-11-1384421-g002.tif"/>
</fig>
<p>A separate grid containing only the voxels associated with the current organ is also saved (<xref ref-type="fig" rid="F2">Figure&#x00A0;2iii-2</xref>) in the output volume. Hence, the final NanoVDB volume (<xref ref-type="fig" rid="F2">Figure&#x00A0;2iii</xref>) contains the original voxel grid and, for each label, two grids: the SDF grid as well as the voxel grid. In practice, the pre-processing takes less than five minutes per volume and we use several worker processes to perform this task on multiple volumes in parallel.</p>
</sec>
<sec id="s2c"><label>2.3</label><title>Scene setup</title>
<p>Similarly to previous work (<xref ref-type="bibr" rid="B15">15</xref>&#x2013;<xref ref-type="bibr" rid="B17">17</xref>), the sound wave is modelled as a ray. The simulation is done using OptiX (<xref ref-type="bibr" rid="B8">8</xref>), which is a CUDA/C&#x002B;&#x002B; general-purpose ray tracing library providing its users with fast intersection primitives on the GPU. The previously generated NanoVDB volume is loaded and the voxel grids corresponding to each label (<xref ref-type="fig" rid="F2">Figure&#x00A0;2iii-2</xref>) are represented as Axis-Aligned Bounding Boxes (AABB) which are grouped together to create the Acceleration Structure (AS) used by OptiX to compute intersections. We assign acoustic properties from the literature (<xref ref-type="bibr" rid="B29">29</xref>) to each organ. A summary of all the assigned properties is listed in <xref ref-type="table" rid="T1">Table&#x00A0;1</xref>. Values for <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM3"><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>0</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>&#x03C3;</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:math></inline-formula> are detailed in <xref ref-type="table" rid="A1">Table A1</xref> in the <xref ref-type="table" rid="A1">Appendix</xref>. To retrieve data during traversal, OptiX uses a Shader Binding Table (SBT). We populate it with tissue properties, pointers to the organs&#x2019; SDFs and a pointer to the original voxel grid (<xref ref-type="fig" rid="F2">Figure&#x00A0;2iv</xref>). Finally, a virtual transducer is positioned in the scene. Transducer parameters are listed in <xref ref-type="table" rid="T2">Table&#x00A0;2</xref>.</p>
<table-wrap id="T1" position="float"><label>Table 1</label>
<caption><p>List of properties assigned to tissues.</p></caption>
<table frame="hsides" rules="groups">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th valign="top" align="left">Property</th>
<th valign="top" align="left">Description</th>
<th valign="top" align="left">Domain</th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Impedance (<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM4"><mml:mi>Z</mml:mi></mml:math></inline-formula>)</td>
<td valign="top" align="left">Tissue-specific acoustic impedance in kg/(m<sup>2</sup>&#x2009;s)</td>
<td valign="top" align="center">&#x2013;</td>
</tr>
<tr>
<td valign="top" align="left">Attenuation coefficient (<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM6"><mml:mi>&#x03B1;</mml:mi></mml:math></inline-formula>)</td>
<td valign="top" align="left">Tissue-specific attenuation in dB/(cm&#x2009;<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM7"><mml:mo>&#x22C5;</mml:mo></mml:math></inline-formula>&#x2009;Hz)</td>
<td valign="top" align="center">&#x2013;</td>
</tr>
<tr>
<td valign="top" align="left">Sound speed <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM8"><mml:mo stretchy="false">(</mml:mo><mml:mi>c</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula></td>
<td valign="top" align="left">Sound speed in a given tissue, in m&#x2009;<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM9"><mml:mo>&#x22C5;</mml:mo></mml:math></inline-formula>&#x2009;s<sup>-1</sup></td>
<td valign="top" align="center">&#x2013;</td>
</tr>
<tr>
<td valign="top" align="left"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM11"><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>0</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>&#x03C3;</mml:mi><mml:mn>0</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="left">Scatterer distribution parameter, from (<xref ref-type="bibr" rid="B15">15</xref>). <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM12"><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>0</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>&#x03C3;</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:math></inline-formula> control the scatterer amplitude while <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM13"><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:math></inline-formula> controls the probability of a scatterer being generated</td>
<td valign="top" align="left"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM14"><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>0</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>&#x03C3;</mml:mi><mml:mn>0</mml:mn></mml:msub><mml:mo>&#x2208;</mml:mo><mml:mo stretchy="false">[</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mn>1</mml:mn><mml:mo stretchy="false">]</mml:mo></mml:math></inline-formula></td>
</tr>
<tr>
<td valign="top" align="left"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM15"><mml:mi>&#x03C4;</mml:mi></mml:math></inline-formula></td>
<td valign="top" align="left">Coefficient used to specify whether a reflection is more diffuse or specular, as in (<xref ref-type="bibr" rid="B15">15</xref>)</td>
<td valign="top" align="left"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM16"><mml:mi>&#x03C4;</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mo stretchy="false">[</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mn>3</mml:mn><mml:mo stretchy="false">]</mml:mo></mml:math></inline-formula></td>
</tr>
<tr>
<td valign="top" align="left"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM17"><mml:mi>&#x03B3;</mml:mi></mml:math></inline-formula></td>
<td valign="top" align="left">Coefficient used to amplify small reflections, as in (<xref ref-type="bibr" rid="B15">15</xref>)</td>
<td valign="top" align="left"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM18"><mml:mi>&#x03B3;</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mo stretchy="false">[</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mn>2</mml:mn><mml:mo stretchy="false">]</mml:mo></mml:math></inline-formula></td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<fn id="table-fn1"><p>Domain values are indicated for hyperparameters. Please refer to <xref ref-type="table" rid="A1">Tables A1</xref>, <xref ref-type="table" rid="A2">A2</xref> in the <xref ref-type="table" rid="A1">Appendix</xref> for the impedance and attenuation coefficient values per tissue.</p></fn>
</table-wrap-foot>
</table-wrap>
<table-wrap id="T2" position="float"><label>Table 2</label>
<caption><p>List of parameters used to configure the transducer.</p></caption>
<table frame="hsides" rules="groups">
<colgroup>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th valign="top" align="left">Property</th>
<th valign="top" align="left">Description</th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Center frequency</td>
<td valign="top" align="left">Transducer center frequency (in Hz)</td>
</tr>
<tr>
<td valign="top" align="left">Sampling frequency</td>
<td valign="top" align="left">Signal sampling frequency (in Hz)</td>
</tr>
<tr>
<td valign="top" align="left">Element width</td>
<td valign="top" align="left">Width (in mm) of an element</td>
</tr>
<tr>
<td valign="top" align="left">Element height</td>
<td valign="top" align="left">Height (in mm) of an element</td>
</tr>
<tr>
<td valign="top" align="left">Kerf</td>
<td valign="top" align="left">Spacing between two elements (in mm)</td>
</tr>
<tr>
<td valign="top" align="left">Number of elements</td>
<td valign="top" align="left">Number of elements making up the matrix array</td>
</tr>
<tr>
<td valign="top" align="left">Scan geometry</td>
<td valign="top" align="left">Type of scan geometry (e.g. linear, phased)</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s2d"><label>2.4</label><title>Simulation module</title>
<p>The goal of the simulation module (<xref ref-type="fig" rid="F1">Figure&#x00A0;1C</xref>) is to generate view-dependent US images. This module is made of two parts.</p>
<p>The first part performs the ray tracing using OptiX. The goal of this module is to model large-scale effects (reflections, refractions and attenuation). This is done by computing, for each point along a scanline, the intensity <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM19"><mml:mi>I</mml:mi></mml:math></inline-formula> sent back to the transducer. The second part generates the US image by convolving the point spread function (PSF) with the scatterer distribution while taking into account the corresponding intensity <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM20"><mml:mi>I</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>l</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> along the scanline.</p>
<sec id="s2d1" sec-type="background"><label>2.4.1</label><title>Background</title>
<sec id="s2d1a"><label>2.4.1.1</label><title>Ultrasound physics</title>
<p>Here we first describe the phenomena happening during ray propagation: The wave loses energy due to attenuation following <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM21"><mml:mi>I</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>l</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:msub><mml:mi>I</mml:mi><mml:mn>0</mml:mn></mml:msub><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mi>l</mml:mi><mml:mi>f</mml:mi><mml:mi>&#x03B1;</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula>, with <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM22"><mml:msub><mml:mi>I</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:math></inline-formula> the initial wave intensity and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM23"><mml:mi>l</mml:mi></mml:math></inline-formula> the distance travelled in a given medium with attenuation <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM24"><mml:mi>&#x03B1;</mml:mi></mml:math></inline-formula> at frequency <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM25"><mml:mi>f</mml:mi></mml:math></inline-formula>. When it reaches a boundary, it is partially reflected and transmitted depending on the difference in impedance between the two media. The reflection and transmission coefficients <italic>R</italic> and <italic>T</italic> are written following <xref ref-type="disp-formula" rid="disp-formula1">Equations 1</xref>, <xref ref-type="disp-formula" rid="disp-formula2">2</xref>:<disp-formula id="disp-formula1"><label>(1)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="DM1"><mml:mi>R</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>Z</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>Z</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>&#x03B8;</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>&#x03B8;</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mfrac><mml:mrow><mml:msub><mml:mi>Z</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mi>cos</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>&#x03B8;</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>Z</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mi>cos</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>&#x03B8;</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:msub><mml:mi>Z</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mi>cos</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>&#x03B8;</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo stretchy="false">)</mml:mo><mml:mo>+</mml:mo><mml:msub><mml:mi>Z</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mi>cos</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>&#x03B8;</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:math></disp-formula><disp-formula id="disp-formula2"><label>(2)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="DM2"><mml:mi>T</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>Z</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>Z</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>&#x03B8;</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>&#x03B8;</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mi>R</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>Z</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>Z</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>&#x03B8;</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>&#x03B8;</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula><disp-formula id="disp-formula3"><label>(3)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="DM3"><mml:mi>cos</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>&#x03B8;</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mover><mml:mi>n</mml:mi><mml:mo>&#x2192;</mml:mo></mml:mover><mml:mo>&#x22C5;</mml:mo><mml:mover><mml:mi>v</mml:mi><mml:mo>&#x2192;</mml:mo></mml:mover></mml:math></disp-formula><disp-formula id="disp-formula4"><label>(4)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="DM4"><mml:mi>cos</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>&#x03B8;</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:msqrt><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mfrac><mml:msub><mml:mi>Z</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:msub><mml:mi>Z</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mfrac></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:msup><mml:mi>s</mml:mi><mml:mn>2</mml:mn></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>&#x03B8;</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">)</mml:mo></mml:msqrt></mml:math></disp-formula>Where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM26"><mml:msub><mml:mi>Z</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM27"><mml:msub><mml:mi>Z</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:math></inline-formula> are the impedances of the media at the boundary. <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM28"><mml:msub><mml:mi>&#x03B8;</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:math></inline-formula> computed following <xref ref-type="disp-formula" rid="disp-formula3">Equation 3</xref>, is the angle between the incident ray <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM29"><mml:mover><mml:mi>v</mml:mi><mml:mo>&#x2192;</mml:mo></mml:mover></mml:math></inline-formula> and the surface normal <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM30"><mml:mover><mml:mi>n</mml:mi><mml:mo>&#x2192;</mml:mo></mml:mover></mml:math></inline-formula>. Finally, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM31"><mml:msub><mml:mi>&#x03B8;</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:math></inline-formula> is the refracted angle and computed following <xref ref-type="disp-formula" rid="disp-formula4">Equation 4</xref>.</p>
</sec>
<sec id="s2d1b"><label>2.4.1.2</label><title>Rendering equation</title>
<p>When the wave propagates in tissue, it can encounter several boundaries and bounce multiple times, depending on the scene geometry. Hence, retrieving the total intensity at a given point <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM32"><mml:mi>P</mml:mi></mml:math></inline-formula> requires taking into account contributions coming from multiple directions. The field of computer graphics has faced similar challenges to compute global illumination.</p>
<p>We take inspiration from the rendering equation (<xref ref-type="bibr" rid="B30">30</xref>):<disp-formula id="disp-formula5"><label>(5)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="DM5"><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>P</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo><mml:mi>&#x03BD;</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>O</mml:mi><mml:mrow><mml:mi>P</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo><mml:mi>&#x03BD;</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mo>&#x222B;</mml:mo><mml:mrow><mml:mi mathvariant="normal">&#x03A9;</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>P</mml:mi><mml:mo>,</mml:mo><mml:mi>&#x03C9;</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo><mml:mi>&#x03BD;</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>P</mml:mi><mml:mo stretchy="false">&#x2190;</mml:mo><mml:mi>&#x03C9;</mml:mi></mml:mrow></mml:msub><mml:mi>cos</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mi>&#x03B8;</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mi mathvariant="normal">d</mml:mi></mml:mrow><mml:mi>&#x03C9;</mml:mi></mml:math></disp-formula>where:
<list list-type="simple">
<list-item><label>&#x2022;</label><p><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM33"><mml:mi mathvariant="normal">&#x03A9;</mml:mi></mml:math></inline-formula> is the surface hemisphere around the surface normal at point <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM34"><mml:mi>P</mml:mi></mml:math></inline-formula>.</p></list-item>
<list-item><label>&#x2022;</label><p><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM35"><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>P</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo><mml:mi>&#x03BD;</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the amount of light leaving point <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM36"><mml:mi>P</mml:mi></mml:math></inline-formula> in direction <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM37"><mml:mi>&#x03BD;</mml:mi></mml:math></inline-formula>.</p></list-item>
<list-item><label>&#x2022;</label><p><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM38"><mml:msub><mml:mi>O</mml:mi><mml:mrow><mml:mi>P</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo><mml:mi>&#x03BD;</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the light emitted at <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM39"><mml:mi>P</mml:mi></mml:math></inline-formula> in direction <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM40"><mml:mi>&#x03BD;</mml:mi></mml:math></inline-formula>.</p></list-item>
<list-item><label>&#x2022;</label><p><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM41"><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>P</mml:mi><mml:mo>,</mml:mo><mml:mi>&#x03C9;</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo><mml:mi>&#x03BD;</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is a Bidirectional Scattering Distribution Function (BSDF) giving the amount of light sent back by a given material in direction <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM42"><mml:mi>&#x03BD;</mml:mi></mml:math></inline-formula> when it receives light from direction <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM43"><mml:mi>&#x03C9;</mml:mi></mml:math></inline-formula> at point <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM44"><mml:mi>P</mml:mi></mml:math></inline-formula>.</p></list-item>
<list-item><label>&#x2022;</label><p><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM45"><mml:msub><mml:mi>L</mml:mi><mml:mrow><mml:mi>P</mml:mi><mml:mo stretchy="false">&#x2190;</mml:mo><mml:mi>&#x03C9;</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the amount of light received by <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM46"><mml:mi>P</mml:mi></mml:math></inline-formula> in direction <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM47"><mml:mi>&#x03C9;</mml:mi></mml:math></inline-formula>.</p></list-item>
<list-item><label>&#x2022;</label><p>Finally, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM48"><mml:mi>&#x03B8;</mml:mi></mml:math></inline-formula> is the angle between the surface normal at <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM49"><mml:mi>P</mml:mi></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM50"><mml:mover><mml:msub><mml:mi>n</mml:mi><mml:mi>P</mml:mi></mml:msub><mml:mo>&#x2192;</mml:mo></mml:mover></mml:math></inline-formula> and the incoming light direction <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM51"><mml:mi>&#x03C9;</mml:mi></mml:math></inline-formula>.</p></list-item>
</list></p>
</sec>
</sec>
<sec id="s2d2"><label>2.4.2</label><title>Model derivation</title>
<p>Several modifications are made to adapt <xref ref-type="disp-formula" rid="disp-formula5">Equation 5</xref> to US physics. Firstly, the term <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM52"><mml:msub><mml:mi>O</mml:mi><mml:mrow><mml:mi>P</mml:mi><mml:mo stretchy="false">&#x2192;</mml:mo><mml:mi>&#x03BD;</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is zero in our case as scatterers do not emit echoes.</p>
<p>We can then refer to the intensity sent back to the transducer from <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM53"><mml:mi>P</mml:mi></mml:math></inline-formula> as <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM54"><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>T</mml:mi><mml:mi>r</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. This term depends on the intensity <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM55"><mml:mi>I</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>P</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> arriving at <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM56"><mml:mi>P</mml:mi></mml:math></inline-formula>, expressed following <xref ref-type="disp-formula" rid="disp-formula6">Equation 6</xref>:<disp-formula id="disp-formula6"><label>(6)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="DM6"><mml:mi>I</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>P</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:msub><mml:mo>&#x222B;</mml:mo><mml:mrow><mml:mi mathvariant="normal">&#x03A9;</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:msup><mml:mi>P</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo stretchy="false">&#x2192;</mml:mo><mml:mi>&#x03C9;</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:msup><mml:mi>P</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo stretchy="false">&#x2192;</mml:mo><mml:mi>P</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mi mathvariant="normal">d</mml:mi></mml:mrow><mml:mi>&#x03C9;</mml:mi></mml:math></disp-formula></p>
<p>This represents the accumulation of echoes reaching <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM57"><mml:mi>P</mml:mi></mml:math></inline-formula> along directions <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM58"><mml:mi>&#x03C9;</mml:mi></mml:math></inline-formula> from several points <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM59"><mml:msup><mml:mi>P</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:math></inline-formula> located on other boundaries in the scene. This is illustrated in <xref ref-type="fig" rid="F3">Figure&#x00A0;3</xref> where contributions from <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM60"><mml:msub><mml:mi>P</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM61"><mml:msub><mml:mi>P</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:math></inline-formula> are gathered at <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM62"><mml:mi>P</mml:mi></mml:math></inline-formula>. <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM63"><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:msup><mml:mi>P</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo stretchy="false">&#x2192;</mml:mo><mml:mi>&#x03C9;</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the intensity leaving <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM64"><mml:msup><mml:mi>P</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:math></inline-formula> in direction <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM65"><mml:mi>&#x03C9;</mml:mi></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM66"><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:msup><mml:mi>P</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo stretchy="false">&#x2192;</mml:mo><mml:mi>P</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> is the attenuation affecting the wave from <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM67"><mml:msup><mml:mi>P</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:math></inline-formula> to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM68"><mml:mi>P</mml:mi></mml:math></inline-formula> along <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM69"><mml:mi>&#x03C9;</mml:mi></mml:math></inline-formula> (denoted as <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM70"><mml:mo>&#x223C;</mml:mo><mml:msup><mml:mi>&#x03B1;</mml:mi><mml:mo>&#x2212;</mml:mo></mml:msup></mml:math></inline-formula> in <xref ref-type="fig" rid="F3">Figure&#x00A0;3</xref>). <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM71"><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:msup><mml:mi>P</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo stretchy="false">&#x2192;</mml:mo><mml:mi>&#x03C9;</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> depends in turn on the intensity accumulated at <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM72"><mml:msup><mml:mi>P</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:math></inline-formula> (illustrated by incident rays at <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM73"><mml:msub><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>&#x22EF;</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:math></inline-formula> in <xref ref-type="fig" rid="F3">Figure&#x00A0;3</xref>) following <xref ref-type="disp-formula" rid="disp-formula7">Equation 7</xref>:<disp-formula id="disp-formula7"><label>(7)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="DM7"><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:msup><mml:mi>P</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo stretchy="false">&#x2192;</mml:mo><mml:mi>&#x03C9;</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>I</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msup><mml:mi>P</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo stretchy="false">)</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:msup><mml:mi>P</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>,</mml:mo><mml:msup><mml:mi>&#x03C9;</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo stretchy="false">&#x2192;</mml:mo><mml:mi>&#x03C9;</mml:mi></mml:mrow></mml:msub><mml:mi>cos</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:msup><mml:mi>&#x03B8;</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>With <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM74"><mml:msup><mml:mi>&#x03B8;</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:math></inline-formula> the angle between the incident ray <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM75"><mml:msup><mml:mi>&#x03C9;</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM76"><mml:mover><mml:msub><mml:mi>n</mml:mi><mml:mrow><mml:msup><mml:mi>P</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:mrow></mml:msub><mml:mo>&#x2192;</mml:mo></mml:mover></mml:math></inline-formula>, and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM77"><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:msup><mml:mi>P</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>,</mml:mo><mml:msup><mml:mi>&#x03C9;</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo stretchy="false">&#x2192;</mml:mo><mml:mi>&#x03C9;</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>R</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>Z</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>Z</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msup><mml:mi>&#x03C9;</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>&#x03C9;</mml:mi><mml:msup><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mi>&#x03B2;</mml:mi></mml:mrow></mml:msup><mml:mi>T</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>Z</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>Z</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msup><mml:mi>&#x03C9;</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>&#x03C9;</mml:mi><mml:msup><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mi>&#x03B2;</mml:mi></mml:mrow></mml:msup></mml:math></inline-formula> where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM78"><mml:mi>&#x03B2;</mml:mi></mml:math></inline-formula> is a binary variable equal to one when the ray is reflected, and zero otherwise. We randomly choose whether to reflect or refract a ray and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM79"><mml:mi>&#x03B2;</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula> when <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM80"><mml:mi>u</mml:mi><mml:mo>&#x003C;</mml:mo><mml:mi>R</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>Z</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>Z</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>&#x03B8;</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>&#x03B8;</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>, with <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM81"><mml:mi>u</mml:mi><mml:mo>&#x223C;</mml:mo><mml:mi>U</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>, otherwise <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM82"><mml:mi>&#x03B2;</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:math></inline-formula>. Here <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM83"><mml:mi>f</mml:mi></mml:math></inline-formula> is analogous to the BSDF in rendering and the corresponding loss of energy is represented at boundaries by <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM84"><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mo fence="false" stretchy="false">|</mml:mo></mml:math></inline-formula> in <xref ref-type="fig" rid="F3">Figure&#x00A0;3</xref>.</p>
<fig id="F3" position="float"><label>Figure 3</label>
<caption><p>(<bold>A</bold>) A summary of the Monte Carlo path tracing logic: For a given point <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM85"><mml:mi>P</mml:mi></mml:math></inline-formula> in the scene, we integrate the contributions from multiple waves reaching <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM86"><mml:mi>P</mml:mi></mml:math></inline-formula> over its surface hemisphere. (<bold>B</bold>) A visualisation of the sampling pdf at intersections. The black arrow is analogous to the main beams in (<bold>A</bold>). Directions close to the main beam (e.g. ray leaving <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM87"><mml:msub><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:math></inline-formula> in (<bold>A</bold>) have a higher chance of being sampled (thick red arrow) than the ones far from it (thick blue arrow, e.g. ray leaving <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM88"><mml:msub><mml:mi>P</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:math></inline-formula> in (<bold>A</bold>). (<bold>A</bold>) Path tracing logic and (<bold>B</bold>) Ray distribution at intersection.</p></caption>
<graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="fcvm-11-1384421-g003.tif"/>
</fig>
<p>As we now have an expression for <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM89"><mml:mi>I</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>P</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>, we can compute <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM90"><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>T</mml:mi><mml:mi>r</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>. This term depends on whether or not <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM91"><mml:mi>P</mml:mi></mml:math></inline-formula> lies on an organ&#x2019;s surface. The two cases are described below:
<list list-type="simple">
<list-item><label>&#x2022;</label><p>Similarly to Burger et al. (<xref ref-type="bibr" rid="B15">15</xref>), on a boundary, the intensity reflected to the transducer <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM92"><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>T</mml:mi><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>P</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:msub><mml:mi>I</mml:mi><mml:mi>R</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>P</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> is written following <xref ref-type="disp-formula" rid="disp-formula8">Equation 8</xref>:<disp-formula id="disp-formula8"><label>(8)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="DM8"><mml:msub><mml:mi>I</mml:mi><mml:mi>R</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>P</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:msup><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mfrac><mml:mrow><mml:msub><mml:mi>Z</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>Z</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>Z</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>Z</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:mfrac></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mn>2</mml:mn></mml:msup><mml:mi>I</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>P</mml:mi><mml:msup><mml:mo stretchy="false">)</mml:mo><mml:mi>&#x03C4;</mml:mi></mml:msup><mml:mi>cos</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mi>&#x03B8;</mml:mi><mml:msup><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mi>&#x03B3;</mml:mi></mml:mrow></mml:msup></mml:math></disp-formula></p></list-item>
<list-item><label>&#x2022;</label><p>Otherwise, it is simply equal to <italic>I</italic>(<italic>P</italic>) as shown in <xref ref-type="disp-formula" rid="disp-formula9">Equation 9</xref>:<disp-formula id="disp-formula9"><label>(9)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="DM9"><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>T</mml:mi><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>P</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mi>I</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>P</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula></p></list-item>
</list></p>
<p>For a given point along a scanline with radial, lateral and elevation coordinates <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM93"><mml:mo stretchy="false">(</mml:mo><mml:mi>r</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>l</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>e</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>, the expression for the received echo is described by <xref ref-type="disp-formula" rid="disp-formula10">Equation 10</xref>:<disp-formula id="disp-formula10"><label>(10)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="DM10"><mml:mi>E</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>r</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>l</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>e</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:msub><mml:mi>I</mml:mi><mml:mrow><mml:mi>T</mml:mi><mml:mi>r</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>r</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>l</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>e</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mi>&#x03C1;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>r</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>l</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>e</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>&#x2297;</mml:mo><mml:mi>T</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>r</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>l</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>e</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM94"><mml:mi>&#x03C1;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>r</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>l</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>e</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> is a cosine modulated PSF and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM95"><mml:mi>T</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>r</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>l</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>e</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> the scatterer distribution. Their expressions are given in <xref ref-type="disp-formula" rid="disp-formula11">Equations 11</xref>, <xref ref-type="disp-formula" rid="disp-formula12">12</xref>, respectively.<disp-formula id="disp-formula11"><label>(11)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="DM11"><mml:mi>&#x03C1;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>y</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>z</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mi>exp</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mn>2</mml:mn></mml:mfrac></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mfrac><mml:msup><mml:mi>r</mml:mi><mml:mn>2</mml:mn></mml:msup><mml:msubsup><mml:mi>&#x03C3;</mml:mi><mml:mi>r</mml:mi><mml:mn>2</mml:mn></mml:msubsup></mml:mfrac></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mfrac><mml:msup><mml:mi>l</mml:mi><mml:mn>2</mml:mn></mml:msup><mml:msubsup><mml:mi>&#x03C3;</mml:mi><mml:mi>l</mml:mi><mml:mn>2</mml:mn></mml:msubsup></mml:mfrac></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mfrac><mml:msup><mml:mi>e</mml:mi><mml:mn>2</mml:mn></mml:msup><mml:msubsup><mml:mi>&#x03C3;</mml:mi><mml:mi>e</mml:mi><mml:mn>2</mml:mn></mml:msubsup></mml:mfrac></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mi>cos</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mn>2</mml:mn><mml:mi>&#x03C0;</mml:mi><mml:mi>f</mml:mi><mml:mi>r</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula><disp-formula id="disp-formula12"><label>(12)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="DM12"><mml:mi>T</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>r</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>l</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>e</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>q</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:msub><mml:mi>w</mml:mi><mml:mi>q</mml:mi></mml:msub><mml:msub><mml:mi>a</mml:mi><mml:mi>q</mml:mi></mml:msub><mml:mi>&#x03B4;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>r</mml:mi><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>r</mml:mi><mml:mi>q</mml:mi></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM96"><mml:mi>N</mml:mi></mml:math></inline-formula> is the number of scatterers, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM97"><mml:msub><mml:mi>a</mml:mi><mml:mi>q</mml:mi></mml:msub></mml:math></inline-formula> is the tissue-dependent scatterer amplitude, computed similarly to (<xref ref-type="bibr" rid="B15">15</xref>&#x2013;<xref ref-type="bibr" rid="B17">17</xref>). Each scatterer is projected onto the scanline and associated with the closest radial sample <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM98"><mml:msub><mml:mi>r</mml:mi><mml:mi>q</mml:mi></mml:msub></mml:math></inline-formula>. Finally, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM99"><mml:msub><mml:mi>w</mml:mi><mml:mi>q</mml:mi></mml:msub></mml:math></inline-formula> is used to weight the contribution of a scatterer depending on its distance to the scanline. Let&#x2019;s write <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM100"><mml:msub><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mi>L</mml:mi></mml:msub></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM101"><mml:msub><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mi>E</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mi>e</mml:mi><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>e</mml:mi><mml:mi>S</mml:mi></mml:msub></mml:math></inline-formula> as the lateral and elevational distances of a scatterer to a scanline. Then <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM102"><mml:msub><mml:mi>w</mml:mi><mml:mi>q</mml:mi></mml:msub></mml:math></inline-formula> can be computed in two ways:
<list list-type="simple">
<list-item><label>&#x2022;</label><p>Using an analytical beam profile, defined by a gaussian PSF with lateral and elevational variance <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM103"><mml:msub><mml:mi>&#x03C3;</mml:mi><mml:mi>L</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi>&#x03C3;</mml:mi><mml:mi>E</mml:mi></mml:msub></mml:math></inline-formula> and expressed in <xref ref-type="disp-formula" rid="disp-formula13">Equation 13</xref>:<disp-formula id="disp-formula13"><label>(13)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="DM13"><mml:msub><mml:mi>w</mml:mi><mml:mi>q</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mi>exp</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mn>2</mml:mn></mml:mfrac></mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mfrac><mml:msubsup><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mi>L</mml:mi><mml:mn>2</mml:mn></mml:msubsup><mml:msubsup><mml:mi>&#x03C3;</mml:mi><mml:mi>L</mml:mi><mml:mn>2</mml:mn></mml:msubsup></mml:mfrac></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mfrac><mml:msubsup><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mi>E</mml:mi><mml:mn>2</mml:mn></mml:msubsup><mml:msubsup><mml:mi>&#x03C3;</mml:mi><mml:mi>E</mml:mi><mml:mn>2</mml:mn></mml:msubsup></mml:mfrac></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p></list-item>
<list-item><label>&#x2022;</label><p>Using a pulse echo field generated from Field II (offline) with the desired transducer configuration. The field is sampled based on <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM104"><mml:msub><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mi>L</mml:mi></mml:msub></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM105"><mml:msub><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mi>E</mml:mi></mml:msub></mml:math></inline-formula> and the scatterer&#x2019;s radial depth.</p></list-item>
</list></p>
<p>The computation of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM106"><mml:mi>E</mml:mi></mml:math></inline-formula> is done using the fast implementation of the COLE algorithm from Storve et al. (<xref ref-type="bibr" rid="B31">31</xref>).</p>
</sec>
<sec id="s2d3"><label>2.4.3</label><title>Monte Carlo path tracing</title>
<p>By substituting <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM107"><mml:mi>I</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msup><mml:mi>P</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> in <xref ref-type="disp-formula" rid="disp-formula7">Equation 7</xref> by its expression in <xref ref-type="disp-formula" rid="disp-formula6">Equation 6</xref>, it is easy to see the recursive nature of the integral, which makes the problem hard to solve. Hence, we resort to Monte-Carlo integration, which is a useful tool to approximate high-dimensional integrals.</p>
<p>This allows us to express <italic>I</italic>(<italic>P</italic>) following <xref ref-type="disp-formula" rid="disp-formula14">Equation 14</xref>:<disp-formula id="disp-formula14"><label>(14)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="DM14"><mml:mi>I</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>P</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mi>N</mml:mi></mml:mfrac></mml:mrow><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:mrow><mml:mfrac><mml:mrow><mml:mi>I</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="false">)</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msup><mml:mi>&#x03C9;</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo stretchy="false">&#x2192;</mml:mo><mml:msub><mml:mi>&#x03C9;</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:msub><mml:msub><mml:mi>A</mml:mi><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="false">&#x2192;</mml:mo><mml:mi>P</mml:mi></mml:mrow></mml:msub><mml:mi>cos</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>&#x03B8;</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>&#x03C9;</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac></mml:mrow></mml:math></disp-formula></p>
<p>Unlike in Mattausch et al. (<xref ref-type="bibr" rid="B17">17</xref>), we explicitly weight the pdf&#x2019;s contribution, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM108"><mml:mi>p</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>&#x03C9;</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>, which is the probability of generating a sample in direction <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM109"><mml:msub><mml:mi>&#x03C9;</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula>. Indeed, at boundaries, rather than randomly varying the surface normal to choose a direction to trace reflected/refracted rays, we choose a random direction by sampling in a cone around the reflection/refraction directions, represented by the black arrow in <xref ref-type="fig" rid="F3">Figure&#x00A0;3B</xref>. Indeed, when the wave hits large spherical scatterers, the reflected wavefront is a replica of the shape of the intersected area, which would take a conic shape in the case of spherical scatterers (<xref ref-type="bibr" rid="B29">29</xref>).</p>
<p>We generate random directions by sampling in spherical coordinates. More precisely, we have <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM110"><mml:mi>&#x03B8;</mml:mi><mml:mo>&#x223C;</mml:mo><mml:mi>U</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mn>2</mml:mn><mml:mi>&#x03C0;</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM111"><mml:mi>&#x03D5;</mml:mi><mml:mo>&#x223C;</mml:mo><mml:mi>&#x03C8;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>&#x03C3;</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>&#x03BC;</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>a</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>b</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM112"><mml:mi>&#x03C8;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>&#x03C3;</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>&#x03BC;</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>a</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>b</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> is a truncated normal distribution. <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM113"><mml:mi>&#x03D5;</mml:mi></mml:math></inline-formula> is sampled using inverse transform sampling. The joint distribution is <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM114"><mml:mi>p</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>&#x03B8;</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>&#x03D5;</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mrow><mml:mfrac><mml:mrow><mml:mi>&#x03C8;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>&#x03C3;</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>&#x03BC;</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>a</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>b</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn><mml:mi>&#x03C0;</mml:mi></mml:mrow></mml:mfrac></mml:mrow></mml:math></inline-formula> and is illustrated in <xref ref-type="fig" rid="F3">Figure&#x00A0;3B</xref>, where directions close to the reflection/refraction direction have a higher chance of being sampled (red colour) than the ones far from it (blue colour).</p>
<p>Finally, since we are working with solid angles, the distribution needs to be converted accordingly, with:<disp-formula id="disp-formula15"><label>(15)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="DM15"><mml:mi>p</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>&#x03C9;</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mrow><mml:mfrac><mml:mrow><mml:mspace width="thinmathspace" /><mml:mi>p</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>&#x03B8;</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>&#x03D5;</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mi>sin</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mi>&#x03B8;</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mfrac><mml:mrow><mml:mi>&#x03C8;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>&#x03BC;</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>&#x03C3;</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>a</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>b</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mn>2</mml:mn><mml:mi>&#x03C0;</mml:mi><mml:mi>sin</mml:mi><mml:mo>&#x2061;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mi>&#x03B8;</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac></mml:mrow></mml:math></disp-formula></p>
<p>When propagating, the sampled ray deviates from its main beam (blue, red and yellow rays in <xref ref-type="fig" rid="F3">Figure&#x00A0;3A</xref>, yielding a reduced echo intensity. Thus, in addition to the attenuation due to propagation through tissue, the sampled rays&#x2019; intensities are further reduced by weighting them with a factor <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM115"><mml:msub><mml:mi>w</mml:mi><mml:mi>R</mml:mi></mml:msub></mml:math></inline-formula> corresponding to the beam coherence (BC) as done in Mattausch et al. (<xref ref-type="bibr" rid="B17">17</xref>). For each point <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM116"><mml:msup><mml:mi>P</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:math></inline-formula> along the sampled ray, the amplitude is weighted by <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM117"><mml:msub><mml:mi>w</mml:mi><mml:mi>R</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mfrac><mml:msub><mml:mi>C</mml:mi><mml:mn>0</mml:mn></mml:msub><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mn>0</mml:mn></mml:msub><mml:mo>+</mml:mo><mml:mi>d</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>P</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msup><mml:mi>P</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac></mml:mrow></mml:math></inline-formula>, where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM118"><mml:msub><mml:mi>C</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:math></inline-formula> is a user-defined constant and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM119"><mml:mi>d</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>P</mml:mi><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msup><mml:mi>P</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> is the distance between <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM120"><mml:msup><mml:mi>P</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup></mml:math></inline-formula> and its projection on the main beam <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM121"><mml:mi>P</mml:mi></mml:math></inline-formula>, as illustrated in <xref ref-type="fig" rid="F3">Figure&#x00A0;3A</xref>. We typically use <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM122"><mml:msub><mml:mi>C</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:math></inline-formula> values in the range <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM123"><mml:mo stretchy="false">[</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mn>1</mml:mn><mml:mo stretchy="false">]</mml:mo></mml:math></inline-formula>.</p>
</sec>
<sec id="s2d4"><label>2.4.4</label><title>Traversal</title>
<p>Rays are sent from the virtual transducer depending on its scan geometry. The intersection with the volume is computed and from that point, we march stepwise along the ray using a hierarchical digital differential analyser (HDDA) (<xref ref-type="bibr" rid="B32">32</xref>). At each step, the ray is attenuated and once a boundary is reached, we randomly reflect or refract the ray. We repeat the process until a maximum number of collisions is reached.</p>
<p>Once the RF scanlines are computed, we apply time-gain compensation, log compression, dynamic range adjustment and scan conversion to obtain the final simulated US.</p>
</sec>
</sec>
</sec>
<sec id="s3"><label>3</label><title>Experiments</title>
<p>In the following sections, we begin by presenting qualitative results, where we examine the impact of different parameterizations and evaluate the pipeline&#x2019;s ability to replicate image artefacts and patient anatomies (<xref ref-type="sec" rid="s3a">Section 3.1</xref>).</p>
<p>Subsequently, we detail our phantom experiments, which serve as a validation of essential aspects of our simulation pipeline for its role as a learning environment. We assess its capability to reproduce anatomical structures by measuring physical distances and assessing contrast, using a calibration phantom as a reference. We further investigate its aptitude in generating a fully-formed speckle pattern, as speckle is an inherent property of ultrasound images (<xref ref-type="sec" rid="s3b">Section 3.2</xref>).</p>
<p>Lastly, we showcase the utility of these simulations in training a neural network for cardiac standard view classification, a critical task for ultrasound navigation guidance (<xref ref-type="sec" rid="s3c">Section 3.3</xref>).</p>
<sec id="s3a"><label>3.1</label><title>Qualitative results</title>
<p><xref ref-type="fig" rid="F4">Figure&#x00A0;4</xref> shows examples of simulated echocardiograms with various parameterizations: Firstly, the number of rays traced is critical in allowing the Monte Carlo process to converge and reveal the anatomy in the scene. Indeed, the left atrium is hardly visible in <xref ref-type="fig" rid="F4">Figure&#x00A0;4B</xref> without MCPT, as rays reflect in deterministic directions, thus not propagating in the whole scene. Using MCPT with a greater number of rays improves the visibility of the anatomical structures as demonstrated in <xref ref-type="fig" rid="F4">Figures&#x00A0;4C,D</xref>. The beam coherence value <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM124"><mml:msub><mml:mi>C</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:math></inline-formula> impacts the intensity of the rays deviating from the main beams. This is illustrated in <xref ref-type="fig" rid="F4">Figure&#x00A0;4E</xref> where a higher <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM125"><mml:msub><mml:mi>C</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:math></inline-formula> reveals the aorta as deviating rays are less attenuated. Additionally, we report the Kernel Inception Distance (KID) (<xref ref-type="bibr" rid="B33">33</xref>) for each synthetic image, where the features are extracted from the penultimate layer of a neural network trained on real images for view classification (see <xref ref-type="sec" rid="s3c">Section 3.3</xref> for network and training details) and compared to features from unseen real apical two chamber (A2C) images. The reported values for each image are obtained after averaging KID values from 100 random resamplings on the real features, following the methodology in (<xref ref-type="bibr" rid="B33">33</xref>). For our experiments and for future use as a training environment, the preferred simulation outcome would be similar to <xref ref-type="fig" rid="F4">Figure&#x00A0;4E</xref>, as critical structures for identifying the view are clearly visible and the KID is the lowest.</p>
<fig id="F4" position="float"><label>Figure 4</label>
<caption><p>Illustration of the influence of the MCPT, beam coherence <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM126"><mml:msub><mml:mi>C</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:math></inline-formula> value, scatterer weighting strategy, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM127"><mml:mi>&#x03C4;</mml:mi></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM128"><mml:mi>&#x03B3;</mml:mi></mml:math></inline-formula> terms. All simulations use MCPT, 2,500 rays, a pulse-echo field from Field II with a focus at 60mm, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM129"><mml:msub><mml:mi>C</mml:mi><mml:mn>0</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:mn>0.1</mml:mn></mml:math></inline-formula> and the myocardium properties are <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM130"><mml:mi>&#x03C4;</mml:mi><mml:mo>=</mml:mo><mml:mn>2.0</mml:mn></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM131"><mml:mi>&#x03B3;</mml:mi><mml:mo>=</mml:mo><mml:mn>0.1</mml:mn></mml:math></inline-formula> unless stated otherwise. The values in parentheses indicate the Kernel Inception Distance (KID) for each image, computed w.r.t real A2C images from the test dataset. Features for KID computation were extracted from a network trained on real images. (<bold>A</bold>) is an input segmentation map for an A2C view, where the orange label is associated with the aorta. In (<bold>E</bold>), the orange box denotes the aorta, showing the simulations reproduce patient-specific anatomy with fidelity. (<bold>A</bold>) Segmentation. (<bold>B</bold>) No MCPT (1.494). (<bold>C</bold>) 500 rays (1.490). (<bold>D</bold>) 2,500 rays (1.493). (<bold>E</bold>) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM132"><mml:msub><mml:mi>C</mml:mi><mml:mn>0</mml:mn></mml:msub><mml:mo>=</mml:mo><mml:mn>0.2</mml:mn></mml:math></inline-formula> (1.488). (<bold>F</bold>) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM133"><mml:mi>&#x03B3;</mml:mi><mml:mo>=</mml:mo><mml:mo>&#x2212;</mml:mo><mml:mn>1.8</mml:mn></mml:math></inline-formula> (1.493). (<bold>G</bold>) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM134"><mml:mi>&#x03C4;</mml:mi><mml:mo>=</mml:mo><mml:mn>2.8</mml:mn></mml:math></inline-formula> (1.492) and (<bold>H</bold>) <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM135"><mml:msub><mml:mi>&#x03C3;</mml:mi><mml:mi>L</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:msup><mml:mn>1.5</mml:mn><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>3</mml:mn></mml:mrow></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:mn>1.492</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>.</p></caption>
<graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="fcvm-11-1384421-g004.tif"/>
</fig>
<p><xref ref-type="fig" rid="F4">Figures&#x00A0;4F,G</xref> show an amplification of myocardium reflections in two ways using <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM136"><mml:mi>&#x03B3;</mml:mi></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM137"><mml:mi>&#x03C4;</mml:mi></mml:math></inline-formula>: The reflection intensities in <xref ref-type="fig" rid="F4">Figure&#x00A0;4F</xref> are angle-dependent while in <xref ref-type="fig" rid="F4">Figure&#x00A0;4G</xref> all reflections are amplified. When using an analytical profile in <xref ref-type="fig" rid="F4">Figure&#x00A0;4H</xref>, the axial distance of the scatterers along the scanline is not taken into account in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM138"><mml:msub><mml:mi>w</mml:mi><mml:mi>q</mml:mi></mml:msub></mml:math></inline-formula>, meaning their amplitude is not attenuated with depth, yielding a brighter image in the far field.</p>
<p><xref ref-type="fig" rid="F5">Figure&#x00A0;5</xref> shows real acquisitions (left column) apical 5, 4, 3 chamber views (top to bottom) alongside simulations (right column). The chambers appear clearly in the images but the simulations lack fine tissue detail, as this information is lost when segmenting the input data. This is highlighted by the orange box in the four-chamber view, where the papillary muscles and valve leaflets in the real left ventricle acquisition make the ventricle&#x2019;s border fuzzier than in our simulation. Nevertheless, this shows the potential of the pipeline in generating any type of view.</p>
<fig id="F5" position="float"><label>Figure 5</label>
<caption><p>Real (left column) and simulated (right column) Apical 5, 4, 3 chambers views (top to bottom, not paired). The orange box denotes papillary muscles and fine cardiac structures which are not captured by the simulations, making the ventricles&#x2019; borders sharper in the synthetic images.</p></caption>
<graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="fcvm-11-1384421-g005.tif"/>
</fig>
<p><xref ref-type="fig" rid="F6">Figure&#x00A0;6</xref> demonstrates post-acoustic enhancement and shadowing artefacts using a virtual sphere placed in a propagating medium. Post-acoustic enhancement is demonstrated in <xref ref-type="fig" rid="F6">Figure&#x00A0;6A</xref>, similar to artefacts caused by fluid-filled cystic structures in clinical settings. When using a highly reflective and attenuating sphere, a shadow is cast as in <xref ref-type="fig" rid="F6">Figure&#x00A0;6B</xref>. <xref ref-type="fig" rid="F6">Figures&#x00A0;6C,D</xref> illustrate acoustic shadowing in a more complex scene, where a rib is in front of the transducer. The advantage of our pipeline lies in its ability to produce such views, which are neither routinely saved nor available in open-source ultrasound datasets.</p>
<fig id="F6" position="float"><label>Figure 6</label>
<caption><p>Our pipeline is able to recreate some artefacts such as (<bold>A</bold>) post-acoustic enhancement and (<bold>B</bold>) shadowing. Spheres filled with fluid (<bold>A</bold>) and with high attenuation (<bold>B</bold>) were used to recreate the artefacts. (<bold>C</bold>) shows segmentation labels of a scene with a rib in front of the transducer (white label) and (<bold>D</bold>) is the corresponding simulated image, demonstrating acoustic shadowing. (<bold>A</bold>) Post-acoustic enhancement. (<bold>B</bold>) Acoustic shadowing. (<bold>C</bold>) Segmentation map and (<bold>D</bold>) Rib shadowing.</p></caption>
<graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="fcvm-11-1384421-g006.tif"/>
</fig>
</sec>
<sec id="s3b"><label>3.2</label><title>Phantom experiments</title>
<p>We use a commercial calibration phantom (Multi-Purpose Multi-Tissue Ultrasound Phantom, model 040GSE, Sun Nuclear, USA) to perform the validation. Real acquisitions with a Siemens<sup>TM</sup> Healthineers ACUSON P500<sup>TM</sup> system (P4-2 phased transducer) are taken for lesion detectability comparison with the simulated images. To generate our simulations, a virtual phantom is built following the technical sheet describing the arrangement of structures in the phantom. Each type of structure is assigned a label and a segmentation volume is built. We simulate three different views, with each containing a different set of targets and perform various measurements on each synthesized view. As we perform a comparison of lesion detectability in simulated and real images, we set the image pixel spacing of our simulations to the same value as the real acquisitions, i.e. at 0.23 mm. All simulations are done using a Desktop computer equipped with an NVIDIA Quadro K5000 GPU.</p>
<sec id="s3b1"><label>3.2.1</label><title>Experiment parameters</title>
<p>The transducer, simulation and post-processing parameters for phantom and view classification experiments are listed in <xref ref-type="table" rid="T3">Table&#x00A0;3</xref>. For the phantom experiment, the transducer is parameterized similarly to the real one following the parameters listed in <xref ref-type="table" rid="T2">Table&#x00A0;2</xref>. The parameters for the truncated normal distribution <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM139"><mml:mi>&#x03D5;</mml:mi></mml:math></inline-formula> are <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM140"><mml:mi>&#x03BC;</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>&#x03C3;</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mfrac><mml:mi>&#x03C0;</mml:mi><mml:mn>4</mml:mn></mml:mfrac></mml:mrow><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>a</mml:mi><mml:mo>=</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:mi>b</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mfrac><mml:mi>&#x03C0;</mml:mi><mml:mn>2</mml:mn></mml:mfrac></mml:mrow></mml:math></inline-formula>.</p>
<table-wrap id="T3" position="float"><label>Table 3</label>
<caption><p>Parameters used in the experiments.</p></caption>
<table frame="hsides" rules="groups">
<colgroup>
<col align="left"/>
<col align="center"/>
<col align="center"/>
</colgroup>
<thead>
<tr>
<th valign="top" align="left" rowspan="2">Property</th>
<th valign="top" align="center" colspan="2">Value in experiment</th>
</tr>
<tr>
<th valign="top" align="center">Phantom</th>
<th valign="top" align="center">View classification</th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left" colspan="3">Transducer parameters</td>
</tr>
<tr>
<td valign="top" align="left">Sampling frequency (MHz)</td>
<td valign="top" align="center" colspan="2">50</td>
</tr>
<tr>
<td valign="top" align="left">Center frequency (MHz)</td>
<td valign="top" align="center">3.6</td>
<td valign="top" align="center">3.6</td>
</tr>
<tr>
<td valign="top" align="left">Field II pulse echo field focus (cm)</td>
<td valign="top" align="center">5</td>
<td valign="top" align="center">6.5</td>
</tr>
<tr>
<td valign="top" align="left">Analytical profile std (<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM141"><mml:msub><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mi>L</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mi>E</mml:mi></mml:msub></mml:math></inline-formula>) (mm)</td>
<td valign="top" align="center">N/A</td>
<td valign="top" align="center">1.0</td>
</tr>
<tr>
<td valign="top" align="left" colspan="3">Simulation parameters</td>
</tr>
<tr>
<td valign="top" align="left">Max num. collisions</td>
<td valign="top" align="center">7</td>
<td valign="top" align="center">10</td>
</tr>
<tr>
<td valign="top" align="left">Beam coherence <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM142"><mml:msub><mml:mi>C</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center">0.1</td>
<td valign="top" align="center">[0.01, 0.05, 0 075, 0.1]</td>
</tr>
<tr>
<td valign="top" align="left">Num. rays per element</td>
<td valign="top" align="center">1,000</td>
<td valign="top" align="center">[1,000, 2,000, 3,000, 5,000]</td>
</tr>
<tr>
<td valign="top" align="left" colspan="3">Post-processing parameters</td>
</tr>
<tr>
<td valign="top" align="left">Dynamic Range (dB)</td>
<td valign="top" align="center">75</td>
<td valign="top" align="center">[65, 75, 85, 95]</td>
</tr>
<tr>
<td valign="top" align="left">Time-Gain compensation (dB/cm)</td>
<td valign="top" align="center" colspan="2">1.5</td>
</tr>
<tr>
<td valign="top" align="left">Reject threshold (dB)</td>
<td valign="top" align="center">40</td>
<td valign="top" align="center">[35, 45, 50, 60]</td>
</tr>
<tr>
<td valign="top" align="left"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM143"><mml:mi>&#x03C4;</mml:mi></mml:math></inline-formula></td>
<td valign="top" align="center">1.0</td>
<td valign="top" align="center">2.0</td>
</tr>
<tr>
<td valign="top" align="left"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM144"><mml:mi>&#x03B3;</mml:mi></mml:math></inline-formula></td>
<td valign="top" align="center">0.7</td>
<td valign="top" align="center">0.1</td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<fn id="table-fn2"><p>For the view classification experiment, brackets indicate the range of values sampled.</p></fn>
</table-wrap-foot>
</table-wrap>
</sec>
<sec id="s3b2"><label>3.2.2</label><title>Distance measurements</title>
<p>We sampled pixels along a 1-D line going through nylon targets. The coordinates of the line were automatically computed given the technical phantom sheet. A 1-D signal was extracted from this line and peaks (corresponding to the centre of nylon wires) were identified. Knowing the virtual transducer&#x2019;s position as well as the peaks&#x2019; location along the line allowed us to compute a Target Registration Error (TRE) between the expected and simulated nylon wire positions. Examples of targets used in this experiment are shown by the orange box in <xref ref-type="fig" rid="F7">Figure&#x00A0;7D</xref>. A detailed summary of the error per view and per target group is given in <xref ref-type="table" rid="T4">Table&#x00A0;4</xref>. An error of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM145"><mml:mn>0.20</mml:mn><mml:mo>&#x00B1;</mml:mo><mml:mn>0.32</mml:mn></mml:math></inline-formula> mm was reported when measuring the TRE from 60 targets.</p>
<fig id="F7" position="float"><label>Figure 7</label>
<caption><p>Examples of real and simulated views used in the lesion detectability and contrast experiment, alongside the corresponding histograms showing the lesion area and distribution (red) and the background area and distributions (blue). (<bold>A,B</bold>) Real and simulated acquisitions and the corresponding histograms [resp. (<bold>E,F</bold>)] associated with the hyperechoic lesion. (<bold>C,D</bold>) Real and simulated acquisitions and the corresponding histograms [resp. (<bold>G,H</bold>)] associated with the anechoic lesion. In the histograms, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM146"><mml:msub><mml:mi>&#x03F5;</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:math></inline-formula> denotes the optimal intensity threshold found that minimizes the probability of error when classifying pixels as belonging to the lesion or the background (<xref ref-type="bibr" rid="B34">34</xref>). The orange box in (<bold>D</bold>) denotes examples of targets used for the distance assessment.</p></caption>
<graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="fcvm-11-1384421-g007.tif"/>
</fig>
<table-wrap id="T4" position="float"><label>Table 4</label>
<caption><p>Target Registration Error (TRE) between expected and simulated wire positions (mean <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM147"><mml:mo>&#x00B1;</mml:mo></mml:math></inline-formula> std).</p></caption>
<table frame="hsides" rules="groups">
<colgroup>
<col align="left"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
</colgroup>
<thead>
<tr>
<th valign="top" align="left">Structure</th>
<th valign="top" align="center" colspan="3">TRE per view in mm</th>
</tr>
<tr>
<th valign="top" align="left">Target groups</th>
<th valign="top" align="center">View 1</th>
<th valign="top" align="center">View 2</th>
<th valign="top" align="center">View 3</th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Vertical distance</td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM148"><mml:mn>0.03</mml:mn><mml:mo>&#x00B1;</mml:mo><mml:mn>0.03</mml:mn></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM149"><mml:mn>0.09</mml:mn><mml:mo>&#x00B1;</mml:mo><mml:mn>0.07</mml:mn></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM150"><mml:mn>0.12</mml:mn><mml:mo>&#x00B1;</mml:mo><mml:mn>0.09</mml:mn></mml:math></inline-formula></td>
</tr>
<tr>
<td valign="top" align="left">Horizontal distance 1 (near-field)</td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM151"><mml:mn>0.05</mml:mn><mml:mo>&#x00B1;</mml:mo><mml:mn>0.04</mml:mn></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM152"><mml:mn>0.16</mml:mn><mml:mo>&#x00B1;</mml:mo><mml:mn>0.14</mml:mn></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM153"><mml:mn>0.28</mml:mn><mml:mo>&#x00B1;</mml:mo><mml:mn>0.05</mml:mn></mml:math></inline-formula></td>
</tr>
<tr>
<td valign="top" align="left">Horizontal distance 2 (far-field)</td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM154"><mml:mn>0.34</mml:mn><mml:mo>&#x00B1;</mml:mo><mml:mn>0.33</mml:mn></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM155"><mml:mn>0.25</mml:mn><mml:mo>&#x00B1;</mml:mo><mml:mn>0.59</mml:mn></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM156"><mml:mn>0.33</mml:mn><mml:mo>&#x00B1;</mml:mo><mml:mn>0.37</mml:mn></mml:math></inline-formula></td>
</tr>
</tbody>
</table>
</table-wrap>
<p>A pattern emerges from <xref ref-type="table" rid="T4">Table&#x00A0;4</xref>, where the error increases with depth (Horizontal Distance Groups 1 and 2). This is due to beam divergence in the far field, which decreases the lateral resolution. This agrees with experimental measurements.</p>
</sec>
<sec id="s3b3"><label>3.2.3</label><title>Lesion detectability and contrast</title>
<p>Having an accurate contrast between background and surrounding structures is critical in ultrasound as it allows users to discriminate between tissues. Thus, we investigate the ability of our pipeline to simulate structures of various contrast. To this end, we compare anechoic and hyperechoic lesions from our virtual phantom to the same lesions from real acquisitions.</p>
<p>In addition to classical metrics such as Contrast to Noise Ratio (CNR) and contrast, we reported the generalized Contrast-to-Noise Ratio (gCNR) (<xref ref-type="bibr" rid="B34">34</xref>), a metric robust to dynamic range alterations and with a simple interpretation. Since our post-processing pipeline differs from the P500&#x2019;s as it is a commercial system, this metric would provide a way to compare the lesion detectability independently of post-processing differences.</p>
<p>We computed gCNR, CNR and contrast between lesions and background using two views. The background patch size was calculated to have a sample size similar to the lesion patch. Real and simulated acquisitions, as well as histograms of the lesions and background distributions, are illustrated in <xref ref-type="fig" rid="F7">Figure&#x00A0;7</xref>.</p>
<p>A summary of the scores between real and simulated images is indicated in <xref ref-type="table" rid="T5">Table&#x00A0;5</xref>. Overall, gCNR, CNR and contrast values between real and simulated values are close, suggesting our pipeline reproduces lesions with fidelity. Contrast values for the second and third anechoic lesions differ as in the real acquisition, the far field is more hypoechoic compared to the focus area in the centre of the image.</p>
<table-wrap id="T5" position="float"><label>Table 5</label>
<caption><p>gCNR, CNR and contrast (in dB), values from lesions in real and simulated US acquisitions (mean <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM157"><mml:mo>&#x00B1;</mml:mo></mml:math></inline-formula> std).</p></caption>
<table frame="hsides" rules="groups">
<colgroup>
<col align="left"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
</colgroup>
<thead>
<tr>
<th valign="top" align="left">Lesion</th>
<th valign="top" align="center">Metric</th>
<th valign="top" align="center">Real</th>
<th valign="top" align="center">Sim</th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Hyperechoic (<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM158"><mml:mo>+</mml:mo><mml:mn>6</mml:mn></mml:math></inline-formula> dB)</td>
<td valign="top" align="left">gCNR</td>
<td valign="top" align="center">0.19</td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM159"><mml:mn>0.22</mml:mn><mml:mo>&#x00B1;</mml:mo><mml:mn>0.08</mml:mn></mml:math></inline-formula></td>
</tr>
<tr>
<td valign="top" align="left"/>
<td valign="top" align="left">CNR</td>
<td valign="top" align="center">0.27</td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM160"><mml:mn>0.29</mml:mn><mml:mo>&#x00B1;</mml:mo><mml:mn>0.1</mml:mn></mml:math></inline-formula></td>
</tr>
<tr>
<td valign="top" align="left"/>
<td valign="top" align="left">Contrast</td>
<td valign="top" align="center">4.72</td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM161"><mml:mn>4.88</mml:mn><mml:mo>&#x00B1;</mml:mo><mml:mn>1.82</mml:mn></mml:math></inline-formula></td>
</tr>
<tr>
<td valign="top" align="left">Hyperechoic (<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM162"><mml:mo>+</mml:mo><mml:mn>15</mml:mn></mml:math></inline-formula> dB)</td>
<td valign="top" align="left">gCNR</td>
<td valign="top" align="center">0.88</td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM163"><mml:mn>0.89</mml:mn><mml:mo>&#x00B1;</mml:mo><mml:mn>0.02</mml:mn></mml:math></inline-formula></td>
</tr>
<tr>
<td valign="top" align="left"/>
<td valign="top" align="left">CNR</td>
<td valign="top" align="center">0.74</td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM164"><mml:mn>0.77</mml:mn><mml:mo>&#x00B1;</mml:mo><mml:mn>0.03</mml:mn></mml:math></inline-formula></td>
</tr>
<tr>
<td valign="top" align="left"/>
<td valign="top" align="left">Contrast</td>
<td valign="top" align="center">16.07</td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM165"><mml:mn>16.97</mml:mn><mml:mo>&#x00B1;</mml:mo><mml:mn>2.30</mml:mn></mml:math></inline-formula></td>
</tr>
<tr>
<td valign="top" align="left">Anechoic 1</td>
<td valign="top" align="left">gCNR</td>
<td valign="top" align="center">0.80</td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM166"><mml:mn>0.82</mml:mn><mml:mo>&#x00B1;</mml:mo><mml:mn>0.03</mml:mn></mml:math></inline-formula></td>
</tr>
<tr>
<td valign="top" align="left"/>
<td valign="top" align="left">CNR</td>
<td valign="top" align="center">0.64</td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM167"><mml:mn>0.70</mml:mn><mml:mo>&#x00B1;</mml:mo><mml:mn>0.05</mml:mn></mml:math></inline-formula></td>
</tr>
<tr>
<td valign="top" align="left"/>
<td valign="top" align="left">Contrast</td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM168"><mml:mo>&#x2212;</mml:mo><mml:mn>14.17</mml:mn></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM169"><mml:mo>&#x2212;</mml:mo><mml:mn>13.38</mml:mn><mml:mo>&#x00B1;</mml:mo><mml:mn>1.89</mml:mn></mml:math></inline-formula></td>
</tr>
<tr>
<td valign="top" align="left">Anechoic 2</td>
<td valign="top" align="left">gCNR</td>
<td valign="top" align="center">0.87</td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM170"><mml:mn>0.78</mml:mn><mml:mo>&#x00B1;</mml:mo><mml:mn>0.04</mml:mn></mml:math></inline-formula></td>
</tr>
<tr>
<td valign="top" align="left"/>
<td valign="top" align="left">CNR</td>
<td valign="top" align="center">0.72</td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM171"><mml:mn>0.70</mml:mn><mml:mo>&#x00B1;</mml:mo><mml:mn>0.04</mml:mn></mml:math></inline-formula></td>
</tr>
<tr>
<td valign="top" align="left"/>
<td valign="top" align="left">Contrast</td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM172"><mml:mo>&#x2212;</mml:mo><mml:mn>16.61</mml:mn></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM173"><mml:mo>&#x2212;</mml:mo><mml:mn>13.38</mml:mn><mml:mo>&#x00B1;</mml:mo><mml:mn>1.34</mml:mn></mml:math></inline-formula></td>
</tr>
<tr>
<td valign="top" align="left">Anechoic 3</td>
<td valign="top" align="left">gCNR</td>
<td valign="top" align="center">0.71</td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM174"><mml:mn>0.71</mml:mn><mml:mo>&#x00B1;</mml:mo><mml:mn>0.06</mml:mn></mml:math></inline-formula></td>
</tr>
<tr>
<td valign="top" align="left"/>
<td valign="top" align="left">CNR</td>
<td valign="top" align="center">0.66</td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM175"><mml:mn>0.69</mml:mn><mml:mo>&#x00B1;</mml:mo><mml:mn>0.06</mml:mn></mml:math></inline-formula></td>
</tr>
<tr>
<td valign="top" align="left"/>
<td valign="top" align="left">Contrast</td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM176"><mml:mo>&#x2212;</mml:mo><mml:mn>19.41</mml:mn></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM177"><mml:mo>&#x2212;</mml:mo><mml:mn>13.69</mml:mn><mml:mo>&#x00B1;</mml:mo><mml:mn>2.43</mml:mn></mml:math></inline-formula></td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<fn id="table-fn3"><p>Simulations were generated 10 times to take in account the stochasticity of the MCPT and the scatterers&#x2019; generation in <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM178"><mml:mi>T</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>.</p></fn>
</table-wrap-foot>
</table-wrap>
</sec>
<sec id="s3b4"><label>3.2.4</label><title>Speckle pattern analysis</title>
<p>In this section, we analyze the capability of our simulator to generate a fully-developed speckle pattern. To this end, we conduct a comparative analysis similar to Gao et al. (<xref ref-type="bibr" rid="B35">35</xref>), where random scatterers at a density of 600 mm<sup>-1</sup> and fixed amplitude of 1 are distributed in a <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM180"><mml:mn>40</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mn>40</mml:mn></mml:math></inline-formula> mm<sup>2</sup> volume. It is known for such an experiment that the envelope detected signal follows a Rayleigh distribution and its signal-to-noise ratio (SNR) reaches a value of 1.91 (<xref ref-type="bibr" rid="B36">36</xref>). The experiment is repeated 10 times to take into account its stochastic nature. Here, we use an analytical beam profile with <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM182"><mml:msub><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mi>E</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mspace width="thickmathspace" /><mml:msub><mml:mi mathvariant="normal">&#x0394;</mml:mi><mml:mi>L</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mn>2.0</mml:mn></mml:math></inline-formula> mm. For each run, the SNR is computed and the sum-of-squared errors (SSE) w.r.t a fitted Rayleigh distribution is calculated. An example histogram and fitted distribution from a run is shown in <xref ref-type="fig" rid="F8">Figure&#x00A0;8</xref>.</p>
<fig id="F8" position="float"><label>Figure 8</label>
<caption><p>Rayleigh distribution fit. The histogram shown is from a random run out of 10. We obtain a mean sum-of-squared Errors of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM183"><mml:mn>1.89</mml:mn><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>5</mml:mn></mml:mrow></mml:msup></mml:math></inline-formula> w.r.t the fitted Rayleigh distribution and a SNR of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM184"><mml:mn>1.89</mml:mn><mml:mo>&#x00B1;</mml:mo><mml:mn>0.01</mml:mn></mml:math></inline-formula>, which is in the ranges reported in the literature (<xref ref-type="bibr" rid="B14">14</xref>, <xref ref-type="bibr" rid="B16">16</xref>, <xref ref-type="bibr" rid="B35">35</xref>).</p></caption>
<graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="fcvm-11-1384421-g008.tif"/>
</fig>
<p>We obtain a mean SSE of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM185"><mml:mn>1.81</mml:mn><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>5</mml:mn></mml:mrow></mml:msup></mml:math></inline-formula> and SNR of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM186"><mml:mn>1.89</mml:mn><mml:mo>&#x00B1;</mml:mo><mml:mn>0.01</mml:mn></mml:math></inline-formula>, which is in the ranges reported in the literature (<xref ref-type="bibr" rid="B14">14</xref>, <xref ref-type="bibr" rid="B16">16</xref>, <xref ref-type="bibr" rid="B35">35</xref>). This suggests that our pipeline is able to create a fully developed speckle pattern.</p>
</sec>
</sec>
<sec id="s3c"><label>3.3</label><title>View classification</title>
<p>Our last experiment assesses the usability of simulated images to train neural networks for view classification. This task is intrinsic to navigation as a network must be capable of identifying when a target view has been reached. We train networks to classify real apical views (A2C, A3C, A4C, A5C) and investigate the impact of fine-tuning with real data on the networks&#x2019; performance, as networks trained in the simulation environment would likely be fine-tuned to adapt to real scenarios. Synthetic and real dataset generation are described in <xref ref-type="sec" rid="s3c1">Sections 3.3.1</xref> and <xref ref-type="sec" rid="s3c2">3.3.2</xref>. Furthermore, we conduct an ablation study where we evaluate the impact of parameters we believe impact the image quality the most, namely: the use of MCPT and the weighting method when projecting scatterers, i.e. with an analytical function or using a pulse echo field from Field II. The experimental setup is detailed in <xref ref-type="sec" rid="s3c3">Section 3.3.3</xref>, followed by the results in <xref ref-type="sec" rid="s3c4">Section 3.3.4</xref>.</p>
<sec id="s3c1"><label>3.3.1</label><title>Simulated TTE dataset</title>
<p>Chest CTs and Cardiac CTs from 1,019 patients from the FUMPE (<xref ref-type="bibr" rid="B37">37</xref>) and The Cancer Imaging Archive (<xref ref-type="bibr" rid="B38">38</xref>) [LIDC-IDRI (<xref ref-type="bibr" rid="B39">39</xref>)] datasets were used to generate simulated images. The volumes were automaticall segmented using (<xref ref-type="bibr" rid="B40">40</xref>) and pre-processed according to the pipeline described in <xref ref-type="fig" rid="F2">Figure&#x00A0;2</xref> and several landmarks were automatically obtained (apex, the centre of the heart chambers&#x2026;) and used to find the appropriate transducer orientations and positions to acquire the standard views.</p>
<p>For each view, we generate multiple synthetic samples by varying simulation parameters as described in <xref ref-type="table" rid="T3">Table&#x00A0;3</xref>. We generated more synthetic samples for the A5C view to compensate for the low number of datasets where we were able to automatically obtain a suitable view. The final dataset distribution is 30&#x0025;, 30&#x0025;, 30&#x0025; and 10&#x0025; resp. for the A2C, A3C, A4C and A5C classes.</p>
<p>All the samples from the simulated dataset are used for training. The average simulation time per image was 300 milliseconds. This number includes only the simulation step (i.e. <xref ref-type="fig" rid="F1">Figure&#x00A0;1C</xref>).</p>
<p>Finally, to conduct the ablation study, 3 different simulated datasets are created.
<list list-type="simple">
<list-item><label>&#x2022;</label><p>sim NO MCPT, where MCPT was disabled. Thus all samples are generated with deterministic raytracing.</p></list-item>
<list-item><label>&#x2022;</label><p>sim <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM187"><mml:mo>+</mml:mo></mml:math></inline-formula> MCPT, where MCPT was enabled and an analytical beam profile used.</p></list-item>
<list-item><label>&#x2022;</label><p>sim <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM188"><mml:mo>+</mml:mo></mml:math></inline-formula> MCPT <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM189"><mml:mo>+</mml:mo></mml:math></inline-formula> FIELD, where MCPT was enabled and a pulse echo field from Field II was used to weight the scatterers&#x2019; contributions.</p></list-item>
</list></p>
</sec>
<sec id="s3c2"><label>3.3.2</label><title>Real TTE dataset</title>
<p>We used real US acquisitions to train and test the view classification network. The video sequences came from Siemens and Philips systems. During training, we sample randomly one frame from a given sequence and add it to the training batch. The real training dataset is also imbalanced, where the sample distribution in each fold for A2C, A3C, A4C and A5C classes is around 21&#x0025;, 18&#x0025;, 51&#x0025; and 10&#x0025;.</p>
</sec>
<sec id="s3c3"><label>3.3.3</label><title>Evaluation methodology</title>
<p>For this experiment, we used a Convolutional Neural Network (CNN) with a DenseNet architecture (<xref ref-type="bibr" rid="B41">41</xref>) to classify views. The network architecture is kept fixed for all experiments. Random weighted sampling is used to fight class imbalance. We divide the real dataset into 5 folds for cross-validation but always use the same synthetic dataset for pre-training.</p>
<p>In each fold, we create subsets <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM190"><mml:msub><mml:mi>d</mml:mi><mml:mi>r</mml:mi></mml:msub></mml:math></inline-formula> of the real training dataset <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM191"><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mrow><mml:mi mathvariant="normal">real</mml:mi></mml:mrow></mml:mrow></mml:msub></mml:math></inline-formula> with varying amounts of real data. For each <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM192"><mml:msub><mml:mi>d</mml:mi><mml:mi>r</mml:mi></mml:msub></mml:math></inline-formula>, we train four networks: One network on <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM193"><mml:msub><mml:mi>d</mml:mi><mml:mi>r</mml:mi></mml:msub></mml:math></inline-formula> only, to establish a baseline and then we pre-train 3 other networks on each one of the simulated datasets and fine-tune them on <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM194"><mml:msub><mml:mi>d</mml:mi><mml:mi>r</mml:mi></mml:msub></mml:math></inline-formula>. Validation and testing are always done on the same real datasets, independently of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM195"><mml:msub><mml:mi>d</mml:mi><mml:mi>r</mml:mi></mml:msub></mml:math></inline-formula>&#x2019;s size.</p>
<p>When pre-training, we employ the following data augmentations on the synthetic samples to match the variations observed in the real dataset: Cropping/zooming (e.g. to mimic real sequences where there&#x2019;s a zoom on a chamber or a valve), Gaussian smoothing, brightness and contrast jittering (to replicate varying texture qualities), fan angle variation (for real sequences where the fan angle is changed by the operator). No augmentations are applied to the real data.</p>
<p>When evaluating, for each video sequence, we perform a majority vote on the network&#x2019;s predictions on each frame to determine which label to assign to the sequence.</p>
</sec>
<sec id="s3c4" sec-type="results"><label>3.3.4</label><title>Results</title>
<p>We report averaged F1-score and accuracy for all the classes in <xref ref-type="fig" rid="F9">Figures&#x00A0;9A,B</xref> and F1-score for the A5C and A4C classes in <xref ref-type="fig" rid="F9">Figures&#x00A0;9C,D</xref>.</p>
<fig id="F9" position="float"><label>Figure 9</label>
<caption><p>Results of the view classification ablation study averaged over 5 folds. Networks pre-trained with simulations and then fine-tuned on real samples were compared to networks trained on real data only. The <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM196"><mml:mi>x</mml:mi></mml:math></inline-formula>-axis indicates the size of the subset of real data <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM197"><mml:msub><mml:mi>d</mml:mi><mml:mi>r</mml:mi></mml:msub></mml:math></inline-formula>. (<bold>A,B</bold>) report the F1-score and accuracy over the 4 classes while (<bold>C,D</bold>) report the metrics for the (most-represented) A4C and (under-represented) A5C classes. For a given <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM198"><mml:msub><mml:mi>d</mml:mi><mml:mi>r</mml:mi></mml:msub></mml:math></inline-formula>, a star is displayed on a graph if the <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM199"><mml:mi>p</mml:mi></mml:math></inline-formula>-value from a right-tailed Wilcoxon signed rank-test is <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM200"><mml:mo>&#x003C;</mml:mo><mml:mn>0.05</mml:mn></mml:math></inline-formula>.</p></caption>
<graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="fcvm-11-1384421-g009.tif"/>
</fig>
<p><xref ref-type="fig" rid="F9">Figure&#x00A0;9</xref> suggests pre-trained networks achieve a performance level comparable to networks trained on all real datasets when fine-tuned with at least half of the real data.</p>
<p>Fine-tuned networks show significant improvements over their counterparts trained on real data (when <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM201"><mml:msub><mml:mi>d</mml:mi><mml:mi>r</mml:mi></mml:msub><mml:mo>&#x003C;</mml:mo><mml:mn>800</mml:mn></mml:math></inline-formula>). This trend is accentuated for the A5C class, which is the most under-represented in the dataset. Using simulated data for pre-training still benefits the dominant A4C class, as shown in <xref ref-type="fig" rid="F9">Figure&#x00A0;9D</xref>. Results for networks trained on simulated data only are not reported as they overfitted easily and performed poorly on the real test dataset.</p>
<p>Confusion matrices for <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM202"><mml:msub><mml:mi>d</mml:mi><mml:mi>r</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mn>450</mml:mn></mml:math></inline-formula> are reported in <xref ref-type="fig" rid="F10">Figure&#x00A0;10</xref> for the baseline trained on real data only (<xref ref-type="fig" rid="F10">Figure&#x00A0;10A</xref>) and the network pre-trained on sim <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM203"><mml:mo>+</mml:mo></mml:math></inline-formula> MCPT (<xref ref-type="fig" rid="F10">Figure&#x00A0;10B</xref>). There is a noticeable improvement in the results, highlighted by a reduction in confusion between the A5C and A4C classes.</p>
<fig id="F10" position="float"><label>Figure 10</label>
<caption><p>Confusion matrices for <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM204"><mml:msub><mml:mi>d</mml:mi><mml:mi>r</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mn>450</mml:mn></mml:math></inline-formula> in the view classification experiment. (<bold>A</bold>) Confusion matrix for the baseline trained on real data only. (<bold>B</bold>) Confusion matrix for the network pre-trained on simulated data with MCPT enabled. An analytical beam profile was used. The network pre-trained on simulated data (<bold>B</bold>) notably reduces the confusion between A5C and A4C classes.</p></caption>
<graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="fcvm-11-1384421-g010.tif"/>
</fig>
<p>Finally, no statistically significant differences were found when comparing the results of the networks pre-trained on sim <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM205"><mml:mo>+</mml:mo></mml:math></inline-formula> MCPT and sim <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM206"><mml:mo>+</mml:mo></mml:math></inline-formula> MCPT <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM207"><mml:mo>+</mml:mo></mml:math></inline-formula> FIELD (<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM208"><mml:mi>p</mml:mi><mml:mo>&#x003E;</mml:mo><mml:mn>0.05</mml:mn></mml:math></inline-formula>). This suggests the choice of the weighting method for scatterers has little influence on neural network training on this task. Results were statistically different between sim NO MCPT and sim <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM209"><mml:mo>+</mml:mo></mml:math></inline-formula> MCPT when <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM210"><mml:msub><mml:mi>d</mml:mi><mml:mi>r</mml:mi></mml:msub><mml:mo>&#x003C;</mml:mo><mml:mn>450</mml:mn></mml:math></inline-formula> and only different between sim NO MCPT and sim <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM211"><mml:mo>+</mml:mo></mml:math></inline-formula> MCPT <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM212"><mml:mo>+</mml:mo></mml:math></inline-formula> FIELD when <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM213"><mml:msub><mml:mi>d</mml:mi><mml:mi>r</mml:mi></mml:msub><mml:mo>&#x003C;</mml:mo><mml:mn>150</mml:mn></mml:math></inline-formula>.</p>
</sec>
</sec>
</sec>
<sec id="s4" sec-type="discussion"><label>4</label><title>Discussion</title>
<p>In this section, we first discuss experimental results from the view classification experiment in <xref ref-type="sec" rid="s4a">Section 4.1</xref>. We then address the limitations of our proposed simulation pipeline in <xref ref-type="sec" rid="s4b">Section 4.2</xref> and finish by expanding on potential applications of the pipeline and future work in <xref ref-type="sec" rid="s4c">Section 4.3</xref>.</p>
<sec id="s4a"><label>4.1</label><title>View classification</title>
<p>In <xref ref-type="fig" rid="F9">Figure&#x00A0;9</xref>, pre-trained networks show improved performance compared to the ones trained on real data only, meaning the simulations can be used to generate data when large datasets are not readily available or to target a sub-population which is less prevalent. This suggests our pipeline could be used to generate data for other tasks, given some improvements are made to circumvent the limitations caused by using segmentations. We expand on this in <xref ref-type="sec" rid="s4b">Section 4.2</xref>.</p>
<p>Moreover, networks pre-trained without MCPT achieved in some cases performances similar to their counterparts trained with MCPT. While MCPT allows for a better visibility of the anatomical structures as demonstrated in <xref ref-type="fig" rid="F4">Figure&#x00A0;4</xref>, the discriminating features between views (i.e. heart chambers) are still present in the images without using MCPT. This would explain why the networks can still learn from such images. However, we believe using MCPT might be more critical in applications where all structures need to be clearly observable, such as image segmentation.</p>
<p>We limited the view classification experiment to four views as apical views were the only ones we could obtain robustly in an automatic way. Even then, we were not always successful in obtaining correct transducer orientations for each apical view in every patient dataset, especially for the A5C view. Indeed, view planes for each patient are obtained by finding landmarks using segmentations and morphological operations and then fitting a plane. Our automated method failed to consistently find a plane where the aorta and the four chambers were visible in the simulations. This is related to the fact that we obtain our segmentations from CT data, where the patients are lying supine, and it is known that finding A5C views when patients are in the supine position is complicated in clinical settings as the imaging plane is suboptimal (<xref ref-type="bibr" rid="B42">42</xref>). This explains the synthetic training data distribution in the view classification experiment. However, using an algorithm capable of navigating between views (which is what we intend to develop using the simulator), we could potentially generate datasets with a greater number of standard views.</p>
<p>Finally, in <xref ref-type="fig" rid="F10">Figure&#x00A0;10</xref>, there is a confusion between A2C and A4C classes. Our data is annotated such that all frames in a video sequence have the same label. However, there are multiple A4C sequences in which some frames resemble A2C views (due to suboptimal probe positioning or cardiac phase) but are labelled as A4C, which introduces confusion for the network during training.</p>
</sec>
<sec id="s4b"><label>4.2</label><title>Proposed simulation pipeline</title>
<p>While this pipeline allows for the fast simulation of arbitrary anatomies from a large number of patient datasets, it presents limitations:
<list list-type="simple">
<list-item><label>(1)</label><p>Similarly to other raytracing methods, we cannot simulate non-linear propagation. This prevents us from using techniques such as tissue harmonic imaging. Furthermore, we cannot reproduce reverberations. These could be simulated by summing the ray contributions temporally (i.e. by keeping track of the distance travelled by a ray) rather than spatially. However, this requires a careful weighting of the contribution of the randomly sampled rays with the beam coherence, so as to not yield incorrect results.</p></list-item>
<list-item><label>(2)</label><p>As seen in <xref ref-type="fig" rid="F5">Figure&#x00A0;5</xref>, the border with the blood pool is sharp and the inhomogeneities of tissues are not represented in the simulations. This is due, respectively, to smaller cardiac structures (e.g. papillary muscles, trabeculae &#x2026;) which are difficult to annotate and segment, and to the assumption of homogeneity within the tissue (i.e. all scatterers&#x2019; intensities in a given medium follow the same distribution) since the intensity variation between pixels is lost with the segmentations. Additionally, the segmentation algorithm can also produce inaccurate labels. The impact of these factors depends on the downstream tasks.</p>
<p>A quantitative evaluation of segmentation errors could be made using a CT with accurate segmentation labels and then altering the labels with geometric and morphological operations to assess the impact of inaccuracies on the outcomes. Furthermore, given pairs of registered CT and real ultrasound images, one could assess the ability of the pipeline in simulating pathological cases, as in <xref ref-type="fig" rid="F6">Figures&#x00A0;6A,B</xref>.</p>
<p>The impact of the tissue homogeneity assumption was illustrated in our attempt to train networks solely on simulated data for the view classification experiment, but the performance was poor. We noticed the network quickly overfitted the data. While the range of anatomies simulated is wide (<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM214"><mml:mo>+</mml:mo></mml:math></inline-formula>1,000 patients), the lack of fine-tissue detail seems to limit the diversity of generated samples. We believe a potential solution to this challenge would be a combination of our pipeline with generative models, to improve the realism and quality of simulations. This could enable the generation of large and realistic ultrasound datasets, with readily available anatomical labels.</p></list-item>
<list-item><label>(3)</label><p>While we do not address the topic of cardiac motion in this manuscript, it is possible to generate such sequences with our pipeline, given input volumes for each timestep of the cardiac cycle.</p></list-item>
<list-item><label>(4)</label><p>We recognize that the pressure applied by sonographers on the patient&#x2019;s chest during TTE examinations can impact the image quality. We plan to address this in future work by incorporating a volumetric deformation model over the anatomical volume. Nevertheless, we note that the proposed framework would still be sufficient for training navigation algorithms for transesophageal imaging, where the impact on images of such anatomical shape deformations due to the ultrasound probe would be significantly smaller.
</p></list-item>
</list></p>
</sec>
<sec id="s4c"><label>4.3</label><title>Applications and future work</title>
<p>We aim to use our pipeline as a simulator to train navigation algorithms, similar to Li et al. (<xref ref-type="bibr" rid="B5">5</xref>). While the motivation behind the development of our pipeline is autonomous navigation, its capabilities could enable numerous downstream applications. Large dataset generation from segmentations could allow for the training of neural networks for tasks such as view classification, image segmentation or automated anatomical measurements.</p>
<p>In addition to the proposed use for automated acquisition, the method could be used for training or guidance of a semi-trained or novice ultrasound operator. Typically, guidance methods use 2D images from a pre-acquired 3D dataset. However, a simulation method would enable larger adjustments to the probe position.</p>
<p>While we focus on cardiac TTE imaging in this paper, other organs or modalities such as Transoesophageal Echocardiography (TEE) or Intracardiac Echocardiography (ICE), in 2D or 3D, could be simulated as a result of the built-in flexibility of our pipeline. Our future work will investigate both the use of the simulation pipeline as an environment to train deep reinforcement learning agents for autonomous navigation and the use of generative networks to improve the realism and train networks for several downstream tasks.</p>
</sec>
</sec>
<sec id="s5" sec-type="conclusions"><label>5</label><title>Conclusion</title>
<p>We have presented an ultrasound simulation pipeline capable of processing numerous patient datasets and generating patient-specific images in under half a second. In the first experiment, we assessed several properties of the simulated images (distances, contrast, speckle statistics) using a virtual calibration phantom. The geometry of our simulations is accurate, the contrast of different tissues is reproduced with fidelity and we are able to generate a fully developed speckle pattern.</p>
<p>We then synthesized cardiac views from more than 1,000 real patient CT datasets and pre-trained networks using simulated datasets. The pre-trained networks required around half the real data for fine-tuning to reach a performance level comparable to networks trained with all the real samples, demonstrating the usefulness of simulations when large real datasets are not available.</p>
<p>The main limitation lies in the use of segmentations, unable to capture smaller cardiac structures or intensity variations between neighbouring pixels. Using a generative neural network to augment the simulations is a potential workaround. Such a pipeline enables a large number of downstream applications, ranging from data generation for neural network training (segmentation, classification, navigation) to sonographer training.</p>
</sec>
</body>
<back>
<sec id="s6" sec-type="data-availability"><title>Data availability statement</title>
<p>Publicly available datasets were analyzed in this study. This data can be found here: <ext-link ext-link-type="uri" xlink:href="https://imaging.cancer.gov/informatics/cancer_imaging_archive.htm">https://imaging.cancer.gov/informatics/cancer_imaging_archive.htm</ext-link>, <ext-link ext-link-type="uri" xlink:href="https://www.kaggle.com/datasets/andrewmvd/pulmonary-embolism-in-ct-images">https://www.kaggle.com/datasets/andrewmvd/pulmonary-embolism-in-ct-images</ext-link>.</p>
</sec>
<sec id="s7" sec-type="author-contributions"><title>Author contributions</title>
<p>AAA: Writing &#x2013; review &#x0026; editing, Writing &#x2013; original draft, Visualization, Validation, Software, Resources, Methodology, Investigation, Formal Analysis, Data curation, Conceptualization; LP: Writing &#x2013; review &#x0026; editing, Writing &#x2013; original draft, Validation, Supervision, Methodology; PD: Writing &#x2013; review &#x0026; editing, Supervision, Methodology, Formal Analysis; PK: Writing &#x2013; review &#x0026; editing, Data curation; KP: Writing &#x2013; review &#x0026; editing, Methodology; RJH: Writing &#x2013; review &#x0026; editing, Supervision, Methodology; VS: Writing &#x2013; review &#x0026; editing, Writing &#x2013; original draft, Supervision, Methodology, Investigation, Formal Analysis; RL: Writing &#x2013; original draft, Supervision, Methodology; Y-HK: Writing &#x2013; review &#x0026; editing, Writing &#x2013; original draft, Methodology; FCG: Writing &#x2013; review &#x0026; editing, Writing &#x2013; original draft, Methodology, Investigation; TM: Writing &#x2013; original draft, Supervision, Methodology; RR: Writing &#x2013; review &#x0026; editing, Supervision; AY: Writing &#x2013; review &#x0026; editing, Writing &#x2013; original draft, Validation, Methodology; KR: Writing &#x2013; review &#x0026; editing, Writing &#x2013; original draft, Validation, Supervision, Resources, Methodology.</p>
</sec>
<sec id="s8" sec-type="funding-information"><title>Funding</title>
<p>The author(s) declare financial support was received for the research, authorship, and/or publication of this article.</p>
<p>This research was funded in part, by the Wellcome Trust under Grant WT203148/Z/16/Z and in part by Siemens Healthineers.</p>
</sec>
<ack><title>Acknowledgments</title>
<p>The authors acknowledge the National Cancer Institute and the Foundation for the National Institutes of Health, and their critical role in the creation of the free publicly available LIDC/IDRI Database used in this study.</p>
</ack>
<sec id="s9" sec-type="COI-statement"><title>Conflict of interest</title>
<p>PK, KP, VS, Y-HK and FCG are employed by Siemens Healthineers. RL and TM were employed by Siemens Healthineers.</p>
<p>The remaining authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p>
</sec>
<sec id="s11" sec-type="disclaimer"><title>Publisher&#x0027;s note</title>
<p>All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.</p>
</sec>
<ref-list><title>References</title>
<ref id="B1"><label>1.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Pinto</surname><given-names>AV</given-names></name><name><surname>Pinto</surname><given-names>F</given-names></name><name><surname>Faggian</surname><given-names>A</given-names></name><name><surname>Rubini</surname><given-names>G</given-names></name><name><surname>Caranci</surname><given-names>F</given-names></name><name><surname>Macarini</surname><given-names>L</given-names></name></person-group>, et al. <article-title>Sources of error in emergency ultrasonography</article-title>. <source>Crit Ultrasound J</source>. (<year>2013</year>) <volume>5</volume>:<fpage>S1</fpage>. <pub-id pub-id-type="doi">10.1186/2036-7902-5-S1-S1</pub-id><pub-id pub-id-type="pmid">23902656</pub-id></citation></ref>
<ref id="B2"><label>2.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Haxthausen</surname><given-names>FV</given-names></name><name><surname>B&#x00F6;ttger</surname><given-names>S</given-names></name><name><surname>Wulff</surname><given-names>D</given-names></name><name><surname>Hagenah</surname><given-names>J</given-names></name><name><surname>Garc&#x00ED;a-V&#x00E1;zquez</surname><given-names>V</given-names></name><name><surname>Ipsen</surname><given-names>S</given-names></name></person-group>. <article-title>Medical robotics for ultrasound imaging: Current systems and future trends</article-title>. <source>Curr Robot Rep</source>. (<year>2021</year>) <volume>2</volume>:<fpage>55</fpage>&#x2013;<lpage>71</lpage>. <pub-id pub-id-type="doi">10.1007/s43154-020-00037-y</pub-id><pub-id pub-id-type="pmid">34977593</pub-id></citation></ref>
<ref id="B3"><label>3.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Huang</surname><given-names>Y</given-names></name><name><surname>Xiao</surname><given-names>W</given-names></name><name><surname>Wang</surname><given-names>C</given-names></name><name><surname>Liu</surname><given-names>H</given-names></name><name><surname>Huang</surname><given-names>RP</given-names></name><name><surname>Sun</surname><given-names>Z</given-names></name></person-group>. <article-title>Towards fully autonomous ultrasound scanning robot with imitation learning based on clinical protocols</article-title>. <source>IEEE Robot Autom Lett</source>. (<year>2021</year>) <volume>6</volume>:<fpage>3671</fpage>&#x2013;<lpage>8</lpage>. <pub-id pub-id-type="doi">10.1109/LRA.2021.3064283</pub-id></citation></ref>
<ref id="B4"><label>4.</label><citation citation-type="other"><person-group person-group-type="author"><name><surname>Hase</surname><given-names>H</given-names></name><name><surname>Azampour</surname><given-names>MF</given-names></name><name><surname>Tirindelli</surname><given-names>M</given-names></name><name><surname>Paschali</surname><given-names>M</given-names></name><name><surname>Simson</surname><given-names>W</given-names></name><name><surname>Fatemizadeh</surname><given-names>E</given-names></name><etal/></person-group>. <article-title>Ultrasound-guided robotic navigation with deep reinforcement learning</article-title>. <comment>In: <italic>2020 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)</italic> (2020). p. 5534&#x2013;41</comment>.</citation></ref>
<ref id="B5"><label>5.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Li</surname><given-names>K</given-names></name><name><surname>Li</surname><given-names>A</given-names></name><name><surname>Xu</surname><given-names>Y</given-names></name><name><surname>Xiong</surname><given-names>H</given-names></name><name><surname>Meng</surname><given-names>MQH</given-names></name></person-group>. <article-title>Rl-tee: autonomous probe guidance for transesophageal echocardiography based on attention-augmented deep reinforcement learning</article-title>. <source>IEEE Trans Autom Sci Eng</source>. (<year>2023</year>) <volume>21</volume>(<issue>2</issue>):<fpage>1526</fpage>&#x2013;<lpage>38</lpage>. <pub-id pub-id-type="doi">10.1109/TASE.2023.3246089</pub-id></citation></ref>
<ref id="B6"><label>6.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Gilbert</surname><given-names>A</given-names></name><name><surname>Marciniak</surname><given-names>M</given-names></name><name><surname>Rodero</surname><given-names>C</given-names></name><name><surname>Lamata</surname><given-names>P</given-names></name><name><surname>Samset</surname><given-names>E</given-names></name><name><surname>Mcleod</surname><given-names>K</given-names></name></person-group>. <article-title>Generating synthetic labeled data from existing anatomical models: An example with echocardiography segmentation</article-title>. <source>IEEE Trans Med Imaging</source>. (<year>2021</year>) <volume>40</volume>:<fpage>2783</fpage>&#x2013;<lpage>94</lpage>. <pub-id pub-id-type="doi">10.1109/TMI.2021.3051806</pub-id><pub-id pub-id-type="pmid">33444134</pub-id></citation></ref>
<ref id="B7"><label>7.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Tiago</surname><given-names>C</given-names></name><name><surname>Snare</surname><given-names>SR</given-names></name><name><surname>Sprem</surname><given-names>J</given-names></name><name><surname>Mcleod</surname><given-names>K</given-names></name></person-group>. <article-title>A domain translation framework with an adversarial denoising diffusion model to generate synthetic datasets of echocardiography images</article-title>. <source>IEEE Access</source>. (<year>2023</year>) <volume>11</volume>:<fpage>17594</fpage>&#x2013;<lpage>602</lpage>. <pub-id pub-id-type="doi">10.1109/ACCESS.2023.3246762</pub-id></citation></ref>
<ref id="B8"><label>8.</label><citation citation-type="other"><person-group person-group-type="author"><name><surname>Parker</surname><given-names>SG</given-names></name><name><surname>Bigler</surname><given-names>J</given-names></name><name><surname>Dietrich</surname><given-names>A</given-names></name><name><surname>Friedrich</surname><given-names>H</given-names></name><name><surname>Hoberock</surname><given-names>J</given-names></name><name><surname>Luebke</surname><given-names>DP</given-names></name><etal/></person-group>. <article-title>Optix: a general purpose ray tracing engine</article-title>. <comment><italic>ACM SIGGRAPH 2010 papers</italic> (2010)</comment>.</citation></ref>
<ref id="B9"><label>9.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Jensen</surname><given-names>JA</given-names></name></person-group>. <article-title>Calculation of pressure fields from arbitrarily shaped, apodized, and excited ultrasound transducers</article-title>. <source>IEEE Trans Ultrason Ferroelectr Freq Control</source>. (<year>1992</year>) <volume>39</volume>:<fpage>262</fpage>&#x2013;<lpage>7</lpage>. <pub-id pub-id-type="doi">10.1109/58.139123</pub-id><pub-id pub-id-type="pmid">18263145</pub-id></citation></ref>
<ref id="B10"><label>10.</label><citation citation-type="other"><person-group person-group-type="author"><name><surname>Arendt</surname><given-names>J</given-names></name></person-group>. <article-title><italic>Paper Presented at the 10th Nordic-Baltic Conference on Biomedical Imaging: Field: A Program for Simulating Ultrasound Systems</italic></article-title> <comment>(1996)</comment>.</citation></ref>
<ref id="B11"><label>11.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Pinton</surname><given-names>GF</given-names></name><name><surname>Dahl</surname><given-names>J</given-names></name><name><surname>Rosenzweig</surname><given-names>SJ</given-names></name><name><surname>Trahey</surname><given-names>GE</given-names></name></person-group>. <article-title>A heterogeneous nonlinear attenuating full- wave model of ultrasound</article-title>. <source>IEEE Trans Ultrason Ferroelectr Freq Control</source>. (<year>2009</year>) <volume>56</volume>:<fpage>474</fpage>&#x2013;<lpage>88</lpage>. <pub-id pub-id-type="doi">10.1109/TUFFC.2009.1066</pub-id><pub-id pub-id-type="pmid">19411208</pub-id></citation></ref>
<ref id="B12"><label>12.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Karamalis</surname><given-names>A</given-names></name><name><surname>Wein</surname><given-names>W</given-names></name><name><surname>Navab</surname><given-names>N</given-names></name></person-group>. <article-title>Fast ultrasound image simulation using the westervelt equation</article-title>. <source>Med Image Comput Comput Assisted Interv</source>. (<year>2010</year>) <volume>13 Pt 1</volume>:<fpage>243</fpage>&#x2013;<lpage>50</lpage>. <pub-id pub-id-type="doi">10.1007/978-3-642-15705-9_30</pub-id></citation></ref>
<ref id="B13"><label>13.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Treeby</surname><given-names>BE</given-names></name><name><surname>Cox</surname><given-names>BT</given-names></name></person-group>. <article-title>k-wave: Matlab toolbox for the simulation and reconstruction of photoacoustic wave fields</article-title>. <source>J Biomed Opt</source>. (<year>2010</year>) <volume>152</volume>:<fpage>021314</fpage>. <pub-id pub-id-type="doi">10.1117/1.3360308</pub-id></citation></ref>
<ref id="B14"><label>14.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Gao</surname><given-names>H</given-names></name><name><surname>Choi</surname><given-names>HF</given-names></name><name><surname>Claus</surname><given-names>P</given-names></name><name><surname>Boonen</surname><given-names>S</given-names></name><name><surname>Jaecques</surname><given-names>SVN</given-names></name><name><surname>van Lenthe</surname><given-names>GH</given-names></name></person-group>, et al. <article-title>A fast convolution-based methodology to simulate 2-Dd/3-D cardiac ultrasound images</article-title>. <source>IEEE Trans Ultrason Ferroelectr Freq Control</source>. (<year>2009</year>) <volume>56</volume>:<fpage>404</fpage>&#x2013;<lpage>9</lpage>. <pub-id pub-id-type="doi">10.1109/TUFFC.2009.1051</pub-id><pub-id pub-id-type="pmid">19251529</pub-id></citation></ref>
<ref id="B15"><label>15.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>B&#x00FC;rger</surname><given-names>B</given-names></name><name><surname>Bettinghausen</surname><given-names>S</given-names></name><name><surname>R&#x00E4;dle</surname><given-names>M</given-names></name><name><surname>Hesser</surname><given-names>JW</given-names></name></person-group>. <article-title>Real-time GPU-based ultrasound simulation using deformable mesh models</article-title>. <source>IEEE Trans Med Imaging</source>. (<year>2013</year>) <volume>32</volume>:<fpage>609</fpage>&#x2013;<lpage>18</lpage>. <pub-id pub-id-type="doi">10.1109/TMI.2012.2234474</pub-id></citation></ref>
<ref id="B16"><label>16.</label><citation citation-type="other"><person-group person-group-type="author"><name><surname>Salehi</surname><given-names>M</given-names></name><name><surname>Ahmadi</surname><given-names>SA</given-names></name><name><surname>Prevost</surname><given-names>R</given-names></name><name><surname>Navab</surname><given-names>N</given-names></name><name><surname>Wein</surname><given-names>W</given-names></name></person-group>. <article-title>Patient-specific 3D ultrasound simulation based on convolutional ray-tracing and appearance optimization</article-title>. <comment>In: <italic>International Conference on Medical Image Computing and Computer-Assisted Intervention</italic> (2015)</comment>.</citation></ref>
<ref id="B17"><label>17.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Mattausch</surname><given-names>O</given-names></name><name><surname>Makhinya</surname><given-names>M</given-names></name><name><surname>Goksel</surname><given-names>O</given-names></name></person-group>. <article-title>Realistic ultrasound simulation of complex surface models using interactive monte-carlo path tracing</article-title>. <source>Comput Graph Forum</source>. (<year>2018</year>) <volume>37</volume>:<fpage>202</fpage>&#x2013;<lpage>13</lpage>. <pub-id pub-id-type="doi">10.1111/cgf.13260</pub-id></citation></ref>
<ref id="B18"><label>18.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Alessandrini</surname><given-names>M</given-names></name><name><surname>Craene</surname><given-names>MD</given-names></name><name><surname>Bernard</surname><given-names>O</given-names></name><name><surname>Giffard-Roisin</surname><given-names>S</given-names></name><name><surname>Allain</surname><given-names>P</given-names></name><name><surname>Waechter-Stehle</surname><given-names>I</given-names></name></person-group>, et al. <article-title>A pipeline for the generation of realistic 3D synthetic echocardiographic sequences: methodology and open-access database</article-title>. <source>IEEE Trans Med Imaging</source>. (<year>2015</year>) <volume>34</volume>:<fpage>1436</fpage>&#x2013;<lpage>51</lpage>. <pub-id pub-id-type="doi">10.1109/TMI.2015.2396632</pub-id><pub-id pub-id-type="pmid">25643402</pub-id></citation></ref>
<ref id="B19"><label>19.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Alessandrini</surname><given-names>M</given-names></name><name><surname>Chakraborty</surname><given-names>B</given-names></name><name><surname>Heyde</surname><given-names>B</given-names></name><name><surname>Bernard</surname><given-names>O</given-names></name><name><surname>Craene</surname><given-names>MD</given-names></name><name><surname>Sermesant</surname><given-names>M</given-names></name></person-group>, et al. <article-title>Realistic vendor-specific synthetic ultrasound data for quality assurance of 2-D speckle tracking echocardiography: simulation pipeline and open access database</article-title>. <source>IEEE Trans Ultrason Ferroelectr Freq Control</source>. (<year>2018</year>) <volume>65</volume>:<fpage>411</fpage>&#x2013;<lpage>22</lpage>. <pub-id pub-id-type="doi">10.1109/TUFFC.2017.2786300</pub-id><pub-id pub-id-type="pmid">29505408</pub-id></citation></ref>
<ref id="B20"><label>20.</label><citation citation-type="other"><person-group person-group-type="author"><name><surname>Stojanovski</surname><given-names>D</given-names></name><name><surname>Hermida</surname><given-names>U</given-names></name><name><surname>Lamata</surname><given-names>P</given-names></name><name><surname>Beqiri</surname><given-names>A</given-names></name><name><surname>G&#x00F3;mez</surname><given-names>A</given-names></name></person-group>. <article-title>Echo from noise: synthetic ultrasound image generation using diffusion models for real image segmentation</article-title>. <comment><italic>ASMUS@MICCAI</italic> (2023)</comment>.</citation></ref>
<ref id="B21"><label>21.</label><citation citation-type="other"><person-group person-group-type="author"><name><surname>Hu</surname><given-names>Y</given-names></name><name><surname>Gibson</surname><given-names>E</given-names></name><name><surname>Lee</surname><given-names>LL</given-names></name><name><surname>Xie</surname><given-names>W</given-names></name><name><surname>Barratt</surname><given-names>DC</given-names></name><name><surname>Vercauteren</surname><given-names>TKM</given-names></name><etal/></person-group>. <article-title>Freehand ultrasound image simulation with spatially-conditioned generative adversarial networks</article-title>. <comment><italic>arXiv</italic> <italic>arXiv:abs/1707.05392</italic> (2017)</comment>.</citation></ref>
<ref id="B22"><label>22.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Vitale</surname><given-names>S</given-names></name><name><surname>Orlando</surname><given-names>JI</given-names></name><name><surname>Iarussi</surname><given-names>E</given-names></name><name><surname>Larrabide</surname><given-names>I</given-names></name></person-group>. <article-title>Improving realism in patient-specific abdominal ultrasound simulation using cyclegans</article-title>. <source>Int J Comput Assist Radiol Surg</source>. (<year>2020</year>) <volume>15</volume>:<fpage>183</fpage>&#x2013;<lpage>92</lpage>. <pub-id pub-id-type="doi">10.1007/s11548-019-02046-5</pub-id><pub-id pub-id-type="pmid">31392671</pub-id></citation></ref>
<ref id="B23"><label>23.</label><citation citation-type="other"><person-group person-group-type="author"><name><surname>Zhang</surname><given-names>L</given-names></name><name><surname>Portenier</surname><given-names>T</given-names></name><name><surname>Goksel</surname><given-names>O</given-names></name></person-group>. <article-title>Unpaired translation from semantic label maps to images by leveraging domain-specific simulations</article-title>. <comment><italic>arXiv</italic> <italic>arXiv:abs/2302.10698</italic> (2023)</comment>.</citation></ref>
<ref id="B24"><label>24.</label><citation citation-type="other"><person-group person-group-type="author"><name><surname>Tomar</surname><given-names>D</given-names></name><name><surname>Zhang</surname><given-names>L</given-names></name><name><surname>Portenier</surname><given-names>T</given-names></name><name><surname>Goksel</surname><given-names>O</given-names></name></person-group>. <article-title>Content-preserving unpaired translation from simulated to realistic ultrasound images</article-title>. <comment>In: <italic>International Conference on Medical Image Computing and Computer-Assisted Intervention</italic> (2021)</comment></citation></ref>
<ref id="B25"><label>25.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Jacob</surname><given-names>AJ</given-names></name><name><surname>Abdelkarim</surname><given-names>O</given-names></name><name><surname>Zook</surname><given-names>S</given-names></name><name><surname>Cocker</surname><given-names>MS</given-names></name><name><surname>Gupta</surname><given-names>P</given-names></name><name><surname>Giraldo</surname><given-names>JCR</given-names></name></person-group>, et al. <article-title>AI-based cardiac chamber analysis from non-contrast, gated cardiac CT</article-title>. <source>J Am Coll Cardiol</source>. (<year>2022</year>) <volume>79</volume>(<issue>9</issue>):<fpage>1250</fpage>. <pub-id pub-id-type="doi">10.1016/S0735-1097(22)02241-0</pub-id></citation></ref>
<ref id="B26"><label>26.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Hu</surname><given-names>Y</given-names></name><name><surname>Nguyen</surname><given-names>H</given-names></name><name><surname>Smith</surname><given-names>C</given-names></name><name><surname>Chen</surname><given-names>T</given-names></name><name><surname>Byrne</surname><given-names>M</given-names></name><name><surname>Archibald-Heeren</surname><given-names>B</given-names></name></person-group>, et al. <article-title>Clinical assessment of a novel machine-learning automated contouring tool for radiotherapy planning</article-title>. <source>J Appl Clin Med Phys</source>. (<year>2023</year>) <volume>24</volume>. <pub-id pub-id-type="doi">10.1002/acm2.13949</pub-id></citation></ref>
<ref id="B27"><label>27.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Museth</surname><given-names>K</given-names></name></person-group>. <article-title>VDB: High-resolution sparse volumes with dynamic topology</article-title>. <source>ACM Trans Graph</source>. (<year>2013</year>) <volume>32</volume>:<fpage>27:1</fpage>&#x2013;<lpage>27:22</lpage>. <pub-id pub-id-type="doi">10.1145/2487228.2487235</pub-id></citation></ref>
<ref id="B28"><label>28.</label><citation citation-type="other"><person-group person-group-type="author"><name><surname>Museth</surname><given-names>K</given-names></name></person-group>. <article-title>NanoVDB: A GPU-friendly and portable VDB data structure for real-time rendering and simulation</article-title>. <comment><italic>ACM SIGGRAPH 2021 Talks</italic> (2021)</comment>.</citation></ref>
<ref id="B29"><label>29.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Szabo</surname><given-names>TL</given-names></name></person-group>. <article-title>Diagnostic ultrasound imaging: inside out (second edition)</article-title>. <source>Ultras Med Biol</source>. (<year>2015</year>) <volume>41</volume>:<fpage>622</fpage>. <pub-id pub-id-type="doi">10.1016/C2011-0-07261-7</pub-id></citation></ref>
<ref id="B30"><label>30.</label><citation citation-type="other"><person-group person-group-type="author"><name><surname>Kajiya</surname><given-names>JT</given-names></name></person-group>. <article-title>The rendering equation</article-title>. <comment>In: <italic>Proceedings of the 13th Annual Conference on Computer Graphics and Interactive Techniques</italic> (1986)</comment>.</citation></ref>
<ref id="B31"><label>31.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Storve</surname><given-names>S</given-names></name><name><surname>Torp</surname><given-names>H</given-names></name></person-group>. <article-title>Fast simulation of dynamic ultrasound images using the GPU</article-title>. <source>IEEE Trans Ultrason Ferroelectr Freq Control</source>. (<year>2017</year>) <volume>64</volume>:<fpage>1465</fpage>&#x2013;<lpage>77</lpage>. <pub-id pub-id-type="doi">10.1109/TUFFC.2017.2731944</pub-id><pub-id pub-id-type="pmid">28749348</pub-id></citation></ref>
<ref id="B32"><label>32.</label><citation citation-type="other"><person-group person-group-type="author"><name><surname>Museth</surname><given-names>K</given-names></name></person-group>. <article-title>Hierarchical digital differential analyzer for efficient ray-marching in openVDB</article-title>. <comment><italic>ACM SIGGRAPH 2014 Talks</italic> (2014)</comment>.</citation></ref>
<ref id="B33"><label>33.</label><citation citation-type="other"><person-group person-group-type="author"><name><surname>Binkowski</surname><given-names>M</given-names></name><name><surname>Sutherland</surname><given-names>DJ</given-names></name><name><surname>Arbel</surname><given-names>M</given-names></name><name><surname>Gretton</surname><given-names>A</given-names></name></person-group>. <article-title>Demystifying mmd gans</article-title>. <comment>In: <italic>Internation Conference on Learning Representations</italic> (2018)</comment>.</citation></ref>
<ref id="B34"><label>34.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Rodriguez-Molares</surname><given-names>A</given-names></name><name><surname>Rindal</surname><given-names>OMH</given-names></name><name><surname>D&#x2019;hooge</surname><given-names>J</given-names></name><name><surname>M&#x00E5;s&#x00F8;y</surname><given-names>SE</given-names></name><name><surname>Austeng</surname><given-names>A</given-names></name><name><surname>Bell</surname><given-names>MAL</given-names></name></person-group>, et al. <article-title>The generalized contrast-to-noise ratio: a formal definition for lesion detectability</article-title>. <source>IEEE Trans Ultrason Ferroelectr Freq Control</source>. (<year>2019</year>) <volume>67</volume>:<fpage>745</fpage>&#x2013;<lpage>59</lpage>. <pub-id pub-id-type="doi">10.1109/TUFFC.2019.2956855</pub-id><pub-id pub-id-type="pmid">31796398</pub-id></citation></ref>
<ref id="B35"><label>35.</label><citation citation-type="other"><person-group person-group-type="author"><name><surname>Gao</surname><given-names>H</given-names></name><name><surname>D&#x2019;hooge</surname><given-names>J</given-names></name><name><surname>Hergum</surname><given-names>T</given-names></name><name><surname>Torp</surname><given-names>H</given-names></name></person-group>. <article-title>Comparison of the performance of different tools for fast simulation of ultrasound data</article-title>. <comment>In: <italic>2008 IEEE Ultrasonics Symposium</italic> (2012). p. 1318&#x2013;21</comment>.</citation></ref>
<ref id="B36"><label>36.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Tuthill</surname><given-names>TA</given-names></name><name><surname>Sperry</surname><given-names>RH</given-names></name><name><surname>Parker</surname><given-names>KJ</given-names></name></person-group>. <article-title>Deviations from rayleigh statistics in ultrasonic speckle</article-title>. <source>Ultrason Imaging</source>. (<year>1988</year>) <volume>10</volume>:<fpage>81</fpage>&#x2013;<lpage>9</lpage>. <pub-id pub-id-type="doi">10.1177/016173468801000201</pub-id><pub-id pub-id-type="pmid">3057714</pub-id></citation></ref>
<ref id="B37"><label>37.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Masoudi</surname><given-names>M</given-names></name><name><surname>Pourreza</surname><given-names>HR</given-names></name><name><surname>Saadatmand-Tarzjan</surname><given-names>M</given-names></name><name><surname>Eftekhari</surname><given-names>N</given-names></name><name><surname>Zargar</surname><given-names>FS</given-names></name><name><surname>Rad</surname><given-names>MP</given-names></name></person-group>. <article-title>A new dataset of computed-tomography angiography images for computer-aided detection of pulmonary embolism</article-title>. <source>Sci Data</source>. (<year>2018</year>) <volume>5</volume>. <pub-id pub-id-type="doi">10.1038/sdata.2018.180</pub-id><pub-id pub-id-type="pmid">30179235</pub-id></citation></ref>
<ref id="B38"><label>38.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Clark</surname><given-names>KW</given-names></name><name><surname>Vendt</surname><given-names>BA</given-names></name><name><surname>Smith</surname><given-names>KE</given-names></name><name><surname>Freymann</surname><given-names>JB</given-names></name><name><surname>Kirby</surname><given-names>JS</given-names></name><name><surname>Koppel</surname><given-names>P</given-names></name></person-group>, et al. <article-title>The cancer imaging archive (TCIA): maintaining and operating a public information repository</article-title>. <source>J Digit Imaging</source>. (<year>2013</year>) <volume>26</volume>:<fpage>1045</fpage>&#x2013;<lpage>57</lpage>. <pub-id pub-id-type="doi">10.1007/s10278-013-9622-7</pub-id><pub-id pub-id-type="pmid">23884657</pub-id></citation></ref>
<ref id="B39"><label>39.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Armato</surname><given-names>SG</given-names></name><name><surname>McNitt-Gray</surname><given-names>MF</given-names></name></person-group>. <article-title>The lung image database consortium (LIDC) and image database resource initiative (IDRI): a completed reference database of lung nodules on ct scans</article-title>. <source>Med Phys</source>. (<year>2011</year>) <volume>382</volume>:<fpage>915</fpage>&#x2013;<lpage>31</lpage>. <pub-id pub-id-type="doi">10.1118/1.3528204</pub-id></citation></ref>
<ref id="B40"><label>40.</label><citation citation-type="other"><person-group person-group-type="author"><name><surname>Yang</surname><given-names>D</given-names></name><name><surname>Xu</surname><given-names>D</given-names></name><name><surname>Zhou</surname><given-names>SK</given-names></name><name><surname>Georgescu</surname><given-names>B</given-names></name><name><surname>Chen</surname><given-names>M</given-names></name><name><surname>Grbic</surname><given-names>S</given-names></name><etal/></person-group>. <article-title>Automatic liver segmentation using an adversarial image-to-image network</article-title>. <comment><italic>arXiv</italic> <italic>arXiv:abs/1707.08037</italic> (2017)</comment>.</citation></ref>
<ref id="B41"><label>41.</label><citation citation-type="other"><person-group person-group-type="author"><name><surname>Huang</surname><given-names>G</given-names></name><name><surname>Liu</surname><given-names>Z</given-names></name><name><surname>Weinberger</surname><given-names>KQ</given-names></name></person-group>. <article-title>Densely connected convolutional networks</article-title>. <comment>In: <italic>2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)</italic> (2016). p. 2261&#x2013;69</comment>.</citation></ref>
<ref id="B42"><label>42.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ugalde</surname><given-names>D</given-names></name><name><surname>Medel</surname><given-names>JN</given-names></name><name><surname>Romero</surname><given-names>C</given-names></name><name><surname>Cornejo</surname><given-names>RA</given-names></name></person-group>. <article-title>Transthoracic cardiac ultrasound in prone position: a technique variation description</article-title>. <source>Intensive Care Med</source>. (<year>2018</year>) <volume>44</volume>:<fpage>986</fpage>&#x2013;<lpage>7</lpage>. <pub-id pub-id-type="doi">10.1007/s00134-018-5049-4</pub-id><pub-id pub-id-type="pmid">29349690</pub-id></citation></ref></ref-list>
<app-group><app id="app1"><title>Appendix</title>
<table-wrap id="A1" position="float"><label>Table A1</label>
<caption><p>Acoustic properties of different media.</p></caption>
<table frame="hsides" rules="groups">
<colgroup>
<col align="left"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
</colgroup>
<thead>
<tr>
<th valign="top" align="left">Medium</th>
<th valign="top" align="center">Impedance [kg/(m<sup>2</sup>s)]&#x2009;&#x00D7;&#x2009;10<sup>6</sup></th>
<th valign="top" align="center">Attenuation [dB/MHz]</th>
<th valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM215"><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:math></inline-formula></th>
<th valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM216"><mml:msub><mml:mi>&#x03BC;</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:math></inline-formula></th>
<th valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM217"><mml:msub><mml:mi>&#x03C3;</mml:mi><mml:mn>0</mml:mn></mml:msub></mml:math></inline-formula></th>
<th valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM218"><mml:mi>&#x03B3;</mml:mi></mml:math></inline-formula></th>
<th valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM219"><mml:mi>&#x03C4;</mml:mi></mml:math></inline-formula></th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Skull bone</td>
<td valign="top" align="center">7.8</td>
<td valign="top" align="center">10.0</td>
<td valign="top" align="center">0.78</td>
<td valign="top" align="center">0.56</td>
<td valign="top" align="center">0.1</td>
<td valign="top" align="center">0.5</td>
<td valign="top" align="center">2.0</td>
</tr>
<tr>
<td valign="top" align="left">Soft tissue</td>
<td valign="top" align="center">1.63</td>
<td valign="top" align="center">0.75</td>
<td valign="top" align="center">0.25</td>
<td valign="top" align="center">0.25</td>
<td valign="top" align="center">0.25</td>
<td valign="top" align="center">0.5</td>
<td valign="top" align="center">1.0</td>
</tr>
<tr>
<td valign="top" align="left">Cardiac muscle</td>
<td valign="top" align="center">1.71</td>
<td valign="top" align="center">0.52</td>
<td valign="top" align="center">0.45</td>
<td valign="top" align="center">0.51</td>
<td valign="top" align="center">0.05</td>
<td valign="top" align="center">0.1</td>
<td valign="top" align="center">2.25</td>
</tr>
<tr>
<td valign="top" align="left">Blood</td>
<td valign="top" align="center">1.62</td>
<td valign="top" align="center">0.18</td>
<td valign="top" align="center">0.02</td>
<td valign="top" align="center">0.005</td>
<td valign="top" align="center">0.015</td>
<td valign="top" align="center">0.7</td>
<td valign="top" align="center">1.0</td>
</tr>
<tr>
<td valign="top" align="left">Lung</td>
<td valign="top" align="center">0.26</td>
<td valign="top" align="center">41.0</td>
<td valign="top" align="center">0.10</td>
<td valign="top" align="center">0.2</td>
<td valign="top" align="center">0.1</td>
<td valign="top" align="center">0.9</td>
<td valign="top" align="center">1.0</td>
</tr>
</tbody>
</table>
</table-wrap>
<table-wrap id="A2" position="float"><label>Table A2</label>
<caption><p>Structures used in the simulation and associated media.</p></caption>
<table frame="hsides" rules="groups">
<colgroup>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th valign="top" align="left">Structure</th>
<th valign="top" align="left">Associated media</th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Aorta, pulmonary veins, ventricles and atrias</td>
<td valign="top" align="left">Blood</td>
</tr>
<tr>
<td valign="top" align="left">Lungs</td>
<td valign="top" align="left">Lungs</td>
</tr>
<tr>
<td valign="top" align="left">Pericardium</td>
<td valign="top" align="left">Cardiac muscle</td>
</tr>
<tr>
<td valign="top" align="left">Body</td>
<td valign="top" align="left">Soft tissue</td>
</tr>
<tr>
<td valign="top" align="left">Ribs</td>
<td valign="top" align="left">Skull bone</td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<fn id="table-fn4"><p>&#x201C;Body&#x201D; is the label associated to the tissues between organs.</p></fn>
</table-wrap-foot>
</table-wrap></app>
</app-group>
</back>
</article>