Marc Kachelrieß
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Marc Kachelrieß has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
Willi A. Kalender
Institute of Medical Physics, University of Erlangen, Nürnberg, Germany
7 shared publicationsMichael Knaup
Institute of Medical Physics, University of Erlangen-Nürnberg, Germany
3 shared publicationsDirk‐Alexander Sennst
Institute of Medical Physics, University of Erlangen-Nürnberg, Germany
1 shared publicationKatia Sourbelle
Institute of Medical Physics, University of Erlangen-Nürnberg, Henkestraße 91, D-91052 Erlangen Germany
1 shared publication- Michael Knaup
Institute of Medical Physics (Germany)
1 shared publication Oliver Watzke
1 shared publication
Latest Publications
- 27 October 2010
- Published by Springer Nature
- p. 1-19
Principles, Design, and Operation of Multi-slice CT
- 27 October 2010
- Published by Springer Nature
- p. 1-19
Principles, Design, and Operation of Multi-slice CT
- 14 February 2008
- Published by SPIE-Intl Soc Optical Eng
- Vol. 6812
Real-time computed tomography on the cell broadband engine processor
Tomographic image reconstruction is computationally very demanding. In all cases the backprojection represents the performance bottleneck due to the high operational count and resulting high demand put on the memory subsystem. In this study, we present the implementation of a cone beam reconstruction algorithm on the Cell Broadband Engine (CBE) processor aimed at real-time applications. The cone-beam backprojection performance was assessed by backprojecting a half-circle scan of 512 projections of 10242 pixels into a volume of size 5123 voxels. The projections are acquired on a C-Arm scanner and directed in real time to a CBE-based platform for real-time reconstruction. The acquisition speed typically ranges between 17 and 35 projections per second. On a CBE processor clocked at 3.2 GHz, our implementation performs this task in ~13 seconds, allowing for real time reconstruction.
- 14 February 2008
- Published by SPIE-Intl Soc Optical Eng
- Vol. 6812
Real-time computed tomography on the cell broadband engine processor
Tomographic image reconstruction is computationally very demanding. In all cases the backprojection represents the performance bottleneck due to the high operational count and resulting high demand put on the memory subsystem. In this study, we present the implementation of a cone beam reconstruction algorithm on the Cell Broadband Engine (CBE) processor aimed at real-time applications. The cone-beam backprojection performance was assessed by backprojecting a half-circle scan of 512 projections of 10242 pixels into a volume of size 5123 voxels. The projections are acquired on a C-Arm scanner and directed in real time to a CBE-based platform for real-time reconstruction. The acquisition speed typically ranges between 17 and 35 projections per second. On a CBE processor clocked at 3.2 GHz, our implementation performs this task in ~13 seconds, allowing for real time reconstruction.
- 27 March 2007
- Published by Wiley in Medical Physics
- Vol. 34 (4) , 1474-1486
Hyperfast parallel‐beam and cone‐beam backprojection using the cell general purpose hardware
Tomographic image reconstruction, such as the reconstruction of computed tomography projection values, of tomosynthesis data, positron emission tomography or SPECT events, and of magnetic resonance imaging data is computationally very demanding. One of the most time‐consuming steps is the backprojection. Recently, a novel general purpose architecture optimized for distributed computing became available: the cell broadband engine (CBE). To maximize image reconstruction speed we modified our parallel‐beam backprojection algorithm [two dimensional (2D)] and our perspective backprojection algorithm [three dimensional (3D), cone beam for flat–panel detectors] and optimized the code for the CBE. The algorithms are pixel or voxel driven, run with floating point accuracy and use linear (LI) or nearest neighbor (NN) interpolation between detector elements. For the parallel‐beam case, 512 projections per half rotation, 1024 detector channels, and an image of sizewas used. The cone‐beam backprojection performance was assessed by backprojecting a full circle scan of 512 projections of sizeinto a volume of sizevoxels. The field of view was chosen to completely lie within the field of measurement and the pixel or voxel size was set to correspond to the detector element size projected to the center of rotation divided by. Both the PC and the CBE were clocked at. For the parallel backprojection of 512 projections into aimage, a throughput of(LI) and(NN) was measured on the PC, whereas the CBE achieved(LI) and(NN), respectively. The cone‐beam backprojection of 512 projections into thevolume tookon the PC and is as fast ason the cell. Thereby, the cell greatly outperforms today's top‐notch backprojections based on graphical processing units. Using both CBEs of our dual cell‐based blade (Mercury Computer Systems) allows to 2D backproject 330 images/s and one can complete the 3D cone‐beam backprojection in.
- 27 March 2007
- Published by Wiley in Medical Physics
- Vol. 34 (4) , 1474-1486
Hyperfast parallel‐beam and cone‐beam backprojection using the cell general purpose hardware
Tomographic image reconstruction, such as the reconstruction of computed tomography projection values, of tomosynthesis data, positron emission tomography or SPECT events, and of magnetic resonance imaging data is computationally very demanding. One of the most time‐consuming steps is the backprojection. Recently, a novel general purpose architecture optimized for distributed computing became available: the cell broadband engine (CBE). To maximize image reconstruction speed we modified our parallel‐beam backprojection algorithm [two dimensional (2D)] and our perspective backprojection algorithm [three dimensional (3D), cone beam for flat–panel detectors] and optimized the code for the CBE. The algorithms are pixel or voxel driven, run with floating point accuracy and use linear (LI) or nearest neighbor (NN) interpolation between detector elements. For the parallel‐beam case, 512 projections per half rotation, 1024 detector channels, and an image of sizewas used. The cone‐beam backprojection performance was assessed by backprojecting a full circle scan of 512 projections of sizeinto a volume of sizevoxels. The field of view was chosen to completely lie within the field of measurement and the pixel or voxel size was set to correspond to the detector element size projected to the center of rotation divided by. Both the PC and the CBE were clocked at. For the parallel backprojection of 512 projections into aimage, a throughput of(LI) and(NN) was measured on the PC, whereas the CBE achieved(LI) and(NN), respectively. The cone‐beam backprojection of 512 projections into thevolume tookon the PC and is as fast ason the cell. Thereby, the cell greatly outperforms today's top‐notch backprojections based on graphical processing units. Using both CBEs of our dual cell‐based blade (Mercury Computer Systems) allows to 2D backproject 330 images/s and one can complete the 3D cone‐beam backprojection in.
- 21 June 2006
- Published by Wiley in Medical Physics
- Vol. 33 (7Part1) , 2435-2447
Multithreaded cardiac CT
Phase‐correlated CT, as it is used for cardiac imaging, is the most popular and the most important but also the most demanding special CT application in the clinical routine, today. Basically, it fulfills the four‐dimensional imaging task of depicting a quasiperiodically moving object at any desired motion phase with significantly reduced motion artifacts. Although image quality with phase‐correlated reconstruction is far better than with standard reconstruction, there are motion artifacts remaining and improvements of temporal resolution are required. As a well‐known alternative to simply decreasing rotation time, we consider a spiral cone‐beam CT scanner that has x‐ray guns and detectors mounted. We call this a multisource or a multithreaded CT scanner. Aiming for improved temporal resolution the relative temporal resolution , which measures the fraction of a motion period that enters the image, is studied as a function of the motion rate (heart rate) and the degree of scan overlap (pitch value) for various configurations. The parameters to optimize are the number of threads and the interthread parameters and , which are the angular and the longitudinal separation between adjacent threads, respectively. To demonstrate the improvements approximate image reconstruction of multithreaded raw data is performed by using a generalization of the extended parallel back projection cone‐beam reconstruction algorithm [Med. Phys. 31(6), 1623–1641 (2004)] to the case of multithreaded CT. Reconstructions of a simulated cardiac motion phantom and of simulated semi‐antropomorphic phantoms are presented for two and three threads and compared to the single‐threaded case to demonstrate the potential of multithreaded cardiac CT. Patient data were acquired using a clinical double‐threaded CT scanner to validate the theoretical results. The optimum angle between the tubes is 90° for a double‐threaded system, and for triple‐threaded scanners it is 60° or 120°. In all cases, results as an optimum, which means that the threads should be mounted in the same transversal plane. However, the dependency of the temporal resolution on is very weak and a longitudinal separation would not deteriorate image quality. The mean temporal resolution achievable with an optimized multithreaded CT scanner is a factor of better than the mean temporal resolution obtained with a single‐threaded scanner. The standard reconstructions showed decreased cone‐beam artifacts with multithreaded CT compared to the single‐threaded case. Our phase‐correlated reconstructions demonstrate that temporal resolution is significantly improved with multithreaded CT. The clinical patient data confirm our results.
- 21 June 2006
- Published by Wiley in Medical Physics
- Vol. 33 (7Part1) , 2435-2447
Multithreaded cardiac CT
Phase‐correlated CT, as it is used for cardiac imaging, is the most popular and the most important but also the most demanding special CT application in the clinical routine, today. Basically, it fulfills the four‐dimensional imaging task of depicting a quasiperiodically moving object at any desired motion phase with significantly reduced motion artifacts. Although image quality with phase‐correlated reconstruction is far better than with standard reconstruction, there are motion artifacts remaining and improvements of temporal resolution are required. As a well‐known alternative to simply decreasing rotation time, we consider a spiral cone‐beam CT scanner that has x‐ray guns and detectors mounted. We call this a multisource or a multithreaded CT scanner. Aiming for improved temporal resolution the relative temporal resolution , which measures the fraction of a motion period that enters the image, is studied as a function of the motion rate (heart rate) and the degree of scan overlap (pitch value) for various configurations. The parameters to optimize are the number of threads and the interthread parameters and , which are the angular and the longitudinal separation between adjacent threads, respectively. To demonstrate the improvements approximate image reconstruction of multithreaded raw data is performed by using a generalization of the extended parallel back projection cone‐beam reconstruction algorithm [Med. Phys. 31(6), 1623–1641 (2004)] to the case of multithreaded CT. Reconstructions of a simulated cardiac motion phantom and of simulated semi‐antropomorphic phantoms are presented for two and three threads and compared to the single‐threaded case to demonstrate the potential of multithreaded cardiac CT. Patient data were acquired using a clinical double‐threaded CT scanner to validate the theoretical results. The optimum angle between the tubes is 90° for a double‐threaded system, and for triple‐threaded scanners it is 60° or 120°. In all cases, results as an optimum, which means that the threads should be mounted in the same transversal plane. However, the dependency of the temporal resolution on is very weak and a longitudinal separation would not deteriorate image quality. The mean temporal resolution achievable with an optimized multithreaded CT scanner is a factor of better than the mean temporal resolution obtained with a single‐threaded scanner. The standard reconstructions showed decreased cone‐beam artifacts with multithreaded CT compared to the single‐threaded case. Our phase‐correlated reconstructions demonstrate that temporal resolution is significantly improved with multithreaded CT. The clinical patient data confirm our results.
- 19 April 2006
- Published by Wiley in Medical Physics
- Vol. 33 (5) , 1269-1274
Empirical cupping correction: A first‐order raw data precorrection for cone‐beam computed tomography
We propose an empirical cupping correction (ECC) algorithm to correct for CT cupping artifacts that are induced by nonlinearities in the projection data. The method is raw data based, empirical, and requires neither knowledge of the x‐ray spectrum nor of the attenuation coefficients. It aims at linearizing the attenuation data using a precorrection function of polynomial form. The coefficients of the polynomial are determined once using a calibration scan of a homogeneous phantom. Computing the coefficients is done in image domain by fitting a series of basis images to a template image. The template image is obtained directly from the uncorrected phantom image and no assumptions on the phantom size or of its positioning are made. Raw data are precorrected by passing them through the once‐determined polynomial. As an example we demonstrate how ECC can be used to perform water precorrection for an in vivo micro‐CT scanner (TomoScope 30 s, VAMP GmbH, Erlangen, Germany). For this particular case, practical considerations regarding the definition of the template image are given. ECC strives to remove the cupping artifacts and to obtain well‐calibrated CT values. Although ECC is a first‐order correction and cannot compete with iterative higher‐order beam hardening or scatter correction algorithms, our in vivo mouse images show a significant reduction of bone‐induced artifacts as well. A combination of ECC with analytical techniques yielding a hybrid cupping correction method is possible and allows for channel‐dependent correction functions.
- 19 April 2006
- Published by Wiley in Medical Physics
- Vol. 33 (5) , 1269-1274
Empirical cupping correction: A first‐order raw data precorrection for cone‐beam computed tomography
We propose an empirical cupping correction (ECC) algorithm to correct for CT cupping artifacts that are induced by nonlinearities in the projection data. The method is raw data based, empirical, and requires neither knowledge of the x‐ray spectrum nor of the attenuation coefficients. It aims at linearizing the attenuation data using a precorrection function of polynomial form. The coefficients of the polynomial are determined once using a calibration scan of a homogeneous phantom. Computing the coefficients is done in image domain by fitting a series of basis images to a template image. The template image is obtained directly from the uncorrected phantom image and no assumptions on the phantom size or of its positioning are made. Raw data are precorrected by passing them through the once‐determined polynomial. As an example we demonstrate how ECC can be used to perform water precorrection for an in vivo micro‐CT scanner (TomoScope 30 s, VAMP GmbH, Erlangen, Germany). For this particular case, practical considerations regarding the definition of the template image are given. ECC strives to remove the cupping artifacts and to obtain well‐calibrated CT values. Although ECC is a first‐order correction and cannot compete with iterative higher‐order beam hardening or scatter correction algorithms, our in vivo mouse images show a significant reduction of bone‐induced artifacts as well. A combination of ECC with analytical techniques yielding a hybrid cupping correction method is possible and allows for channel‐dependent correction functions.
- 18 April 2005
- Published by Wiley in Medical Physics
- Vol. 32 (5) , 1321-1334
Presampling, algorithm factors, and noise: Considerations for CT in particular and for medical imaging in general
CT scanners acquire noisy data at discrete sample positions. Typically, a convention of how to continue these data from discrete integer positions to the continuous domain must be applied during processing. We study the properties of three typical one‐dimensional spatial domain interpolation algorithms in terms of a cost or quality factor . This figure of merit is a function of spatial resolution, data noise, and dose and is used to optimize detector design. Spatial resolution is defined as either mean square width or as the full width at half maximum of the point spread function (PSF). Our results show that a trapezoidal interpolation algorithm is optimal for the high resolution domain (relative to the detector aperture size ) and should be replaced by a triangular or Gaussian interpolation function for spatial resolutions of about or larger; these result in bell‐shaped PSFs. Assuming such a hybrid algorithm we find a 1.5‐fold increase of —this is equivalent to 50% improved dose usage—when smoothing the data to a spatial resolution of or more compared to a highest resolution reconstruction. Therefore it is advisable to use detectors of one‐third of the size of the desired spatial resolution and to compensate for the 1.5‐fold increase in by reducing dose by 33%. Under the presence of moderately sized septa (e.g., 10% of the spatial resolution element size) the benefit of optimizing still lies in the order of 30% improved dose usage; in that case the detector size should be on the order of and a dose reduction of 23% can be achieved. Again, bell‐shaped PSFs show a better tradeoff between noise and resolution for a given dose than rectangular‐shaped PSFs. The general interpretation of our results is that the degree of freedom of choosing the weighting or interpolation function for a given resolution is large for small detectors and small for large detectors. Thus systems with small have a higher potential of optimization compared to systems with large . Similarly, detector binning, which corresponds to replacing by , should be avoided. Note that the figures reported correspond to a one‐dimensional interpolation. Two‐dimensional detectors typically separate and resulting quality factors can be easily obtained by multiplication. Then, is expected to improve by a factor of without septa and by a factor of with septa. This indicates that dose can be reduced by about 56% and about 41%, respectively. Our findings are general and not restricted to CT. They can be readily applied to medical or nonmedical imaging devices and digital detectors and they may also turn out to be useful in other fields.
- 18 April 2005
- Published by Wiley in Medical Physics
- Vol. 32 (5) , 1321-1334
Presampling, algorithm factors, and noise: Considerations for CT in particular and for medical imaging in general
CT scanners acquire noisy data at discrete sample positions. Typically, a convention of how to continue these data from discrete integer positions to the continuous domain must be applied during processing. We study the properties of three typical one‐dimensional spatial domain interpolation algorithms in terms of a cost or quality factor . This figure of merit is a function of spatial resolution, data noise, and dose and is used to optimize detector design. Spatial resolution is defined as either mean square width or as the full width at half maximum of the point spread function (PSF). Our results show that a trapezoidal interpolation algorithm is optimal for the high resolution domain (relative to the detector aperture size ) and should be replaced by a triangular or Gaussian interpolation function for spatial resolutions of about or larger; these result in bell‐shaped PSFs. Assuming such a hybrid algorithm we find a 1.5‐fold increase of —this is equivalent to 50% improved dose usage—when smoothing the data to a spatial resolution of or more compared to a highest resolution reconstruction. Therefore it is advisable to use detectors of one‐third of the size of the desired spatial resolution and to compensate for the 1.5‐fold increase in by reducing dose by 33%. Under the presence of moderately sized septa (e.g., 10% of the spatial resolution element size) the benefit of optimizing still lies in the order of 30% improved dose usage; in that case the detector size should be on the order of and a dose reduction of 23% can be achieved. Again, bell‐shaped PSFs show a better tradeoff between noise and resolution for a given dose than rectangular‐shaped PSFs. The general interpretation of our results is that the degree of freedom of choosing the weighting or interpolation function for a given resolution is large for small detectors and small for large detectors. Thus systems with small have a higher potential of optimization compared to systems with large . Similarly, detector binning, which corresponds to replacing by , should be avoided. Note that the figures reported correspond to a one‐dimensional interpolation. Two‐dimensional detectors typically separate and resulting quality factors can be easily obtained by multiplication. Then, is expected to improve by a factor of without septa and by a factor of with septa. This indicates that dose can be reduced by about 56% and about 41%, respectively. Our findings are general and not restricted to CT. They can be readily applied to medical or nonmedical imaging devices and digital detectors and they may also turn out to be useful in other fields.
- 26 May 2004
- Published by Wiley in Medical Physics
- Vol. 31 (6) , 1623-1641
Extended parallel backprojection for standard three‐dimensional and phase‐correlated four‐dimensional axial and spiral cone‐beam CT with arbitrary pitch, arbitrary cone‐angle, and 100% dose usage
We have developed a new approximate Feldkamp‐type algorithm that we call the extended parallel backprojection (EPBP). Its main features are a phase‐weighted backprojection and a voxel‐by‐voxel 180° normalization. The first feature ensures three‐dimensional (3‐D) and 4‐D capabilities with one and the same algorithm; the second ensures 100% detector usage (each ray is accounted for). The algorithm was evaluated using simulated data of a thorax phantom and a cardiac motion phantom for scanners with up to 256 slices. Axial (circle and sequence) and spiral scan trajectories were investigated. The standard reconstructions (EPBPStd) are of high quality, even for as many as 256 slices. The cardiac reconstructions (EPBPCI) are of high quality as well and show no significant deterioration of objects even far off the center of rotation. Since EPBPCI uses the cardio interpolation (CI) phase weighting the temporal resolution is equivalent to that of the well‐established single‐slice and multislice cardiac approaches 180°CI, 180°MCI, and ASSRCI, respectively, and lies in the order of 50 to 100 ms for rotation times between 0.4 and 0.5 s. EPBP appears to fulfill all required demands. Especially the phase‐correlated EPBP reconstruction of cardiac multiple circle scan data is of high interest, e.g., for dynamic perfusion studies of the heart.
- 26 May 2004
- Published by Wiley in Medical Physics
- Vol. 31 (6) , 1623-1641
Extended parallel backprojection for standard three‐dimensional and phase‐correlated four‐dimensional axial and spiral cone‐beam CT with arbitrary pitch, arbitrary cone‐angle, and 100% dose usage
We have developed a new approximate Feldkamp‐type algorithm that we call the extended parallel backprojection (EPBP). Its main features are a phase‐weighted backprojection and a voxel‐by‐voxel 180° normalization. The first feature ensures three‐dimensional (3‐D) and 4‐D capabilities with one and the same algorithm; the second ensures 100% detector usage (each ray is accounted for). The algorithm was evaluated using simulated data of a thorax phantom and a cardiac motion phantom for scanners with up to 256 slices. Axial (circle and sequence) and spiral scan trajectories were investigated. The standard reconstructions (EPBPStd) are of high quality, even for as many as 256 slices. The cardiac reconstructions (EPBPCI) are of high quality as well and show no significant deterioration of objects even far off the center of rotation. Since EPBPCI uses the cardio interpolation (CI) phase weighting the temporal resolution is equivalent to that of the well‐established single‐slice and multislice cardiac approaches 180°CI, 180°MCI, and ASSRCI, respectively, and lies in the order of 50 to 100 ms for rotation times between 0.4 and 0.5 s. EPBP appears to fulfill all required demands. Especially the phase‐correlated EPBP reconstruction of cardiac multiple circle scan data is of high interest, e.g., for dynamic perfusion studies of the heart.
- 20 June 2002
- Published by Wiley in Medical Physics
- Vol. 29 (7) , 1489-1503
Kymogram detection and kymogram‐correlated image reconstruction from subsecond spiral computed tomography scans of the heart
Subsecond single‐slice, multi‐slice or cone‐beam spiral computed tomography (SSCT, MSCT, CBCT) offer great potential for improving heart imaging. Together with the newly developed phase‐correlated cardiac reconstruction algorithms 180°MCD and 180°MCI [Med. Phys. 27, 1881–1902 (2000)] or related algorithms provided by the CT manufacturers, high image quality can be achieved. These algorithms require information about the cardiac motion, i.e., typically the simultaneously recorded electrocardiogram (ECG), to synchronize the reconstruction with the cardiac motion. Neither data acquired without ECG information (standard patients) nor acquisitions with corrupted ECG information can be handled adequately. We developed a method to extract the appropriate information about cardiac motion directly from the measured raw data (projection data). The so‐called kymogram function is a measure of the cardiac motion as a function of time t or as a function of the projection angle α. In contrast to the ECG which is a global measure of the heart's electric excitation, the kymogram is a local measure of the heart motion at the z‐position at projection angle α. The patient's local heart rate as well as the necessary synchronization information to be used with phase‐correlated algorithms can be extracted from the kymogram by using a series of signal processing steps. The kymogram information is shown to be adequate to substitute the ECG information. Computer simulations with simulated ECG and patient measurements with simultaneously acquired ECG were carried out for a multislice scanner providing slices to evaluate these new approaches. Both the ECG function and the kymogram function were used for reconstruction. Both were highly correlated regarding the periodicity information used for reconstruction. In 21 out of 25 consecutive cases the kymogram approach was equivalent to the ECG‐correlated reconstruction; only minor differences in image quality between both methods were observed. For one patient the synchronization information detected by the ECG monitor turned out to be wrong; here, the kymogram constituted the only approach that provided useful reconstructions. Patient studies with 12 and 16 slices indicate the usefulness of our approach for cone‐beam CT scans. Kymogram‐correlated reconstructions also appear to have the potential to improve imaging of pericardial lung areas in general.
- 20 June 2002
- Published by Wiley in Medical Physics
- Vol. 29 (7) , 1489-1503
Kymogram detection and kymogram‐correlated image reconstruction from subsecond spiral computed tomography scans of the heart
Subsecond single‐slice, multi‐slice or cone‐beam spiral computed tomography (SSCT, MSCT, CBCT) offer great potential for improving heart imaging. Together with the newly developed phase‐correlated cardiac reconstruction algorithms 180°MCD and 180°MCI [Med. Phys. 27, 1881–1902 (2000)] or related algorithms provided by the CT manufacturers, high image quality can be achieved. These algorithms require information about the cardiac motion, i.e., typically the simultaneously recorded electrocardiogram (ECG), to synchronize the reconstruction with the cardiac motion. Neither data acquired without ECG information (standard patients) nor acquisitions with corrupted ECG information can be handled adequately. We developed a method to extract the appropriate information about cardiac motion directly from the measured raw data (projection data). The so‐called kymogram function is a measure of the cardiac motion as a function of time t or as a function of the projection angle α. In contrast to the ECG which is a global measure of the heart's electric excitation, the kymogram is a local measure of the heart motion at the z‐position at projection angle α. The patient's local heart rate as well as the necessary synchronization information to be used with phase‐correlated algorithms can be extracted from the kymogram by using a series of signal processing steps. The kymogram information is shown to be adequate to substitute the ECG information. Computer simulations with simulated ECG and patient measurements with simultaneously acquired ECG were carried out for a multislice scanner providing slices to evaluate these new approaches. Both the ECG function and the kymogram function were used for reconstruction. Both were highly correlated regarding the periodicity information used for reconstruction. In 21 out of 25 consecutive cases the kymogram approach was equivalent to the ECG‐correlated reconstruction; only minor differences in image quality between both methods were observed. For one patient the synchronization information detected by the ECG monitor turned out to be wrong; here, the kymogram constituted the only approach that provided useful reconstructions. Patient studies with 12 and 16 slices indicate the usefulness of our approach for cone‐beam CT scans. Kymogram‐correlated reconstructions also appear to have the potential to improve imaging of pericardial lung areas in general.
- 9 April 2001
- Published by Wiley in Medical Physics
- Vol. 28 (4) , 475-490
Generalized multi‐dimensional adaptive filtering for conventional and spiral single‐slice, multi‐slice, and cone‐beam CT
In modern computed tomography (CT) there is a strong desire to reduce patient dose and/or to improve image quality by increasing spatial resolution and decreasing image noise. These are conflicting demands since increasing resolution at a constant noise level or decreasing noise at a constant resolution level implies a higher demand on x‐ray power and an increase of patient dose. X‐ray tube power is limited due to technical reasons. We therefore developed a generalized multi‐dimensional adaptive filtering approach that applies nonlinear filters in up to three dimensions in the raw data domain. This new method differs from approaches in the literature since our nonlinear filters are applied not only in the detector row direction but also in the view and in the z‐direction. This true three‐dimensional filtering improves the quantum statistics of a measured projection value proportional to the third power of the filter size. Resolution tradeoffs are shared among these three dimensions and thus are considerably smaller as compared to one‐dimensional smoothing approaches. Patient data of spiral and sequential single‐ and multi‐slice CT scans as well as simulated spiral cone‐beam data were processed to evaluate these new approaches. Image quality was assessed by evaluation of difference images, by measuring the image noise and the noise reduction, and by calculating the image resolution using point spread functions. The use of generalized adaptive filters helps to reduce image noise or, alternatively, patient dose. Image noise structures, typically along the direction of the highest attenuation, are effectively reduced. Noise reduction values of typically 30%–60% can be achieved in noncylindrical body regions like the shoulder. The loss in image resolution remains below 5% for all cases. In addition, the new method has a great potential to reduce metal artifacts, e.g., in the hip region.
- 9 April 2001
- Published by Wiley in Medical Physics
- Vol. 28 (4) , 475-490
Generalized multi‐dimensional adaptive filtering for conventional and spiral single‐slice, multi‐slice, and cone‐beam CT
In modern computed tomography (CT) there is a strong desire to reduce patient dose and/or to improve image quality by increasing spatial resolution and decreasing image noise. These are conflicting demands since increasing resolution at a constant noise level or decreasing noise at a constant resolution level implies a higher demand on x‐ray power and an increase of patient dose. X‐ray tube power is limited due to technical reasons. We therefore developed a generalized multi‐dimensional adaptive filtering approach that applies nonlinear filters in up to three dimensions in the raw data domain. This new method differs from approaches in the literature since our nonlinear filters are applied not only in the detector row direction but also in the view and in the z‐direction. This true three‐dimensional filtering improves the quantum statistics of a measured projection value proportional to the third power of the filter size. Resolution tradeoffs are shared among these three dimensions and thus are considerably smaller as compared to one‐dimensional smoothing approaches. Patient data of spiral and sequential single‐ and multi‐slice CT scans as well as simulated spiral cone‐beam data were processed to evaluate these new approaches. Image quality was assessed by evaluation of difference images, by measuring the image noise and the noise reduction, and by calculating the image resolution using point spread functions. The use of generalized adaptive filters helps to reduce image noise or, alternatively, patient dose. Image noise structures, typically along the direction of the highest attenuation, are effectively reduced. Noise reduction values of typically 30%–60% can be achieved in noncylindrical body regions like the shoulder. The loss in image resolution remains below 5% for all cases. In addition, the new method has a great potential to reduce metal artifacts, e.g., in the hip region.