Beam hardening and scatter removal

Abstract

A method for removing artifacts from an image reconstructed from scanner data according to embodiments includes: performing a forward projection p to update an estimated object image; determining a transfer function f.sub.θ that represents the effect of scatter and beam hardening; modifying the forward projection p using the transfer function f.sub.θ to provide a modified forward projection p′; and performing an iterative image reconstruction process using the modified forward projection p′ to generate a reconstructed image.

Claims

1. A method for removing artifacts from an image reconstructed from scanner data, comprising: performing a forward projection p to update an estimated object image; determining a transfer function f.sub.θ, wherein the transfer function f.sub.θ is obtained by calculating a best-fit between the forward projection p and the scanner data; modifying the forward projection p using the transfer function f.sub.θ to provide a modified forward projection p′; and performing an iterative image reconstruction process using the modified forward projection p′ to generate a reconstructed image, wherein scatter and beam hardening artifacts are removed from the reconstructed image.

2. The method of claim 1, further comprising outputting the reconstructed image.

3. The method of claim 1, wherein the scanner data are provided using computed tomography (CT).

4. The method of claim 1, further comprising storing the transfer function f.sub.θ.

5. The method of claim 4, further comprising: accessing the stored transfer function f.sub.θ; determining an inverse of the transfer function f′.sub.θ; modifying additional scanner data using the inverse transfer function f′.sub.θ to obtain modified scanner data, wherein the modifying of the additional scanner data using the inverse transfer function f′.sub.θ removes scatter and beam hardening artifacts from the additional scanner data; and performing any image reconstruction process using the modified scanner data to generate an additional reconstructed image free of scatter and beam hardening artifacts.

6. The method of claim 5, further comprising outputting the additional reconstructed image.

7. The method of claim 5, wherein the additional scanner data is provided using computed tomography (CT).

8. The method of claim 4, wherein the image reconstruction algorithm is a standard FBP or Feldkamp-Davis type algorithm.

9. The method of claim 4, wherein the image reconstruction algorithm is an iterative algorithm.

10. A method for removing artifacts from a reconstructed image, comprising: determining an inverse of a transfer function f.sub.θ to obtain an inverse transfer function f′.sub.θ; modifying scanner data using the inverse transfer function f′.sub.θ to obtain modified scanner data, wherein the modifying of the scanner data using the inverse transfer function f′.sub.θ removes scatter and beam hardening artifacts from the scanner data; and performing an image reconstruction process using the modified scanner data to generate a reconstructed image free of scatter and beam hardening artifacts.

11. The method of claim 10, wherein the image reconstruction algorithm is a standard FBP or Feldkamp-Davis type algorithm.

12. The method of claim 10, wherein the image reconstruction algorithm is an iterative algorithm.

13. The method of claim 10, further comprising outputting the reconstructed image.

14. The method of claim 10, wherein the scanner data is provided using computed tomography (CT).

15. A computer program product stored on a non-transitory computer-readable storage medium, which when executed, performs a method for removing artifacts from an image reconstructed from scanner data, the method comprising: performing a forward projection p to update an estimated object image; determining a transfer function f.sub.θ, wherein the transfer function f.sub.θ is obtained by calculating a best-fit between the forward projection p and the scanner data; modifying the forward projection p using the transfer function f.sub.θ to provide a modified forward projection p′; and performing an iterative image reconstruction process using the modified forward projection p′ to generate a reconstructed image, wherein scatter and beam hardening artifacts are removed from the reconstructed image.

16. The program product of claim 15, wherein the method further comprises: determining an inverse of the transfer function f′.sub.θ; modifying additional scanner data using the inverse transfer function f′.sub.θ to obtain modified scanner data; and performing any image reconstruction process using the modified scanner data to generate an additional reconstructed image free of scatter and beam hardening artifacts.

17. A method for removing scatter and beam hardening artifacts from a reconstructed image obtained from scanner data, comprising: determining a transfer function f.sub.θ by calculating a best-fit between a forward projection p and the scanner data; determining an inverse of the transfer function f.sub.θ to obtain an inverse transfer function f′.sub.θ; modifying the scanner data using the inverse transfer function f′.sub.θ to obtain modified scanner data, wherein the modifying of the scanner data using the inverse transfer function f′.sub.θ removes scatter and beam hardening artifacts from the scanner data; and performing an image reconstruction process using the modified scanner data to generate a reconstructed image free of scatter and beam hardening artifacts.

18. The method of claim 17, wherein the scanner data are provided using computed tomography (CT).

19. The method of claim 17, wherein the image reconstruction algorithm is an iterative algorithm.

