{'fraction_non_alphanumeric': 0.02358490566037736, 'fraction_numerical': 0.0015723270440251573, 'mean_word_length': 5.209756097560976, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Use of B-splines in fast dynamic ultrasound RF simulations

Synthetic ultrasound data is invaluable for applications such as tuning image segmentation algorithms. Unfortunately, simulation time can become prohibitive for phantoms consisting of a large number of point-scatterers. In such cases, simplified simulation algorithms can be useful, and trade accuracy for speed. Storage of dynamic scatterer phantoms requires vast amounts of disk space when the number of time steps is large. We propose (1) a spline-based approach for efficient handling of dynamic scatterer phantoms with arbitrary time resolution, and (2) a fast, open source C++/CUDA implementation of a previously published convolution-based technique (COLE by Gao et al.) with support for our proposed spline-based approach. We observed a speedup of several orders of magnitude when comparing the simulation time for our CUDA implementation to the simulation time from an experiment reported in the literature, when using a similar simulation setup. We also observed that the spline-based representation of scatterers can improve the simulation speed almost four times for a dynamic simulation using the GPU, compared to the alternative of uploading new scatterer data to the GPU memory at every time step.