检索结果-内蒙古大学图书馆

A parallel implementation of the katsevich algorithm for 3-D CT image reconstruction

JOURNAL OF SUPERCOMPUTING 2006年第1期38卷 35-47页

作者： Deng, Junjun Yu, Hengyong Ni, Jun He, Tao Zhao, Shiying Wang, Lihe Wang, Ge Univ Iowa Dept Radiol Iowa City IA 52242 USA

Yu and Wang [1, 2] implemented the first theoretically exact spiral cone-beam reconstruction algorithm developed by katsevich [3, 4]. This algorithm requires a high computational cost when the data amount becomes large. Here we study a parallel computing scheme for the katsevich algorithm to facilitate the image reconstruction. Based on the proposed parallel algorithm, several numerical tests are conducted on a high performance computing (HPC) cluster with thirty two 64-bit AMD-based Opteron processors. The standard phantom data [5] is used to establish the performance benchmarks. The results show that our parallel algorithm significantly reduces the reconstruction time, achieving high speedup and efficiency.

关键词： computed tomography (CT) medical imaging image reconstruction katsevich algorithm spiral cone-beam CT high performance computing parallel computing MPI

来源：评论

学校读者我要写书评

暂无评论

Studies on implementation of the katsevich algorithm for spiral cone-beam CT

引用

JOURNAL OF X-RAY SCIENCE AND TECHNOLOGY 2004年第2期12卷 97-116页

作者： Yu, Hengyong Wang, Ge Hangzhou Inst Elect Engn Coll Commun Engn Hangzhou 310018 Zhejiang Peoples R China Univ Iowa Dept Radiol Iowa City IA 52242 USA

Recently, katsevich proposed the first exact helical cone-beam reconstruction algorithm that takes longitudinally truncated data collected from part of a scanning turn. A key theoretical basis is that any point inside the scanning helix belongs to one and only one PI-line. Unfortunately, he only provided a general formulation and did not describe the implementation details. To make this complicated algorithm more transparent, we report here specifically how to program the katsevich algorithm in the planar detector geometry. As an important component, we also analyze the effects of various implementation parameters on the image quality. Our results are intended to be valuable for those who are interested in evaluating, improving and extending the katsevich approach.

关键词： Computed tomography (CT) spiral cone-beam katsevich algorithm filtered backprojection (FBP) image artifacts

来源：评论

学校读者我要写书评

暂无评论

Studies on artifacts of the katsevich algorithm for spiral conebeam CT

Studies on artifacts of the Katsevich algorithm for spiral c...

引用

4th Conference on Developments in X-Ray Tomography

作者： Yu, HY Wang, G Hangzhou Dianzi Univ Coll Commun Engn Hangzhou 310018 Zhejiang Peoples R China

ISBN: (纸本)0819454737

Recently, katsevich proposed an exact filtered backprojection (FBP) algorithm to solve the long object problem. Although the katsevich algorithm is theoretically error-free, it may produce image artifacts if its numerical implementation is not well designed. To evaluate the katsevich algorithm, we implement it in planar detector geometry. Then, we study four types of image artifacts associated with the numerical implementation of this algorithm, which are "texture", "streak", "shadow" and "winkle" artifacts. The "texture" artifacts appear if the endpoints of the PI-Line are not treated appropriately. The "streak" artifacts are caused by an inadequate number of filtering lines Q, which can be reduced by setting 0.3N < Q < 0.7N. In the step of Hilbert filtering, the aliasing effect results in "shadow" artifacts if the window is not truncated properly. The "wrinkle" artifacts are due to both the interpolation and difference operators, which may be minimized using more sophisticated interpolation methods, increasing projection data and using a more accurate derivative formula. Our results should be valuable to apply the katsevich algorithm optimally for practical spiral cone-beam CT.

关键词： computed tomography (CT) image artifacts katsevich algorithm spiral cone-beam filtered backprojection (FBP)

来源：评论

学校读者我要写书评

暂无评论

Fast katsevich algorithm based on GPU for helical cone-beam computed tomography

引用

IEEE transactions on information technology in biomedicine : a publication of the IEEE Engineering in Medicine and Biology Society 2010年第4期14卷 1053-61页

作者： Guorui Yan Jie Tian Shouping Zhu Chenghu Qin Yakang Dai Fei Yang Di Dong Ping Wu Medical Image Processing Group Institute of Automation Chinese Academy of Sciences Beijing 100190 China. yangr@***

