2008
DOI: 10.1109/tuffc.2008.663
|View full text |Cite
|
Sign up to set email alerts
|

Ultrasonic imaging using a computed point spread function

Abstract: An explicit point spread function (PSF) evaluator in the frequency domain is described for an ultrasonic transducer operating in the pulse-echo mode. The PSF evaluator employs the patch element model for transducer field determination and scattered field assessment from a small but finite "point" reflector. The PSF for a planar transducer in a medium has been evaluated in the near and the far field. The computed PSFs were used to deconvolve and restore surface images, obtained experimentally, of a single hole … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
13
0

Year Published

2010
2010
2024
2024

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 14 publications
(13 citation statements)
references
References 11 publications
0
13
0
Order By: Relevance
“…Its complexity would thus be greater than the square of the number of pixels in the image, limiting its applicability to medium sized images. Using the matrix-free expression in (2), operator H performs m k n k m t n t multiplications and has negligible memory requirements. Therefore, in ultrasound imaging, the matrix-free representation is not only vastly superior to its matrix counterpart (because the kernel is much smaller than the image), but has the same computational complexity as spatially invariant convolution (excluding the unrealistic circulant boundary case).…”
Section: B Axially Varying Convolutionmentioning
confidence: 99%
“…Its complexity would thus be greater than the square of the number of pixels in the image, limiting its applicability to medium sized images. Using the matrix-free expression in (2), operator H performs m k n k m t n t multiplications and has negligible memory requirements. Therefore, in ultrasound imaging, the matrix-free representation is not only vastly superior to its matrix counterpart (because the kernel is much smaller than the image), but has the same computational complexity as spatially invariant convolution (excluding the unrealistic circulant boundary case).…”
Section: B Axially Varying Convolutionmentioning
confidence: 99%
“…Many authors thus discuss deconvolution in conjunction with PSF assessment [1]- [3]. Two approaches to account for PSF blurring can be distinguished: deterministic [1], [2], [4] and blind deconvolution [3], [5].…”
Section: Background and Motivationmentioning
confidence: 99%
“…To avoid too complex an optimization, the PSF is usually assumed spatially-invariant across the imaging domain. In non-blind deconvolution [4], [6], a deterministic model of the PSF is obtained by means of simulation, such as Field II [7] or numerical approximation [1]. Again, the convenience of a spatiallyinvariant PSF avoids time-consuming repeated simulation.…”
mentioning
confidence: 99%
“…A possible solution to the limited depth range could be the use of double-sided inspection [27], but this is on the expense of a more involved experimental procedure. In [28] and [29], the point-spread function of ultrasonic pulse-echo imaging is computed and used in different deconvolution schemes to enhance spatial resolution. In [30], an axially varying kernel forward convolution model is applied for the deconvolution of ultrasonic imaging yielding enhanced results over fixed-kernel methods.…”
Section: Introductionmentioning
confidence: 99%