AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (872.9 KB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline

Region of Interest Imaging for a General Trajectory with the Rebinned BPF Algorithm

Junguo BIAN( )Dan XIAEmil Y SIDKYXiaochuan PAN
Department of Radiology, University of Chicago, 5841 S. Maryland Avenue, Chicago, IL 60637, USA
Show Author Information

Abstract

The back-projection-filtration (BPF) algorithm has been applied to image reconstruction for cone-beam configurations with general source trajectories. The BPF algorithm can reconstruct 3-D region-of-interest (ROI) images from data containing truncations. However, like many other existing algorithms for cone-beam configurations, the BPF algorithm involves a back-projection with a spatially varying weighting factor, which can result in the non-uniform noise levels in reconstructed images and increased computation time. In this work, we propose a BPF algorithm to eliminate the spatially varying weighting factor by using a rebinned geometry for a general scanning trajectory. This proposed BPF algorithm has an improved noise property, while retaining the advantages of the original BPF algorithm such as minimum data requirement.

References

【1】
【1】
 
 
Tsinghua Science and Technology
Pages 68-73

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
BIAN J, XIA D, SIDKY EY, et al. Region of Interest Imaging for a General Trajectory with the Rebinned BPF Algorithm. Tsinghua Science and Technology, 2010, 15(1): 68-73. https://doi.org/10.1016/S1007-0214(10)70011-0

92

Views

1

Downloads

3

Crossref

N/A

Web of Science

3

Scopus

19

CSCD

Received: 25 October 2009
Published: 01 February 2010
© Tsinghua University Press 2010