三维CT变螺距螺旋投影数据模拟方法

为了研究不同扫描方式下的三维CT重建算法,首先必须获取相应扫描方式下的投影数据,投影数据的仿真可以用来验证重建算法的准确性和可靠性.变螺距螺旋扫描可以提高扫描速度,有更高的时间、空间分辨率.本文采用三维Shepp-Logan头部模型,详细介绍了该模型在变螺距螺旋扫描方式下的投影数据的仿真计算,利用解析几何求解二次方程仿...     

一般直线-圆弧扫描轨迹CT的三维精确重建

近年,C-arm CT扫描系统的推出,给实际的扫描轨迹提供了很大的灵活性,比如圆弧-圆弧及直线-圆弧等扫描轨迹,针对于不同的成像及放疗部位,它们将具有很好的应用前景.最近提出的BPF算法不但可以处理投影数据的纵向截断问题,而且也可以处理投影数据的横向截断问题,这使得精确的局部重建成为可能.为了更好的进行局部重建,本文提出了一种一般形式的直线-圆弧扫描轨迹,并且针对这种扫描轨迹,基于上述的BPF算法,提出了一个通用的三维精确重建算法,它可以适用于直线和圆弧所在平面成任意角度的成像系统.这将更进一步的接近真正意义上的局部重建.文章最后的实验结果也证明了我们算法的有效性.     

圆弧轨迹Katsevich类型的锥束CT重建

基于Katsevich重建理论,提出了一种适合圆弧轨迹且具有移不变滤波反投影结构的锥束重建算法.分析了Radon平面绕投影射线连续转动过程中与轨迹平面相交的运动关系,并依据投影数据存储方式确定Radon平面的法线矢量方向.在此基础上,将检测器区域进行划分,进而探讨了与圆弧端点关联的结构因子在检测器阵列单元上的分布规律.同时,根据滤波线在检测器上的分布特点,推导了满足投影数据重采样精度并适合平板检测器的锥束重建公式.利用Forbild模型进行数值模拟,实验结果表明提出的算法有效地抑制了FDK类型重建算法所存在的锥束伪像并且适合长物体重建.     

圆锥扫描机制下的红外图像帧重建仿真研究

重点研究了圆锥扫描机制下,红外图像帧重建的仿真实现.在简要介绍圆锥扫描机制下基于变行频采样机理和红外图像完整重建技术的基础上,进行了大量的重建图像仿真研究.作为示例,文中列出第1、3、5、7、9场的扫描数据图像及其相应的场重建图像.从图像仿真结果可以看出这种技术能够完成红外图像的重建,重建的红外图像具有较高的分辨率,能够充分利用红外器件获得的扫描数据和相应的空间信息.     

基于CUDA架构与B样条的实时锥束CT重建算法

随着X线探测板数据采集速度的快速发展,研究者开始利用C臂机采集投影数据并重建断层图像,用于手术导航或者放射治疗.但是普通PC的重建速度慢,很难匹配硬件数据采集速度,限制了其在实时临床环境中的应用.本文提出一种基于CUDA(Compute Unified Device Architecture)架构的改进FDK算法,利用GPU(Graphic Porcessing Unit)显卡的并行计算能力实现了实时CT重建,并通过B样条插值提高重建图像的质量,在实时临床环境中具有很好的应用价值.     

利用GPU实现单层螺旋CT的三维图像重建

CT数据的获取过程和CT图像的重建过程与图形学的渲染过程极其相似,因此利用图形处理器(GPU)来加速CT重建算法成为了近年来CT研究的热点之一.本文根据单层螺旋CT数据的特点,构造了"平行-扇束"投影模式,实现了基于GPU的单层螺旋CT的三维图像重建算法.数值实验表明,与CPU上的分层重建相比重建速度提高10倍以上.     

一种快速的扇束CT滤波反投影重建算法

提出了一种用于扇束CT(计算机断层扫描)重建的快速滤波反投影算法.这种算法是传统标准滤波反投影(FBP)重建算法的加速形式,主要通过减少投影数量然后重建子图像来实现.实验结果表明:对于一幅512×512图像,这种算法可以将重建过程加速40倍以上,并且不会引入明显的图像误差.这种算法也适应于多层螺旋三维重建,并且可以延伸用于三维锥形重建.     

