Techniques for Efficient Fourier Transform Computation in Ultrasound Simulations

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F24%3APU152002" target="_blank" >RIV/00216305:26230/24:PU152002 - isvavai.cz</a>

Výsledek na webu

<a href="https://dl.acm.org/doi/10.1145/3625549.3658825" target="_blank" >https://dl.acm.org/doi/10.1145/3625549.3658825</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1145/3625549.3658825" target="_blank" >10.1145/3625549.3658825</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Techniques for Efficient Fourier Transform Computation in Ultrasound Simulations

Popis výsledku v původním jazyce

Noninvasive ultrasound surgeries represent a rapidly growing field in medical applications. Preoperative planning often relies on computationally expensive ultrasound simulations. This paper explores methods to accelerate these simulations by reducing the computation time of the Fourier transform, which is an integral part of the simulation in the k-Wave toolbox. Two experiments and their results will be presented. The first investigates substituting the standard Fast Fourier Transform (FFT) with a Sparse Fourier Transform (SFT). The second approach utilises filtering of the frequency spectrum, inspired by image compression algorithms. The aim of both experiments is to find a suitable method for accelerating the Fourier transform while utilising the sparsity of the spectrum in acoustic pressure. Our findings show that filtering offers significantly better results in terms of computation error, leading to a substantial reduction in overall simulation runtime.

Název v anglickém jazyce

Techniques for Efficient Fourier Transform Computation in Ultrasound Simulations

Popis výsledku anglicky

Noninvasive ultrasound surgeries represent a rapidly growing field in medical applications. Preoperative planning often relies on computationally expensive ultrasound simulations. This paper explores methods to accelerate these simulations by reducing the computation time of the Fourier transform, which is an integral part of the simulation in the k-Wave toolbox. Two experiments and their results will be presented. The first investigates substituting the standard Fast Fourier Transform (FFT) with a Sparse Fourier Transform (SFT). The second approach utilises filtering of the frequency spectrum, inspired by image compression algorithms. The aim of both experiments is to find a suitable method for accelerating the Fourier transform while utilising the sparsity of the spectrum in acoustic pressure. Our findings show that filtering offers significantly better results in terms of computation error, leading to a substantial reduction in overall simulation runtime.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

—

Návaznosti

R - Projekt Ramcoveho programu EK

Rok uplatnění

2024

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

HPDC '24: Proceedings of the 33nd International Symposium on High-Performance Parallel and Distributed Computing

ISBN

979-8-4007-0413-0

ISSN

—

e-ISSN

—

Počet stran výsledku

3

Strana od-do

361-363

Název nakladatele

Association for Computing Machinery

Místo vydání

New York

Místo konání akce

Polo Piagge, University of Pisa Via Giacomo Matt

Datum konání akce

3. 6. 2024

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—