katsevich reconstruction algorithm represents a breakthrough for helical cone-beam computed tomography (CT) reconstruction, because it is the first exact cone-beam reconstruction algorithm of filtered backprojection (FBP) type with 1-D shift-invariant filtering. Although FBP-type reconstruction algorithm is effective, 3-D CT reconstruction is time-consuming, and the accelerations of katsevich algorithm on CPU or cluster have been widely studied. In this paper, katsevich algorithm is accelerated by using graphics processing unit, including flat-detector and curved-detector geometry in the case of helical orbit. An overscan formula is derived, which helps to avoid unnecessary overscan in practical CT scanning. Based on the overscan formula, a volume-blocking method in device memory is proposed. One advantage of the blocking method is that it can reconstruct large volume with high speed.

关键词： Computed tomography (CT) katsevich algorithm graphics processing unit (GPU) overscan Memory devices Tomography Helical GRAPPER PICK UP Graphics Processing Unit Reconstruction algorithm X-Ray Computed Tomography acceleration large volume Helical orbit central processing units High speed Cone-Beam Computed Tomography

来源：评论

学校读者我要写书评

暂无评论

A dual-domain deep network for high pitch CT reconstruction

引用

PATTERN RECOGNITION 2025年 161卷

作者： Wang, Wei Xia, Xiang-Gen He, Chuanjiang Shenzhen Polytech Univ Inst Appl Math Shenzhen 518055 Guangdong Peoples R China Univ Delaware Dept Elect & Comp Engn Newark DE 19716 USA Chongqing Univ Coll Math & Stat Chongqing 400044 Peoples R China

In this paper, we propose an end-to-end dual-domain deep network for the high pitch helical CT reconstruction. Our network is composed of a sinogram domain subnetwork and a CT image domain subnetwork, and the two subnetworks are linked by the katsevich algorithm layer. The sinogram subnetwork is a discrete cosine transform (DCT) 3D U-net and used to complete the missing sinograms due to high pitch while the CT image subnetwork is a standard 3D U-net used to denoise the CT images. By utilizing the periodic properties of parameters of katsevich algorithm, our network reconstructs CT images rotation turn by rotation turn and so can reduce the GPU memory consumption. To further reduce the GPU memory consumption, we train the sinogram domain subnetwork and the CT image domain subnetwork separately, where the gradient flow through the katsevich layer is obtained manually. Experiments show that the proposed network trained by our method outperforms the related methods both in subjective and objective evaluations.

关键词： Helical CT High pitch Deep learning katsevich algorithm

来源：评论

学校读者我要写书评

暂无评论

Trade-Off Analysis Considering Tomogram Quality and Performance of a Parallel Computing Hardware Realization of katsevich's Reconstruction algorithm

引用

IEEE TRANSACTIONS ON NUCLEAR SCIENCE 2013年第5期60卷 3270-3281页

作者： Nellesen, Jens Weichert, Frank Timm, Constantin Kerbitz, Rudolf A. Tillmann, Wolfgang TU Dortmund Univ Inst Mat Engn D-44221 Dortmund Germany TU Dortmund Univ Dept Comp Sci 7 D-44221 Dortmund Germany TU Dortmund Univ Dept Comp Sci 12 D-44221 Dortmund Germany

In this paper, the trade-off between the target variables tomogram quality and reconstruction time of an implementation of katsevich's exact reconstruction algorithm for helical cone-beam computed tomography (CT) is analyzed. This is accomplished by means of an OpenCL-based, parallel and portable realization of katsevich's algorithm. The detailed examination is carried out on a phantom object which is composed of cubes with different attenuation coefficients. For this phantom object, X-ray cone-beam projections are simulated with different helix trajectory parameters. From the simulated projection data sets 3D tomograms are reconstructed. The impacts of the helix parameters on the tomogram quality and the reconstruction time are measured. Moreover, the speedup in dependence of the number of computing units on the OpenCL device is examined. To sum up the results: the tomogram quality increases monotonically with ascending number of projections while keeping the helix pitch fixed. A linear relationship between the overall runtime and the number of projections exists. The trade-off analysis between the tomogram quality and the reconstruction time proves that an optimum is reached if the criteria for the lateral and vertical sampling of the 3D space are fulfilled.

关键词： GPGPU helical cone-beam tomography katsevich algorithm OpenCL trade-off analysis

来源：评论

学校读者我要写书评

暂无评论

Cone-beam mammo-computed tomography from data along two tilting arcs

引用

MEDICAL PHYSICS 2006年第10期33卷 3621-3633页

作者： Zeng, Kai Yu, Hengyong Fajardo, Laurie L. Wang, Ge Univ Iowa Dept Radiol CT Micro CT Lab Iowa City IA 52242 USA

