Efficient Convolution Kernels for Computerized Tomography

Surender K. Kenue, James F. Greenleaf

Research output: Contribution to journalArticle

1 Scopus citations

Abstract

Three concepts are presented: 1) Extended kernels: The Ramachandran-Lakshminarayanan convolution kernel has one zero between each non-zero value in the spatial domain. By extending the kernel in Fourier space, it is shown that each extension leads to two additional zeros in the spatial domain of the convolution kernel, thus decreasing the required number of multiplications necessary for convolution. Any known kernel can be extended and in the limit of extension a simple backprojection reconstruction is obtained. 2) Binary kernels: A technique for generating binary approximations to any convolution kernel is described. Excluding the central element, all other elements of the kernel are approximated by an even power of two thus, multiplications are replaced by shift operations in the convolution procedure. 3) Recursive convolution: It is shown how additions can be saved by using a recursive formulation which generates new elements in the convolution procedure utilizing only a few summation steps. Results from both extended kernels and their binary approximations are described for simulated phantoms and ultrasound data obtained from breast scans of patients.

Original languageEnglish (US)
Pages (from-to)232-244
Number of pages13
JournalUltrasonic Imaging
Volume1
Issue number3
DOIs
StatePublished - Jul 1979

Keywords

  • Computerized tomography
  • convolution kernels
  • hardware
  • image reconstruction
  • ultrasound
  • x-ray

ASJC Scopus subject areas

  • Radiological and Ultrasound Technology
  • Radiology Nuclear Medicine and imaging

Fingerprint Dive into the research topics of 'Efficient Convolution Kernels for Computerized Tomography'. Together they form a unique fingerprint.

  • Cite this