US 6,201,888 B1Grant
System and method for restoring, describing and graphically displaying noise-corrupted boundaries in tomography images
Issue Date:2001-03-13
•8 Claims
•11 Drawing Sheets
Abstract
Noise-corrupted boundary information in tomographic images is restored using a data structure, called a “boundary envelope”. Both the restored boundary information and a measure of the precision of the restoration are described by the process. This data structure is used to describe the restored information in both qualitative and quantitative terms. The results of the boundary restoration process are described qualitatively by graphically displaying the boundary envelope together with the noisy CT image in such a way that allows a human observer to (a) see more details of the boundary than are visible in the CT image alone, and (b) to visually apprehend the precision with which the boundary has been restored. A boundary envelope describes a region in the image within which the boundary of a given noisy object is guaranteed to lie. The boundary envelope describes a set of limits on the object boundary, and limits on those properties of a noisy object that can be computed from boundary information.
Metadata
Assignee
- International Business Machines Corporation
Inventor
- Alan David Kalvin
Application Information
Application Number:US 09/025,675
Filing Date:1998-02-18
Priority Date:1998-02-18
Art Unit:7
Classifications
IPC:
G06K 900G06K 936A61B 600G01T 1166
Field of Search:
382131382154382197382241382242128920128922378 4378901250363042503900225039004
Patent Drawings (11 sheets)
Description
Background of the Invention
[0002] 1. Field of the Invention
[0003] The present invention generally relates to the field of computer image processing of computer tomography (CT) data and, more particularly to the problem of restoring noise-corrupted boundaries in CT images, and to the characterizing and displaying of this restored boundary information.
[0004] 2. Background Description
[0005] U.S. Pat. No. 5,416,815, which is incorporated herein by reference in its entirety, describes computer tomography (CT) systems and the method of image reconstruction from projections.
[0006] Computed tomography images are created from projection data by a process known as “image reconstruction from projections”. If the projection data are corrupted by noise, the reconstructed images will in turn be corrupted by noise. The artifacts in the images resulting from this noise are known as “reconstruction artifacts”.
[0007] For example, in X-ray CT imaging, a significant amount of noise can be introduced into the projection data when the objects being scanned contain metal. The reconstruction artifacts manifest in the form of blooming and streaking artifacts that radiate from he regions of the image where the metal is present.
[0008] These artifacts (known as “metal-induced” reconstruction artifacts) produce severe corruption especially at the boundaries of objects in the images. This significantly limits the clinical usefulness of the images, both for diagnostic and therapeutic purposes, since an accurate knowledge about locations of object boundaries is crucial in applications such as computer-assisted surgery, and radiotherapy.
[0009] There are two basic approaches to recover information about the corrupted boundaries, a “projection-based” approach, and an “image-based” approach.
[0010] In the “projection-based” approach, projection data obtained from the CT scanner are used to recover missing boundary information. The prior art in boundary recovery from projection data includes:
[0011] m. Bergstrom, J. Litton, L. Eriksson, C. Bohm, and G. Blomqvist, “Determination of Object Contour from Projections for Attenuation Correction in Cranial Positron Emission Tomography”, Journal of Computer Assisted Tomography,April 11982, 6(2), pp. 365-372; Jean-Philippe Thirion and Nicholas Ayache, “Method and device for examining a body, particularly for tomography”, U.S. Pat. No. 5,421,330, (1995); N. Srinivasa, K. R. Ramakrishnan, and K. Rajgopal, “Detection of edges from projections”, IEEE Trans. Medical Imaging,March 1992, 11(1), pp. 76-80; Ralph Benjamin, “Method and apparatus for generating images”, U.S. Pat. No. 5,647,018, (1997).
[0012] In the “image-based” approach, the noisy CT image is first “cleaned-up” by applying a suitable noise-reduction algorithm. Since this process improves the overall quality of the image, it will improve the quality of the boundaries, which can then be determined with improved precision. Since the image-based methods are primarily concerned with improving the overall quality of the image, they are not especially well-suited for the specific task of boundary-recovery. Nevertheless, they are included here for the sake of completeness.
[0013] In general, the most appropriate noise reduction algorithms to use in the image-based approach are hose algorithms known as “metal artifact reduction” (MAR) methods. The prior art in MAR algorithms includes the following: D. D. Robertson, P. J. Weiss, E. K. Fishman, D. Magid, and P. S. Walker, “Evaluation of CT techniques for reducing artifacts in the presence of metallic orthopedic implants”, Journal of Computer Assisted Tomography,March-April 1988, 12(2), pp. 236-41; Hamid Soltanian-Zadeh, Joe P. Windham, and Jalal Soltanianzadeh, “CT Artifact Correction: An Image Processing Approach”, SPIE Medical Imaging '96, Newport Beach, Calif., February. 1996; Heang K. Tuy, “An Algorithm to Reduce Clip Artifacts in CT Images”, SPIE Vol.1652 Medical Imaging VI: Image processing(1992); G. H. Glover and N. J. Pelc, “An algorithm for the reduction of metal clip artifacts in CT reconstruct ions”, Medical Physics,8(6), November/December 1981, pp. 799-807; T. Hinderling, P. Ruegsegger, M. Anliker, and C. Dietschi, “Computed Tomography reconstruction from hollow projections: an application to in vivo valuation of artificial hip joints”, Journal of Computer Assisted Tomography,February 1979, 3(1), pp. 52-57; W. A. Kalender, R. Hebel, and J. Ebersberger, “Reduction of CT artifacts caused by metallic implants”, Radiology,August. 1987, 164(2), pp. 576-7; E. Klotz, W. A. Kalender, R. Sokiranski, and D. Felsenberg, “Algorithms for the reduction of CT artifacts caused by metallic implants”, Medical Imaging IV: PACS System Design and Evaluation,vol. 1234, Newport Beach, Calif., February 1990, pp. 642-650; R. M. Lewitt and B. H. T. Bates, “Image reconstruction from projections: IV: Projection completion methods (computational examples)”, Optik 50, 1978, pp. 269-278; B. E. Oppenheim, “Reconstruction tomography from incomplete projections”, Reconstruction Tomography in Diagnostic and Nuclear Medicine,Ter-Pogossian (editor), University Park Press, Baltimore, 1977, pp. 155-183; and G. Wang, D. L. Snyder, A. O'Sullivan, and M. W. Vannier, “Iterative deblurring for CT metal artifact reduction”, IEEE Trans. MedicalImaging, October 1996, 14(5), pp. 657-664.
[0014] The following are the limitations of the prior art. The existing projection-based boundary-recovery methods are designed to work with high-quality projection data, that is projection data that are (i) highly-sampled, (ii) of high-resolution, and (iii) contain an insignificant amount of noise. Unlike the present invention, they are not designed to handle noisy projection data, or sparsely-sampled or low-resolution projection data.
[0015] Therefore, these methods are not suitable for embodiment in practical, real-world systems that can be routinely used in hospitals and medical clinics, and that rely only on data that are readily available from standard medical CT scanners.
[0016] The image-based methods, as already mentioned, are not especially well-suited for the specific task of boundary-recovery. Since they are not expressly designed to solve this problem.
Definitions
[0017] The basic concepts described in the present invention are better understood with review of the following definitions.
[0018] PIXEL: A picture element. The basic element in a two-dimensional (2D) digital picture.
[0019] IMAGE: A rectangular 2D digital picture. Each pixel in the image is identified by a pair of integers (x,y), where x and y are, respectively, the column and row locations of the pixel. (The terms “slice” and “image” are used interchangeably in describing the present invention).
[0020] SLICE: See IMAGE.
[0021] IMAGE SEGMENTATION: The process of identifying objects of interest in an image.
[0022] EDGE: An edge is a point in an image at the transition between two regions having markedly disparate pixel values.
[0023] SEGMENTED OBJECT: A object of interest in an image identified by the process of segmentation.
[0024] RAY: This refers to a single X-ray beam that travels from the CT scanner X-ray tube to a detector cell on the CT scanner detector array.
[0025] RAYSUM: This refers to the basic unit of projection data collected by a CT scanner. It is the value associated with a single X-ray beam. It is a measure of the total attenuation of the beam ray as it travels from its source through the object being scanned to the CT detector array.
[0026] VIEW: A view consists of a complete set of rays produced by a CT scanner with the X-ray tube in a fixed position.
[0027] DERIVATIVE PROJECTION DATA: Given a set of projection data P, a derivative set of projection data D is a set of projection data derived from P that has less information content. Typical examples of sets of derivative projection data are sets produced when P is sub-sampled, when its resolution is reduced, or when it is otherwise filtered.
[0028] SINOGRAM: In its standard mode of operation, a CT scanner collects a set S of views while the CT table is held in a fixed position. The views in the set S are acquired at different positions of the X-ray tube as it rotates around the table. A sinogram consists of all the projection data, or a derivative thereof, in a single set S of views.
[0029] Since each data point in a sinogram corresponds to a single ray traveling from the X-ray source to the detector, a sinogram can be represented as a 2D image, where each pixel is uniquely identified by the ordered pair of integers (r,v) where v is the view containing this ray, and r is the number of the ray within view v. Therefore, the following terms are used interchangeably: sinogram data, projection data, sinogram image, and projection image.
[0030] SCOUT IMAGE: A scout image is a 2D digital X-ray produced when a CT machine scans a collection of objects while the X-ray tube is held in a fixed position, and the CT table, together with the objects, is moved.
Summary of the Invention
[0031] It is therefore an object of the present invention to provide a system and method to recover the details of object boundaries in computed tomography images that are corrupted by noise, and in particular in X-ray computer tomography (CT) images that have been corrupted by reconstruction artifacts.
[0032] It is another object of the present invention to provide a system and method for determining and describing the constraints on the precision of the recovered boundary information.
[0033] It is a further object of the present invention to provide a system and method for graphically displaying the recovered boundary information together with the constraints on the precision of the restored information.
[0034] It is yet another object of the present invention to provide a system and method for determining physical properties of the objects in tomographic images from the recovered boundary information.
[0035] According to the invention, there is provided a boundary-recovery system that:
[0036] uses projection data and tomographic image data to restore noise-corrupted boundaries in tomographic images;
[0037] produces a description of the limits of the precision of the restored boundary information;
[0038] graphically displays the restored information in a manner that allows a human observer to see the locations of corrupted object boundaries, together with a graphical representation of the limits of precision of the determined boundaries;
[0039] computes physical properties of objects in the tomographic images from the restored boundary information and the description of the limits of restoration precision;
[0040] is applicable to the processing of not only high-quality sinogram data, but also to the processing of to sparsely-sampled and/or low-resolution projection data, including projection data derived from scout images as well;
[0041] is applicable to projection data corrupted by noise of the type that is induced by the scanning of objects made of material (such as steel) that is opaque, or near-opaque to the scanning x-rays;
[0042] is applicable to recovering the boundaries of convex objects, and the boundaries of the convex hulls of concave objects (but not the boundaries of the concave objects themselves); and
[0043] is clinically viable in the sense that this method that can be embodied in a practical, real-world system that can be used routinely in hospitals and medical clinics, and relies only on data that are available from standard medical CT scanners.
[0044] More specifically, this invention is a technique for restoring missing boundary information in CT scans of medical patients having implanted metallic prostheses, a method of describing the restored boundary information, a method of graphically displaying the restored boundary information, and a method for computing geometric properties of objects with noisy boundaries in CT images, using the techniques according to the invention.
Brief Description of the Drawings
[0045] The foregoing and other objects, aspects and advantages will be better understood from the following detailed description of a preferred embodiment of the invention with reference to the drawings, in which:
[0046] FIG. 1 is a block diagram of a computer tomography (CT) system using the present invention;
[0047] FIG. 2 is a flow chart showing the overall logic of the computer implemented process according to the invention;
[0048] FIG. 3 shows a diagram showing an example of a boundary envelope;
[0049] FIG. 4 is a flow chart showing the steps of extracting edge pairs from a sinogram image;
[0050] FIG. 5 is a flow chart showing the steps of deriving a boundary envelope from the sinogram edge pairs extracted by the process shown in FIG. 4;
[0051] FIG. 6 is a flow chart showing the method of computing an image tangent line from a sinogram edge;
[0052] FIG. 6A is a diagram showing the scanning geometry related to computing the line PQ in the method of FIG. 6;
[0053] FIGS. 7A, 7B, 7C, and 7D are diagrams illustrating the process for computing the outer polygon of a boundary envelope;
[0054] FIG. 8 is a flow chart showing the process of computing the inner polygon of a boundary envelope;
[0055] FIGS. 9A, 9B and 9C are diagrams illustrating the process of FIG. 8; and
[0056] FIG. 10 is a photographic image which illustrates the superimposition of a boundary envelope on a noisy CT image.
Detailed Description of a Preferred Embodiment of the Invention
[0057] Referring now to the drawings, and more particularly to FIG. 1, there is shown one preferred embodiment of the present invention for recovering, describing, and displaying missing boundary information in noise-corrupted computer tomography (CT) images 130 produced by a computed tomography scanner 105 and output via a CT input/output (I/O) unit 110. A patient 120 is scanned by the CT scanner 105, collecting projection data 135, from which is created a set of two-dimensional CT images 130. This process of creating the images 130 is known as image reconstruction from projections. The CT images 130 contain cross-sectional details of the scene that was scanned, which typically includes the patient 120.
[0058] The CT images 130 and the related CT projection data 135 are input to a computer 150 and, optionally, stored on an external storage medium 155. The computer 150 may be, for example, an IBM RS/6000 workstation running AIX, IBM'S version of the UNIX operating system, and the external storage medium 155 may be, for example, a disk storage system connected to the computer. An boundary-recovery program 140 running on the computer 150 reads in the CT images 130 and projection data 135, and produces the restored boundary information 160.
[0059] The restored boundary information 160 is graphically displayed on a computer monitor 170. Further, this restored boundary information 160 is used by a computer program 180 to measure numerical properties of image objects, for example geometric properties like surface area, boundary perimeter, centroid position, moments and products of inertia, eccentricity, etc.
[0060] FIG. 2 shows a flow chart of the boundary-recovery program 140 shown in FIG. 1. The CT image is processed as follows. The noisy CT image (input at function block 200), and the noisy sinogram (i.e., projection) data (input at function block 210), are read into the computer. In function block 220, the high contrast sinogram edges are detected.
[0061] Each of these high-contrast sinogram edges corresponds to a line in the CT image that is tangent to an object boundary. We know that these correspondences do indeed exist, because of the particular nature of (a) the sinogram data being processed, and (b) the boundaries being restored. That is, the sinogram data are affected by noise that corrupts sinogram pixel values, but not the location of high-contrast sinogram edges. In addition, the boundaries being restored belong to convex objects.
[0062] Once the boundary tangents have been computed in function block 230, the boundary envelope (see (definition below) is computed in function block 240. The boundary envelope, which is derived from the tangent data, is a novel feature of this invention. Its function is to describe the limits of the precision with which the missing boundary information can be restored. Once the boundary envelope is computed, it is displayed with the CT image at function block 250, and it is also used to computer quantitative image properties in function block 260.
[0063] A boundary envelope (Pinner, Pouter), is defined to be the region of intersection between the pair of nested, convex polygons Pinnerand Pouter. An example of a boundary envelope is shown in FIG. 3. A boundary envelope delimits the region within which a boundary is constrained to lie, and quantifies the degree of precision to which the boundary location can be specified. Given a boundary envelope, we know the region in which the boundary is guaranteed to lie, but we cannot be more precise in specifying the location of the boundary. The two polygons Pinnerand Pouterthat define a boundary envelope have the following specific properties:
[0064] They have the same number of vertices, and
[0065] either polygon can be uniquely determined from the other.
[0066] FIG. 4 is a flowchart illustrating the method of extracting the sinogram edges (function block 220 of FIG. 2). The CT image data are input at function block 400. The projection data (also referred to form a 2D image) are read in 420, and an edge-detector algorithm 440 is applied to this projection image, using prior art image processing techniques (see, for example, Computer Visionby Ballard and Brown, Prentice Hall, 1982). A region R is identified in process block 430 that completely encloses the object of interest in the CT image input at function block 400. In the preferred embodiment of this invention, this region is identified manually by a human operator by tracing the outline of region R on top of the CT image on the computer monitor. Now region R induces a set of constraints on the possible edge locations on the sinogram image that correspond to points of the object boundary. The limits on locations of the sinogram edges are computed in function block 450. These edge constraints can be easily derived, using prior art methods, from R and the CT scanning geometry 415. (In general, such a region R can always be identified in the type of CT image that we consider in the preferred embodiment of this invention, even though the precise location of he object boundary is corrupted by noise. In the event that the CT image is so corrupted by noise as to make it impossible to find such a region R, the method described in FIG. 4 can still applied, with steps 430 and 450 being skipped. The method will still work correctly when these two steps are skipped, since they are used primarily to speed up computation.
[0067] In function block 460, further constraints on the possible sinogram edges are computed, by making use of the facts that:
[0068] (a) the scanned object is convex; and
[0069] (b) projection rays passing through the object are attenuated more (and therefore produce sinogram pixels with higher values) than rays passing through the background region immediately outside the object.
[0070] From (a), we can conclude that in each row of the sinogram, the there are exactly two edges corresponding to the object boundary, and from (b) that the image intensity gradient at the leftmost of these two edges is positive, and the image intensity gradient at the rightmost of these two edges is negative.
[0071] The constraints in function blocks 450 and 460 are used to select, from edge data computed in function block 440, the required edges pairs 470. If these constraints are not adequate on their own to uniquely identify the required edges pairs 470, a further election step is required to do this. In the preferred embodiment of this invention, an additional step is performed manually by a human operator.
[0072] FIG. 5 is a flowchart of the method of computing a boundary envelope from sinogram edges. The sinogram edge data 500 and the parameters of the scanning geometry 510 used as inputs to function block 520 where the boundary tangents in the image are computed.
[0073] The parameters of the scanning geometry 510 that are used in this invention are:
[0074] the CT X-ray source-to-detector distance;
[0075] the CT X-ray source-to-origin distance;
[0076] the ray geometry: (i) parallel or (ii) divergent (fan-beam);
[0077] the detector shape (for divergent ray geometry): (i) arc or (ii) planar;
[0078] number of rays per view;
[0079] spacing between successive rays;
[0080] the number of views;
[0081] the azimuth angles of the X-ray source at every view; and
[0082] the rotation direction of gantry: (i) clockwise or (ii) counter-clockwise.
[0083] In the preferred embodiment of this invention:
[0084] the ray geometry is divergent;
[0085] the detector is arc-shaped;
[0086] the angular spacing between successive rays is constant; and
[0087] each view has an odd number of rays, and the center-most ray intersects the detector at its center.
[0088] After the tangents corresponding to the sinogram edges are computed in function block 520, the outer polygon of the boundary envelope is is computed in function block 530. In function block 540, the inner polygon of the boundary envelope is computed, completing the calculation of the boundary.
[0089] FIG. 6 describes the details of the process of function block 520 in FIG. 5. FIG. 6 is a flowchart showing the method used to derive the line segment corresponding to a given sinogram pixel. The accompanying drawing in FIG. 6A shows the scanning geometry related to computing this line segment.
[0090] The sinogram edge data is input at function block 610 and comprises:
[0091] (r,v) are the (ray,view) coordinates of the edge; and
[0092] α is the azimuth angle of the x-ray source at view v.
[0093] The CT scanner geometry data input at function block 620 comprises:
[0094] A is to distance from X-ray source to the origin (i.e., the length of line PO in FIG. 6A);
[0095] B is to distance from X-ray source to the detector (i.e., the length of line PC in FIG. 6A);
[0096] rcis the ray number of the central ray (i.e., the ray along line PC in FIG. 6A); and
[0097] δ is the angle between successive rays in the view.
[0098] In function block 630, β, the angle between lines PC and PQ in FIG. 6A, is computed. In function block 640, the 2×2 rotation matrix R is initialized. In function block 650, the 2×2 matrix M is initialized. In function block 660, the coordinates of the endpoints of line segment PQ are computed.
[0099] The sequence of process steps in function blocks 610, 620, 630, 640, 650, and 660 (FIG. 6) is applied to every sinogram edge. This completes the computation of all boundary tangents (function block 520 of FIG. 5).
[0100] The next processing step in this invention is to compute the outer polygon of the boundary envelope process block 530 of FIG. 5. FIGS. 7A to 7D illustrate the details of this process.
[0101] In FIG. 7A, (L1,R1), (L2,R2), (L3,R3), and (L4,R4) are four pairs of tangent lines obtained from scanning a convex object with scan views acquired at points P1, P2, P3, P4. In each pair of tangents, Lilies on the left side of the scanned object, and is called the “left tangent”. Similarly, each Riis called a “right tangent”. To compute the outer polygon, we first compute two intermediate polygons, polygon Pv=(v1,v2,v3,v4) which is formed by the intersection of the set of left tangents (see FIG. 7B) and polygon Pw=(w1,w2,w3,w4) which is formed by the intersection of the set of right tangents (see FIG. 7C).
[0102] Note that the problem of finding the convex polygon that is defined by the intersection of a set of N tangents is equivalent to the problem of finding the intersection of N half planes. In general, this problem requires O(nlog(n)) time (see for example F. Preparata and M. Sharnos, “Computational Geometry”, Springer-Verlag, 1985). However, in the problem at hand, the tangents in each set are ordered. Therefore, each vertex can be computed from the intersection of pair of consecutive tangents, e.g. Vi=LiLi+1. Therefore, the two polygons can be found in linear time.
[0103] To calculate Pouter=(O1,O2,O3,O4,O5,O6,O7,O8), the outer polygon of the boundary envelope, we now compute the intersection between polygons Pv, and Pw, as shown in FIG. 7D. This completes the processing of function block 530 of FIG. 5. Note that computing the intersection of two polygons can be done using prior art algorithms (see for example, J. O'Rourke, Computational Geometry in C,Cambridge University Press, 1994).
[0104] FIGS. 8 and 9A to 9C illustrate the details of calculating Pinner=(I1,I2,I3,I4,I5,I6,I7,I8), the inner polygon of the boundary envelope (function block 540 of FIG. 5). In FIG. 8, function block 800, counter j is initialized to 1. In function block 810, Kjis set to line segment (Oj, O[(j MOD N)+2](see FIG. 9A). In function block 820, counter j is incremented, and if its value is less than or equal to N (the number of vertices in the outer polygon) as determined in decision block 830, the process loops back to function blocks 810 and the process is repeated. When all N line segments K1,K2, . . . , KN, have been calculated (see FIG. 9B), and counter j is larger than N, function block 840 is executed, and inner polygon Pinner=(I1,I2, . . . ,IN) is the polygon defined by the intersection of the set of line segments (K1,K2, . . . , KN) (see FIG. 9C).
[0105] The reason that the object boundary (FIG. 9A) is guaranteed to lie strictly within the boundary envelope (FIG. 9C) is a follows. First, since the object is convex, and the edges of the outer polygon of the boundary envelope are tangent to the object, the object must lie completely inside the outer polygon. Second, consider the line segment K1=(O1,O3) (see FIG. 9A). We know that the object boundary must touch polygon edges (O1, O2) and (O2, O3). Let us call these two contact points t1and t2. Since the object is convex, the portion of its boundary between t1and t2cannot cross over line segment K1. Therefore, the piece of boundary segment between t1and t2is guaranteed to lie with the shaded triangular region (O1,O2,O3). By repeating this argument for every triple of successive outer polygon edges (O1, O(i MOD N)+1, O(i MOD N)+2, we see that the object boundary is guaranteed to lie outside the region defined by the intersection of line segments K1,K2, . . . , KN(FIG. 9B). Therefore, the object boundary is guaranteed to lie:
[0106] inside polygon Pinner=(I1,I2, . . . , IN), and
[0107] outside polygon Pouter=(O1,O2, . . . , ON).
[0108] In other words the object is guaranteed to lie within the boundary envelope (Pinner, Pouter) (FIG. 9C).
[0109] The boundary envelope of an object can be used for both qualitative and quantitative evaluation of the physical properties of a convex object in a noisy CT image.
[0110] In the preferred embodiment of this invention, qualitative evaluation is achieved by displaying on a computer monitor the noisy CT image, together with a graphical overlay of the boundary envelope (FIG. 10). The physician (or other human observer) can then visually integrate the information presented by the boundary envelope together with the CT image, in order to make more accurate clinical judgments than would be possible from observing the just the noisy CT image itself.
[0111] Since the boundary envelope has a precise mathematical definition, it can also be used to quantitatively evaluate properties of objects and their boundaries. In the preferred embodiment of this invention, these include using the inner and outer polygons to calculate bounds on an object's surface area, boundary perimeter, centroid position, moments, and products of inertia, eccentricity, etc.
[0112] Given this disclosure, alternative equivalent embodiments will become apparent to those skilled in the art. These embodiments are also within the contemplation of the invention. Thus, while the invention has been described in terms of a single preferred embodiment, those skilled in the art will recognize that the invention can be practiced with modification within the spirit and scope of the appended claims.
Claims
Having thus described my invention, what I claim as new and desire to secure by Letters Patent is as follows:
1. A computer-implemented method of processing computed tomography (CT) data for restoring noise-corrupted boundary information comprising the steps of:
i) detecting pairs of edges in projection data;
ii) deriving from said edge pairs, two corresponding sets of line segments in a CT image, said sets of line segments being tangent to a convex object in the CT image having noise-corrupted boundaries;
iii) computing first and second convex polygons, the first polygon defined by the intersection of the line segments in the first set of said line segments, and the second polygon defined by the intersection the line segments in the second set of said line segments;
iv) computing an intersection of said two convex polygons to produce a third polygon which is referred to as an outer polygon;
v) computing from said outer polygon, a fourth polygon, which is referred to as an inner polygon, that lies within said outer polygon, and that is uniquely determined by said outer polygon; and
vi) computing a region of intersection between said inner and outer polygons, said region of intersection being referred to as a boundary envelope.
2. The computer-implemented method as in claim 1, practiced in combination with computer-implemented methods for describing restored boundary information and limits in a precision of the restored boundary information.
3. The computer-implemented method as in claim 2, wherein said computer-implemented methods for describing the restored boundary information, and the limits in its precision, comprise a qualitative method of description and a set of quantitative methods of description.
4. The computer-implemented method as in claim 3, wherein said qualitative method of description comprises a method for graphically displaying on a computer monitor the boundary envelope together with the noisy CT image.
5. The computer-implemented method as in claim 3, wherein said methods of quantitative description comprise methods of computing bounds on properties of the object whose boundary has been restored.
6. The computer-implemented method as in claim 5, wherein said methods of computing bounds on the properties of said object with restored boundary comprise methods that employ the geometric shape of a boundary envelope to compute said object's surface area, boundary perimeter, centroid position, moments and products of inertia, eccentricity, and other two dimensional properties of an object that can be computed from its boundary.
7. The computer-implemented method as in claim 1, wherein said projection data are projection data that are readily accessible on a standard medical imaging scanner in a clinical environment.
8. The computer-implemented method as in claim 7, wherein said projection data are scout images.
Patent Citations (7)
Non-Patent Literature (12)
- Spetsieris et al, “Visuo-Computational Tools for PET Physiological Imaging”, IEEE Conference on Nuclear Science Symposium and Medical Imaging; ISBN: 0-7803-0513-2, vol. 3, pp. 2149-2153, Nov. 1991.Examiner
- M. Bergstron et al, “Determination of Object Contour from Projections for Attenuation Correction in Cranial Positron Emission Tomography”, J. of Computer Assisted Tomography, pp. 365-372, Apr. 1982.Applicant
- N. Srinivasa et al., “Detection of Edges from Projections” IEEE 1992, pp. 76-80.Applicant
- W. A. Kalender et al., “Reduction of CT Artifacts Caused by Metallic Implants,” Radiology, vol. 164, No. 2, Aug. 1987; pp. 576-577.Applicant
- Th. Hinderling et al., “Computed Tomography Reconstruction from Hollow Projections: An Application to In Vivo Evaluation of Artificial Hip Joints,” J. of Computer Assisted Tomography, pp. 52-57, vol. 3, No. 1, 1979.Applicant
- B. E. Oppenheim, “Reconstruction Tomography from Incomplete Projections,” University Park Press, pp. 155-183.Applicant
- D. D. Robertson et al, “Evaluation of CT Techniques for Reducing Artifacts in the Presence of Metallic Orthopedic Implants,” J. of Computer Assisted Tomography, 1988, pp. 236-241.Applicant
- E. Klotz et al., “Algorithms for the reduction of CT artefact Caused by Metallic Implants,” Siemens Medical System, D-8520. SPIE vol. 1324, pp. 642-650.Applicant
- G.H. Glover et al, “An Algorithm for the Reduction of Metal Clip Artifacts in CT Reconstruction,” Medical Physics, vol. 8, No. 6, Nov./Dec. 1981, pp. 799-807.Applicant
- Ge Wang, et al., “Interative Deblurring for CT Metal Artifact Reduction,” IEEE Trans. of Medical Imaging, vol. 15, No. 5, Oct. 1996; pp., 657-663.Applicant
- H. Soltanian-Zadeh et al., “CT Artifact Correction: An Image Processing Approach,” SPIE Medical Imaging '96 in Newport Beach, CA, Feb. 1996, 9 pages.Applicant
- H. K. Tuy, “An Algorithm to Reduce Clip Artifacts in CT Images,” SPIE vol. 1652 Medical Imaging VI: Image Processing 1992 pp. 635-643. 1981.Applicant