Description

BRIEF DESCRIPTION OF THE DRAWINGS

(1) These and other features of the disclosure will be more readily understood from the following detailed description taken in conjunction with the accompanying drawings that depict various aspects of the invention.

(2) FIG. 1 depicts the Fast Expectation Maximization Ordered Subset (FEMOS) iterative algorithm according to embodiments.

(3) FIG. 2 depicts a flow diagram of a process for removing beam hardening and scatter artifacts from a CT image reconstruction according to embodiments.

(4) FIG. 3 depicts a flow diagram of a process for correcting scanner data to remove beam hardening and scatter artifacts according to embodiments.

(5) FIG. 4 depicts a computing system for implementing one or more embodiments or aspects thereof disclosed herein.

(6) The drawings are merely schematic representations, not intended to portray specific parameters of the invention. The drawings are intended to depict only typical embodiments of the invention, and therefore should not be considered as limiting the scope of the invention. In the drawings, like numbering represents like elements.

DETAILED DESCRIPTION

(7) The present disclosure is directed to a technique for removing scatter and beam hardening artifacts that does not utilize any additional hardware nor model the physics of these phenomena. This technique relies only on the scanner data, and can be applied to any iterative CT image reconstruction algorithm that employs a forward projection operation. In addition, the technique may be utilized to pre-correct scanner data. Once pre-corrected, any other CT image reconstruction algorithms such as Filter Back Projection can be applied to obtain a scatter-free image from the scanner data.

(8) One example of an iterative CT image reconstruction algorithm that employs a forward projection operation is described in U.S. Pat. No. 9,801,591, which is incorporated herein in its entirety by reference. This iterative algorithm is known as Fast Expectation Maximization Ordered Subset (FEMOS), a functional block diagram of which is depicted in FIG. 1.

(9) In the description below, reference is made to the following variables: x Spatial coordinate of the image. For 2D CT images x=(x.sub.1,x.sub.2), for 3D CT images (volume) x=(x.sub.1,x.sub.2,x.sub.3), where x.sub.1, x.sub.2 and x.sub.3 are the Cartesian coordinates b(x) Estimated Image or image guess. y Variable that indexes source-detector pairs. For example, in a fan-beam scanner, y is given in terms of polar coordinates (r,θ); in a cone-beam scanner, y is the 2D spatial coordinate of the pixel in the radiograph and the view angle θ. θ Scanner view angle. r Linear coordinate relative to the center of the detector, used to represent the parallel beam and fan beam type CT scanners (see Radon Transform). p(y) Forward projection of the current estimated image. d(y) Scanner data. q(y)

(10) $\mathrm{Ratio}\mathrm{or}\mathrm{quotient}\mathrm{defined}\mathrm{as}=\frac{d\left(y\right)}{p\left(y\right)}.$ q(x) The ratio q(y) is back-projected to the spatial coordinate space of the image x. h(y|x) Coefficient that enables expressing the forward projection operator as a linear summation operation. It is the fraction of linear-attenuation coefficient combination at pixel x that contributes to the projection sample at y. It may be thought of as an interpolation coefficient. If the blur due to the detector size is dominant, it may also be thought of as point-spread function or impulse response. In a strict sense, it is both. f.sub.θ( ) Transfer function that transforms projections p(y) into estimated scattered projections p′(y), obtained from estimating the best fit between the collection of projection samples p(y) at a particular view angle θ and the collected CT data d(y) at the same view angle. p′(y) The result of applying the transfer function f.sub.θ( ) to p(y): p′(y)=f.sub.θ(p(y)). f.sub.θ.sup.−1 (p′) Inverse of the transfer function f.sub.θ( )—i.e., p(y)=f.sub.θ.sup.−1(p′(y)).

(11) FEMOS is initialized in steps 1 and 2. Steps 3, 4, 5 and 6 are executed in each iteration: (3) the current image guess (b(x)) is forward projected to obtain p(y) for a particular angle view θ; (4) this step is optional and performs scatter reduction and beam-hardening compensation; (5) the ratio q(y) between the scanner data d(y) and p(y) is calculated, and the ratio q(y) is then back projected to obtain q(x); and (6) the actual guess b(x) is updated by multiplying q(x). This cycle is repeated in each of the iterations within a subset of angles θ (steps 7 and 8). Finally, at step 9, a reconstructed image is outputted (e.g., on a display).