投影数据预处理三维CT重构算法研究

大面积非晶硅平板探测器在工业透射射线成像领域得到越来越多的应用.基于FPD的圆轨道FDK型三维计算机层析成像技术(3D-CT)检测速度快,但成像质量不及2D-CT.为发挥3D-CT速度优势,抑制噪声,同时提高图像重建的质量,以由平板探测器得到的二维投影数据为研究对象,提出了一种对投影数据进行小波分解,分别对高频和低频进行两次滤波的投影预处理方法,然后将分别重建的图像叠加,最终得到高质量的重建图像.算法的仿真实验结果表明,重建图像质量得到明显改善,系统噪声得到抑制.     

一种基于IBP的红外微扫描图像重建算法

微扫描技术是在现有红外探测器基础上提升空间分辨率的一种有效方法.各种图像重建算法被用来对获得的微扫描低分辨率图像序列进行重建得到高分辨图像,其中IBP算法相对于POCS,MAP等方法具有计算速度上的优势.但是经典的IBP算法由于使用单一的松弛因子在实际计算中并不能兼顾重建图像的边缘细节和整体噪声,针对此问题提出了一种基...     

可编程图形硬件下的三维图像的并行重建算法

本文在研究过程中,从几何层面上研究了FDK算法特性,并对其进行了几何描述,并据此分析了一种运用可编程图形硬件加速图像构建方式,在该方式运用过程中,充分运用了图形处理器的高精度性特征、可编程性特征以及计算特性,该图形重建方式操作较为便捷,能够降低运用成本,与原有的传统算法相比,操作效率更高。     

A Filtered Backprojection Algorithm for Triple-Source Helical Cone-Beam CT

Multisource cone-beam computed tomography (CT) is an attractive approach of choice for superior temporal resolution, which is critically important for cardiac imaging and contrast enhanced studies. In this paper, we present a filtered-backprojection (FBP) algorithm for triple-source helical cone-beam CT. The algorithm is both exact and efficient. It utilizes data from three inter-helix PI-arcs associated with the inter-helix PI-lines and the minimum detection windows defined for the triple-source configuration. The proof of the formula is based on the geometric relations specific to triple-source helical cone-beam scanning. Simulation results demonstrate the validity of the reconstruction algorithm. This algorithm is also extended to a multisource version for $( 2N + 1 )$ -source helical cone-beam CT. With parallel computing, the proposed FBP algorithms can be significantly faster than our previously published multisource backprojection-filtration algorithms. Thus, the FBP algorithms are promising in applications of triple-source helical cone-beam CT.      

A general tool for the evaluation of spiral CT interpolation algorithms: revisiting the effect of pitch in multislice CT

While multislice spiral computed tomography (CT) scanners are provided by all major manufacturers, their specific interpolation algorithms have been rarely evaluated. Because the results published so far relate to distinct particular cases and differ significantly, there are contradictory recommendations about the choice of pitch in clinical practice. In this paper, we present a new tool for the evaluation of multislice spiral CT z-interpolation algorithms, and apply it to the four-slice case. Our software is based on the computation of a "Weighted Radiation Profile" (WRP), and compares WRP to an expected ideal profile in terms of widening and heterogeneity. It provides a unique scheme for analyzing a large variety of spiral CT acquisition procedures. Freely chosen parameters include: number of detector rows, detector collimation, nominal slice width, helical pitch, and interpolation algorithm with any filter shape and width. Moreover, it is possible to study any longitudinal and off-isocenter positions. Theoretical and experimental results show that WRP, more than Slice Sensitivity Profile (SSP), provides a comprehensive characterization of interpolation algorithms. WRP analysis demonstrates that commonly "preferred helical pitches" are actually nonoptimal regarding the formerly distinguished z-sampling gap reduction criterion. It is also shown that "narrow filter" interpolation algorithms do not enable a general preferred pitch discussion, since they present poor properties with large longitudinal and off-center variations. In the more stable case of "wide filter" interpolation algorithms, SSP width or WRP widening are shown to be almost constant. Therefore, optimal properties should no longer be sought in terms of these criteria. On the contrary, WRP heterogeneity is related to variable artifact phenomena and can pertinently characterize optimal pitches. In particular, the exemplary interpolation properties of pitch = 1 "wide filter" mode are demonstrated.     

