### 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 language | English (US) |
---|---|

Pages (from-to) | 2693-2696 |

Number of pages | 4 |

Journal | IEEE Trans Nucl Sci |

Volume | NS-26 |

Issue number | Part 2 |

State | Published - Apr 1979 |

### Fingerprint

### ASJC Scopus subject areas

- Nuclear Energy and Engineering
- Electrical and Electronic Engineering

### Cite this

*IEEE Trans Nucl Sci*,

*NS-26*(Part 2), 2693-2696.

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

Research output: Contribution to journal › Article

*IEEE Trans Nucl Sci*, vol. NS-26, no. Part 2, pp. 2693-2696.

}

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 -