(12) The ratio quantity q(y) is an operator that compares the reprojected and scatter-transformed quantity to the collected CT data. It is just one way of doing such a comparison. Many other types of comparisons, besides a ratio, may be effective. For example, the compared quantities may be subtracted. The quantity outputted by the comparison may be taken to a power that is greater or lesser than 1 to amplify or dampen the effect of the comparison, respectively.

(13) The “forward projection” operation is based on the Radon Transform, a well-known mathematical operation that can be thought as the data conversion from Cartesian coordinates x=(x,y) to polar coordinates y=(r,θ) for fan-beam scanners. Forward projection (FP) has been defined in terms of the photons received by the detector:

(14) $\begin{array}{cc}\mathrm{FP}\left(y\right)=I_o\left(y,E\right)\exp \left\{\underset{x\in X}{\Sigma }h\left(y|x\right)\mu \left(x,E\right)\right\}& \left(1\right)\end{array}$
where h(y|x) is fraction of the value of μ(x, E) that contributes to the projection at angle θ. It is sometimes referred to as a point-spread function. The term μ is the attenuation coefficient, E is the scanner energy level, I.sub.o is the mean detector reading in the absence of attenuation and background, and X is the set of x that contribute to the detector location and angle indicated by y. “Back projection,” on the other hand, is based on the inverse Radon Transform, which performs the reverse operation.

(15) According to the present disclosure, scanner data, and an estimated forward projection of the object, or reprojection, are used to remove scatter and correct beam hardening artifacts. In any iterative CT reconstruction algorithm that calculates a forward projection to update an estimated object image, an extra step is introduced in which the forward projection is modified according to a transfer function.

(16) A flow diagram of a process for removing beam hardening and scatter artifacts from a CT image reconstruction according to embodiments of the disclosure is depicted in FIG. 2. P1, P2 and P3 are the tasks required in step 4 of FIG. 1 to produce a CT image reconstruction (FIG. 1, step 9) without beam-hardening and scatter artifacts. At P1, a forward projection p(y) is determined from scanner data using any iterative CT image reconstruction algorithm that employs a forward projection operation. At P2, a transfer function f.sub.θ( ) is obtained by calculating the best-fit between the forward projection p(y) and the scanner data.

(17) At P3, the forward projection p(y) is modified to generate p′(y) according to the transfer function f.sub.θ( ) where p(y) is the forward projection of the current estimated image for a particular angle, f.sub.θ( ) is the transfer function, and y is a variable that indexes source-detector pairs.
p′(y)=f.sub.θ(p(y))  (2)

(18) Once p(y) is replaced by p′(y), the rest of the iterative algorithm is executed as originally designed, and beam hardening and scatter artifacts are removed from the reconstructed image so generated.

(19) The transfer function f.sub.θ( ) is the mathematical function that has the best fit to a series of data points. These data points are the pairs (p(y),d(y)), where d(y) is the scanner data for every θ.

(20) The best fit can be calculated using any curve fitting technique, and the function can be expressed in terms of any mathematical form, such as polynomials, splines, etc.

(21) The above-described technique for removing beam hardening and scatter can also be utilized to correct the scanner data by executing the optional step P4 (FIG. 2). A flow diagram of a process for correcting scanner data to remove beam hardening and scatter according to embodiments is depicted in FIG. 3. At S1, the transfer function(s) f.sub.θ( ) are stored and/or accessed. At S2, the scanner data d(y) are modified according to the following equation:
d′(y)=f.sub.θ.sup.−1(d(y))  (3)
where f.sub.θ.sup.−1( ) is the inverse of the transfer function f.sub.θ( ). At S3, the corrected data d′(y) are stored. Once the whole CT image reconstruction is completed at step 9 in FIG. 1, any other CT image reconstruction algorithm can process the corrected data d′(y) in order to deliver an output free of scatter and beam hardening.

(22) The inverse of the transfer function f.sub.θ.sup.−1( ) can be calculated by any mathematical technique, and it may be coded using a lookup table. In addition, for practicality, the function f.sub.θ( ) can be obtained from a downsampled version of the pairs (p(y),d(y)), which may reduce the processing time of the data correction.

(23) Various aspects of the disclosure may be provided as a system, method, and/or computer program product. The computer program product may include a computer readable storage medium (or media) having computer readable program instructions thereon for causing a processor to carry out aspects of the present invention.

