HIGH SPEED CONVOLVING KERNELS FOR CT HAVING TRIANGULAR SPECTRA AND/OR BINARY VALUES.

Surender K. Kenue, James F Greenleaf

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

An algorithm is described to transform sampled CT convolution kernels into ″binary″ kernels having values which are even powers of 2. Multiplication in the convolution operation can then be replaced by a much faster shift operation. A technique for further reducing the number of shift and addition operations using new computationally fast CT kernels is also given. The binary kernels are computationally faster by about 80-90% on a conventional computer. Reconstructed CT images using both conventional kernels and their transformed binary equivalents are compared.

Original languageEnglish (US)
Pages (from-to)2693-2696
Number of pages4
JournalIEEE Trans Nucl Sci
VolumeNS-26
Issue numberPart 2
StatePublished - Apr 1979

Fingerprint

Convolution
high speed
convolution integrals
shift
multiplication

ASJC Scopus subject areas

  • Nuclear Energy and Engineering
  • Electrical and Electronic Engineering

Cite this

HIGH SPEED CONVOLVING KERNELS FOR CT HAVING TRIANGULAR SPECTRA AND/OR BINARY VALUES. / Kenue, Surender K.; Greenleaf, James F.

In: IEEE Trans Nucl Sci, Vol. NS-26, No. Part 2, 04.1979, p. 2693-2696.

Research output: Contribution to journalArticle

@article{3eacd6e858a749039834c71367d06bee,
title = "HIGH SPEED CONVOLVING KERNELS FOR CT HAVING TRIANGULAR SPECTRA AND/OR BINARY VALUES.",
abstract = "An algorithm is described to transform sampled CT convolution kernels into ″binary″ kernels having values which are even powers of 2. Multiplication in the convolution operation can then be replaced by a much faster shift operation. A technique for further reducing the number of shift and addition operations using new computationally fast CT kernels is also given. The binary kernels are computationally faster by about 80-90{\%} on a conventional computer. Reconstructed CT images using both conventional kernels and their transformed binary equivalents are compared.",
author = "Kenue, {Surender K.} and Greenleaf, {James F}",
year = "1979",
month = "4",
language = "English (US)",
volume = "NS-26",
pages = "2693--2696",
journal = "IEEE Transactions on Nuclear Science",
issn = "0018-9499",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "Part 2",

}

TY - JOUR

T1 - HIGH SPEED CONVOLVING KERNELS FOR CT HAVING TRIANGULAR SPECTRA AND/OR BINARY VALUES.

AU - Kenue, Surender K.

AU - Greenleaf, James F

PY - 1979/4

Y1 - 1979/4

N2 - An algorithm is described to transform sampled CT convolution kernels into ″binary″ kernels having values which are even powers of 2. Multiplication in the convolution operation can then be replaced by a much faster shift operation. A technique for further reducing the number of shift and addition operations using new computationally fast CT kernels is also given. The binary kernels are computationally faster by about 80-90% on a conventional computer. Reconstructed CT images using both conventional kernels and their transformed binary equivalents are compared.

AB - An algorithm is described to transform sampled CT convolution kernels into ″binary″ kernels having values which are even powers of 2. Multiplication in the convolution operation can then be replaced by a much faster shift operation. A technique for further reducing the number of shift and addition operations using new computationally fast CT kernels is also given. The binary kernels are computationally faster by about 80-90% on a conventional computer. Reconstructed CT images using both conventional kernels and their transformed binary equivalents are compared.

UR - http://www.scopus.com/inward/record.url?scp=0018454691&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0018454691&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0018454691

VL - NS-26

SP - 2693

EP - 2696

JO - IEEE Transactions on Nuclear Science

JF - IEEE Transactions on Nuclear Science

SN - 0018-9499

IS - Part 2

ER -