TH‐D‐L100J‐06: Streaming Architectures for Cone‐Beam CT Image Reconstruction and Deformable Registration

H. Singh, N. Kandasamy, M. Folkert, G. Sharp

Research output: Contribution to journalArticle

Abstract

Purpose: To develop data‐parallel algorithms for tomographic reconstruction and deformable registration within a stream‐processing paradigm, and execute them on cheap stream processors such as graphics processing units (GPUs). Method and Materials: In the computer sciences, the stream‐processing paradigm is emerging as a cost‐effective way of solving large‐scale parallel computing problems. This is due to the recent introduction of high‐performance stream‐processing hardware such as the Cell processor and GPUs—both are commodity stream (or vector) processors, designed specifically to support large‐scale parallel computing on a single chip. This presentation describes how to use the stream‐processing model to significantly accelerate the complex problems of data reconstruction and fusion for radiotherapy. Highly data‐parallel models were developed for: (1) the Feldkamp, Davis, and Kress (FDK) reconstruction algorithm, and (2) Demon's algorithm for optical‐flow based deformable registration. These models were implemented within the Brook programming environment and executed on an nVIDIA 8800 GPU. Results: The performance of GPU‐based implementations of the FDK and Demon's algorithms was analyzed using data obtained from an IGRT testbed of a preserved swine lung. The results indicate a substantial speedup of up to 17 times for FDK, and up to 33 times for Demons, when compared with a 2.4 GHz Intel Duo‐Core processor. In addition, the GPU was found to be capable of high‐quality reconstructions, with differences within a few Hounsfield unit. Conclusions: Results indicate that data‐parallel image‐processing algorithms, when properly designed and executed on a GPU, achieve significant speedup when compared to high‐end desktop CPUs. The acceleration of key data‐processing stages will decrease the time needed to perform image‐guided patient positioning and analysis.

Original languageEnglish (US)
Pages (from-to)2634
Number of pages1
JournalMedical Physics
Volume34
Issue number6
DOIs
StatePublished - 2007

Fingerprint

Computer-Assisted Image Processing
Patient Positioning
Swine
Radiotherapy
Lung

ASJC Scopus subject areas

  • Biophysics
  • Radiology Nuclear Medicine and imaging

Cite this

TH‐D‐L100J‐06 : Streaming Architectures for Cone‐Beam CT Image Reconstruction and Deformable Registration. / Singh, H.; Kandasamy, N.; Folkert, M.; Sharp, G.

In: Medical Physics, Vol. 34, No. 6, 2007, p. 2634.

Research output: Contribution to journalArticle

@article{10532f9a36844bc7bc0fc141e4cb6c72,
title = "TH‐D‐L100J‐06: Streaming Architectures for Cone‐Beam CT Image Reconstruction and Deformable Registration",
abstract = "Purpose: To develop data‐parallel algorithms for tomographic reconstruction and deformable registration within a stream‐processing paradigm, and execute them on cheap stream processors such as graphics processing units (GPUs). Method and Materials: In the computer sciences, the stream‐processing paradigm is emerging as a cost‐effective way of solving large‐scale parallel computing problems. This is due to the recent introduction of high‐performance stream‐processing hardware such as the Cell processor and GPUs—both are commodity stream (or vector) processors, designed specifically to support large‐scale parallel computing on a single chip. This presentation describes how to use the stream‐processing model to significantly accelerate the complex problems of data reconstruction and fusion for radiotherapy. Highly data‐parallel models were developed for: (1) the Feldkamp, Davis, and Kress (FDK) reconstruction algorithm, and (2) Demon's algorithm for optical‐flow based deformable registration. These models were implemented within the Brook programming environment and executed on an nVIDIA 8800 GPU. Results: The performance of GPU‐based implementations of the FDK and Demon's algorithms was analyzed using data obtained from an IGRT testbed of a preserved swine lung. The results indicate a substantial speedup of up to 17 times for FDK, and up to 33 times for Demons, when compared with a 2.4 GHz Intel Duo‐Core processor. In addition, the GPU was found to be capable of high‐quality reconstructions, with differences within a few Hounsfield unit. Conclusions: Results indicate that data‐parallel image‐processing algorithms, when properly designed and executed on a GPU, achieve significant speedup when compared to high‐end desktop CPUs. The acceleration of key data‐processing stages will decrease the time needed to perform image‐guided patient positioning and analysis.",
author = "H. Singh and N. Kandasamy and M. Folkert and G. Sharp",
year = "2007",
doi = "10.1118/1.2761696",
language = "English (US)",
volume = "34",
pages = "2634",
journal = "Medical Physics",
issn = "0094-2405",
publisher = "AAPM - American Association of Physicists in Medicine",
number = "6",

}