(24) The computer readable storage medium can be a tangible device that can retain and store instructions for use by an instruction execution device. The computer readable storage medium may be, for example, but is not limited to, an electronic storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any suitable combination of the foregoing. A non-exhaustive list of more specific examples of the computer readable storage medium includes the following: a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), a static random access memory (SRAM), a portable compact disc read-only memory (CD-ROM), a digital versatile disk (DVD), a memory stick, a floppy disk, a mechanically encoded device such as punch-cards or raised structures in a groove having instructions recorded thereon, and any suitable combination of the foregoing. A computer readable storage medium, as used herein, is not to be construed as being transitory signals per se, such as radio waves or other freely propagating electromagnetic waves, electromagnetic waves propagating through a waveguide or other transmission media (e.g., light pulses passing through a fiber-optic cable), or electrical signals transmitted through a wire.

(25) Computer readable program instructions described herein can be downloaded to respective computing/processing devices from a computer readable storage medium or to an external computer or external storage device via a network, for example, the Internet, a local area network, a wide area network and/or a wireless network. The network may comprise copper transmission cables, optical transmission fibers, wireless transmission, routers, firewalls, switches, gateway computers and/or edge servers. A network adapter card or network interface in each computing/processing device receives computer readable program instructions from the network and forwards the computer readable program instructions for storage in a computer readable storage medium within the respective computing/processing device.

(26) Computer readable program instructions for carrying various aspects of the present invention may be assembler instructions, instruction-set-architecture (ISA) instructions, machine instructions, machine dependent instructions, microcode, firmware instructions, state-setting data, or either source code or object code written in any combination of one or more programming languages, including an object oriented programming language such as Smalltalk, C++ or the like, and conventional procedural programming languages, such as the “C” programming language or similar programming languages. The computer readable program instructions may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider). In some embodiments parts of the computer readable program instructions may execute on one or more graphical processing units that may reside on the user's computer or on a remote computer. Such portions of the program instructions may be written using source code that is of the Compute Unified Device Architecture (CUDA), Open-CL or Open-MP language extensions. There are language extensions to C/C++, Python, Fortran and other types of computer languages. Additionally there are many computer language libraries that may be used and that are compatible with GPU's, which may be used for portions of the program instructions. In some embodiments, electronic circuitry including, for example, programmable logic circuitry, field-programmable gate arrays (FPGA), or programmable logic arrays (PLA) may execute the computer readable program instructions by utilizing state information of the computer readable program instructions to personalize the electronic circuitry, in order to perform aspects of the present invention.

(27) Aspects of the disclosure are described herein with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer readable program instructions.

(28) These computer readable program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks. These computer readable program instructions may also be stored in a computer readable storage medium that can direct a computer, a programmable data processing apparatus, and/or other devices to function in a particular manner, such that the computer readable storage medium having instructions stored therein comprises an article of manufacture including instructions which implement aspects of the function/act specified in the flowchart and/or block diagram block or blocks.

(29) The computer readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other device to cause a series of operational steps to be performed on the computer, other programmable apparatus or other device to produce a computer implemented process, such that the instructions which execute on the computer, other programmable apparatus, or other device implement the functions/acts specified in the flowchart and/or block diagram block or blocks.

(30) The flowchart and block diagrams in the Figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of instructions, which comprises one or more executable instructions for implementing the specified logical function(s). In some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts or carry out combinations of special purpose hardware and computer instructions.

(31) While it is understood that the program product of the present invention may be manually loaded directly in a computer system via a storage medium such as a CD, DVD, etc., the program product may also be automatically or semi-automatically deployed into a computer system by sending the program product to a central server or a group of central servers. The program product may then be downloaded into client computers that will execute the program product. Alternatively the program product may be sent directly to a client system via e-mail. The program product may then either be detached to a directory or loaded into a directory by a button on the e-mail that executes a program that detaches the program product into a directory. Another alternative is to send the program product directly to a directory on a client computer hard drive.

(32) FIG. 4 depicts an illustrative computing system 100 for implementing various aspects of the present disclosure according to embodiments. The computing system 100 may comprise any type of computing device, and for example includes at least one processor, memory, an input/output (I/O) (e.g., one or more I/O interfaces and/or devices), and a communications pathway. In general, processor(s) execute program code, which is at least partially fixed in memory. While executing program code, processor(s) can process data, which can result in reading and/or writing transformed data from/to memory and/or I/O for further processing. The pathway provides a communications link between each of the components in computing system 100. I/O can comprise one or more human I/O devices (e.g., a display), which enable a user to interact with computing system 100. The computing system 100 is coupled to, or provided as part of, a CT scanning system.

(33) The foregoing description of various aspects of the invention has been presented for purposes of illustration and description. It is not intended to be exhaustive or to limit the invention to the precise form disclosed, and obviously, many modifications and variations are possible. Such modifications and variations that may be apparent to an individual skilled in the art are included within the scope of the invention as defined by the accompanying claims.