Region of interest reconstruction from truncated data in circular cone-beam CT

The circular scanning trajectory is one of the most widely adopted data-acquisition configurations in computed tomography (CT). The Feldkamp, Davis, Kress (FDK) algorithm and its various modifications have been developed for reconstructing approximately three-dimensional images from circular cone-beam data. When data contain transverse truncations, however, these algorithms may reconstruct images with significant truncation artifacts. It is of practical significance to develop algorithms that can reconstruct region-of-interest (ROI) images from truncated circular cone-beam data that are free of truncation artifacts and that have an accuracy comparable to that obtained from nontruncated cone-beam data. In this work, we have investigated and developed a backprojection-filtration (BPF)-based algorithm for ROI-image reconstruction from circular cone-beam data containing transverse truncations. Furthermore, we have developed a weighted BPF algorithm to exploit "redundant" information in data for improving image quality. In an effort to validate and evaluate the proposed BPF algorithms for circular cone-beam CT, we have performed numerical studies by using both computer-simulation data and experimental data acquired with a radiotherapy cone-beam CT system. Quantitative results in these studies demonstrate that the proposed BPF algorithms for circular cone-beam CT can reconstruct ROI images free of truncation artifacts.     

The n-PI-method for helical cone-beam CT

A new class of acquisition schemes for helical cone-beam computed tomography (CB-CT) scanning is introduced, and their effect on the reconstruction methods is analyzed. These acquisition schemes are based on a new detector shape that is bounded by the helix. It will be shown that the data acquired with these schemes are compatible with exact reconstruction methods, and the adaptation of exact reconstruction algorithms to the new acquisition geometry is described. At the same time, the so-called PI-sufficiency condition is fulfilled. Moreover, a good fit to the acquisition requirements of the various medical applications of cone-beam CT is achieved. In contrast to other helical cone-beam acquisition and reconstruction methods, the n-PI-method introduced in this publication allows for variable pitches of the acquisition helix. This additional feature will introduce a higher flexibility into the acquisition protocols of future medical cone-beam scanners. An approximative n-PI-filtered backprojection (n-PI-FBP) reconstruction method is presented and verified. It yields convincing image quality.     

Variable pitch reconstruction using John's equation

We present an algorithm to reconstruct helical cone beam computed tomography (CT) data acquired at variable pitch. The algorithm extracts a halfscan segment of projections using an extended version of the advanced single slice rebinning (ASSR) algorithm. ASSR rebins constant pitch cone beam data to fan beam projections that approximately lie on a plane that is tilted to optimally fit the source helix. For variable pitch, the error between the tilted plane chosen by ASSR and the source helix increases, resulting in increased image artifacts. To reduce the artifacts, we choose a reconstruction plane, which is tilted and shifted relative to the source trajectory. We then correct rebinned fan beam data using John's equation to virtually move the source into the tilted and shifted reconstruction plane. Results obtained from simulated phantom images and scanner images demonstrate the applicability of the proposed algorithm.      

Moving beam helical CT scanning

Images generated with helical scanning are degraded by partial volume artifacts caused by an increased slice thickness when compared to conventional computed tomography (CT) scanning. The slice thickness for a helical scan is proportional to the sum of the thickness of the fan of radiation and the distance the patient moves during data acquisition. The authors present a method called moving beam helical scanning (MBHS) which significantly reduces the partial volume artifacts caused by helical scanning. The key element of MBHS is a rotatable collimator that is placed between the X-ray source and the patient. As the patient is translated, the collimator is used to aim the fan on a fixed position in the patient. Once sufficient data are obtained to reconstruct a slice, the collimator is quickly reset to scan a target in the next slice. The authors examined the performance of MBHS by scanning wires and phantoms on a modified scanner. The full-width-at-tenth-maximum of the slice profile at iso-center for MBHS is identical to conventional CT versus a 59% increase for conventional helical scanning. It is concluded that MBHS can be used to obtain the scan rate advantages of helical scanning with image quality comparable to conventional scanning.     

Longitudinal sampling and aliasing in spiral CT

