English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We discuss efficient algorithms for the accurate forward and reverseevaluation of the discrete Fourier-Bessel transform (dFBT) as numerical toolsto assist in the 2D polar convolution of two radially symmetric functions,relevant, e.g., to applications in computational biophotonics. In our survey ofthe numerical procedure we account for the circumstance that the objectivefunction might result from a more complex measurement process and is, in theworst case, known on a finite sequence of coordinate values, only. We contrastthe performance of the resulting algorithms with a procedure based on astraight forward numerical quadrature of the underlying integral transform andasses its efficienty for two benchmark Fourier-Bessel pairs. An application tothe problem of finite-size beam-shape convolution in polar coordinates,relevant in the context of tissue optics and optoacoustics, is used toillustrate the versatility and computational efficiency of the numericalprocedure.

Efficient polar convolution based on the discrete Fourier-Bessel transform for application in computational biophotonics