Over the past several years there has been an increasing interest in cone-beam computed tomography (CT) for breast imaging. In this article, we propose a new scheme for theoretically exact cone-beam mammo-CT and develop a corresponding katsevich-type reconstruction algorithm. In our scheme, cone-beam scans are performed along two tilting arcs to collect a sufficient amount of information for exact reconstruction. In our algorithm, cone-beam data are filtered in a shift-invariant fashion and then weighted backprojected into the three-dimensional space for the final reconstruction. Our approach has several desirable features, including tolerance of axial data truncation, efficiency in sequential/parallel implementation, and accuracy for quantitative analysis. We also demonstrate the system performance and clinical utility of the proposed technique in numerical simulations. (c) 2006 American Association of Physicists in Medicine.

关键词： cone-beam CT mammography exact reconstruction katsevich algorithm

来源：评论

学校读者我要写书评

暂无评论

Deployment of one-sided communication technique for parallel computing in katsevich CT image reconstruction

Deployment of one-sided communication technique for parallel...

引用

1st International Multi Symposium on Computer and Computational Sciences

作者： He, Tao Ni, Jun Deng, Junjun Yu, Hengyong Wang, Ge Univ Iowa Dept Comp Sci Med Imaging High Performance Comp Lab Iowa City IA 52242 USA Univ Iowa Dept Radiol Iowa City IA 52242 USA

ISBN: (纸本)0769525814

This paper focuses' on the implementation of parallel! approach of katsevich CT image reconstruction algorithm using one-sided communication technique. One-sided communication is a new feature provided by MPI-2 standard. It natively supports new network techniques such as InfiniBand and Myrinet. In this project, we implement three kinds of one-sided approaches for katsevich algorithm. The results are compared the other P2P models on the performance metrics - -speedup, efficiency, and cost.

关键词： one-sided communications MPI-2 computed tomography (CT) medical imaging image reconstruction katsevich algorithm high performance computing parallel computing

来源：评论

学校读者我要写书评

暂无评论

katsevich-type algorithms for variable radius spiral cone-beam CT

Katsevich-type algorithms for variable radius spiral cone-be...

引用

4th Conference on Developments in X-Ray Tomography

作者： Yu, HY Ye, YB Wang, G Hangzhou Dianzi Univ Coll Commun Engn Hangzhou 310018 Zhejiang Peoples R China

ISBN: (纸本)0819454737

To solve the long object problem, an exact and efficient algorithm has been recently developed by katsevich. While the katsevich algorithm only works with standard helical cone-beam scanning, there is an important need for nonstandard spiral cone-beam scanning. Specifically, we need a scanning spiral of variable radius for our newly proposed electron-beam CT/micro-CT prototype. In this paper, for variable radius spiral cone-beam CT we construct two katsevich-type cone-beam reconstruction algorithms in the filtered backprojection (FBP) and backprojected filtration (BPF) formats, respectively. The FBP algorithm is developed based on the standard katsevich algorithm, and consists of four steps: data differentiation, PI-tine determination, slant filtration and weighted backprojection. The BPF algorithm is designed based on the scheme by Zou and Pan, and also consists four steps: data differentiation, PI-fine determination, weighted backprojection and inverse Hilbert transform. Numerical experiments are conducted with mathematical phantoms

关键词： computed tomography (CT) katsevich algorithm spiral come-beam scanning filtered backprojection (FBP) backprojected filtration(BPF)

来源：评论

学校读者我要写书评

暂无评论

Geometrical study on two tilting arcs based exact cone-beam CT for breast imaging

Geometrical study on two tilting arcs based exact cone-beam ...

引用

5th Conference on Developments in X-Ray Tomography

作者： Zeng, Kai Yu, Hengyong Fajardo, Laurie L. Wang, Ge Univ Iowa Dept Radiol CT Micro CT Lab Iowa City IA 52242 USA

ISBN: (纸本)0819463973

Breast cancer is the second leading cause of cancer death in women in the United States. Currently, X-ray mammography is the method of choice for screening and diagnosing breast cancer. However, this 2D projective modality is far from perfect;with up to 17% breast cancer going unidentified. Over past several years, there has been an increasing interest in cone-beam CT for breast imaging. However, previous methods utilizing cone-beam CT only produce approximate reconstructions. Following katsevich's recent work, we propose a new scanning mode and associated exact cone-beam CT method for breast imaging. In our design, cone-beam scans are performed along two tilting arcs for collection of a sufficient amount of data for exact reconstruction. In our katsevich-type algorithm, cone-beam data is filtered in a shift-invariant fashion and then backprojected in 3D for the final reconstruction. This approach has several desirable features. First, it allows data truncation unavoidable in practice. Second, it optimizes image quality for quantitative analysis. Third, it is efficient for sequential/parallel computation. Furthermore, we analyze the reconstruction region and the detection window in detail, which are important for numerical implementation.

关键词： cone-beam CT exact reconstruction katsevich algorithm breast imaging mammography

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：