A Parallel Implementation of the Katsevich Algorithm for 3-D CT Image Reconstruction
|
|
- Hubert Lamb
- 5 years ago
- Views:
Transcription
1 The Journal of Supercomputing, 38, 35 47, 2006 C 2006 Springer Science + Business Media, LLC. Manufactured in The Netherlands. A Parallel Implementation of the Katsevich Algorithm for 3-D CT Image Reconstruction JUNJUN DENG HENGYONG YU JUN NI TAO HE SHIYING ZHAO LIHE WANG GE WANG Department of Radiology, the University of Iowa, Iowa City, Iowa 52242, USA jdeng@math.uiowa.edu hengyong-yu@uiowa.edu jun-ni@uiowa.edu tao-he@uiowa.edu shiying-zhao@uiowa.edu lihe-wang@uiowa.edu ge-wang@uiowa.edu Abstract. 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. Keywords: Computed tomography (CT), medical imaging, image reconstruction, Katsevich algorithm, spiral cone-beam CT, high performance computing, parallel computing, MPI 1. Introduction X-ray computed tomography (CT) is an important medical-imaging modality where projection data are used to reconstruct a cross-sectional or volumetric image of a patient. In this field, spiral cone-beam CT has become a main mode, in which a data acquisition system consisting of an X-ray tube and a multi-row detector bank rotates while the patient is moved into a scanner gantry [6]. Relative to the patient, the X-ray source scans along a helix, and generates cone beam X-rays through the object. The attenuated X-ray signals are then recorded on the detectors placed on the other side of the patient. Although the mechanism of spiral cone beam CT seems simplistic, the cone-beam divergence and the longitudinal truncation of projection data make the exact image reconstruction far from trivial. In 1984, a landmark contribution was made by Feldkamp et al. [7]. The Feldkamp algorithm allows approximate reconstruction from cone-beam data collected along a circular trajectory. In 1993, a generalized Feldkamp algorithm was developed by Wang et al. [8]. The Wang algorithm is primarily for approximate reconstruction in the case of spiral cone-beam CT. Like the Feldkamp algorithm, the Wang algorithm is excellent in terms of efficiency and parallelism. As far as exact reconstruction for spiral cone-beam CT is concerned, a breakthrough was made in 2002 when Katsevich derived a filtered backprojection algorithm which is quite similar to the
2 36 Deng et al. Feldkamp-type algorithm but does reconstruct images exactly for spiral cone-beam CT [3, 4]. In 2004, the Katsevich algorithm was implemented by Yu and Wang [1] and other groups. In practice, the Katsevich algorithm requires significantly long computational time when the amount of data becomes increasingly large. There are several approaches to reduce the computation time. From the computing perspective, one can use the parallel computing technology for that purpose. A parallel computing machine can be a single Symmetric Multi-Processing (SMP) system with multiple built-in processors sharing a common memory; or a cluster of locally-connected computer processors with distributed interconnected memories; or a cluster comprising multiple workstations linked by a network. In analysis of parallel computing, a processor participating in a computational process is called a processing element (PE). An overall computational task is typically partitioned into multiple sub-tasks, and the associated data is sent to different PEs through a local connection (with an internal switch) or a networked connection (with an external switch). After the sub-tasks are completed, the results are assembled by a master PE to obtain the final result. The parallel computing technology has been successfully used in several medical applications involving image reconstruction. Many parallel algorithms were developed. A parallel algorithm is usually designed based on a corresponding sequential algorithm. For example, Raman [9] developed a parallel Filtered-BackProjection (FBP) algorithm and implemented it on Intel Paragon system with 16 processors and the Connection Machine (CM5) system with 32 processors. The performance of their parallel FBP programs was compromised by a large communication overhead, giving a speedup of about 4 on Paragon and 1.36 on CM5, respectively. In the early 1990s, some parallel Expectation-Maximization (EM) algorithms were proposed [10, 11]. The parallel implementation was directly based on the conventional EM algorithm with various domain partition techniques [11, 12]. Ordered subset techniques were also further used to speedup the iterative reconstruction [13]. Recently, Johnson and Sofer investigated various parallelisms in image reconstruction [14]. An OSC (Order- Subset Convex)-based parallel statistical cone-beam X-ray CT algorithm was proposed based on a shared memory [15]. This algorithm employs two parallelization techniques: (1) processing all the projections within one subset in parallel (OSC-ang), and (2) dividing the whole volume into various parts and reconstructing them in parallel (OSC-vol). Both the techniques rely on re-projection/back-projection operations heavily. The second parallelization strategy is suitable for distributed memory systems. It was also found that the optimal choice of the OSC-ang and OSC-vol specifics depended on the dataset size. The paradigm of using multiple parallelization techniques is effective to reduce the communication cost during data transferring. This paper presents a parallel computing scheme for the Katsevich algorithm. This parallelization is built upon the previous numerical implementation [1, 2] of the original Katsevich algorithm [3, 4]. In the following sections, the Katsevich algorithm is first outlined. Then, the parallel computing scheme is presented. In the simulation, the major indexes are studied, including the computation time, the ratio of communication to computation time, the overall speedup, and the parallel efficiency. Finally, relevant issues are discussed.
3 A parallel implementation of the Katsevich algorithm for 3-D CT image reconstruction 37 Figure 1. CT. Coordinate systems and variables used for image reconstruction in the case of helical cone-beam 2. Katsevich algorithm and its sequential implementation 2.1. Katsevich theorem As shown in Figure 1, a helical scanning locus C in 3-D Euclidean space R 3 can be mathematically described as [4] C := { y R 3 : y 1 = R cos(s), y 2 = R sin(s), y 3 = sh } 2π, s R, (1) where s is a angular parameter, h (> 0) and R (> 0) are the pitch and radius of the locus, and y is a Cartesian-coordinate vector with three components y 1, y 2 and y 3. In a practical CT system, a patient is moved through the gantry while the X-ray source rotates around the patient. Relative to the patient s position, the locus of the X-ray source can be viewed as the helix C. Let U denote an open set that is strictly inside the helix and contains the volume (object) of interest (VOI): U { x R 3 : x x 2 2 < r 2, 0 < r < R }, (2) where r is the radius of VOI inside the locus and x is the Cartesian-coordinate vector with three coordinate components x 1, x 2 and x 3.
4 38 Deng et al. Assume f is a compactly supported function defined on U and let S 2 be the unit sphere in R 3, then the cone-beam transform of f is defined as D f (y, β) := 0 f (y + tβ) dt, β S 2. (3) The π-line of a given point x is a line segment passing through x with its two endpoints within one helix turn. It has been proved that any point strictly inside the spiral belongs to one and only one π-line [16, 17]. Assume s b (x) and s t (x) are the angular parameters of the two endpoints, the π-interval can be denoted as I PI (x) := [s b (x), s t (x)]. For a given s I PI (x), one can find s 2 I PI (x) such that x, y(s), y(s 2 ) and y(s 1 (s, s 2 )) are on the same plane with the constraint s 1 (s, s 2 ) = (s + s 2 )/2. Denote (y(s 1 ) y(s)) (y(s 2 ) y(s)) (y(s u(s, x) = 1 ) y(s)) (y(s 2 ) y(s)) sgn(s 2 s), 0 < s 2 s < 2π, ẏ(s) ÿ(s) ẏ(s) ÿ(s), s 2 = s Katsevich theorem [4] can be given as Theorem 1 For f C 0 (U), one has f (x) = 1 1 2π 2π 2 I PI (x) x y(s) 0 (4) q D dγ f (y(q), Θ(s, x,γ)) q=s ds, (5) sin γ where Θ(s, x,γ) = cos(γ )β(s, x) + sin(γ )e(s, x), β(s, x) = (x y(s)) / x y(s) and e(s, x) = β(s, x) u(s, x) Numerical implementation As illustrated in Figure 1, with d 1 = ( sin(s), cos(s), 0), d 2 = (0, 0, 1) and d 3 = ( cos(s), sin(s), 0), a local coordinate system on planar detector is formed to numerically implement Katsevich s formula [1]. The cone-beam projection data is measured using planar detector arrays parallel to d 1 and d 2 at a distance D from y(s). The detector position in the array is given by a pair of values (u,v), which are the signed distances along d 1 and d 2, respectively. Let (u,v) = (0, 0) be the orthogonal projection of y(s) onto the detector array. For given s and D, projection (u,v) is determined by β. Ifwe denote g(s, u,v) = D f (y, β) and D g (s, u,v) = d g(s, u,v), Katsevich algorithm can ds be implemented by the following two steps [1]: (S1) Hilbert filtering Define an intermediate function ψ(s, u,v) for this filtering step as: ψ(s, u,v) = D2 + u D g (s, ũ, ṽ) 2 + v 2 dũ (6) D2 + ũ 2 + ṽ 2 (ũ u)
5 A parallel implementation of the Katsevich algorithm for 3-D CT image reconstruction 39 where (ũ, ṽ) represents the local coordinates of a variable point on the filtering line determined by (u,v), and D g (s, u,v) is the first order derivative of cone-beam data which can be computed by the following equation: D g (s, u,v) = ( s + D2 + u 2 D u + uv D ) g(s, u,v) (7) v (S2) Weighted Backprojection The weighted backprojection is expressed by the following formula: f (x) = 1 st (x) 1 2π 2 s b (x) x y(s) ψ(s, u,v )ds. (8) u = D(x y(s)) d 1 (x y(s)) d,v = D(x y(s)) d 2 3 (x y(s)) d 3 To numerically implement katsevich algorithm, the cone beam projections are first uniformly sampled with intervals s, u, v for s, u, and v respectively. The sampled data is denoted as g(s k, u m,v n ) 0 k < K, 0 m < M, 0 n < N (9) where k, m and n are the indexes of sampling points for s, u and v, respectively. In practice, m and n are indexes of unit detector positions, and u and v represent the unit detector size. Therefore D g (s, u,v) can be numerically computed as D g (s k, u m,v n ) = Dg s (s k, u m,v n ) + D2 + u 2 m Dg u D (s k, u m,v n ) + u mv n D Dv g (s k, u m,v n ) (10) where Dg s (s k, u m,v n ), Dg u(s k, u m,v n ) and Dg v(s k, u m,v n ) are the first-order central difference formats of s g(s, u,v), g(s, u,v), and g(s, u,v) respectively. Then the data u v ψ(s k, u m,v n ) can be calculated from Eq. (6). Finally, the filtered data needs to be backprojected by Eq. (8) where π-interval I PI (x) has to be numerically determined. For the details of numerical implementations, refer to [1, 2]. 3. Parallel implementation As mentioned above, the accomplishment of a 3-D image reconstruction requires a great amount of time if one sequentially implements the Katsevich algorithm. This is not acceptable in demanding biomedical applications. To speedup the computational process is the primary goal of this project. Specifically, the parallel Katsevich algorithm is implemented on a multiprocessor HPC cluster with 16 nodes at our Medical Imaging High Performance Computing Lab (MIHPC Lab). Each node has two 64-bit AMD-based Opteron processors (PEs) and 4 GB memory shared between the processors. The total system storage is 8 TB for archiving
6 40 Deng et al. and retrieval of high-resolution data and images. The program is in C, compiled by the Porland C compiler. The MPI serves as a parallel library to perform message passing among the PEs. Since the MPI protocol is implemented through a low-level socket, the communication between the processors (processes) on the same node is realized through message passing. Besides, the processors on different nodes have higher priority to be assigned than the processors on the same nodes. The main message passing functions include MPI-based sending, receiving, broadcasting, and collecting. As described above, the two major computing procedures are filtration and backprojection (S1 and S2). In the filtering step, the calculation of numerical differentiation terms D s g (s k, u m,v n ), D u g (s k, u m,v n ) and D v g (s k, u m,v n ) in Eq. (10) and integration in Eq. (6) are the most time-consuming parts. The computation of D u g (s k, u m,v n ) and D v g (s k, u m,v n ) requires only the data collected at one view angle s k and therefore, it is independent of the data at other view angles. By this property, the projection data from different view angles can be distributed to different PEs and processed in parallel. The computation of D s g (s k, u m,v n ) takes the data from the view angles s k+1 and s k 1. This requires that the projection data be partitioned in such a way that the data from view angles s k, s k+1 and s k 1 be sent to the same PE. The integration operation in Eq. (6) uses the data at one view angle s k, thus the previous partition strategy for D u g (s k, u m,v n ) and D v g (s k, u m,v n ) applies here. An important issue is to determine how much projection data should be distributed to each PE in the filtering step. The filtering operation (6) is identical for all projection data indexedby(s k, u m,v n ). As a result, each PE should process an amount of projection data consistent to its computing capacity. Since the PC cluster is a homogenous system, we assume that each PE has the same computing capacity. The computing privilege is not a critical issue here. The load balance is not very important either. Hence, the projection data are just partitioned evenly, as shown in the Figure 2. In the backprojection step, Eq. (8) is a voxel-driven formulation. The reconstruction of each voxel x can be independently performed, requiring the same amount of computation. Therefore, the volume is also partitioned over the PEs consistent to their processing capabilities. Each PE reconstructs corresponding voxels, as shown also in Figure 2. Figure 2. Data flow of the parallel Katsevich algorithm.
7 A parallel implementation of the Katsevich algorithm for 3-D CT image reconstruction 41 Figure 3. Flowchart for the parallel reconstruction process. To sum up, the overall parallel computing is processed in the following order. The projection data is first partitioned and distributed over selected PEs. After each PE receives its assigned data, it performs the filtering operation. After each PE accomplishes the filtering operation, it sends the filtered data to all the PEs. Once each PE received all of the filtered data, it independently performs intensive backprojection. Finally, the backprojected data are collected and assembled on the master PE to obtain the final reconstruction. The flowchart of the whole parallel reconstruction process is presented in Figure Numerical results The parallel implementation of the Katsevich algorithm was evaluated by reconstructing the 3-D Shepp-Logan phantom [5]. The spiral cone-beam projection data was collected with a planar detector, as shown in Figure 1. Different datasets (volumes of 128 3, 256 3, and ) were used to measure the performance (mainly speedup and efficiency) and study the effects of sizes of datasets and images. The double precision format was used for all the data and images. The measured computational time in each run was slightly different due to varying computational loads at the nodes. Therefore, the average parallel computation time was calculated from ten runs for each test. The mean value of the computational time (Case I, II, III and IV for volumes of 128 3, 256 3, and voxels, respectively) and the
8 42 Deng et al. Figure 4. Comparisons of the performance parameters for the parallel Katsevich algorithm. All the X-axes represent the number of processors. The Y-axes of (a), (b), (c), and (d) are for computational time, speedup, efficiency and ratio, respectively. corresponding standard deviations are listed in Table 1. The corresponding semi-log plots are shown in Figure 4(a). From these results, it is observed that the reconstruction time significantly decreases with the increment in the number of PEs. It is also seen in Table 1 that the standard deviation is relatively large in the case of 4 processors. This is because the cluster has a master node and it needs to handle not only one computing task but also coordinate the whole reconstruction process, and handle tasks submitted by other users sometimes. Therefore, it often has more memory allocated than other slave nodes. As a result, the slave nodes sometimes, although not always, need wait for the master node in our experiments. Such a phenomenon is more prominent when fewer processors are used, causing a higher standard deviation. The benchmarks of a parallel algorithm are quantified in terms of speedup S p and parallel efficiency η, which are respectively defined as S p = T s T np, and η = S p n p. (11)
9 A parallel implementation of the Katsevich algorithm for 3-D CT image reconstruction 43 Table 1. Average total reconstruction time with the number of processors Number of Processors (NP) Case I: Volume = (16 MB) Reconstruction time Standard deviation Case II : Volume = (128 MB) Reconstruction time Standard deviation Case III : Volume = (432 MB) Reconstruction time Standard deviation Case IV : Volume = (1 GB) Reconstruction time Standard deviation *Note: The values are the means from 10 runs. The unit of time is second. Table 2. Speedup with the number of processors Number of Processors (NP) Case I: Volume = Case II: Volume = Case III: Volume = Case IV: Volume = n p is the number of processors, T s the total execution time when one processor is used, T np the total parallel execution time when n processors are used. Based on the data in Table 1, the associated speedup was calculated in each case to produce Table 2. Figure 4(b) is a plot of speedup with the number of processors in each of the four cases. The parallel efficiencies in the Cases I, II, III and IV with respect to the number of processors are listed in Table 3, and plotted in Figure 4(c). It is noticed that the efficiency curve for the first case stays below the ideal efficiency curve and decreases relatively rapidly, whereas the curves for the other cases descend slowly and are close to the ideal efficiency curve. In addition, the efficiency curves for the latter cases show a common wavy pattern, in which the efficiency decreases first, then increases and finally decreases again. In the region 1, where the number of PE ranges from 1 to 5, the parallel efficiencies for these cases decrease. In the region 2, the efficiencies increase with increment in the Table 3. Efficiency with the number of processors Number of Processors (NP) Case I: Volume = Case II: Volume = Case III: Volume = Case IV: Volume =
10 44 Deng et al. Table 4. Time used in different steps* Number of Processes (NP) Case I: Volume = Filtration Collecting filtered data Backprojection Collecting BP data Total reconstruction time Case II: Volume = Filtration Collecting filtered data Backprojection Collecting BP data Total reconstruction time Case III: Volume = Filtration Collecting filtered data Backprojection Collecting BP data Total reconstruction time Case IV: Volume = Filtration Collecting filtered data Backprojection Collecting BP data Total reconstruction time * The unit of time is second. The values are means from10 runs. The time for broadcasting projection data to PEs is not listed since it is insignificant. number of PEs. The curves reach their peaks when the number of PEs is about 16. In the region 3, also called the post-peak performance region, the efficiencies decrease again as the number of PEs further increases. The appearance of the super-linear effect (the behavior in which the speedup is greater than the ideal linear speedup) is due to the fact that in the multiprocessor system the memory usage associated with each PE is less than that in the single processor system [18]. For example, during the backprojection process, each processor reconstructs a portion of the object, thus allocating only that portion of memory. In the case IV, to reconstruct an object into a volume of 512 3, at least bytes = 1 GB memory is needed for backprojection in a single-processor system. While in a multiprocessor system where n (n > 1) PEs are used, the memory associated with each processor is 1/n of the memory (1 GB). The impact of memory on the computational ability of PEs is responsible for the super-linear speedup. Such phenomena are more evident with a larger dataset. That is why it appears more prominently in the cases II through IV. Table 4 compares the time used in different steps. The results indicate that the communication time constitutes a smaller percentage of the total reconstruction time as the reconstruction volume becomes larger. Hence, the parallel algorithm will be computationally more efficient when a large dataset is dealt with for higher resolution reconstruction. The ratio between the communication and computation time corresponding to
11 A parallel implementation of the Katsevich algorithm for 3-D CT image reconstruction 45 Figure 5. Representative slices of reconstructed volume. The top row shows the reconstructed slices of the 3D Shepp-Logan phantom, while the bottom reveals the differences between the reconstructed and original slices. The gray ranges are [1.00, 1.05] and [ ] for the reconstructed slices and the differences, respectively. different numbers of processors is also plotted in Figure 4(d). It shows that as the size of a dataset increases this ratio decreases, resulting in a higher performance. Finally, to verify the correctness of the current parallel implementation, the selected slices of the reconstructed objects are compared with the corresponding slices of the 3-D Shepp-Logan phantom. An excellent agreement can be seen in Figure Discussion and conclusion Some concerns need to be addressed here. One may argue why not to start the 3-D backprojection as soon as some PEs finish their filtering task so as to avoid waiting for the others. Theoretically, it is feasible. However, there are three reasons that make it unnecessary or impractical. First, the time needed for the filtering constitutes only a small portion of the total reconstruction time. Second, in our homogeneous system, the computation load is balanced among PEs in the filtering step, which can be observed from the timeline, hence the PEs finish the filtering task at almost the same time. Third, the programming complexity would be increased if we had done that way. Nevertheless, it is admitted that, in a heterogeneous system where the computation load of PEs is imbalanced, one need consider starting backprojection asynchronically. Another concern is that, after the filtration, it seems not economic in terms of data communication and memory storage to send a full copy of the filtered data to every involved PE. An alternative solution is to search for all the PI-segments and the affiliated
12 46 Deng et al. projection data immediately after the filtration, gather and distribute only the necessary data, and finally do the backprojection. It could reduce the needed data storage and communication among PEs, but it would demand more computing resources to compute and store the endpoints of the PI-segments and so on. Therefore, the tradeoff between them should be optimized. Both these concerns suggest that the parallel implementation of the Katsevich algorithm is not unique. Since this work is to demonstrate the feasibility and advantages utilizing the parallelism, more implementation options are not discussed here. It is also worth noting that the proposed parallel computing structure can definitely be adapted for many other CB-FBP algorithms, such as those described in [19, 21]. In conclusion, the parallel Katsevich algorithm for 3-D CT has been designed and studied. Our algorithm distributes the projection data and image sub-volumes to multiple PEs consistent to their computing abilities. It is feasible to modify the partitioning scheme when PEs are not identical or more PEs are used. Future work includes studies on the trend of speedup and efficiency curves when more PEs are used, and on the impact of enlarging the image volume on the speedup and efficiency of the parallel computing system. Acknowledgments The project is partially supported by National Health Institute (NIH/NIBIB) grants EB and EB The authors are grateful for the anonymous reviewers who made constructive comments. The authors thank Academic Technology-Research Services, and Information Technology Services at the University of Iowa for generous support. We also thank Ms. Diane Machatka in Facility Management at the University of Iowa for contributing legacy Gateway Desktop PCs to build a test-bed PC cluster, and Mr. Deepak Bharkhada for editorial help. References 1. H. Yu and G. Wang. Studies on implementation of the Katsevich algorithm for spiral cone-beam CT. Journal of X-Ray Science and Technology, 12:97 116, H. Yu and G. Wang. Studies on artifacts of the Katsevich algorithm for spiral cone-beam CT. In Developments in X-Ray Tomography IV, Proceedings of SPIE, 5535: Denver, CO, United States, pp , Aug 4 6, A. Katsevich. Theoretically exact FBP-type inversion algorithm for spiral CT. SIAM J. Appl. Math., 62(6): , A. Katsevich. An improved exact filtered backprojection algorithm for spiral computed tomography. Advance in Applied Mathematics, 32: , L. A. Shepp and B. F. Logan. The Fourier reconstruction of a head section. IEEE Transactions on Nuclear Science, NS21(3):21 34, J. L. Prince and J. M. Links. Medical Imaging Signals and Systems. Pearson Prentice Hall, Upper Saddle River, New Jersey, L. A. Feldkamp, L. C. Davis, and J. W. Kress. Practical cone-beam algorithm. J. Opt. Soc. Am., A: , G. Wang, T. H. Lin, P. C. Cheng, and D. M. Shinozaki. A general cone-beam reconstruction algorithm. IEEE Transaction on Medical Imaging, 12(3): , 993.
13 A parallel implementation of the Katsevich algorithm for 3-D CT image reconstruction P. V. R. Raman. Parallel implementation of the filtered back projection for tomographic imaging, Masters Thesis, Dept. Electrical Engineering, Virginia Polytechnic Institute and State University, Blacksburg, Virginia, January, M. Miller and C. Butler. 3-D maximum a posteriori estimation for single photon emission computed tomography on massively-parallel computers. IEEE Trans. Med. Imag., 12: , C. M. Chen, S. Y. Lee, and Z. H. Cho. A parallel implementation of 3-D CT image reconstruction on hypercube multiprocessor. IEEE Transaction on Nuclear Science, 37(3): , G. Kontaxakis, L. G. Strauss, and G. Tzanakos. An efficient implementation of the iterative MLEM image reconstruction algorithm for PET on a Pentium PC platform. Journal of Computing and Information Technology, 7(2): , C. Kamphuis and F. J. Beekman. Accelerated Iteirative transmission CT reconstruction using an ordered subset convex algorithm. IEEE Trans. Med. Imaging, 17: , C. Johnson and A. Sofer. A Data-parallel algorithm for iterative tomographic image reconstruction. In Proc. of 7th IEEE Symp. Front Mass Parallel Computing, IEEE Computer Society Press, J. S. Kole and F. J. Beekman. Parallel statistical image reconstruction for cone-beam X-ray CT on a shared memory computation platform. Phys. Med. Bio., 50: , P. E. Danielsson, P. Edholm, J. Eriksson, and M. Magnusson. Towards exact reconstruction for helical cone-beam scanning of long objects. A new detector arrangement and a new completeness condition, In Proc.1997 Meeting on Fully 3D Image Reconstruction in Radiology and Nuclear Medicine (Pittsburgh) D.W. Townsend and P.E. Kinahan, eds., pp M. Defrise, F. Noo, and H. Kudo. A solution to the long-object problem in helical cone-beam tomography, Physics in Medicine and Biology, 45(2000), B. Wilkinson and M. Allen. Parallel Programming: Techniques and Applications Using Networked Workstations and Parallel Computers. Prentice Hall Press, H. Tuy. 3D image reconstruction for helical partial cone beam scanners using wedge beam transform. US Patent, 6,104,775, X. Tang and J. Hsieh. A filtered backprojection algorithm for cone beam reconstruction using rotational filtering under helical source trajectory. Med. Phys., 31: (2004). 21. X. Tang, J. Hsieh, A. Hagiwara, R. A. Nilsen, J. Thibault, and E. Drapkin. A three-dimensional weighted cone beam filtered backprojection (CB-FBP) algorithm for image reconstruction in volumetric CT under a circular source trajectory. Phys. Med. Biol., 50: (2005).
Feldkamp-type image reconstruction from equiangular data
Journal of X-Ray Science and Technology 9 (2001) 113 120 113 IOS Press Feldkamp-type image reconstruction from equiangular data Ben Wang a, Hong Liu b, Shiying Zhao c and Ge Wang d a Department of Elec.
More informationA Backprojection-Filtration Algorithm for Nonstandard. Spiral Cone-beam CT with an N-PI Window
A Backprojection-Filtration Algorithm for Nonstandard Spiral Cone-beam CT with an N-PI Window Hengyong Yu, Yangbo Ye,, Shiying Zhao, Ge Wang, CT/Micro-CT Laboratory, Department of Radiology, Department
More informationRECENTLY, biomedical imaging applications of
1190 IEEE TRANSACTIONS ON MEDICAL IMAGING, VOL. 24, NO. 9, SEPTEMBER 2005 A General Exact Reconstruction for Cone-Beam CT via Backprojection-Filtration Yangbo Ye*, Shiying Zhao, Hengyong Yu, Ge Wang, Fellow,
More informationParallel Implementation of Katsevich s FBP Algorithm
Hindawi Publishing Corporation International Journal of Biomedical Imaging Volume 26, Article ID 7463, Pages 8 DOI.55/IJBI/26/7463 Parallel Implementation of Katsevich s FBP Algorithm Jiansheng Yang, Xiaohu
More informationImage Reconstruction 3 Fully 3D Reconstruction
Image Reconstruction 3 Fully 3D Reconstruction Thomas Bortfeld Massachusetts General Hospital, Radiation Oncology, HMS HST.S14, February 25, 2013 Thomas Bortfeld (MGH, HMS, Rad. Onc.) Image Reconstruction
More informationAn approximate cone beam reconstruction algorithm for gantry-tilted CT
An approximate cone beam reconstruction algorithm for gantry-tilted CT Ming Yan a, Cishen Zhang ab, Hongzhu Liang a a School of Electrical & Electronic Engineering, Nanyang Technological University, Singapore;
More informationInterior Reconstruction Using the Truncated Hilbert Transform via Singular Value Decomposition
Interior Reconstruction Using the Truncated Hilbert Transform via Singular Value Decomposition Hengyong Yu 1, Yangbo Ye 2 and Ge Wang 1 1 CT Laboratory, Biomedical Imaging Division, VT-WFU School of Biomedical
More informationImprovement of Efficiency and Flexibility in Multi-slice Helical CT
J. Shanghai Jiaotong Univ. (Sci.), 2008, 13(4): 408 412 DOI: 10.1007/s12204-008-0408-x Improvement of Efficiency and Flexibility in Multi-slice Helical CT SUN Wen-wu 1 ( ), CHEN Si-ping 2 ( ), ZHUANG Tian-ge
More informationGeometric studies on variable radius spiral cone-beam scanning
Geometric studies on variable radius spiral cone-beam scanning Yangbo Ye a) Jiehua Zhu Department of Mathematics, The University of Iowa, Iowa City, Iowa 52242 Ge Wang Department of Radiology, The University
More informationMulti-slice CT Image Reconstruction Jiang Hsieh, Ph.D.
Multi-slice CT Image Reconstruction Jiang Hsieh, Ph.D. Applied Science Laboratory, GE Healthcare Technologies 1 Image Generation Reconstruction of images from projections. textbook reconstruction advanced
More informationParallel computing techniques for computed tomography
University of Iowa Iowa Research Online Theses and Dissertations Spring 2011 Parallel computing techniques for computed tomography Junjun Deng University of Iowa Copyright 2011 Junjun Deng This dissertation
More informationTheoretically-exact CT-reconstruction from experimental data
Theoretically-exact CT-reconstruction from experimental data T Varslot, A Kingston, G Myers, A Sheppard Dept. Applied Mathematics Research School of Physics and Engineering Australian National University
More informationTESTING OF THE CIRCLE AND LINE ALGORITHM IN THE SETTING OF MICRO-CT
SCA2016-080 1/7 TESTING OF THE CIRCLE AND LINE ALGORITHM IN THE SETTING OF MICRO-CT Alexander Katsevich 1, 2 and Michael Frenkel 1 1 itomography Corp., 2 University of Central Florida (UCF) This paper
More informationCIRCULAR scanning trajectory has been widely used in
IEEE TRANSACTIONS ON MEDICAL IMAGING, VOL. 25, NO. 7, JULY 2006 869 Region of Interest Reconstruction From Truncated Data in Circular Cone-Beam CT Lifeng Yu, Yu Zou, Emil Y. Sidky, Charles A. Pelizzari,
More informationScaling Calibration in the ATRACT Algorithm
Scaling Calibration in the ATRACT Algorithm Yan Xia 1, Andreas Maier 1, Frank Dennerlein 2, Hannes G. Hofmann 1, Joachim Hornegger 1,3 1 Pattern Recognition Lab (LME), Friedrich-Alexander-University Erlangen-Nuremberg,
More informationParallel iterative cone beam CT image reconstruction on a PC cluster
Galley Proof 30/04/2005; 12:41 File: xst127.tex; BOKCTP/ljl p. 1 Journal of X-Ray Science and Technology 13 (2005) 1 10 1 IOS Press Parallel iterative cone beam CT image reconstruction on a PC cluster
More informationDiscrete Estimation of Data Completeness for 3D Scan Trajectories with Detector Offset
Discrete Estimation of Data Completeness for 3D Scan Trajectories with Detector Offset Andreas Maier 1, Patrick Kugler 2, Günter Lauritsch 2, Joachim Hornegger 1 1 Pattern Recognition Lab and SAOT Erlangen,
More informationComparison of Probing Error in Dimensional Measurement by Means of 3D Computed Tomography with Circular and Helical Sampling
nd International Symposium on NDT in Aerospace - We..A. Comparison of Probing Error in Dimensional Measurement by Means of D Computed Tomography with Circular and Helical Sampling Jochen HILLER, Stefan
More informationResearch Article Cone-Beam Composite-Circling Scan and Exact Image Reconstruction for a Quasi-Short Object
Hindawi Publishing Corporation International Journal of Biomedical Imaging Volume 27, Article ID 87, pages doi:.55/27/87 Research Article Cone-Beam Composite-Circling Scan and Exact Image Reconstruction
More informationAn Iterative Approach to the Beam Hardening Correction in Cone Beam CT (Proceedings)
Marquette University e-publications@marquette Biomedical Engineering Faculty Research and Publications Engineering, College of 1-1-1999 An Iterative Approach to the Beam Hardening Correction in Cone Beam
More informationParallelism of iterative CT reconstruction based on local reconstruction algorithm
J Supercomput (2009) 48: 1 14 DOI 10.1007/s11227-008-0198-9 Parallelism of iterative CT reconstruction based on local reconstruction algorithm Junjun Deng Hengyong Yu Jun Ni Lihe Wang Ge Wang Published
More informationA study on the section sensitivity profile in multi-row-detector spiral CT
Journal of X-Ray Science and Technology (3) IOS Press A study on the section sensitivity profile in multi-row-detector spiral CT Ge Wang a, Mark Madsen a, Katherine Redford a, Shiying Zhao b and Michael
More informationThis paper deals with ecient parallel implementations of reconstruction methods in 3D
Ecient Implementation of Parallel Image Reconstruction Algorithms for 3D X-Ray Tomography C. Laurent a, C. Calvin b, J.M. Chassery a, F. Peyrin c Christophe.Laurent@imag.fr Christophe.Calvin@imag.fr a
More informationCone-beam reconstruction for the 2-circles plus line trajectory
Cone-beam reconstruction for the -circles plus line trajectory Yanbin Lu a,*, Jiansheng Yang a, John W. Emerson b, Heng Mao a, Yuanzheng Si a and Ming Jiang a a LMAM, School of Mathematical Sciences, Peking
More informationA Fast GPU-Based Approach to Branchless Distance-Driven Projection and Back-Projection in Cone Beam CT
A Fast GPU-Based Approach to Branchless Distance-Driven Projection and Back-Projection in Cone Beam CT Daniel Schlifske ab and Henry Medeiros a a Marquette University, 1250 W Wisconsin Ave, Milwaukee,
More informationTHE FAN-BEAM scan for rapid data acquisition has
190 IEEE TRANSACTIONS ON MEDICAL IMAGING, VOL. 26, NO. 2, FEBRUARY 2007 Hilbert Transform Based FBP Algorithm for Fan-Beam CT Full Partial Scans Jiangsheng You*, Member, IEEE, Gengsheng L. Zeng, Senior
More informationTwo Local FBP Algorithms for Helical Cone-beam Computed Tomography
Digital Industrial Radiology and Computed Tomography (DIR 215) 22-25 June 215, Belgium, Ghent - www.ndt.net/app.dir215 More Info at Open Access Database www.ndt.net/?id=187 Two Local FBP Algorithms for
More informationIntroduction to Medical Imaging. Cone-Beam CT. Klaus Mueller. Computer Science Department Stony Brook University
Introduction to Medical Imaging Cone-Beam CT Klaus Mueller Computer Science Department Stony Brook University Introduction Available cone-beam reconstruction methods: exact approximate algebraic Our discussion:
More informationAn FDK-like cone-beam SPECT reconstruction algorithm for non-uniform attenuated
Home Search Collections Journals About Contact us My IOPscience An FK-like cone-beam SPECT reconstruction algorithm for non-uniform attenuated projections acquired using a circular trajectory This content
More informationGengsheng Lawrence Zeng. Medical Image Reconstruction. A Conceptual Tutorial
Gengsheng Lawrence Zeng Medical Image Reconstruction A Conceptual Tutorial Gengsheng Lawrence Zeng Medical Image Reconstruction A Conceptual Tutorial With 163 Figures Author Prof. Dr. Gengsheng Lawrence
More informationA unified framework for exact cone-beam reconstruction formulas
A unified framework for exact cone-beam reconstruction formulas Shiying Zhao, a Hengyong Yu, b and Ge Wang c CT/Micro-CT Laboratory, Department of Radiology University of Iowa, 200 Hawkins Drive Iowa City,
More informationInternational Symposium on Digital Industrial Radiology and Computed Tomography - Mo.2.2
International Symposium on Digital Industrial Radiology and Computed Tomography - Mo.2.2 Accuracy Evaluation and Exploration of Measurement Uncertainty for Exact Helical Cone Beam Reconstruction Using
More informationAccelerated C-arm Reconstruction by Out-of-Projection Prediction
Accelerated C-arm Reconstruction by Out-of-Projection Prediction Hannes G. Hofmann, Benjamin Keck, Joachim Hornegger Pattern Recognition Lab, University Erlangen-Nuremberg hannes.hofmann@informatik.uni-erlangen.de
More informationA sufficient condition for spiral cone beam long object imaging via backprojection
A sfficient condition for spiral cone beam long object imaging via backprojection K. C. Tam Siemens Corporate Research, Inc., Princeton, NJ, USA Abstract The response of a point object in cone beam spiral
More informationFDK Half-Scan with a Heuristic Weighting Scheme on a Flat Panel Detector-Based Cone Beam CT (FDKHSCW)
Biomedical Imaging Volume 26, Article ID 83983, Pages 8 DOI.55/IJBI/26/83983 FDK Half-Scan with a Heuristic Weighting Scheme on a Flat Panel Detector-Based Cone Beam CT (FDKHSCW) Dong Yang and Ruola Ning
More informationF3-D: Computationally Efficient Simultaneous Segmentation and Image Reconstruction for CT X-ray Based EDS Systems Screening
F3-D: Computationally Efficient Simultaneous Segmentation and Image Reconstruction for CT X-ray Based EDS Systems Screening Abstract Despite recent technological advances, reliable detection of explosives
More informationMedical Image Processing: Image Reconstruction and 3D Renderings
Medical Image Processing: Image Reconstruction and 3D Renderings 김보형 서울대학교컴퓨터공학부 Computer Graphics and Image Processing Lab. 2011. 3. 23 1 Computer Graphics & Image Processing Computer Graphics : Create,
More informationA Fast Implementation of the Incremental Backprojection Algorithms for Parallel Beam Geometries5
A Fast mplementation of the ncremental Backprojection Algorithms for Parallel Beam Geometries5 Chung-Ming Chent, Zang-Hee Cho*, Cheng-Yi Wang t +Center for Biomedical Engineering, College of Medicine,
More informationReconstruction in CT and relation to other imaging modalities
Reconstruction in CT and relation to other imaging modalities Jørgen Arendt Jensen November 1, 2017 Center for Fast Ultrasound Imaging, Build 349 Department of Electrical Engineering Center for Fast Ultrasound
More informationDEVELOPMENT OF CONE BEAM TOMOGRAPHIC RECONSTRUCTION SOFTWARE MODULE
Rajesh et al. : Proceedings of the National Seminar & Exhibition on Non-Destructive Evaluation DEVELOPMENT OF CONE BEAM TOMOGRAPHIC RECONSTRUCTION SOFTWARE MODULE Rajesh V Acharya, Umesh Kumar, Gursharan
More informationDetermination of Three-Dimensional Voxel Sensitivity for Two- and Three-Headed Coincidence Imaging
IEEE TRANSACTIONS ON NUCLEAR SCIENCE, VOL. 50, NO. 3, JUNE 2003 405 Determination of Three-Dimensional Voxel Sensitivity for Two- and Three-Headed Coincidence Imaging Edward J. Soares, Kevin W. Germino,
More information2D Fan Beam Reconstruction 3D Cone Beam Reconstruction. Mario Koerner
2D Fan Beam Reconstruction 3D Cone Beam Reconstruction Mario Koerner Moscow-Bavarian Joint Advanced Student School 2006 March 19 2006 to March 29 2006 Overview 2D Fan Beam Reconstruction Shortscan Reconstruction
More informationHigh-performance tomographic reconstruction using graphics processing units
18 th World IMACS / MODSIM Congress, Cairns, Australia 13-17 July 29 http://mssanz.org.au/modsim9 High-performance tomographic reconstruction using graphics processing units Ya.I. esterets and T.E. Gureyev
More informationThe n-pi-method for Helical Cone-Beam CT
848 IEEE TRANSACTIONS ON MEDICAL IMAGING, VOL. 19, NO. 9, SEPTEMBER 2000 The n-pi-method for Helical Cone-Beam CT R. Proksa*, Th. Köhler, M. Grass, and J. Timmer Abstract A new class of acquisition schemes
More informationNovel C-arm based cone-beam CT using a source trajectory of two concentric arcs
Novel C-arm based cone-beam CT using a source trajectory of two concentric arcs Joseph Zambelli a, Brian E. Nett a,shuaileng a, Cyril Riddell c, Barry Belanger d,guang-hong Chen a,b a Department of Medical
More informationIterative and analytical reconstruction algorithms for varying-focal-length cone-beam
Home Search Collections Journals About Contact us My IOPscience Iterative and analytical reconstruction algorithms for varying-focal-length cone-beam projections This content has been downloaded from IOPscience.
More informationTomographic Reconstruction
Tomographic Reconstruction 3D Image Processing Torsten Möller Reading Gonzales + Woods, Chapter 5.11 2 Overview Physics History Reconstruction basic idea Radon transform Fourier-Slice theorem (Parallel-beam)
More information2D Fan Beam Reconstruction 3D Cone Beam Reconstruction
2D Fan Beam Reconstruction 3D Cone Beam Reconstruction Mario Koerner March 17, 2006 1 2D Fan Beam Reconstruction Two-dimensional objects can be reconstructed from projections that were acquired using parallel
More informationReconstruction in CT and relation to other imaging modalities
Reconstruction in CT and relation to other imaging modalities Jørgen Arendt Jensen November 16, 2015 Center for Fast Ultrasound Imaging, Build 349 Department of Electrical Engineering Center for Fast Ultrasound
More informationPlanar tomosynthesis reconstruction in a parallel-beam framework via virtual object reconstruction
Planar tomosynthesis reconstruction in a parallel-beam framework via virtual object reconstruction Brian E. Nett a,shuaileng a and Guang-Hong Chen a,b a Department of Medical Physics, University of Wisconsin-Madison,
More informationAn Acquisition Geometry-Independent Calibration Tool for Industrial Computed Tomography
4th International Symposium on NDT in Aerospace 2012 - Tu.3.A.3 An Acquisition Geometry-Independent Calibration Tool for Industrial Computed Tomography Jonathan HESS *, Patrick KUEHNLEIN *, Steven OECKL
More informationA Novel Two-step Method for CT Reconstruction
A Novel Two-step Method for CT Reconstruction Michael Felsberg Computer Vision Laboratory, Dept. EE, Linköping University, Sweden mfe@isy.liu.se Abstract. In this paper we address the parallel beam 2D
More informationAdaptive region of interest method for analytical micro-ct reconstruction
Journal of X-Ray Science and Technology 19 (2011) 23 33 23 DOI 10.3233/XST-2010-0274 IOS Press Adaptive region of interest method for analytical micro-ct reconstruction Wanneng Yang, Xiaochun Xu, Kun Bi,
More informationCone-beam reconstruction by backprojection and filtering
Andrei V. Bronnikov Vol. 7, No. / November 000/ J. Opt. Soc. Am. A 993 Cone-beam reconstruction by backprojection and filtering Andrei V. Bronnikov KEMA, Utrechtseweg 30, P.O. Box 9035, 6800 ET Arnhem,
More informationUSING cone-beam geometry with pinhole collimation,
IEEE TRANSACTIONS ON NUCLEAR SCIENCE, VOL. 56, NO. 3, JUNE 2009 687 A Backprojection-Based Parameter Estimation Technique for Skew-Slit Collimation Jacob A. Piatt, Student Member, IEEE, and Gengsheng L.
More informationAttenuation map reconstruction from TOF PET data
Attenuation map reconstruction from TOF PET data Qingsong Yang, Wenxiang Cong, Ge Wang* Department of Biomedical Engineering, Rensselaer Polytechnic Institute, Troy, NY 80, USA *Ge Wang (ge-wang@ieee.org)
More informationGrangeat-type helical half-scan computerized tomography algorithm for reconstruction of a short object
Grangeat-type helical half-scan computerized tomography algorithm for reconstruction of a short object Seung Wook Lee a) CT/Micro-CT Laboratory, Department of Radiology, University of Iowa, Iowa City,
More informationAxial block coordinate descent (ABCD) algorithm for X-ray CT image reconstruction
Axial block coordinate descent (ABCD) algorithm for X-ray CT image reconstruction Jeffrey A. Fessler and Donghwan Kim EECS Department University of Michigan Fully 3D Image Reconstruction Conference July
More informationAdvanced Image Reconstruction Methods for Photoacoustic Tomography
Advanced Image Reconstruction Methods for Photoacoustic Tomography Mark A. Anastasio, Kun Wang, and Robert Schoonover Department of Biomedical Engineering Washington University in St. Louis 1 Outline Photoacoustic/thermoacoustic
More informationSpiral CT. Protocol Optimization & Quality Assurance. Ge Wang, Ph.D. Department of Radiology University of Iowa Iowa City, Iowa 52242, USA
Spiral CT Protocol Optimization & Quality Assurance Ge Wang, Ph.D. Department of Radiology University of Iowa Iowa City, Iowa 52242, USA Spiral CT Protocol Optimization & Quality Assurance Protocol optimization
More informationSuitability of a new alignment correction method for industrial CT
Suitability of a new alignment correction method for industrial CT Matthias Elter 1, Nicole Maass 1, Peter Koch 2 1 Siemens AG, Healthcare Sector, Erlangen, Germany, e-mail: matthias.elter@siemens.com,
More informationAdapted acquisition trajectory and iterative reconstruction for few-views CT inspection
Adapted acquisition trajectory and iterative reconstruction for few-views CT inspection Caroline Vienne 1, Marius Costin 1 More info about this article: http://www.ndt.net/?id=21917 1 CEA, LIST, Département
More informationRadon Transform and Filtered Backprojection
Radon Transform and Filtered Backprojection Jørgen Arendt Jensen October 13, 2016 Center for Fast Ultrasound Imaging, Build 349 Department of Electrical Engineering Center for Fast Ultrasound Imaging Department
More informationOptimization of Cone Beam CT Reconstruction Algorithm Based on CUDA
Sensors & Transducers 2013 by IFSA http://www.sensorsportal.com Optimization of Cone Beam CT Reconstruction Algorithm Based on CUDA 1 Wang LI-Fang, 2 Zhang Shu-Hai 1 School of Electronics and Computer
More informationJoint ICTP-TWAS Workshop on Portable X-ray Analytical Instruments for Cultural Heritage. 29 April - 3 May, 2013
2455-5 Joint ICTP-TWAS Workshop on Portable X-ray Analytical Instruments for Cultural Heritage 29 April - 3 May, 2013 Lecture NoteBasic principles of X-ray Computed Tomography Diego Dreossi Elettra, Trieste
More informationA numerical simulator in VC++ on PC for iterative image reconstruction
Journal of X-Ray Science and Technology 11 (2003) 61 70 61 IOS Press A numerical simulator in VC++ on PC for iterative image reconstruction Xiang Li a,, Ming Jiang c and Ge Wang a,b a Department of Biomedical
More informationClinical Evaluation of GPU-Based Cone Beam Computed Tomography.
Clinical Evaluation of GPU-Based Cone Beam Computed Tomography. Peter B. Noël 1,2, Alan M. Walczak 2, Kenneth R. Hoffmann 1,2, Jinhui Xu 1, Jason J. Corso 1, and Sebastian Schafer 2 1 Department of Computer
More informationModeling Cone-Beam Tomographic Reconstruction U sing LogSMP: An Extended LogP Model for Clusters of SMPs
Modeling Cone-Beam Tomographic Reconstruction U sing LogSMP: An Extended LogP Model for Clusters of SMPs David A. Reimann, Vipin Chaudhary 2, and Ishwar K. Sethi 3 Department of Mathematics, Albion College,
More informationAcknowledgments and financial disclosure
AAPM 2012 Annual Meeting Digital breast tomosynthesis: basic understanding of physics principles James T. Dobbins III, Ph.D., FAAPM Director, Medical Physics Graduate Program Ravin Advanced Imaging Laboratories
More informationAN ELLIPTICAL ORBIT BACKPROJECTION FILTERING ALGORITHM FOR SPECT
1102 IEEE TRANSACTIONS ON NUCLEAR SCIENCE, VOL. 40, NO. 4, AUGUST 1993 AN ELLIPTICAL ORBIT BACKPROJECTION FILTERING ALGORITHM FOR SPECT Grant. T. Gullberg and Gengsheng L. Zeng, Department of Radiology,
More informationCone-beam mammo-computed tomography from data along two tilting arcs
Cone-beam mammo-computed tomography from data along two tilting arcs Kai Zeng, a Hengyong Yu, b Laurie L. Fajardo, c and Ge Wang d CT/Micro-CT Laboratory, Department of Radiology, University of Iowa, Iowa
More informationImplementation of a backprojection algorithm on CELL
Implementation of a backprojection algorithm on CELL Mario Koerner March 17, 2006 1 Introduction X-ray imaging is one of the most important imaging technologies in medical applications. It allows to look
More informationImprovements of FDK-type Helical Cone-beam CT Imaging
Improvements of FDK-type Helical Cone-beam CT Imaging Liang Hong Zhu School of Electrical & Electronic Engineering A thesis submitted to the in fulfillment of the requirements for the degree of Doctor
More informationReconstruction from Projections
Reconstruction from Projections M.C. Villa Uriol Computational Imaging Lab email: cruz.villa@upf.edu web: http://www.cilab.upf.edu Based on SPECT reconstruction Martin Šámal Charles University Prague,
More informationhigh performance medical reconstruction using stream programming paradigms
high performance medical reconstruction using stream programming paradigms This Paper describes the implementation and results of CT reconstruction using Filtered Back Projection on various stream programming
More informationBPF-type Region-of-interest Reconstruction for Parallel. Translational Computed Tomography
BPF-type Region-of-interest Reconstruction for Parallel Translational Computed Tomography Weiwen Wu a, Hengyong Yu b, Shaoyu Wang a, Fenglin Liu a,c,* a Key Lab of Optoelectronic Technology and Systems,
More informationWorkshop on Quantitative SPECT and PET Brain Studies January, 2013 PUCRS, Porto Alegre, Brasil Corrections in SPECT and PET
Workshop on Quantitative SPECT and PET Brain Studies 14-16 January, 2013 PUCRS, Porto Alegre, Brasil Corrections in SPECT and PET Físico João Alfredo Borges, Me. Corrections in SPECT and PET SPECT and
More informationProjection and Reconstruction-Based Noise Filtering Methods in Cone Beam CT
Projection and Reconstruction-Based Noise Filtering Methods in Cone Beam CT Benedikt Lorch 1, Martin Berger 1,2, Joachim Hornegger 1,2, Andreas Maier 1,2 1 Pattern Recognition Lab, FAU Erlangen-Nürnberg
More information3/27/2012 WHY SPECT / CT? SPECT / CT Basic Principles. Advantages of SPECT. Advantages of CT. Dr John C. Dickson, Principal Physicist UCLH
3/27/212 Advantages of SPECT SPECT / CT Basic Principles Dr John C. Dickson, Principal Physicist UCLH Institute of Nuclear Medicine, University College London Hospitals and University College London john.dickson@uclh.nhs.uk
More informationGPU implementation for rapid iterative image reconstruction algorithm
GPU implementation for rapid iterative image reconstruction algorithm and its applications in nuclear medicine Jakub Pietrzak Krzysztof Kacperski Department of Medical Physics, Maria Skłodowska-Curie Memorial
More informationSplitting-Based Statistical X-Ray CT Image Reconstruction with Blind Gain Correction
Splitting-Based Statistical X-Ray CT Image Reconstruction with Blind Gain Correction Hung Nien and Jeffrey A. Fessler Department of Electrical Engineering and Computer Science University of Michigan, Ann
More informationCUDA and OpenCL Implementations of 3D CT Reconstruction for Biomedical Imaging
CUDA and OpenCL Implementations of 3D CT Reconstruction for Biomedical Imaging Saoni Mukherjee, Nicholas Moore, James Brock and Miriam Leeser September 12, 2012 1 Outline Introduction to CT Scan, 3D reconstruction
More informationCentral Slice Theorem
Central Slice Theorem Incident X-rays y f(x,y) R x r x Detected p(, x ) The thick line is described by xcos +ysin =R Properties of Fourier Transform F [ f ( x a)] F [ f ( x)] e j 2 a Spatial Domain Spatial
More informationArtifact analysis of approximate helical cone-beam CT reconstruction algorithms
Artifact analysis of approximate helical cone-beam CT reconstruction algorithms Th. Köhler, a) R. Proksa, C. Bontus, and M. Grass Philips Research Laboratories, Sector Technical Systems, Roentgenstrasse
More informationEnhancement Image Quality of CT Using Single Slice Spiral Technique
Enhancement Image Quality of CT Using Single Slice Spiral Technique Doaa. N. Al Sheack 1 and Dr.Mohammed H. Ali Al Hayani 2 1 2 Electronic and Communications Engineering Department College of Engineering,
More informationUnmatched Projector/Backprojector Pairs in an Iterative Reconstruction Algorithm
548 IEEE TRANSACTIONS ON MEDICAL IMAGING, VOL. 19, NO. 5, MAY 2000 Unmatched Projector/Backprojector Pairs in an Iterative Reconstruction Algorithm Gengsheng L. Zeng*, Member, IEEE, and Grant T. Gullberg,
More informationSpiral ASSR Std p = 1.0. Spiral EPBP Std. 256 slices (0/300) Kachelrieß et al., Med. Phys. 31(6): , 2004
Spiral ASSR Std p = 1.0 Spiral EPBP Std p = 1.0 Kachelrieß et al., Med. Phys. 31(6): 1623-1641, 2004 256 slices (0/300) Advantages of Cone-Beam Spiral CT Image quality nearly independent of pitch Increase
More informationMULTI-PURPOSE 3D COMPUTED TOMOGRAPHY SYSTEM
MULTI-PURPOSE 3D COMPUTED TOMOGRAPHY SYSTEM M. Simon, C. Sauerwein, I. Tiseanu, S. Burdairon Hans Wälischmiller GmbH Klingleweg 8, D-88709 Meersburg, Germany e-mail: ms@hwm.com ABSTRACT A new flexible
More informationSpiral-CT. Benjamin Keck. 21. March 2006
Spiral-CT Benjamin Keck 21. March 2006 1 Motivation Spiral-CT offers reconstruction of long objects compared to circular filtered backprojection, where reconstruction is limited in z-direction. While the
More informationTemperature Distribution Measurement Based on ML-EM Method Using Enclosed Acoustic CT System
Sensors & Transducers 2013 by IFSA http://www.sensorsportal.com Temperature Distribution Measurement Based on ML-EM Method Using Enclosed Acoustic CT System Shinji Ohyama, Masato Mukouyama Graduate School
More informationArion: a realistic projection simulator for optimizing laboratory and industrial micro-ct
Arion: a realistic projection simulator for optimizing laboratory and industrial micro-ct J. DHAENE* 1, E. PAUWELS 1, T. DE SCHRYVER 1, A. DE MUYNCK 1, M. DIERICK 1, L. VAN HOOREBEKE 1 1 UGCT Dept. Physics
More informationF3-A5: Toward Model-Based Reconstruction in Scanned Baggage Security Applications
F3-A5: Toward Model-Based Reconstruction in Scanned Baggage Security Applications Abstract While traditional direct reconstruction algorithms such as filtered back projection depend on the analytic inversion
More informationIndex. aliasing artifacts and noise in CT images, 200 measurement of projection data, nondiffracting
Index Algebraic equations solution by Kaczmarz method, 278 Algebraic reconstruction techniques, 283-84 sequential, 289, 293 simultaneous, 285-92 Algebraic techniques reconstruction algorithms, 275-96 Algorithms
More informationDigital Image Processing
Digital Image Processing SPECIAL TOPICS CT IMAGES Hamid R. Rabiee Fall 2015 What is an image? 2 Are images only about visual concepts? We ve already seen that there are other kinds of image. In this lecture
More informationGPU acceleration of 3D forward and backward projection using separable footprints for X-ray CT image reconstruction
GPU acceleration of 3D forward and backward projection using separable footprints for X-ray CT image reconstruction Meng Wu and Jeffrey A. Fessler EECS Department University of Michigan Fully 3D Image
More informationA comparison of FBP and BPF reconstruction methods for circular X-ray tomography with off-center detector
A comparison of FBP and BPF reconstruction methods for circular X-ray tomography with off-center detector Dirk Schäfer, Michael Grass Philips Technologie GmbH Forschungslaboratorien, Röntgenstrasse, D
More informationMEDICAL IMAGING 2nd Part Computed Tomography
MEDICAL IMAGING 2nd Part Computed Tomography Introduction 2 In the last 30 years X-ray Computed Tomography development produced a great change in the role of diagnostic imaging in medicine. In convetional
More informationArtifact Mitigation in High Energy CT via Monte Carlo Simulation
PIERS ONLINE, VOL. 7, NO. 8, 11 791 Artifact Mitigation in High Energy CT via Monte Carlo Simulation Xuemin Jin and Robert Y. Levine Spectral Sciences, Inc., USA Abstract The high energy (< 15 MeV) incident
More informationSPECT reconstruction
Regional Training Workshop Advanced Image Processing of SPECT Studies Tygerberg Hospital, 19-23 April 2004 SPECT reconstruction Martin Šámal Charles University Prague, Czech Republic samal@cesnet.cz Tomography
More informationA Reconstruction Algorithm for Helical Cone-Beam SPECT
1092 IEEE TRANSACTIONS ON NUCLEAR SCIENCE, VOL. 40, NO. 4, AUGUST 1993 A Reconstruction Algorithm for Helical Cone-Beam SPECT Y. Weng, G. L. Zeng and G. T. Gullberg Medical Imaging Research Laboratory
More information