TY - JOUR

T1 - TH‐D‐L100J‐06

T2 - Streaming Architectures for Cone‐Beam CT Image Reconstruction and Deformable Registration

AU - Singh, H.

AU - Kandasamy, N.

AU - Folkert, M.

AU - Sharp, G.

PY - 2007

Y1 - 2007

N2 - Purpose: To develop data‐parallel algorithms for tomographic reconstruction and deformable registration within a stream‐processing paradigm, and execute them on cheap stream processors such as graphics processing units (GPUs). Method and Materials: In the computer sciences, the stream‐processing paradigm is emerging as a cost‐effective way of solving large‐scale parallel computing problems. This is due to the recent introduction of high‐performance stream‐processing hardware such as the Cell processor and GPUs—both are commodity stream (or vector) processors, designed specifically to support large‐scale parallel computing on a single chip. This presentation describes how to use the stream‐processing model to significantly accelerate the complex problems of data reconstruction and fusion for radiotherapy. Highly data‐parallel models were developed for: (1) the Feldkamp, Davis, and Kress (FDK) reconstruction algorithm, and (2) Demon's algorithm for optical‐flow based deformable registration. These models were implemented within the Brook programming environment and executed on an nVIDIA 8800 GPU. Results: The performance of GPU‐based implementations of the FDK and Demon's algorithms was analyzed using data obtained from an IGRT testbed of a preserved swine lung. The results indicate a substantial speedup of up to 17 times for FDK, and up to 33 times for Demons, when compared with a 2.4 GHz Intel Duo‐Core processor. In addition, the GPU was found to be capable of high‐quality reconstructions, with differences within a few Hounsfield unit. Conclusions: Results indicate that data‐parallel image‐processing algorithms, when properly designed and executed on a GPU, achieve significant speedup when compared to high‐end desktop CPUs. The acceleration of key data‐processing stages will decrease the time needed to perform image‐guided patient positioning and analysis.

AB - Purpose: To develop data‐parallel algorithms for tomographic reconstruction and deformable registration within a stream‐processing paradigm, and execute them on cheap stream processors such as graphics processing units (GPUs). Method and Materials: In the computer sciences, the stream‐processing paradigm is emerging as a cost‐effective way of solving large‐scale parallel computing problems. This is due to the recent introduction of high‐performance stream‐processing hardware such as the Cell processor and GPUs—both are commodity stream (or vector) processors, designed specifically to support large‐scale parallel computing on a single chip. This presentation describes how to use the stream‐processing model to significantly accelerate the complex problems of data reconstruction and fusion for radiotherapy. Highly data‐parallel models were developed for: (1) the Feldkamp, Davis, and Kress (FDK) reconstruction algorithm, and (2) Demon's algorithm for optical‐flow based deformable registration. These models were implemented within the Brook programming environment and executed on an nVIDIA 8800 GPU. Results: The performance of GPU‐based implementations of the FDK and Demon's algorithms was analyzed using data obtained from an IGRT testbed of a preserved swine lung. The results indicate a substantial speedup of up to 17 times for FDK, and up to 33 times for Demons, when compared with a 2.4 GHz Intel Duo‐Core processor. In addition, the GPU was found to be capable of high‐quality reconstructions, with differences within a few Hounsfield unit. Conclusions: Results indicate that data‐parallel image‐processing algorithms, when properly designed and executed on a GPU, achieve significant speedup when compared to high‐end desktop CPUs. The acceleration of key data‐processing stages will decrease the time needed to perform image‐guided patient positioning and analysis.

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

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

U2 - 10.1118/1.2761696

DO - 10.1118/1.2761696

M3 - Article

AN - SCOPUS:85024819841

VL - 34

SP - 2634

JO - Medical Physics

JF - Medical Physics

SN - 0094-2405

IS - 6

ER -