1. Field of the Invention
The present invention relates generally to an X-ray computed tomography (CT) apparatus. More particularly, in a multi-slice X-ray CT apparatus that uses a plurality of rows of detectors for detecting an X-ray image formed by helical scanning of the surroundings of a subject, this invention relates to a technique for achieving data interpolation and image reconstruction based on data obtained from helical scanning of the subject while the patient couch or gantry is tilted. Specifically, the invention relates to the reconstruction of CT scans for a tilted gantry or tilted couch implementing a 3-D Feldkamp cone-beam based reconstruction algorithm.
2. Discussion of the Background
There have previously been proposed X-ray CT devices using a helical scanning system. As illustrated in
There are two types of helical scanning devices: single slice and multi-slice. A single slice CT device has an X-ray beam generation source for irradiating fan shaped X-ray beams (hereafter referred to as fan beams) and a detector having M channels (for example 1,000 channels) arrayed in a fan shape or in a linear shape in one row. This single slice CT device has an X-ray beam generation source and a detector that rotate around the subject. M data is collected in one rotation. Data collection for a single time period is referred to as “one view.”
The second type of helical scanning device, a multi-slice CT scanning device, has an X-ray beam generation source for irradiating conical X-ray beams (hereafter referred to as cone-beams), and a two dimensional detector having detectors arrayed in a body axis (Z axis) direction in a plurality of rows, each detector having an arcuate array of M channel detectors (M channels times N rows). The multi-slice CT device rotates the X-ray focus and the detector around the subject, and collects M×N data in one rotation. Accordingly, as compared with the single-slice CT apparatus, it is possible to scan over a wide range with higher precision and higher speed.
Image reconstruction processing in a helical scanning system includes several steps, as illustrated in
The raw data is then interpolated to generate interpolated data on a desired slice surface. This type of interpolation is known as helical interpolation. The interpolation may be performed using adjacent interpolation, as disclosed for example in Japanese Laid-open Publication Hei 4-224736. Filter interpolation for the addition of weighted multi-point data may also be performed using techniques similar to those described in Japanese Laid-open Publication Hei 9-234195. Other interpolation methods, such as opposite beam interpolation and the like may also be used.
The interpolated data for the respective angles are then subjected to a convolution calculation, as illustrated in
The convolved data is then added to all the pixels arrayed along the path of an X-ray beam at the time of data collection. This process is known as backprojection. The backprojection is repeated for all of the convolved data at angles according to the beam shape, thereby leaving only the original signal.
In order to reconstruct the original signal, fan beam reconstruction has often been used, especially in the case of a tilted gantry or tilted patient couch. In order to prevent unnecessary patient exposure to X-rays during CT scans, it is useful to tilt the gantry about the patient or to tilt the couch during scanning. Without compensation for artifacts introduced during the tilting of the gantry or couch, the quality of reconstructed images is poor. In the past, fan beam reconstruction of tilted gantry CT scans has been performed in order to correct for artifacts introduced during the tilt.
However, fan beam reconstruction is an approximation useful for small cone angles associated with multi-slice systems of four or less slices. For larger multi-slice systems, such as those having eight or sixteen slices, the fan beam approximation becomes less and less accurate. As a result, unacceptable artifacts such as loss of resolution and inaccurate structure reconstruction occur.
In previous methods using the ASSR method (described, for example, in M. Kachelriess, T. Fuchs, S. Schaller, and W. A. Kalendar, “Advanced Single-Slice Rebinning for Tilted Spiral Cone-Beam CT,” Med. Phys. 28(6), pp. 1033–1041 (June 2001), the contents of which-are herein incorporated by reference), it was not possible to compensate for arbitrary pitch values. Additionally, for incorporating the tilt of the gantry, ASSR requires complete reformulation of the reconstruction problem.
Accordingly, in light of the above-described difficulties, an object of this invention is to provide a method, system, and computer program product for 3D Feldkamp cone-beam reconstruction using a tilted gantry helical reconstruction algorithm (THFK) for use in the cone-beam helical CT case.
A more complete appreciation of the invention and many of the attendant advantages thereof will be readily obtained as the same becomes better understood by reference to the following detailed description when considered in connection with the accompanying drawings, wherein:
Referring now to the drawings, wherein like reference numerals designate identical or corresponding parts throughout the several views,
This movement of the isocenter in the direction y′ is illustrated in
and TP is the tube position, which is an integer ranging from zero to Nβrot−1, and is encoded in each projection view.
As with non-tilted Feldkamp (techniques of which may be found in L. A. Feldkamp, L. C. Davis, and J. W. Kress, “Practical Cone-Beam Algorithm,” Journal Optical Society of America, Vol. 1, pp 612–619 (1984), the contents of which are incorporated herein by reference) the view reconstruction range βRR is centered at β(zp), with as starting position defined as:
and an ending position defined as:
where βRR is the angular backprojection range and βstart≦βk≦βend. The first z position, zpmin, that may be reconstructed corresponds to the view β1st
Once the backprojection view range is defined, the projection view data for the range is weighted (using techniques such as those described in Dennis L. Parker, “Optimal Short Scan Convolution Reconstruction for Fanbeam CT,” Med. Phys. 9(2), March/April 1982, the contents of which are herein incorporated by reference), and convolved (using techniques analogous to those described in H. H. Barrett and W. Swindell, Radiological Imaging: Theory of Image Formation, Detection, and Processing, Vol. 2, New York: Academic Press, pp 391–392 (1981), the contents of which is herein incorporated by reference) as desired prior to backprojection.
In the non-tilted helical case, the relative z-position Δz of the slice of interest is a function of β, and are given as follows:
Because of the tilt, FOVT<FOV′, and the maximum FOVT is given by
FOVT max=FOV′−Δy′(βRR/2) (8)
As shown in
The segment number is
The channel position is given by
with channel number
The reconstructed tilted field of view FOVT is the default FOV divided by the zoom factor Zs:
where Zs=1.0 for the default FOV case with no zooming. The reconstruction x and y increments xinc and yinc are:
The parameters Xo and Yo define the center of the reconstruction. The starting x and y positions for the backprojection are:
Micro-slice stacking is implemented along the z′-axis, as shown in
According to the present invention, the use of the Feldkamp equations yields an improved CT scan image with fewer artifacts.
Computer and System
The source of image data may be any appropriate image acquisition device such as an X-ray machine, CT apparatus, and MRI apparatus. Further, the acquired data may be digitized if not already in digital form. Alternatively, the source of image data being obtained and processed may be a memory storing data produced by an image acquisition device, and the memory may be local or remote, in which case a data communication network, such as PACS (Picture Archiving Computer System), can be used to access the image data for processing according to the present invention.
This invention conveniently may be implemented using a conventional general purpose computer or micro-processor programmed according to the teachings of the present invention, as will be apparent to those skilled in the computer art. Appropriate software may readily be prepared by programmers of ordinary skill based on the teachings of the present disclosure, as ill be apparent to those skilled in the software art.
A computer implements the method of the present invention, wherein the computer housing houses a motherboard which contains a CPU, memory (e.g., DRAM, ROM, EPROM, EEPROM, SRAM, SDRAM, and Flash RAM), and other optical special purpose logic devices (e.g., ASICS) or configurable logic devices (e.g., GAL and reprogrammable FPGA). The computer may also include plural input devices, (e.g., keyboard and mouse), and a display card for controlling a monitor. Additionally, the computer may include a floppy disk drive; other removable media devices (e.g. compact disc, tape, and removable magneto-optical media); and a hard disk or other fixed high density media drives, connected using an appropriate device bus (e.g., a SCSI bus, an Enhanced IDE bus, or an Ultra DMA bus). The computer may also include a compact disc reader, a compact disc reader/writer unit, or a compact disc jukebox, which may be connected to the same device bus or to another device bus.
As stated above, the system includes at least one computer readable medium. Examples of computer readable media are compact discs, hard disks, floppy disks, tape, magneto-optical disks, PROMS (e.g., EPROM, EEPROM, Flash EPROM), DRAM, SRAM, SDRAM, etc. Stored on any one or on a combination of computer readable media, the present invention includes software for controlling both the hardware of the computer and for enabling the computer to interact with a human user. Such software may include, but is not limited to, device drivers, operating systems and user applications, such as development tools. Computer program products of the present invention include any computer readable medium which stores computer program instructions (e.g. computer code devices) which when executed by a computer causes the computer to perform the method of the present invention. The computer code devices of the present invention can be any interpreted or executable code mechanism, including but not limited to, scripts, interpreters, dynamic link libraries, Java classes, and complete executable programs. Moreover, parts of the processing of the present invention may be distributed for better performance, reliability, and/or cost. For example, an outline or image may be selected on a first computer and sent to a second computer for remote diagnosis.
The invention may also be implemented by the preparation of application specific integrated circuits or by interconnecting an appropriate network of conventional component circuits, as will be readily apparent to those skilled in the art.
Numerous modifications and variations of the present invention are possible in light of the above teachings. It is therefore to be understood that within the scope of the appended claims, the invention may be practiced otherwise than as specifically described herein.
The present application is related to and claims the benefit of priority of U.S. patent application Ser. No. 10/283,080, filed Oct. 30, 2002, now U.S. Pat. No. 6,904,117, the entire contents of which are incorporated herein by reference.
Number | Name | Date | Kind |
---|---|---|---|
5999587 | Ning et al. | Dec 1999 | A |
6263040 | Hsieh | Jul 2001 | B1 |
6332013 | Hsieh | Dec 2001 | B1 |
6477221 | Ning | Nov 2002 | B1 |
6504892 | Ning | Jan 2003 | B1 |
6678346 | Hsieh | Jan 2004 | B1 |
6904117 | Hein et al. | Jun 2005 | B1 |
Number | Date | Country | |
---|---|---|---|
20050111611 A1 | May 2005 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 10283080 | Oct 2002 | US |
Child | 11024683 | US |