CA2396804A1 - Fast hierarchical backprojection for 3d radon transform - Google Patents
Fast hierarchical backprojection for 3d radon transform Download PDFInfo
- Publication number
- CA2396804A1 CA2396804A1 CA002396804A CA2396804A CA2396804A1 CA 2396804 A1 CA2396804 A1 CA 2396804A1 CA 002396804 A CA002396804 A CA 002396804A CA 2396804 A CA2396804 A CA 2396804A CA 2396804 A1 CA2396804 A1 CA 2396804A1
- Authority
- CA
- Canada
- Prior art keywords
- subsinograms
- sinogram
- volume
- subdividing
- subdivisions
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Abandoned
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T11/00—2D [Two Dimensional] image generation
- G06T11/001—Texturing; Colouring; Generation of texture or colour
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T11/00—2D [Two Dimensional] image generation
- G06T11/003—Reconstruction from projections, e.g. tomography
- G06T11/006—Inverse problem, transformation from projection-space into object-space, e.g. transform methods, back-projection, algebraic methods
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10S378/00—X-ray or gamma ray systems or devices
- Y10S378/901—Computer tomography program or processor
Abstract
Data representing a three-dimensional-3D sinogram, samples of the 3D Radon Transform (10, 12) is backprojected to reconstruct a 3D volume. The backprojection requires O(N3log2 N) plane-integral projections. An input sinogram (10, 12) is subdivided into a plurality of subsinograms using either an exact (12a, 12h) or approximate (24a, 24h) decomposition algorithm. The subsinograms are repeatedly subdivided until they represent volumes as small as one voxel. The smallest subsinograms are backprojected using the direct approach to form a plurality of subvolumes, and the subvolumes are recursively aggregated (18a, 18h, 20, 28a, 28h, 30) to form a final volume. Two subdivision algorithms are used. The first is an exact decomposition algorithm, which is accurate, but slow. The second is an approximate decomposition algorithm which is less accurate, but fast. By using both subdivision algorithms appropriately, high quality backprojections are computed significantly faster than existing techniques.
Description
-1_ FAST HIERARCHICAL BACKPROJECTION
This is a continuation-in-part of Serial No. 09/418,933, filed October 15, 1999, which is a continuation-in-part of Serial No. 09/338,677, filed June 23, 1999. This is also a continuation-in-part of Serial No. 09/419,415, filed October 15, 1999, which is a continuation-in-part of Serial No. 09/338,092, filed June 23, 1999. All of the parent applications are incorporated by reference in their entirety.
TECHNICAL FIELD
The present invention generally concerns imaging. More specifically, the present invention concerns a method of reconstructing three-dimensional tomographic volumes from projections.
BACKGROUND ART
Tomographic volumes are created from line integral measurements of an unknown object at a variety of orientations. These line integral measurements, which may represent measurements of density, reflectivity, etc., are then processed to yield a volume that represents the unknown object. Data L 5 generated in this manner is collected into a sinogram, and the sinogram is processed and backprojected to create two-dimensional images or three-dimensional volumes.
The process of backprojection of three-dimensional (3D) Radon transform data is a key step in the reconstruction of volumes from tomographic data. The 3D Radon transform underlies a number of existing and emerging technologies, such as Synthetic Aperture Radar (SAR), volumetric Magnetic Resonance Imaging (MRI), cone-beam X-ray tomo~graphy, etc. The backprojection step is intensive from a computation standpoint, and slow.
Thus, there is a need for methods for backprojecting 3D Radon data which are less costly and less time consuming.
Accordingly, one object of this invention is to provide new and improved imaging methods.
Another object is to provide new and improved methods for backprojecting 3D volume data.
Still another obj ect is to provide new and improved methods for backprojecting 3D volume data which are less costly in terms of hardware and computational expense, and faster than known methods.
DISCLOSURE OF THE INVENTION
Data representing a 3D sinogram (array of numbers) is backproj ected to reconstruct a 3D volume. The transformation requires N3 loge N operations.
An input sinogram is subdivided into a plurality of subsinograms using decomposition algorithms. The subsinograms are repeatedly subdivided until they represent volumes as small as one voxel. The smallest subsinograms are ~0 backprojected using the direct approach to form a plurality of subvolumes, and the subvolumes are aggregated to form a final volume.
Two subdivision algorithms are used. The first is an exact decomposition algorithm, which is accurate, but slow. The second is an approximate decomposition algorithm which is less accurate, but fast. By using ?5 both subdivision algorithms appropriately, high quality backprojections are computed significantly faster than existing techniques.
This is a continuation-in-part of Serial No. 09/418,933, filed October 15, 1999, which is a continuation-in-part of Serial No. 09/338,677, filed June 23, 1999. This is also a continuation-in-part of Serial No. 09/419,415, filed October 15, 1999, which is a continuation-in-part of Serial No. 09/338,092, filed June 23, 1999. All of the parent applications are incorporated by reference in their entirety.
TECHNICAL FIELD
The present invention generally concerns imaging. More specifically, the present invention concerns a method of reconstructing three-dimensional tomographic volumes from projections.
BACKGROUND ART
Tomographic volumes are created from line integral measurements of an unknown object at a variety of orientations. These line integral measurements, which may represent measurements of density, reflectivity, etc., are then processed to yield a volume that represents the unknown object. Data L 5 generated in this manner is collected into a sinogram, and the sinogram is processed and backprojected to create two-dimensional images or three-dimensional volumes.
The process of backprojection of three-dimensional (3D) Radon transform data is a key step in the reconstruction of volumes from tomographic data. The 3D Radon transform underlies a number of existing and emerging technologies, such as Synthetic Aperture Radar (SAR), volumetric Magnetic Resonance Imaging (MRI), cone-beam X-ray tomo~graphy, etc. The backprojection step is intensive from a computation standpoint, and slow.
Thus, there is a need for methods for backprojecting 3D Radon data which are less costly and less time consuming.
Accordingly, one object of this invention is to provide new and improved imaging methods.
Another object is to provide new and improved methods for backprojecting 3D volume data.
Still another obj ect is to provide new and improved methods for backprojecting 3D volume data which are less costly in terms of hardware and computational expense, and faster than known methods.
DISCLOSURE OF THE INVENTION
Data representing a 3D sinogram (array of numbers) is backproj ected to reconstruct a 3D volume. The transformation requires N3 loge N operations.
An input sinogram is subdivided into a plurality of subsinograms using decomposition algorithms. The subsinograms are repeatedly subdivided until they represent volumes as small as one voxel. The smallest subsinograms are ~0 backprojected using the direct approach to form a plurality of subvolumes, and the subvolumes are aggregated to form a final volume.
Two subdivision algorithms are used. The first is an exact decomposition algorithm, which is accurate, but slow. The second is an approximate decomposition algorithm which is less accurate, but fast. By using ?5 both subdivision algorithms appropriately, high quality backprojections are computed significantly faster than existing techniques.
BRIEF DESCRIPTION OF THE DRAWINGS
The above mentioned and other features of this invention and the manner of obtaining them will become more apparent, and the invention itself will be best understood by reference to the following description of an embodiment of the invention taken in conjunction with the accompanying drawings, in which:
FIG. 1 is a block diagram of apparatus for use with the present invention;
FIG. 2 is a diagram of a known decomposition method;
FIG. 3 is a diagram of a decomposition utilizing exact subdivision;
and FIG. 4 is a diagram of a decomposition utilizing approximate subdivision.
DETAILED DESCRIPTION
The present invention has application in a variety of imaging apparatus, including CT scanners. Typical imaging apparatus 1 (FIG. 1) includes a scanner 2 which acquires data from an object such as a head, and sends raw data to a receiver 3. The data is processed in a post-processor 4, which can include re-binning, filtering, or other processes. The post-processor 4 generates a sinogram which is backprojected in a Hierarchical BackProjection (HBP) apparatus 5. The ~0 HBP 5 produces an image which is shown on a display 6 or other suitable output device.
Known backprojection is described by Fig. 2, in which an input 34 is a sinogram (3D array of numbers) mapped through backprojection 36 to a volume (3D array of numbers) 38. The straightforward approach to this ?5 transformation required 1V5 operations, where N characterizes the linear size of both the input and output.
The process of this invention is a fast method for performing this transformation which requires N3 loge N operations under the same circumstances.
The above mentioned and other features of this invention and the manner of obtaining them will become more apparent, and the invention itself will be best understood by reference to the following description of an embodiment of the invention taken in conjunction with the accompanying drawings, in which:
FIG. 1 is a block diagram of apparatus for use with the present invention;
FIG. 2 is a diagram of a known decomposition method;
FIG. 3 is a diagram of a decomposition utilizing exact subdivision;
and FIG. 4 is a diagram of a decomposition utilizing approximate subdivision.
DETAILED DESCRIPTION
The present invention has application in a variety of imaging apparatus, including CT scanners. Typical imaging apparatus 1 (FIG. 1) includes a scanner 2 which acquires data from an object such as a head, and sends raw data to a receiver 3. The data is processed in a post-processor 4, which can include re-binning, filtering, or other processes. The post-processor 4 generates a sinogram which is backprojected in a Hierarchical BackProjection (HBP) apparatus 5. The ~0 HBP 5 produces an image which is shown on a display 6 or other suitable output device.
Known backprojection is described by Fig. 2, in which an input 34 is a sinogram (3D array of numbers) mapped through backprojection 36 to a volume (3D array of numbers) 38. The straightforward approach to this ?5 transformation required 1V5 operations, where N characterizes the linear size of both the input and output.
The process of this invention is a fast method for performing this transformation which requires N3 loge N operations under the same circumstances.
In the present invention, the input sinogram is subdivided into a plurality of subsinograms using decomposition algorithms. The subsinograms are repeatedly subdivided until they represent volumes as small as one voxel. Then, the smallest subsinograms are backprojected using the direct approach to form a plurality of subvolumes. The subvolumes axe aggregated to form a final volume.
Backprojection is accomplished using two subdivision algorithms.
One algorithm is an exact algorithm, which is accurate, but slow, and the other algorithm is an approximate algorithm which is less accurate, but fast. Both algorithms are based on a 3D Radon transform.
The 3D Radon transform for a spatial density h(x), is given by h(x) ~~
xw r where w is a point on the unit 3D sphere. The sinogram g(m, h, k) is indexed by three integers, the first two representing the angular coordinates, and the third representing samples in the radial coordinate. For example, g(m, n, k) =
q(co",, n, kT), where T is the radial sampling period, and w",," with m, h E { 1,. . .,P}
are the I S PZ orientations at which the 3D Radon transform is sampled.
The backprojection operation is computed by first radially interpolating the backprojected data:
g~(m~ h~ s) _ ~ g(m~ yl~ k)~ {s- (k+'~,~t,»)~ (~) n where c~ is the radial interpolation kernel, T is the radial sampling period, m, h E
{0,. . .,P -1 }, and i"1," E [-.5, .5]. Next, this is backprojected using the following ~0 direct formula:
Backprojection is accomplished using two subdivision algorithms.
One algorithm is an exact algorithm, which is accurate, but slow, and the other algorithm is an approximate algorithm which is less accurate, but fast. Both algorithms are based on a 3D Radon transform.
The 3D Radon transform for a spatial density h(x), is given by h(x) ~~
xw r where w is a point on the unit 3D sphere. The sinogram g(m, h, k) is indexed by three integers, the first two representing the angular coordinates, and the third representing samples in the radial coordinate. For example, g(m, n, k) =
q(co",, n, kT), where T is the radial sampling period, and w",," with m, h E { 1,. . .,P}
are the I S PZ orientations at which the 3D Radon transform is sampled.
The backprojection operation is computed by first radially interpolating the backprojected data:
g~(m~ h~ s) _ ~ g(m~ yl~ k)~ {s- (k+'~,~t,»)~ (~) n where c~ is the radial interpolation kernel, T is the radial sampling period, m, h E
{0,. . .,P -1 }, and i"1," E [-.5, .5]. Next, this is backprojected using the following ~0 direct formula:
.f~(x)-~ ~ g~(m~~~x'~m,~t)~ (3) m n This continuous reconstruction is then smoothed and resampled .f(i) = f b(x- i).f~ (x) dx (4) where b is a smoothing function, such as a cube-shaped or spherical voxel, or some smoother such function. Combining formulas (2), (3) and (4) yields the following discretized backprojection:
.f(i) - ~ ~ ~ g(m~ ~~ k) f b (x- l) ~ f x'W m,,1 - (k+i,n,~) T~ dx.
x m ra r This can be rewritten as .f(i) - ~ ~ ~ g(yn~ ~~ k) P (i'~f»,rt - (k+ijn,~l) T ~ ~ (6) n »t f~
with P (t~ jn~ ~) = f b (x) ~ (x'~f»,rt + t) dx. ('7) We denote the backprojection operation that maps a sinogram f g(m,h,k)~ with P
x P angular samples and O(N) radial samples to an N x N x N volume Vii)} by Bp N. The calculation of f (i) (step 38 in Fig. 2) from g (step 34) by formula (5) (step 36) is the "direct", slow method for backprojection.
The exact subdivision step is depicted in Fig. 3. The input sinogram (step 10) g(m, n, k) is radially shifted and truncated (step 12a -12h) to yield gl(m, h, k) for l E {1, 2,. . .,8}, defined by gl(m~~~k) _ ~m~~~k-~l(m~~) ~ ~ (g) where Cl(m,Yl) _ [ Sl ~ GJnt,n +'Gm n] (9 T ' and [x] is the integer nearest x. The 8l are defined by 81 [-Nl4, Nl4, -Nl4]T82 [-Nl4,Nl4, Nl4]T
= - = - -83 [-Nl4, Nl4, -Nl4]T84 [-Nl4,Nl4, Nl4]T
= - = - -85 = [-Nl4,-Nl4, -Nl4]T86 = [-Nl4,-Nl4,-Nl4]T (10) 8~ _ [-Nl4,-Nl4, -Nl4]T88 = [-Nl4,-Nl4,-Nl4]T
Then g1 is radially truncated to a width of O(Nl2) samples. The process of exact subdivision yields g1 that are each P/2 x Pl2 x O(N) in size.
After step 12a - 12h, the subsinograms defined by formula (8), one for each octant of the reconstruction, are backprojected BPN,2 (step 14a -14h) via P P
f(i)=~ ~ ~ gt(mWk)P fi'~m,tt+(k+vr(me))~ ~ 1 ~lhl2~l3<-Nl2 (11) tn=i tt=i n _7_ where Vl(Yi2,72) ~ < ~l ~ CJrn,n +'Cm n>~
T ' and < x > = x - [x]. The aggregation step (steps 18a-18h, 20) consists of simply copying f into the lth octant of the final volume.
The approximate subdivision step is depicted in Fig. '4. The input sinogram (step 22), is processed by an "angular decimation step" 24a-24h (APN..Ap~, in Fig. 4) before backprojection. This angular decimation step 24a-24h contains, in addition to the shifting and truncation used in the exact decomposition, as described below, the angular decimations made in the approximate decomposition. A comparison between Figs. 3 and 4 shows that after the processing steps (step 12a-12h and 24a-24h, respectively), the size of the volume being manipulated is different. In the exact decomposition, the output after each of steps 12a-12h is of size P x P x O (N/2), because the processing in formula (8) involves only shifting and truncation in the third coordinate.
For the approximate subdivision, an additional angular smoothing and decimation step is included, so that g1 is now defined by gl(~~h~k) ~ ~ ~ a(m~~~uw~W~k)g~uw~W+'cj(2m,2Y1)~, (13) a v w where cx is an appropriately chosen angular and radial smoothing kernel. In general, a is chosen to have small support and be easily computable so that formula (13) can be calculated very efficiently. The process of the approximate _$_ subdivision yields g1 that are each P/2 x Pl2 x O(Nl2) in size, as opposed to the exact subdivision, which yields g1 that are each P x P x O (N/2) in size.
After step 24a-24h in Fig. 4, the subsinograms defined by formula (13), one for each octant of the reconstruction, are backprojected BP,2, rriz (step 26a-26h) via f(i)W ~ ~ (m~~~k)Pfi'~am,a~t+)k+ul(2m,2h))~~ (14) m n kg~
where v is defined in formula (12). The aggregation step (steps 28a-28h,30) consists of simply copying f into the lth octant of the final volume.
As in the fast 2D backprojection algorithm described in U.S. patent application Serial No. 09/418,933, the process is applied recursively, with the backprojection steps (step 14a-14h or 26a-26h) being replaced by the entire decomposition, until the outputs are as small as one voxel. By controlling the number of times the exact subdivision process is performed, and the number of times the approximate subdivision process is used, the accuracy of the backprojections can be controlled at the expense of increased computational effort.
Furthermore, assuming that a is chosen to have small support, the cost of the proposed process is roughly O (N3 loge N) operations when decomposed to subsinograms that represent single voxels.
A test of the algorithm was performed on the 3D Shepp-Logan head phantom. To use the fast backprojection algorithm for reconstruction, it is first necessary to radially filter the projections with an approximate second-order derivative kernel. The standard second order difference kernel [-l, 0,1] was used for these experiments. Synthetic plane-integral projections were computed for P
= 256, and the reconstruction volume size was N- 256. The detector spacing was set to T- 0.5. The filtered data was then backprojected using formula (5), as well as by the proposed process. The data was radially oversampled by a factor of two prior to passing to the fast backprojections. The exact subdivision process was used in the first two stages of the algorithm, with the approximate process being used for the remaining stages. 'The inventive process was roughly 200 times faster than the direct method; producing reconstructions of comparable quality.
As described, the invention is fairly general, and covers 3D
tomographic data acquisition geometries of practical interest. Standard computational techniques can be applied to rearrange the proposed process structure. It can also be implemented in hardware, software, or any combination thereof. However, the defining idea of the hierarchical decomposition and the resulting recursive algorithm structure are not affected by these changes.
With varying degrees of computational efficiency, the algorithm can be implemented for another radix or for an arbitrary factorization of N.
The many advantages of this invention are now apparent. Accurate 3D, graphic data can be backprojected more quickly, with less computational cost.
While the principles of the invention have been described above in connection with a specific apparatus and applications, it is to be understood that this description is made only by way of example and not as a limitation on the scope of the invention.
.f(i) - ~ ~ ~ g(m~ ~~ k) f b (x- l) ~ f x'W m,,1 - (k+i,n,~) T~ dx.
x m ra r This can be rewritten as .f(i) - ~ ~ ~ g(yn~ ~~ k) P (i'~f»,rt - (k+ijn,~l) T ~ ~ (6) n »t f~
with P (t~ jn~ ~) = f b (x) ~ (x'~f»,rt + t) dx. ('7) We denote the backprojection operation that maps a sinogram f g(m,h,k)~ with P
x P angular samples and O(N) radial samples to an N x N x N volume Vii)} by Bp N. The calculation of f (i) (step 38 in Fig. 2) from g (step 34) by formula (5) (step 36) is the "direct", slow method for backprojection.
The exact subdivision step is depicted in Fig. 3. The input sinogram (step 10) g(m, n, k) is radially shifted and truncated (step 12a -12h) to yield gl(m, h, k) for l E {1, 2,. . .,8}, defined by gl(m~~~k) _ ~m~~~k-~l(m~~) ~ ~ (g) where Cl(m,Yl) _ [ Sl ~ GJnt,n +'Gm n] (9 T ' and [x] is the integer nearest x. The 8l are defined by 81 [-Nl4, Nl4, -Nl4]T82 [-Nl4,Nl4, Nl4]T
= - = - -83 [-Nl4, Nl4, -Nl4]T84 [-Nl4,Nl4, Nl4]T
= - = - -85 = [-Nl4,-Nl4, -Nl4]T86 = [-Nl4,-Nl4,-Nl4]T (10) 8~ _ [-Nl4,-Nl4, -Nl4]T88 = [-Nl4,-Nl4,-Nl4]T
Then g1 is radially truncated to a width of O(Nl2) samples. The process of exact subdivision yields g1 that are each P/2 x Pl2 x O(N) in size.
After step 12a - 12h, the subsinograms defined by formula (8), one for each octant of the reconstruction, are backprojected BPN,2 (step 14a -14h) via P P
f(i)=~ ~ ~ gt(mWk)P fi'~m,tt+(k+vr(me))~ ~ 1 ~lhl2~l3<-Nl2 (11) tn=i tt=i n _7_ where Vl(Yi2,72) ~ < ~l ~ CJrn,n +'Cm n>~
T ' and < x > = x - [x]. The aggregation step (steps 18a-18h, 20) consists of simply copying f into the lth octant of the final volume.
The approximate subdivision step is depicted in Fig. '4. The input sinogram (step 22), is processed by an "angular decimation step" 24a-24h (APN..Ap~, in Fig. 4) before backprojection. This angular decimation step 24a-24h contains, in addition to the shifting and truncation used in the exact decomposition, as described below, the angular decimations made in the approximate decomposition. A comparison between Figs. 3 and 4 shows that after the processing steps (step 12a-12h and 24a-24h, respectively), the size of the volume being manipulated is different. In the exact decomposition, the output after each of steps 12a-12h is of size P x P x O (N/2), because the processing in formula (8) involves only shifting and truncation in the third coordinate.
For the approximate subdivision, an additional angular smoothing and decimation step is included, so that g1 is now defined by gl(~~h~k) ~ ~ ~ a(m~~~uw~W~k)g~uw~W+'cj(2m,2Y1)~, (13) a v w where cx is an appropriately chosen angular and radial smoothing kernel. In general, a is chosen to have small support and be easily computable so that formula (13) can be calculated very efficiently. The process of the approximate _$_ subdivision yields g1 that are each P/2 x Pl2 x O(Nl2) in size, as opposed to the exact subdivision, which yields g1 that are each P x P x O (N/2) in size.
After step 24a-24h in Fig. 4, the subsinograms defined by formula (13), one for each octant of the reconstruction, are backprojected BP,2, rriz (step 26a-26h) via f(i)W ~ ~ (m~~~k)Pfi'~am,a~t+)k+ul(2m,2h))~~ (14) m n kg~
where v is defined in formula (12). The aggregation step (steps 28a-28h,30) consists of simply copying f into the lth octant of the final volume.
As in the fast 2D backprojection algorithm described in U.S. patent application Serial No. 09/418,933, the process is applied recursively, with the backprojection steps (step 14a-14h or 26a-26h) being replaced by the entire decomposition, until the outputs are as small as one voxel. By controlling the number of times the exact subdivision process is performed, and the number of times the approximate subdivision process is used, the accuracy of the backprojections can be controlled at the expense of increased computational effort.
Furthermore, assuming that a is chosen to have small support, the cost of the proposed process is roughly O (N3 loge N) operations when decomposed to subsinograms that represent single voxels.
A test of the algorithm was performed on the 3D Shepp-Logan head phantom. To use the fast backprojection algorithm for reconstruction, it is first necessary to radially filter the projections with an approximate second-order derivative kernel. The standard second order difference kernel [-l, 0,1] was used for these experiments. Synthetic plane-integral projections were computed for P
= 256, and the reconstruction volume size was N- 256. The detector spacing was set to T- 0.5. The filtered data was then backprojected using formula (5), as well as by the proposed process. The data was radially oversampled by a factor of two prior to passing to the fast backprojections. The exact subdivision process was used in the first two stages of the algorithm, with the approximate process being used for the remaining stages. 'The inventive process was roughly 200 times faster than the direct method; producing reconstructions of comparable quality.
As described, the invention is fairly general, and covers 3D
tomographic data acquisition geometries of practical interest. Standard computational techniques can be applied to rearrange the proposed process structure. It can also be implemented in hardware, software, or any combination thereof. However, the defining idea of the hierarchical decomposition and the resulting recursive algorithm structure are not affected by these changes.
With varying degrees of computational efficiency, the algorithm can be implemented for another radix or for an arbitrary factorization of N.
The many advantages of this invention are now apparent. Accurate 3D, graphic data can be backprojected more quickly, with less computational cost.
While the principles of the invention have been described above in connection with a specific apparatus and applications, it is to be understood that this description is made only by way of example and not as a limitation on the scope of the invention.
Claims (23)
1. A method for generating a three-dimensional electronic volume from a sinogram (10) comprising the steps of subdividing (12a-12h)(24a-24h) the sinogram into a plurality of subsinograms;
backprojecting (14a-14h) (26a-26h) each of said subsinograms to produce a plurality of corresponding sub-volumes, and aggregating (20) (30) said sub-volumes to create the electronic volume.
backprojecting (14a-14h) (26a-26h) each of said subsinograms to produce a plurality of corresponding sub-volumes, and aggregating (20) (30) said sub-volumes to create the electronic volume.
2. The method of claim 1 wherein said subdividing step includes performing a number of approximate subdivisions (24a-24h).
3. The method of claim 1 wherein said subdividing step includes performing a number of exact subdivisions (12a-12h).
4. The method of claim 1 wherein said sinogram is subdivided into a plurality of subsinograms in a recursive manner, wherein said subdividing steps include a number of exact subdivisions (12a-12h) and a number of approximate subdivisions (24a-24h).
5. The method of claim 1 wherein said aggregation step is performed in a recursive manner.
6. The method of claim 1 wherein said electronic volume is a tomographic volume.
7. The method of claim 1 further comprising preprocessing in which angular and radial oversampling are used to improve the accuracy of the electronic volume.
8. The method of claim 1 wherein said sinograms are subdivided in a recursive manner, until each subsinogram represents a volume of a desired size.
9. The method of claim 8 wherein said subsinograms correspond to volumes as small as one voxel in size.
10. The method of claim 1 wherein the sinogram includes filtered projections.
11. The method of claim 2 wherein said approximate subdivision steps (24a-24h) include radial truncation and shifting, and angular decimation of the sinogram.
12. The method of claim 3 wherein said exact subdivision steps (12a-12h) include radial truncation and shifting.
13. Apparatus for generating a three-dimensional electronic volume of an object comprising:
means (2) for scanning the object to generate data representing a volume of the object;
means (4) for processing said data to generate a sinogram which includes a plurality of filtered projections;
means (5) for subdividing said sinogram into a plurality of subsinograms;
means (5) for backprojecting each of said subsinograms to produce a plurality of corresponding subvolumes;
means (6) for aggregating said subvolumes to create the electronic volume; and means for displaying the electronic volume.
means (2) for scanning the object to generate data representing a volume of the object;
means (4) for processing said data to generate a sinogram which includes a plurality of filtered projections;
means (5) for subdividing said sinogram into a plurality of subsinograms;
means (5) for backprojecting each of said subsinograms to produce a plurality of corresponding subvolumes;
means (6) for aggregating said subvolumes to create the electronic volume; and means for displaying the electronic volume.
14. The apparatus of claim 13 wherein said means for subdividing performs a number of approximate subdivisions.
15. The apparatus of claim 14 wherein said approximate subdivisions include radial truncation and shifting, and angular decimation of the sinogram.
16. The apparatus of claim 13 wherein said means for subdividing performs a number of exact subdivisions.
17. The apparatus of claim 16 wherein said exact subdivisions include radial truncation and shifting.
18. The apparatus of claim 13 wherein said sinograms are subdivided into a plurality of subsinograms in a recursive manner, wherein said means for subdividing performs a number of exact subdivisions and a number of approximate subdivisions.
19. The apparatus of claim 13 wherein said means for aggregating operates in a recursive manner.
20. The apparatus of claim 13 wherein said electronic volume is a tomographic volume.
21. The apparatus of claim 13 wherein said means for processing performs angular and radial oversampling to improve the accuracy of the electronic volume.
22. The apparatus of claim 13 wherein said means for subdividing operates in a recursive manner, until each subsinogram represents a volume of a desired size.
23. The apparatus of claim 20 wherein said subsinograms correspond to volumes as small as one voxel in size.
Applications Claiming Priority (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US09/539,074 US6307911B1 (en) | 1999-06-23 | 2000-03-30 | Fast hierarchical backprojection for 3D Radon transform |
US09/539,074 | 2000-03-30 | ||
PCT/US2001/008953 WO2001074250A1 (en) | 2000-03-30 | 2001-03-21 | Fast hierarchical backprojection for 3d radon transform |
Publications (1)
Publication Number | Publication Date |
---|---|
CA2396804A1 true CA2396804A1 (en) | 2001-10-11 |
Family
ID=24149644
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CA002396804A Abandoned CA2396804A1 (en) | 2000-03-30 | 2001-03-21 | Fast hierarchical backprojection for 3d radon transform |
Country Status (5)
Country | Link |
---|---|
US (1) | US6307911B1 (en) |
EP (1) | EP1259164A4 (en) |
JP (1) | JP2003528683A (en) |
CA (1) | CA2396804A1 (en) |
WO (1) | WO2001074250A1 (en) |
Families Citing this family (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
FR2810141B1 (en) * | 2000-06-07 | 2002-08-23 | Commissariat Energie Atomique | METHOD FOR ACCELERATED RECONSTRUCTION OF A THREE-DIMENSIONAL IMAGE |
US6771732B2 (en) * | 2002-02-28 | 2004-08-03 | The Board Of Trustees Of The University Of Illinois | Methods and apparatus for fast divergent beam tomography |
DE10307331B4 (en) * | 2003-02-17 | 2009-03-05 | BAM Bundesanstalt für Materialforschung und -prüfung | Imaging method for the computer aided evaluation of computer-tomographic measurements by direct iterative reconstruction |
US7215731B1 (en) | 2005-11-30 | 2007-05-08 | General Electric Company | Fast backprojection/reprojection with hexagonal segmentation of image |
US9091628B2 (en) | 2012-12-21 | 2015-07-28 | L-3 Communications Security And Detection Systems, Inc. | 3D mapping with two orthogonal imaging views |
Family Cites Families (42)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4042811A (en) | 1975-11-28 | 1977-08-16 | Picker Corporation | Tomography system having an ultrahigh-speed processing unit |
US4149247A (en) | 1975-12-23 | 1979-04-10 | Varian Associates, Inc. | Tomographic apparatus and method for reconstructing planar slices from non-absorbed and non-scattered radiation |
US4217641A (en) | 1978-04-28 | 1980-08-12 | U.S. Philips Corporation | Correction for polychromatic X-ray distortion in CT images |
US4491932A (en) | 1981-10-01 | 1985-01-01 | Yeda Research & Development Co. Ltd. | Associative processor particularly useful for tomographic image reconstruction |
US4626991A (en) | 1983-04-21 | 1986-12-02 | Elscint Incorporated | System for reprojecting images acquired by backprojection |
US4714997A (en) | 1983-06-02 | 1987-12-22 | Elscint Incorporated | Data reduction in reprojection systems |
US4616318A (en) | 1983-06-07 | 1986-10-07 | Elscint, Inc. | System for reprojecting images using transform techniques |
US4991093A (en) | 1985-08-21 | 1991-02-05 | Exxon Research And Engineering Company | Method for producing tomographic images using direct Fourier inversion |
US4709333A (en) | 1986-01-03 | 1987-11-24 | General Electric Company | Method and apparatus for imaging in the presence of multiple high density objects |
US4858128A (en) | 1986-08-11 | 1989-08-15 | General Electric Company | View-to-view image correction for object motion |
US4930076A (en) | 1988-11-09 | 1990-05-29 | General Electric Company | Systolic radon transform processor |
US5008822A (en) | 1988-11-25 | 1991-04-16 | Picker International, Inc. | Combined high speed backprojection and forward projection processor for CT systems |
US5136660A (en) | 1989-10-13 | 1992-08-04 | International Business Machines Corporation | Apparatus and method for computing the radon transform of digital images |
US5229934A (en) | 1990-06-18 | 1993-07-20 | Picker International, Inc. | Post-processing technique for cleaning up streaks and artifacts in diagnostic images |
US5224037A (en) | 1991-03-15 | 1993-06-29 | Cti, Inc. | Design of super-fast three-dimensional projection system for Positron Emission Tomography |
US5396528A (en) | 1991-06-28 | 1995-03-07 | General Electric Company | Tomographic image reconstruction using cross-plane rays |
US5243664A (en) | 1991-09-16 | 1993-09-07 | Picker International, Inc. | Post-processing technique for reducing metallic clip artifacts in CT images |
US5375156A (en) | 1992-03-31 | 1994-12-20 | Siemens Medical Systems, Inc. | Method and apparatus for 3-D computer tomography |
US5414623A (en) | 1992-05-08 | 1995-05-09 | Iowa State University Research Foundation | Optoelectronic system for implementation of iterative computer tomography algorithms |
JP3332087B2 (en) * | 1992-05-14 | 2002-10-07 | 株式会社東芝 | X-ray CT system |
US5300782A (en) | 1992-06-26 | 1994-04-05 | General Electric Company | Gamma ray detector for pet scanner |
JPH0630927A (en) * | 1992-07-17 | 1994-02-08 | Yokogawa Medical Syst Ltd | Image reconstruction method and apparatus for fast reverse projection computation of radiation ct |
FR2701135B1 (en) | 1993-01-29 | 1995-03-10 | Commissariat Energie Atomique | Method for reconstructing three-dimensional images of an evolving object. |
US5438602A (en) | 1993-12-23 | 1995-08-01 | General Electric Company | Correction of CT attenuation data using fan beam reprojections |
JPH0844850A (en) * | 1994-07-28 | 1996-02-16 | Olympus Optical Co Ltd | Device and method for reconstituting tomographic image |
US5552605A (en) | 1994-11-18 | 1996-09-03 | Picker International, Inc. | Motion correction based on reprojection data |
US5559335A (en) | 1994-12-28 | 1996-09-24 | The University Of Utah | Rotating and warping projector/backprojector for converging-beam geometries |
US5579358A (en) | 1995-05-26 | 1996-11-26 | General Electric Company | Compensation for movement in computed tomography equipment |
US5625190A (en) | 1995-07-11 | 1997-04-29 | General Electric Company | Forward projection algorithm |
JP3373720B2 (en) | 1996-03-25 | 2003-02-04 | 株式会社日立メディコ | X-ray tomography equipment |
JP4163767B2 (en) | 1996-05-02 | 2008-10-08 | シーメンス アクチエンゲゼルシヤフト | Image reconstruction method for computer tomography apparatus |
US5778038A (en) | 1996-06-06 | 1998-07-07 | Yeda Research And Development Co., Ltd. | Computerized tomography scanner and method of performing computerized tomography |
JP3851689B2 (en) * | 1996-09-09 | 2006-11-29 | 株式会社東芝 | Image reconstruction processing device |
US5805098A (en) | 1996-11-01 | 1998-09-08 | The United States Of America As Represented By The Secretary Of The Army | Method and system for forming image by backprojection |
US5727041A (en) | 1996-11-13 | 1998-03-10 | General Electric Company | Methods and apparatus for reducing partial volume image artifacts |
JP3672399B2 (en) * | 1996-11-21 | 2005-07-20 | 株式会社東芝 | CT image reconstruction method |
JPH119589A (en) * | 1997-04-30 | 1999-01-19 | Hitachi Medical Corp | X-ray ct tomograph and image recomposing method |
US5862198A (en) | 1997-09-30 | 1999-01-19 | Siemens Corporate Research, Inc. | Pre-calculated hitlist for reducing run-time processing of an exact cone beam reconstruction algorithm |
US5901196A (en) | 1997-09-30 | 1999-05-04 | Siemens Corporate Research, Inc. | Reduction of hitlist size in spiral cone beam CT by use of local radon origins |
US6108007A (en) | 1997-10-09 | 2000-08-22 | Silicon Graphics, Inc. | Method, system, and computer program product for increasing interpolation precision using multi-channel texture mapping |
US6028907A (en) | 1998-05-15 | 2000-02-22 | International Business Machines Corporation | System and method for three-dimensional geometric modeling by extracting and merging two-dimensional contours from CT slice data and CT scout data |
US6282257B1 (en) | 1999-06-23 | 2001-08-28 | The Board Of Trustees Of The University Of Illinois | Fast hierarchical backprojection method for imaging |
-
2000
- 2000-03-30 US US09/539,074 patent/US6307911B1/en not_active Expired - Lifetime
-
2001
- 2001-03-21 JP JP2001571998A patent/JP2003528683A/en active Pending
- 2001-03-21 CA CA002396804A patent/CA2396804A1/en not_active Abandoned
- 2001-03-21 EP EP01920586A patent/EP1259164A4/en not_active Withdrawn
- 2001-03-21 WO PCT/US2001/008953 patent/WO2001074250A1/en active Application Filing
Also Published As
Publication number | Publication date |
---|---|
US6307911B1 (en) | 2001-10-23 |
JP2003528683A (en) | 2003-09-30 |
WO2001074250A1 (en) | 2001-10-11 |
EP1259164A1 (en) | 2002-11-27 |
EP1259164A4 (en) | 2007-11-28 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
JP4550426B2 (en) | Method and apparatus for fast diverging beam tomography | |
Delaney et al. | A fast and accurate Fourier algorithm for iterative parallel-beam tomography | |
Louis et al. | Contour reconstruction in 3-D X-ray CT | |
US6332035B1 (en) | Fast hierarchical reprojection algorithms for 3D radon transforms | |
JP2000135214A (en) | Image reconstitution | |
US6282257B1 (en) | Fast hierarchical backprojection method for imaging | |
EP1221129B1 (en) | A multilevel domain decomposition method for fast reprojection of images | |
EP1264275B1 (en) | Fast hierarchical reprojection algorithm for tomography | |
CN104851080B (en) | A kind of three-dimensional PET images method for reconstructing based on TV | |
Basu et al. | O (N/sup 3/log N) backprojection algorithm for the 3-D Radon transform | |
CA2396804A1 (en) | Fast hierarchical backprojection for 3d radon transform | |
Roerdink et al. | Wavelet-based volume visualization | |
Fessler | Iterative tomographic image reconstruction using nonuniform fast Fourier transforms | |
Xiao et al. | O (N/sup 2/log N) native fan-beam tomographic reconstruction | |
JP2004329947A (en) | Image forming method and spiral ct device in spiral computed tomography | |
Occorsio et al. | FILTERED POLYNOMIAL INTERPOLATION FOR SCALING 3D IMAGES | |
Tam | Exact image reconstruction in cone beam 3D CT | |
Westenberg et al. | X-ray rendering through two-stage splatting | |
You | Image Reconstruction from Projections in Tomography | |
Hamon et al. | An analytical method for 3D tomographic reconstruction from a small number of projections using a simple interpolation scheme | |
Xuan et al. | Exact rebinning methods for 3D PET | |
Long | Wavelets, Frequency Volume Rendering and Multiresolution Analysis Yield Fast Displays of Acquired Data | |
Bresler et al. | Fast hierarchical backprojection for helical cone-beam tomography | |
Domonkos | High–quality and efficient volume resampling | |
Mihajlović et al. | The B-spline interpolation in visualization |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
EEER | Examination request | ||
FZDE | Discontinued |