Although analyses of in-plane aliasing have been done for conventional computed tomography (CT) images, longitudinal aliasing in spiral CT has not been properly investigated. We propose a mathematical model of the three-dimensional (3-D) sampling scheme in spiral CT and analyze its effects on longitudinal aliasing. We investigated longitudinal aliasing as a function of the helical-interpolation algorithm, pitch, and reconstruction interval using CT simulations and actual phantom scans. Our model predicts, and we verified, that for a radially uniform object at the isocenter, the spiral sampling scheme results in spatially varying cancellation of the aliased spectral islands which, in turn, results in spatially varying longitudinal aliasing. The aliasing is minimal at the scanner isocenter, but worsens with distance from it and rapidly becomes significant. Our results agree with published results observed at the isocenter of the scanner and further provide new insight into the aliasing conditions at off-isocenter locations with respect to the pitch, interpolation algorithm, and reconstruction interval. We conclude that longitudinal aliasing at off-isocenter locations can be significant, and that its magnitude and effects cannot be predicted by measurements made only at the scanner isocenter.     

Single-slice rebinning reconstruction in spiral cone-beam computed tomography

At the advent of multislice computed tomography ICT) a variety of approximate cone-beam algorithms have been proposed suited for reconstruction of small cone-angle CT data in a spiral mode of operation. The goal of this study is to identify a practical and efficient approximate cone-beam method, extend its potential for medical use, and demonstrate its performance at medium cone-angles required for area detector CT. We will investigate two different approximate single-slice rebinning algorithms for cone-beam CT: the multirow Fourier reconstruction (MFR) and an extension of the advanced single-slice rebinning method (ASSR), which combines the idea of ASSR with a z-filtering approach. Thus, both algorithms, MFR and ASSR, are formulated in the framework of z-filtering using optimized spiral interpolation algorithms. In each view, X-ray samples to be used for reconstruction are identified, which describe an approximation to a virtual reconstruction plane. The performance of approximate reconstruction should improve as the virtual reconstruction plane better fits the spiral focus path. The image quality of the respective reconstruction will be assessed with respect to image artifacts, spatial resolution, contrast resolution, and image noise. It turns out that the ASSR method using tilted reconstruction planes is a practical and efficient algorithm, providing image quality comparable to that of a single-row scanning system even with a 46-row detector at a table feed of 64 mm. Both algorithms tolerate any table feed below the maximum value associated to the detector height. Due to the z-filter approach, all detector data sampled can be used for image reconstruction.     

Spiral interpolation algorithms for multislice spiral CT--part II: measurement and evaluation of slice sensitivity profiles and noise at a clinical multislice system

The recently introduced multislice data acquisition for computed tomography (CT) is based on multirow detector design, increased rotation speed, and advanced z-interpolation and z-filtering algorithms. We evaluated slice sensitivity profiles (SSPs) and noise of a clinical multislice spiral CT (MSCT) scanner with M = 4 simultaneously acquired slices and adaptive axial interpolator (AAI) reconstruction software. SSPs were measured with a small gold disk of 50 microm thickness and 2-mm diameter located at the center of rotation (COR) and 100 mm off center. The standard deviation of CT values within a 20-cm water phantom was used as a measure of image noise. With a detector slice collimation of S = 1.0 mm, we varied spiral pitch p from 0.25 to 2.0 in steps of 0.025. Nominal reconstructed slice thicknesses were 1.25, 1.5, and 2.0 mm. For all possible pitch values, we found the full-width at half maximum (FWHM) of the respective sensitivity profile at the COR equivalent to the selected nominal slice thickness. The profiles at 100 mm off center are broadened less than 7 % on the average compared with the FWHM at the COR. In addition, variation of the full-width at tenth maximum (FWTM) at the COR was below 10% for p < or = 1.75. Within this range, image noise varied less than 10% with respect to the mean noise level. The slight increase in measured slice-width above p = 1.75 for nominal slice-widths of 1.25 and 1.50 mm is accompanied by a decrease of noise according to the inverse square root relationship. The MSCT system that we scrutinized provides reconstructed slice-widths and image noise, which can be regarded as constant within a wide range of table speeds. With respect to this, MSCT is superior to single-slice spiral CT. These facts can be made use of when defining and optimizing clinical protocols: the spiral pitch can be selected almost freely, and scan protocols can follow the diagnostic requirements without technical restrictions. In summary, MSCT offers constant image quality while scan times are reduced drastically. Volume scans with three-dimensional (3-D) isotropic resolution are routinely feasible for complete anatomical regions.