Automatic image segmentation methods and analysis

Information

  • Patent Grant
  • 11900608
  • Patent Number
    11,900,608
  • Date Filed
    Monday, November 28, 2022
    a year ago
  • Date Issued
    Tuesday, February 13, 2024
    3 months ago
Abstract
The invention provides methods and apparatus for image processing that perform image segmentation on data sets in two- and/or three-dimensions so as to resolve structures that have the same or similar grey values (and that would otherwise render with the same or similar intensity values) and that, thereby, facilitate visualization and processing of those data sets.
Description
BACKGROUND OF THE INVENTION

The invention pertains to digital data processing and, more particularly, to the visualization of image data. It has application, by way of non-limiting example, in medical imaging, microscopy, geophysics, non-destructive testing.


Data sets in diagnostic medical imaging and other disciplines such as microscopy, geo-physics, non destructive testing etc., are growing in size and number. Efficient visualization methods are therefore increasingly important to enable clinicians, researchers and others to analyze digital image data. Image segmentation and the extraction of structures from images for visualization and analysis can be helpful for this purpose.


Image segmentation is an automated technique that facilitates distinguishing objects and other features in digital images. The technique can be used, for example, to simplify digitized images so that they can be more readily interpreted by computers (e.g., image analysis software) and/or by their users. Thus, for example, image segmentation can be used to simplify a digitized x-ray image of a patient who has consumed a barium “milkshake.” In its original form, such an image is made up of pixels containing a wide range of undifferentiated intensity values that—although, possibly recognizable to the human eye as skeletal bones and digestive tract—are largely uninterpretable by a computer.


Image segmentation can remedy this by categorizing as being of potential interest (e.g., “not background”) all pixels of a selected intensity range—typically, all intensities above a threshold value. Alternatively, image segmentation can rely on finding all edges or borders in the image. A related, but still further alternative technique, is to identify all “connected components”—i.e., groupings of adjacent pixels in the image of the same, or similar, pixel intensity (or color). Yet another image segmentation technique involves “region growing,” in which connected components are grown around seed point pixels known to reside within structures of interest.


Continuing the example, threshold-based segmentation can be applied to an x-ray image such that pixels whose intensities are above, say, 200 (out of 255) are labelled as barium-containing digestive organs and all other pixels are labelled as background. If the pixel intensities of the former are uniformly adjusted to a common value of, say, 255, and the pixel intensities of the latter are uniformly adjusted to, say, 0, the resulting “segmented” image, with only two levels of intensity values (0 and 255) is often more readily interpreted by man and machine alike.


An object of the invention is to provide improved methods and apparatus for digital data processing.


A related object is to provide such improved methods and apparatus for the visualization of image data.


A still further related aspect of the invention is to provide such methods and apparatus as can be applied in medical imaging, microscopy, geophysics, non destructive testing, and other imaging applications.


SUMMARY OF THE INVENTION

The invention provides methods and apparatus for image processing that perform image segmentation on data sets in two- and/or three-dimensions so as to resolve structures that have the same or similar grey values (and that would otherwise render with the same or similar intensity values) and that, thereby, facilitate visualization and processing of those data sets.


Such methods and apparatus can be used, for example, to apply different visualization parameters or rendering methods to different structures or regions of the data set, including completely hiding one or more of those regions. In particular, for example, aspects of the invention provide methods and apparatus for medical imaging that automatically extract bone structures in computed tomography (CT) 3D run-off studies without removing vessel structures (although those vessel structures may have the same or similar grey values). Further aspects of the invention provide for automatic removal of these and/or other structures shown in 3D (and other dimensional) images generated by other medical imaging techniques.


Thus, in one aspect, the invention provides a method for processing one or more two-dimensional (2D) image slices of a three-dimensional (3D) volume. The method includes the steps of identifying a region of the 3D volume to which the 2D image belongs, and performing segmentation on the 2D image to identify connected components. The method further calls for labeling pixels of those connected components based on geometric characteristics (e.g., shape and/or size), where such labeling is based on a volumetric region to which the 2D image belongs. By way of example, methods of the invention can be applied to processing 2D image “slices” generated via computed tomography, e.g., in medical imaging. For these purposes, the “region” is a region of the patient's body.


Related aspects of the invention provide such methods wherein the step of identifying the region to which the 2D image belongs includes computing a histogram of the image and comparing it with one or more other histograms, e.g., from an atlas of average histograms previously determined for the 3D volume (such as, for example, an atlas of average CT histograms for the human body). The image can be assigned, for example, to the region of the 3D volume associated with the best-matching histogram from the atlas. In instances where multiple 2D images are assigned to regions, the method can include checking those assignments for consistency and re-assigning one or more 2D images to another region, as necessary.


Still further related aspects of the invention provide such methods wherein the step of identifying the region to which the 2D image belongs includes determining additional information about the 2D image by performing threshold segmentation and determining therefrom any of (a) a number of connected components in the resulting image and/or (b) a total area occupied by selected structures and/or types of structures (e.g., body tissues). Alternatively, or in addition, the step of determining additional information can include computing a histogram of selected structures (e.g., a histogram of a region within the body and/or a region covered by body tissues).


Other aspects of the invention provide methods as described above in which the step of performing segmentation on the 2D image includes performing a threshold segmentation to label identically pixels representing the structures of interest. When such methods are applied to processing CT images, for example, such structures may be vasculature (e.g., blood vessels) and bone.


Such methods can, according to related aspects of the invention, include identifying connected components in the 2D image, following threshold segmentation, and relabeling pixels as differing types of structures of interest (e.g., vasculature versus bone, and vice versa) based on geometric properties of those connected components, e.g., in the context of the (body) region to which the 2D image has been assigned.


Still further related aspects of the invention provide such methods in which the step of performing segmentation on the 2D image to identify and label connected components based on their geometric characteristics includes performing such segmentation with increasingly larger thresholds to identify connected components that separate, as a result, into multiple components. When this is detected, the method calls for relabeling as differing types of structures of interest (again, by way of example, vasculature versus bone, and vice versa) making up those separated components.


Still further aspects of the invention provide methods as described above that include performing segmentation on a 3D data set formed from the plurality of the 2D images so as to label voxels representing the structures of interest (e.g., vasculature versus bone). According to these aspects of the invention, such segmentation can include flood-filling the 3D data set from one or more seed points placed at voxels in such structures of interest.


Flood-filling can proceed with increasing voxel intensity ranges until a connected component or region created thereby overextends. In related aspects of the invention, flood-filling is terminated when a connected component formed thereby either (i) stair-steps, or (ii) overruns a seed point placed in a voxel representing another structure of interest.


According to still further related aspects of the invention, the method calls for using model-based detection to find structures of interest in the 3D data set. And, yet, in still further related aspects of the invention, pixels corresponding to voxels labeled using such 3D segmentation are not relabeled if and when 2D segmentation of the type described above is performed.


These and other aspects of the invention are evident in the drawings and the description that follows.





BRIEF DESCRIPTION OF THE DRAWINGS

A more complete understanding of the invention may be attained by reference to the drawings, in which:



FIG. 1A depicts a digital data processing environment of the type in which the invention is practiced;



FIG. 1B overviews a method according to the invention;



FIG. 2 depicts a result of segmentation of a data set of images utilizing two-dimensional and/or three-dimensional segmentation-based methods according to the invention;



FIG. 3 depicts a method according to the invention for assigning a 2D image slice to a volumetric region;



FIG. 4 depicts a method according to the invention for 2D segmentation;



FIG. 5 depicts a method according to the invention for 3D segmentation;



FIGS. 6-8 depict a melding and segregation of structures in an image subject to 2D segmentation according to the invention.





DETAILED DESCRIPTION OF THE ILLUSTRATED EMBODIMENT

Overview


Described below are methods and apparatus for image processing according to the invention. These may be realized on workstations, personal computers, and other digital data processing systems of the type known in the art and used for image processing and/or reconstruction, an example of which is provided in FIG. 1A.


The system 10 includes a central processing unit (CPU) 30, dynamic memory (RAM) 32, and I/O section 34, all of the type known in the art, as adapted in accord with the teachings hereof. The digital data processor 26 may be coupled, via I/O section 34, with an image source (not shown), as well as with a monitor or other presentation device 28 on which images processed by system 10 may be displayed. I/O section 34 can also provide coupling to other apparatus (e.g., storage devices) and/or networks to which processed images can be transmitted for storage, displayed or otherwise. Illustrated digital data processor 26 may also include one or more graphical processing units (GPUs) 36, or other hardware acceleration devices, to facilitate execution of the methods described herein, though, such is not a requirement of the invention. Moreover, although digital data processor 26 is shown here has a stand-alone device, in other embodiments, it may be arranged otherwise, e.g., as an embedded processor.


The image source generates or otherwise supplies a plurality of images 14 for segmentation. In the illustrated embodiment, these represent, individually, two-dimensional (2D) “slices” of a three-dimensional (3D) volume. Indeed, in the example discussed below, they represent axial slices of a computed tomography (CT) scan of a patient's body, or portion thereof. More generally, however, images supplied by source 12 may derive from any number of technical pursuits, medical and non-medical alike, such as, by way of non-limiting example, microscopy, geophysics, non destructive testing, and so forth. Furthermore, although referred to as such in the illustrated embodiment, in other embodiments “images” 14 may comprise two-dimensional slices of data of any nature that make up the 3D volume.



FIG. 1B overviews operation of the system 10 and, more particularly, of computer software 40 executing thereon for purposes of segmenting images 14. Although such methods according to the invention are implemented in computer software (or, a “computer program”) in other embodiments, such apparatus and/or methods may be implemented solely in hardware, in firmware or otherwise.


Referring to the drawing, the system 10 and, more particularly, the software 40 executes the following operations:


First the image data is loaded into main memory 32 of the computer 26. See, step 42. This can be effected all at once or in stages, e.g., as image data from the respective slices is needed for processing. In the illustrated embodiment, that image data comprises the plurality of 2D images 14 that make up a 3D volume (hence, the image data is referred to as a “3D data set”). In other embodiments, processing is performed on only a single individual 2D image.


Then, specific structures represented in the images are segmented, i.e., pixels (and voxels) belonging to those structures are marked (or “labeled”) in a suitable data structure in memory 32. See, step 44. In instances where the images 14 are from medical imaging apparatus, the structures can be, for example, anatomical structures. The data structure may comprise any collection of data elements (e.g., an array, struct, linked list, etc.) of the type known in the art (as adopted for use herewith) suitable for holding labels that designate structures to which the pixels and/or voxels belong.


Then the processed image data is displayed, e.g., on output device 28, using different rendering settings for the different structures. See step 46. In other embodiments, the processed image data may be subjected to still further processing on device 26, before, after, or in lieu of display. Alternatively, or in addition, it may be transmitted elsewhere (e.g., to other equipment and/or locations) for storage, processing, and/or display.



FIGS. 3-5 depict further details of the processing effected in step 44. The discussion of those figures below uses, as an example, segmentation of bone and blood vessels in the images 14, e.g., to enable the former to be removed during display of the segmented images in step 46. However, as noted above, it will be appreciated that the invention can be used for a variety of other purposes and in a variety of other applications.


To understand the example, it will be appreciated that, often, CT studies use contrast agent to visualize the blood vessels. In such cases the blood vessels appear bright in the CT images, similar to bone structures. When rendering the image in maximum intensity projection mode (MIP), then the bright bone structures will often occlude the vessel structures which are typically much thinner than bone. However since both contrasted vessels and bone have the same or similar intensity values, standard rendering methods to distinguish them, such as assigning different transparency values based on intensity, will fail. Apparatus and methods according to the invention resolve this, allowing for the segmentation of structures represented in images 14—i.e., structures that would otherwise render with the same or similar intensity values—so that they may be rendered (and/or processed) differently from one another.


In the example that follows, those methods are applied to segment pixels representing bone differently from those representing blood vessels so that they can be rendered differently and, particularly, so that the bone can be rendered invisibly in step 46. FIG. 2 illustrates the result of executing such a method. In the left hand half of the figure a maximum intensity projection (MIP) of a CT runoff study is shown. Most of the vascular structure is hidden by the bone. In the right hand half of the figure voxels belonging to bone were segmented using methods of the invention and then left out in the rendering, thus, revealing the vessel structure. Note that in the discussion that follows, the images 14 are referred to, individually, as “slices,” “2D slices,” or the like and, collectively, as the “data set,” “3D data set,” or the like.


Identifying Body Regions


Referring to FIG. 3, the illustrated method first identifies volumetric regions to which the respective image slices 14 belong. In the example, these are body regions, i.e., ranges of successive slices corresponding to certain anatomy, such as foot, lower leg, knee, upper leg, hip, lower abdomen, lung. This is done as follows:


A histogram is computed for each slice of the data set. See step 48. The histogram is computed in the conventional manner known in the art.


The histograms are then used to determine which volumetric regions the respective slices belong to. In the example, the histograms are compared with an anatomic atlas containing average histograms for the different body regions. See step 50. For each of the slices a correlation such as a cross-correlation is computed between the slice histogram and said atlas of average histograms in order to determine which body part's histogram the slice most closely matches and therefore most likely belongs to. See step 51. The slice is then assigned to the respective body part. See step 52.


Once all (or a subset of all) of the slices have been assigned, then it is checked whether the individual slice assignment is consistent with the overall volumetric region to which they pertain. In the example, the slice assignments are checked to insure that they are consistent with human anatomy, e.g. in the above example, there can only be one range of slices assigned to each of the body regions such as “lower leg” and the body regions must be ordered in the correct spatial order. See step 54.


If inconsistencies are detected, slices are re-assigned to different volumetric regions—in the example, body regions—to obtain a consistent overall assignment. In many instances, multiple different sets of slices could be chosen for re-assignment in order to achieve overall consistency. Preferably, methods and apparatus according to the invention choose the one which re-assigns the smallest number of slices possible to achieve consistency.


As those skilled in the art will appreciate, additional criteria (or parameters) can be utilized to match slices to atlas entries—or, more generally, to determine which volumetric regions the respective slices belong to. This is illustrated in steps 56-64. Generally speaking, this involves performing a threshold segmentation on each slice and, then, determining (a) the number of connected components in the image and/or (b) the total area occupied by pixels representing structures and/or types of structures of interest (in the example, body tissues). It may also involve computing a second histogram for the latter, i.e., structures of interest (e.g., pixels within the body).


More particularly, by way of example, in the illustrated embodiment additional parameters for processing axial slices of a CT scan, e.g., for segmentation of bone and blood vessels, can be computed in a manner such as the following:


A threshold segmentation is performed in each slice with a threshold of −1000 HU (Hounsfield Units) which separates body tissue from air. See step 58. The number of connected components in the threshold segmented image is computed, as well as the total area covered by body pixels. See steps 60-62. A second histogram (subsequently referred to as Body Histogram) is computed for each slice which only takes into account pixels inside the body, i.e., enclosed in a connected component in said threshold segmented image. See step 64. It will be appreciated that, in some applications, the threshold used to separate body tissue from air may vary (e.g., from about −1000 HU to other values) and that, in other embodiments, still other thresholds are used, e.g., to distinguish among other structures and/or types of structures of interest.


The additional information determined for each slice following threshold segmentation (in step 58)—namely, the number of connected components, the total area occupied by structures of interest (e.g., body tissue), and/or a histogram of those structures—can be used along with (or instead of) the slice histogram computed in step 48, to determine volumetric regions (e.g., body regions) to which the respective image slices 14 belong.


In the example, the additional information is used to assign slices to body regions and/or anatomical structures using criteria such as, for example, “slices which have a significant number (>25%) of air pixels (pixels with intensity<−1000 HU) are assigned to lung” or “the number of connected components in slices in region lower leg is two” or “the knee region is between 2 cm and 20 cm in size”. Adding such criteria can make the illustrated method and apparatus more robust and/or more efficient. The exact selection of criteria is application- and image-set dependent: for example a criterion like “the number of connected components in slices in region lower leg is two” should not be chosen if one-legged patient data are to be processed.


Performing Segmentation in Slices


Once the slices have been assigned to volumetric regions (in the example, body regions), 2D segmentation is performed to identify connected components of potential interest (bone and vessel) and their pixels labelled (or categorized) based on geometric characteristics. In the example, this differentiates pixels depicting bone from blood vessels, though, in other applications it may differentiate pixels depicting other structures from one another. In that light, it will be appreciated that some of the algorithms discussed below are specific to bone/vessel segmentation and that different algorithms and/or thresholds may be employed in different applications. Moreover, even in the context of bone/vessel segmentation, the algorithms may vary within different regions of the body as will be described in the following.


In each slice, a threshold segmentation is performed using a first threshold. See step 66. A value is chosen so as to result in identical labeling of pixels representing the structures of interest (in the example, bones and blood vessels), yet, different labeling for structures that are not of interest (e.g., organs). In the example, this is a threshold of 130 HU—though it will be appreciated that different threshold values (e.g., those of about 130 HU or otherwise) can be used depending on the acquisition protocol and user input. As noted, this segmentation will label both, bone and vessels.


In the next step, connected components in each slice are (re-)labelled based on their geometries characteristics (e.g., size and/or shape). This labeling is preferably done in the context of the volumetric region to which the respective slice is assigned. See step 68. Bones normally have a greater diameter than vessels. Therefore, in the example, after said threshold segmentation all connected components with an area greater than the diameter of the largest vessel which can occur in the respective body region is assigned to bone, all others are assigned to vessel. As noted, this may be further qualified by the context of the body region to which the slice is assigned. Thus, in the leg, except for the knee region, one can add the additional constraint that only the largest connected component (upper leg) or the two largest connected components (lower leg) are to be considered bone. Caution is required when cases are to be processed in certain applications were pathologies are present which could violate those latter criteria, such as patients with bone fractures.


Sometimes the structures that will ultimately be differentiated (in the example, bones and blood vessels) run very close to one another. In such cases, in some slices the cross section of one structure (e.g., the bone) and of another structure (e.g., the vessel) near it may actually appear melted into one connected component in the threshold segmentation generated in step 66. This is illustrated in FIG. 6, which shows part of an axial slice in the lower leg. The two bones and some vessels can be clearly seen as bright spots. FIG. 7 shows a threshold segmentation with a certain threshold (268 HU). As can be seen, one vessel which runs close to the upper bone appears to be connected in this segmentation. Therefore if the whole connected component was selected as bone, then that piece of the vessel would be segmented incorrectly.


The method used to prevent that is illustrated in steps 70-74 and involves performing segmentation with increasingly larger thresholds, checking after each successive segmentation to see if another otherwise seemingly connected component separates into multiple components and, if so, relabeling the separated components as different structures. Application of this to the example follows:


Assume that a connected component is identified as bone in one slice. We will refer to (and label) the set of pixels comprising this component as B. Now the threshold is increased from the first or original threshold—in this case, 130 HU—in steps of 1 HU up to 400 HU. See step 70. Of course, it will be appreciated that other step sizes may be used. When increasing the threshold, the segmented bone structure shrinks. Often, in the case of a melted vessel/bone structure, the vessel will separate in the course of this process. This can be seen in FIGS. 7 and 8. While in FIG. 7 the vessel and the upper bone are still connected, in FIG. 8 with a higher threshold, they are separated.


After each increase of the threshold it is checked whether a connected component previously identified as bone gets separated into multiple components, a large one and one and a small one. See step 72. Once that happens, the smaller component is labelled as vessel. See step 74. We label the set of pixels comprising said smaller component as V and the set of pixels comprising said larger component as B*.


In the original segmentation with the first threshold (here, 130 HU), all pixels belonging to B are now reassigned according to the following criterion: Any pixel which is part of B* remains bone. Any pixel which is part of V is assigned to vessel, i.e. removed from B. Any pixel which is neither part of B* nor V is re-assigned to vessel if it is closer to V than to B*. The distance of a pixel p to a set of pixels S is defined to be the shortest distance between p and any of the pixels belonging to S.


Performing Segmentation in 3D


In addition to (or in lieu of) performing segmentation on the 2D image slices 14 as described above, methods and apparatus according to the invention performs segmentation on 3D data sets formed from those slices utilizing flood-filling (or region growing). This permits labeling voxels representing structures of interest (e.g., those representing bone and blood vessels) and, as a consequence, provides further basis for differentially labeling the corresponding voxels (and pixels).


By way of overview, this 3D segmentation involves placing seed points in voxels which are known to represent structures of interest and flood-filling from those seed points to mark connected components belonging to the same respective structures. The voxel intensity range for the flood-fill is gradually increased until the connected components—in this case, regions or volumes—formed thereby stair-step or overrun seed points for other structures.


An advantage of 3D segmentation (used alone or in connection with 2D segmentation) is that it can take advantage of structures that are more readily identifiable in 3D (i.e., across multiple slices) than in individual 2D slices. For example, in the abdominal and lung region, blood vessels like the aorta may have diameters larger than some of the thinner bone structures. While the procedures discussed in the preceding section might therefore result in the aorta being marked as vasculature, and vice versa, use of 3D segmentation in accord herewith circumvents the problem.


Therefore in the illustrated embodiment the above described 2D method is extended as follows using a three dimensional approach: Seed points are placed in voxels which are known to be either bone or vessel. Then from these seed points a flood fill is started to mark connected voxels belonging to the same structure. Measures are taken to avoid the flood fill from “spilling over” from vessel into bone structures or vice versa.


In the example this is implemented as follows: Anatomic structures in the pelvic and abdomen region are searched which can be easily found with model based detection methods. See, step 76. For example the aorta is a tubular structure with a known diameter range, always rather centered and always located in front of the spine structure. Also the pelvis bone can be located by searching in the pelvic region for the largest 3D-connected component.


Once those components are identified, seed points can be placed into these objects. See, step 78.


Then from these seed-points a flood-fill algorithm is started. See, step 80. The flood-fill first uses a very conservative intensity range meaning that only voxels with an intensity very similar to the seed points are marked. See step 82. Then, the range is grown to fill/mark more voxels belonging to the same anatomic structure. See, step 84. If the range was made too wide, the flood-fill could erroneously spread out into a spatially close structure. This is the reverse process of the above described melting/separation problem for vessels running near bones. For example with a seed point placed in the aorta, the flood fill could spill over into the spine if the range was chosen such that those two structures would meld. This must be avoided. To do so, step 86 is executed and a number of criteria are evaluated while growing the intensity range.


(i) If the volume filled by the flood fill stair steps, when continuously increasing the range, then it must be assumed that the flood-fill has spilled over and the range is reduced again. See, steps 88 and 90.


(ii) If the flood fill reaches a voxel which is marked as a seed point for a different structure then also it must be assumed that the range is too wide and the range is reduced again. See, steps 90 and 92. For example if a flood fill is started at a seed point in the aorta and it reaches a point marked bone in the pelvis, then the range was obviously chosen such that the vessel tree and the bones are connected relative to this range. Therefore this range must be rejected and narrowed.


Any voxels which are marked by the above method can be marked bone or vessel respectively, depending on which seed point they were connected to (or grown from). The pixels correspond to such voxels do not need to be re-labeled when this method is combined with the slice based segmentation described above.


Following segmentation of a data set of images 14 utilizing two-dimensional and/or three-dimensional segmentation in the manner discussed above, the data set (and/or individual images 14 contained therein) can be displayed on output device 28. Different rendering settings can be set for the structures labelled by such segmentation, e.g., to facilitate visualization. For example, as shown on the right side of FIG. 2 and discussed above, voxels labelled as bone can be rendered invisibly, while voxels labelled as blood vessels can be rendered in MIP mode. Of course, other display settings can be used instead, e.g., with blood vessels rendered in one color and bone in another color, and so forth. Moreover, as noted above, the data set may be subjected to still further processing on device 26, before, after, or in lieu of display. Alternatively, or in addition, it may transmitted elsewhere (e.g., to other equipment and/or locations) for storage, processing, and/or display.


The embodiments described herein meet the objects set forth above, among others. Thus, those skilled in the art will appreciate that the illustrated embodiment merely comprises an example of the invention and that other embodiments making changes thereto fall within the scope of the invention, of which we claim:

Claims
  • 1. An apparatus for revealing a volumetric region comprising: (a) a storage device;(b) a network to which a processed image can be transmitted;(c) a Digital Data Processor (DDP) comprising a central processing unit, a graphics processing unit, a dynamic memory, a software program, an input device and an output device, where the output device is adapted to enable the processed image to be transmitted to the storage device, where the software program is adapted to receive and/or generate a plurality of 2D image slices in a CT runoff study corresponding to a portion of a patient's body, where each 2D image slice of the plurality of 2D image slices comprises a plurality of pixels, where the software program is further adapted to:(i) generate a first histogram of the plurality of 2D image slices;(ii) compute a cross-correlation between the first histogram and an atlas of average histograms;(iii) determine based on the cross-correlation a matching body part;(iv) assign the CT runoff study to the matching body part based on step(c)(iii);(v) determine a threshold;(vi) perform a segmentation based on the threshold to determine one or more parameters selected from the group consisting of a first connected component, a total area occupied by the first connected component, a second histogram of the first connected component, and/or a third histogram of the total area occupied by the first connected component;(vii) determine a volumetric region of the first connected component based on step(c)(vi);(viii) generate a plurality of extracted 2D image slices by extracting the first connected component from the plurality of 2D image slices; and(viii) label a second connected component based on the plurality of extracted 2D image slices.
  • 2. The apparatus of claim 1, where the plurality of 2D image slices correspond to an upper leg.
  • 3. The apparatus of claim 2, where one or more pixels of the plurality of pixels in a 2D image slice of the plurality of 2D image slices are identified as corresponding to a bone structure based on one or both the segmentation and an intensity of the one or more pixels above the threshold.
  • 4. The apparatus of claim 3, where a diameter is determined for the bone structure occupied by the one or more pixels in the 2D image slice identified as corresponding to the bone structure.
  • 5. The apparatus of claim 4, where one or more pixels connected with the one or more pixels in the 2D image slice identified as corresponding to the bone structure are identified as one or more additional bone structure pixels.
  • 6. The apparatus of claim 4, where one or more pixels adjacent with the one or more pixels in the 2D image slice identified as corresponding to the bone structure are identified as one or more additional bone structure pixels.
  • 7. The apparatus of claim 4, where one or more pixels with an area greater than the diameter of a largest vessel in the volumetric region and bounded by the diameter are identified as one or more additional bone structure pixels.
  • 8. The apparatus of claim 4, where one or more pixels with a geometric characteristic are identified as one or more additional bone structure pixels, where the geometric characteristic is selected from the group consisting of shape of the bone structure in the 2D image slice and size of the bone structure in the 2D image slice.
  • 9. The apparatus of claim 8, where all pixels not assigned as the bone structure are labelled as vessel.
  • 10. The apparatus of claim 9, where all pixels assigned as the bone structure are extracted from the 2D image slice.
  • 11. The apparatus of claim 10, where removing the bone structure from the 2D image slice reveals a vessel.
  • 12. The apparatus of claim 3, where a pixel of the plurality of pixels is not assigned to the bone structure based on an intensity of the pixel below the threshold.
  • 13. The apparatus of claim 1, where the threshold is between: a lower limit of 130 Hounsfield Units (HU); andan upper limit of 400 HU.
  • 14. The apparatus of claim 13, where steps (v) through (vii) are repeated with an increased threshold.
  • 15. The apparatus of claim 14, where the increased threshold is the threshold increased by 1 HU.
  • 16. The apparatus of claim 1, where the threshold is between: a lower limit of −1000 Hounsfield Units (HU); andan upper limit of 400 HU.
  • 17. The apparatus of claim 16, where steps (v) through (vii) are repeated with an increased threshold.
  • 18. The apparatus of claim 17, where the increased threshold is the threshold increased by 1 HU.
PRIORITY CLAIM

This application is a continuation of (1) U.S. application Ser. No. 16/913,808 filed Jun. 26, 2020, which claims priority to (2) U.S. application Ser. No. 15/988,519 filed May 24, 2018, which issued Jul. 7, 2020 as U.S. Pat. No. 10,706,538 and which claims priority to (3) U.S. application Ser. No. 15/276,546 filed Sep. 26, 2016, which issued May 29, 2018 as U.S. Pat. No. 9,984,460 and claims priority to (4) U.S. application Ser. No. 14/040,215 filed Sep. 27, 2013, which issued Sep. 27, 2016 as U.S. Pat. No. 9,454,813 and claims priority to (5) U.S. application Ser. No. 12/275,862 filed Nov. 21, 2008 which issued Oct. 1, 2013 as U.S. Pat. No. 8,548,215 and claims the benefit of priority of (6) U.S. Provisional Patent Application Ser. No. 60/989,915, filed Nov. 23, 2007; the teachings of (1)-(6) are explicitly incorporated herein by reference in their entireties and for all purposes.

US Referenced Citations (384)
Number Name Date Kind
2658310 Cook Nov 1953 A
3431200 Davis et al. Mar 1969 A
3645040 Ort Feb 1972 A
4137868 Pryor Feb 1979 A
4235043 Harasawa et al. Nov 1980 A
4258661 Margen Mar 1981 A
4267038 Thompson May 1981 A
4320594 Raymond Mar 1982 A
4746795 Stewart et al. May 1988 A
4905148 Crawford Feb 1990 A
4910912 Lowrey, III Mar 1990 A
4928250 Greenberg et al. May 1990 A
4958460 Nielson et al. Sep 1990 A
4984160 Saint Felix et al. Jan 1991 A
5031117 Minor et al. Jul 1991 A
5091960 Butler Feb 1992 A
5121708 Nuttle Jun 1992 A
5128864 Waggener et al. Jul 1992 A
5218534 Trousset et al. Jun 1993 A
5235510 Yamada Aug 1993 A
5241471 Trousset et al. Aug 1993 A
5253171 Hsiao et al. Oct 1993 A
5274759 Yoshioka Dec 1993 A
5280428 Wu et al. Jan 1994 A
5287274 Saint Felix et al. Feb 1994 A
5293313 Cecil Mar 1994 A
5307264 Waggener et al. Apr 1994 A
5355453 Row et al. Oct 1994 A
5368033 Moshfeghi Nov 1994 A
5375156 Kuo-Petravic et al. Dec 1994 A
5412703 Goodenough et al. May 1995 A
5412764 Tanaka May 1995 A
5442672 Bjorkholm et al. Aug 1995 A
5452416 Hilton Sep 1995 A
5488700 Glassner Jan 1996 A
5560360 Filler Oct 1996 A
5594842 Kaufman et al. Jan 1997 A
5602892 Llacer Feb 1997 A
5633951 Moshfeghi May 1997 A
5633999 Clowes et al. May 1997 A
5640436 Kawai et al. Jun 1997 A
5671265 Andress Sep 1997 A
5744802 Muehllehner et al. Apr 1998 A
5774519 Lindstrom et al. Jun 1998 A
5790787 Scott et al. Aug 1998 A
5793374 Guenter et al. Aug 1998 A
5793879 Benn et al. Aug 1998 A
5813988 Alfano et al. Sep 1998 A
5821541 Tumer Oct 1998 A
5825842 Taguchi Oct 1998 A
5838756 Taguchi et al. Nov 1998 A
5841140 McCroskey et al. Nov 1998 A
5909476 Cheng et al. Jun 1999 A
5930384 Guillemaud et al. Jul 1999 A
5931789 Alfano et al. Aug 1999 A
5950203 Stakuis Sep 1999 A
5960056 Lai Sep 1999 A
5963612 Navab Oct 1999 A
5963613 Navab Oct 1999 A
5963658 Klibanov et al. Oct 1999 A
6002739 Heumann Dec 1999 A
6018562 Willson Jan 2000 A
6032264 Beffa et al. Feb 2000 A
6044132 Navab Mar 2000 A
6049390 Notredame Apr 2000 A
6049582 Navab Apr 2000 A
6072177 Mccroskey et al. Jun 2000 A
6088423 Krug et al. Jul 2000 A
6091422 Ouaknine et al. Jul 2000 A
6104827 Benn et al. Aug 2000 A
6105029 Maddalozzo, Jr. et al. Aug 2000 A
6108007 Shochet Aug 2000 A
6108576 Alfano et al. Aug 2000 A
6123733 Dalton Sep 2000 A
6175655 George Jan 2001 B1
6205120 Packer et al. Mar 2001 B1
6219061 Lauer et al. Apr 2001 B1
6226005 Laferriere May 2001 B1
6236704 Navab et al. May 2001 B1
6243098 Lauer et al. Jun 2001 B1
6249594 Hibbard Jun 2001 B1
6255655 McCroskey et al. Jul 2001 B1
6264610 Zhu Jul 2001 B1
6268846 Georgiev Jul 2001 B1
6278460 Myers et al. Aug 2001 B1
6282256 Grass et al. Aug 2001 B1
6289235 Webber et al. Sep 2001 B1
6304771 Yodh et al. Oct 2001 B1
6320928 Vaillant et al. Nov 2001 B1
6324241 Besson Nov 2001 B1
6377257 Borrel Apr 2002 B1
6377266 Baldwin Apr 2002 B1
6384821 Borrel May 2002 B1
6404843 Vaillant Jun 2002 B1
6415013 Hsieh et al. Jul 2002 B1
6470067 Harding Oct 2002 B1
6470070 Menhardt Oct 2002 B2
6473793 Dillon et al. Oct 2002 B1
6475150 Haddad Nov 2002 B2
6507633 Elbakri et al. Jan 2003 B1
6510241 Vaillant et al. Jan 2003 B1
6519355 Nelson Feb 2003 B2
6526305 Mori Feb 2003 B1
6557102 Wong et al. Apr 2003 B1
6559958 Motamed May 2003 B2
6591004 VanEssen et al. Jul 2003 B1
6615063 Ntziachristos et al. Sep 2003 B1
6633688 Nixon Oct 2003 B1
6636623 Nelson et al. Oct 2003 B2
6654012 Lauer et al. Nov 2003 B1
6658142 Kam et al. Dec 2003 B1
6664963 Zatz Dec 2003 B1
6674430 Kaufman et al. Jan 2004 B1
6697508 Nelson Feb 2004 B2
6707878 Claus et al. Mar 2004 B2
6718195 Van Der Mark et al. Apr 2004 B2
6731283 Navab May 2004 B1
6740232 Beaulieu May 2004 B1
6741730 Rahn et al. May 2004 B2
6744253 Stolarczyk Jun 2004 B2
6744845 Harding et al. Jun 2004 B2
6745070 Wexler et al. Jun 2004 B2
6747654 Laksono et al. Jun 2004 B1
6754299 Patch Jun 2004 B2
6765981 Heumann Jul 2004 B2
6768782 Hsieh et al. Jul 2004 B1
6770893 Nelson Aug 2004 B2
6771733 Katsevich Aug 2004 B2
6778127 Stolarczyk et al. Aug 2004 B2
6785409 Suri Aug 2004 B1
6798417 Taylor Sep 2004 B1
6807581 Starr et al. Oct 2004 B1
6825840 Gritz Nov 2004 B2
6825843 Allen et al. Nov 2004 B2
6923906 Oswald et al. Aug 2005 B2
6947047 Moy et al. Sep 2005 B1
6978206 Pu Dec 2005 B1
7003547 Hubbard Feb 2006 B1
7006101 Brown et al. Feb 2006 B1
7031022 Komori et al. Apr 2006 B1
7034828 Drebin et al. Apr 2006 B1
7039723 Hu May 2006 B2
7050953 Chiang et al. May 2006 B2
7054852 Cohen May 2006 B1
7058644 Patchet et al. Jun 2006 B2
7076735 Callegari Jul 2006 B2
7098907 Houston et al. Aug 2006 B2
7120283 Thieret Oct 2006 B2
7133041 Kaufman et al. Nov 2006 B2
7154985 Dobbs Dec 2006 B2
7167176 Sloan et al. Jan 2007 B2
7184041 Heng et al. Feb 2007 B2
7185003 Bayliss et al. Feb 2007 B2
7219085 Buck et al. May 2007 B2
7242401 Yang et al. Jul 2007 B2
7262770 Sloan et al. Aug 2007 B2
7274368 Keslin Sep 2007 B1
7299232 Stakutis et al. Nov 2007 B2
7315926 Fridella et al. Jan 2008 B2
7324116 Boyd et al. Jan 2008 B2
7339585 Verstraelen et al. Mar 2008 B2
7472156 Philbrick et al. Dec 2008 B2
7502869 Boucher et al. Mar 2009 B2
7506375 Kanda et al. Mar 2009 B2
7552192 Carmichael Jun 2009 B2
7609884 Stalling Oct 2009 B1
7693318 Stalling Apr 2010 B1
7701210 Ichinose Apr 2010 B2
7778392 Bergman Aug 2010 B1
7876944 Stalling Jan 2011 B2
7889895 Nowinski Feb 2011 B2
7899516 Chen et al. Mar 2011 B2
7907759 Hundley Mar 2011 B2
7956612 Sorensen Jun 2011 B2
7983300 Vaughan et al. Jul 2011 B2
7991837 Tahan Aug 2011 B1
7995824 Yim Aug 2011 B2
8107592 Bergman Jan 2012 B2
8189002 Westerhoff May 2012 B1
8319781 Westerhoff Nov 2012 B2
8369600 Can et al. Feb 2013 B2
8386560 Ma Feb 2013 B2
8392529 Westerhoff Mar 2013 B2
8508539 Vlietinck Aug 2013 B2
8538108 Shekhar Sep 2013 B2
8542136 Owsley et al. Sep 2013 B1
8548215 Westerhoff Oct 2013 B2
8701167 Kovalan Apr 2014 B2
8745413 Hahn Jun 2014 B2
8775510 Westerhoff Jul 2014 B2
8976190 Westerhoff Mar 2015 B1
9019287 Westerhoff Apr 2015 B2
9106609 Kovalan Aug 2015 B2
9167027 Westerhoff Oct 2015 B2
9299156 Zalis Mar 2016 B2
9355616 Westerhoff May 2016 B2
9438667 Kovalan Sep 2016 B2
9454813 Westerhoff Sep 2016 B2
9509802 Westerhoff Nov 2016 B1
9524577 Westerhoff Dec 2016 B1
9531789 Westerhoff Dec 2016 B2
9595242 Westerhoff Mar 2017 B1
9728165 Westerhoff Aug 2017 B1
9749245 Stalling Aug 2017 B2
9749389 Kovalan Aug 2017 B2
9860300 Westerhoff Jan 2018 B2
9898855 Westerhoff Feb 2018 B2
9904969 Westerhoff Feb 2018 B1
9984460 Westerhoff May 2018 B2
9984478 Westerhoff May 2018 B2
10038739 Westerhoff Jul 2018 B2
10043482 Westerhoff Aug 2018 B2
10070839 Westerhoff Sep 2018 B2
10311541 Westerhoff Jun 2019 B2
10320684 Stalling Jun 2019 B2
10373368 Westerhoff Aug 2019 B2
10380970 Westerhoff Aug 2019 B2
10395398 Westerhoff Aug 2019 B2
10430914 Westerhoff Oct 2019 B2
10448911 Erhard Oct 2019 B2
10452813 Sorenson Oct 2019 B2
10540803 Westerhoff Jan 2020 B2
10614543 Westerhoff Apr 2020 B2
10631812 Westerhoff Apr 2020 B2
10686868 Westerhoff Jun 2020 B2
10706538 Westerhoff Jul 2020 B2
10726955 Kovalan Jul 2020 B2
10762872 Westerhoff Sep 2020 B2
10818048 Zhao Oct 2020 B2
10867011 Sorenson Dec 2020 B2
10930397 Kovalan Feb 2021 B2
10970365 Sorenson Apr 2021 B2
10978184 Sorenson Apr 2021 B2
11075978 Westerhoff Jul 2021 B2
11183292 Stalling Nov 2021 B2
11315210 Westerhoff Apr 2022 B2
11328381 Westerhoff May 2022 B2
11514572 Westerhoff Nov 2022 B2
11599672 Stalling Mar 2023 B2
11620773 Westerhoff Apr 2023 B2
20010026848 Van Der Mark Oct 2001 A1
20020010551 Wang et al. Jan 2002 A1
20020016813 Woods et al. Feb 2002 A1
20020034817 Henry et al. Mar 2002 A1
20020049825 Jewett et al. Apr 2002 A1
20020080143 Morgan et al. Jun 2002 A1
20020089587 White et al. Jul 2002 A1
20020099290 Haddad Jul 2002 A1
20020099844 Baumann et al. Jul 2002 A1
20020120727 Curley et al. Aug 2002 A1
20020123680 Vailant Sep 2002 A1
20020138019 Wexler Sep 2002 A1
20020150202 Harding Oct 2002 A1
20020150285 Nelson Oct 2002 A1
20020180747 Lavelle et al. Dec 2002 A1
20020184238 Chylla Dec 2002 A1
20020184349 Manukyan Dec 2002 A1
20030001842 Munshi Jan 2003 A1
20030031352 Nelson et al. Feb 2003 A1
20030059110 Wilt Mar 2003 A1
20030065268 Chen et al. Apr 2003 A1
20030086599 Armato May 2003 A1
20030103666 Edie et al. Jun 2003 A1
20030120743 Coatney et al. Jun 2003 A1
20030123720 Launav et al. Jul 2003 A1
20030149812 Schoenthal et al. Aug 2003 A1
20030158786 Yaron Aug 2003 A1
20030176780 Arnold Sep 2003 A1
20030179197 Sloan et al. Sep 2003 A1
20030194049 Claus et al. Oct 2003 A1
20030220569 Dione Nov 2003 A1
20030220772 Chiang et al. Nov 2003 A1
20030227456 Gritz Dec 2003 A1
20030234791 Boyd et al. Dec 2003 A1
20040010397 Barbour et al. Jan 2004 A1
20040012596 Allen et al. Jan 2004 A1
20040015062 Ntziachristos et al. Jan 2004 A1
20040022348 Heumann Feb 2004 A1
20040059822 Jiang Mar 2004 A1
20040066384 Ohba Apr 2004 A1
20040066385 Kilgard Apr 2004 A1
20040066891 Freytag Apr 2004 A1
20040078238 Thomas et al. Apr 2004 A1
20040101183 Mullick et al. May 2004 A1
20040102688 Walker May 2004 A1
20040125103 Kaufman Jul 2004 A1
20040133652 Miloushev et al. Jul 2004 A1
20040147039 Van Der Mark Jul 2004 A1
20040162677 Bednar Aug 2004 A1
20040170302 Museth et al. Sep 2004 A1
20040193901 Bharara Sep 2004 A1
20040210584 Nir et al. Oct 2004 A1
20040215858 Armstrong et al. Oct 2004 A1
20040215868 Solomon et al. Oct 2004 A1
20040239672 Schmidt Dec 2004 A1
20040240753 Hu Dec 2004 A1
20050012753 Karlov Jan 2005 A1
20050017972 Poole et al. Jan 2005 A1
20050066095 Mullick et al. Mar 2005 A1
20050088440 Sloan et al. Apr 2005 A1
20050128195 Houston et al. Jun 2005 A1
20050152590 Thieret Jul 2005 A1
20050165623 Landi et al. Jul 2005 A1
20050225554 Bastos et al. Oct 2005 A1
20050228272 Yu Oct 2005 A1
20050231503 Heng et al. Oct 2005 A1
20050239182 Berzin Oct 2005 A1
20050240628 Jiang et al. Oct 2005 A1
20050256742 Kohan et al. Nov 2005 A1
20050259103 Kilgard et al. Nov 2005 A1
20050270298 Thieret Dec 2005 A1
20050271302 Khamene et al. Dec 2005 A1
20060010438 Brady et al. Jan 2006 A1
20060010454 Napoli et al. Jan 2006 A1
20060028479 Chun Feb 2006 A1
20060034511 Verstraelen Feb 2006 A1
20060066609 Iodice Mar 2006 A1
20060197780 Watkins et al. Sep 2006 A1
20060214949 Zhang Sep 2006 A1
20060239540 Serra Oct 2006 A1
20060239589 Omernick Oct 2006 A1
20060282253 Buswell et al. Dec 2006 A1
20070005798 Gropper et al. Jan 2007 A1
20070031019 Lesage Feb 2007 A1
20070038939 Challen Feb 2007 A1
20070046966 Mussack Mar 2007 A1
20070067497 Craft et al. Mar 2007 A1
20070092864 Reinhardt Apr 2007 A1
20070097133 Stauffer et al. May 2007 A1
20070116332 Cai et al. May 2007 A1
20070127802 Odry Jun 2007 A1
20070156955 Royer, Jr. Jul 2007 A1
20070165917 Cao et al. Jul 2007 A1
20070185879 Roublev et al. Aug 2007 A1
20070188488 Choi Aug 2007 A1
20070226314 Eick et al. Sep 2007 A1
20070255704 Baek et al. Nov 2007 A1
20070280518 Nowinski Dec 2007 A1
20080009055 Lewnard Jan 2008 A1
20080042923 De Laet Feb 2008 A1
20080086557 Roach Apr 2008 A1
20080115139 Inglett et al. May 2008 A1
20080137929 Chen et al. Jun 2008 A1
20080147554 Stevens et al. Jun 2008 A1
20080155890 Oyler Jul 2008 A1
20080174593 Ham Jul 2008 A1
20080208961 Kim et al. Aug 2008 A1
20080224700 Sorensen Sep 2008 A1
20080281908 McCanne et al. Nov 2008 A1
20080317317 Shekhar Dec 2008 A1
20090005693 Brauner et al. Jan 2009 A1
20090012382 Dutta et al. Jan 2009 A1
20090043988 Archer et al. Feb 2009 A1
20090077097 Lacapra et al. Mar 2009 A1
20090147793 Hayakawa et al. Jun 2009 A1
20090208082 Westerhoff et al. Aug 2009 A1
20090210487 Westerhoff et al. Aug 2009 A1
20090225076 Vlietinck Sep 2009 A1
20090245610 Can et al. Oct 2009 A1
20090313170 Goldner et al. Dec 2009 A1
20100054556 Novatzky Mar 2010 A1
20100060652 Karlsson Mar 2010 A1
20100123733 Zaharia May 2010 A1
20100174823 Huang Jul 2010 A1
20100272342 Berman et al. Oct 2010 A1
20100278405 Kakadiaris et al. Nov 2010 A1
20110044524 Wang et al. Feb 2011 A1
20110110576 Kreeger et al. May 2011 A1
20110112862 Yu May 2011 A1
20120078088 Whitestone et al. Mar 2012 A1
20120226916 Hahn Sep 2012 A1
20120233153 Roman et al. Sep 2012 A1
20130176319 Westerhoff Jul 2013 A1
20130195329 Canda Aug 2013 A1
20150213288 Bilodeau et al. Jul 2015 A1
20160012181 Massey Jan 2016 A1
20170011514 Westerhoff Jan 2017 A1
20170346883 Westerhoff Mar 2017 A1
20170098329 Westerhoff Apr 2017 A1
20170104811 Westerhoff Apr 2017 A1
20170178593 Westerhoff Jun 2017 A1
20190096062 Westerhoff Mar 2019 A1
20190318512 Westerhoff Oct 2019 A1
20210133978 Ma May 2021 A1
Foreign Referenced Citations (44)
Number Date Country
10317384 Apr 2004 DE
0492897 Jul 1992 EP
0502187 Sep 1992 EP
0611181 Aug 1994 EP
0476070 Aug 1996 EP
0925556 Jun 1999 EP
0953943 Nov 1999 EP
0964 366 Dec 1999 EP
187340 Mar 2001 EP
2098895 Sep 2009 EP
2098994 Sep 2009 EP
2405344 Jan 2012 EP
WO9016072 Dec 1990 WO
WO9102320 Feb 1991 WO
WO9205507 Apr 1992 WO
WO9642022 Dec 1996 WO
WO9810378 Mar 1998 WO
WO9812667 Mar 1998 WO
WO9833057 Jul 1998 WO
WO0120546 Mar 2001 WO
WO0134027 May 2001 WO
WO0163561 Aug 2001 WO
WO0174238 Oct 2001 WO
WO0185022 Nov 2001 WO
WO0241760 May 2002 WO
WO02067201 Aug 2002 WO
WO02082065 Oct 2002 WO
WO03061454 Jul 2003 WO
WO03088133 Oct 2003 WO
WO03090171 Oct 2003 WO
WO03098539 Nov 2003 WO
WO04019782 Mar 2004 WO
WO04020996 Mar 2004 WO
WO04020997 Mar 2004 WO
WO04034087 Apr 2004 WO
WO04044848 May 2004 WO
WO04066215 Aug 2004 WO
WO04072906 Aug 2004 WO
WO05071601 Aug 2005 WO
WO09029636 Mar 2009 WO
WO09067675 May 2009 WO
WO09067680 May 2009 WO
WO11065929 Jun 2011 WO
WO2015063188 May 2015 WO
Non-Patent Literature Citations (93)
Entry
ATI Website Index, http://www.ati.com/developer/index.html, Dec. 20, 2002, 2 pages.
Boone et al., Recognition of Chest Radiograph Orientation for Picture Archiving and Communications Systems Display Using Neural Networks, J. Digital Imaging, 1992, 5(3), 190-193.
Boone et al., Automated Recognition of Lateral from PA Chest Radiographs: Saving Seconds in a PACS Environment, J. Digital Imaging, 2003, 16(4), 345-349.
Luo et al., Automatic Image Hanging Protocol for Chest Radiographs in a PACS, IEEE Transactions on Information Technology in Biomedicine, 2006, 10(2), 302-311.
Cabral et al., Accelerated Volume Rendering and Tomographic Reconstruction Using Texture Mapping Hardware⋅, Silicon Graphics Computer Systems, 1995 IEEE, DD. 91-97.
Carr, Nathan A., Jesse D. Hall, John C. Hart, The ray engine, Proceedings of the ACM SIGGRAPH/Eurographics conference on Graphics hardware, Sep. 1-2, 2002, pp. 37-46.
Chidlow, et al, Rapid Emission Tomography Reconstruction, Proceedings of the 2003 Eurographics/IEEE TVCG Workshop on Volume Graphics, Tokyo, Japan, Jul. 7-8, 2003, 13 pages.
Cohen, Michael, et al., A Progressive Refinement Approach to Fast Radiosity Image Generation, Computer Graphics, vol. 22, No. 4, Aug. 1988, pp. 75-84.
Corner, B., University of Nebraska-Lincoln, MatLab.txt, 2003, 1 page.
Dachille, et al., High-Quality Volume Rendering Using Texture Mapping Hardware, Siggraph/Eurographics Hardware Workshop (1998) (8 pages).
Dempster, et al., Maximum Likelihood From Incomplete Data Via the EM Algorithm, Harvard University and Educational Testing Service, Dec. 8, 1976, pp. 1-38.
Dennis, C, et al.,, Overview of X-Ray Computed Tomography, http://www.howstuffworks.com/framed.htm?parent=c ...tm&url=http://www.ctlab.geo.utexas.edu/overview/, Dec. 26, 2002, 5 pages.
Dobbins, et al., Digital X-Ray Tomosynthesis: Current State of the Art and Clinical Potential, Physics in Medicine and Biology, vol. 48, pp. R65-R106 (2003).
Doggett, Michael, ATI, Programmability Features of Graphics Hardware, (paper) Apr. 23, 2002, pp. C1-C22.
Doggett, Michael, ATI, Programmability Features of Graphics Hardware, (slideshow) slides 1-62 31 pages.
Du, H., Sanchez-Elez, M., Tabrizi, N., Bagherzadeh, N., Anido, M. L., and Fernandez, M. 2003. Interactive ray tracing on reconfigurable SIMD MorphoSys. In Proceedings of the 2003 Conference on Asia South Pacific Design Automation (Kitakyushu, Japan, Jan. 21-24, 2003). ASPDAC. ACM, New York, NY, 471-476.
Eldridge Matthew, Homan Igehy, Pat Hanrahan, Pomegranate: a fully scalable graphics architecture, Proceedings of the 27th annual conference on Computer graphics and interactive techniques, p. 443-454, Jul. 2000.
Fang, L., et al., Fast Maximum Intensity Projection Algorithm Using Shear Warp Factorization and Reduced Resampling, Mangetic Resonance in Medicine 47:696-700 (2002).
Filtered Backprojection Reconstruction, http://www.physics.ubd.ca/-mirg/home/tutorial/fbDrecon.html, 216/2003, 5 pages.
Goddard et al., High-speed cone-beam reconstruction: an embedded systems approach, 2002, SPIE vol. 4681, pp. 483-491.
Grass et al., Three-dimensional reconstruction of high contrast objects using C-arm image intensifier projection data, 1999, Computerized Medical Imaging and Graphics, 23, pp. 311-321.
Hadwiger, Markus, et al., Hardware-Accelerated High-Quality Reconstruction of Volumetric Data on PC Graphics Hardware, VRVis Research Center, Vienna, Austria, and Institute of Computer Graphics and Algorithms, Vienna University of Technology, Austria, 9 pages.
Hastreiter et al. (Integrated registration and visualization of medical image data, Proc. Computer Graphics International, Jun. 22-26, 1998, pp. 78-85).
Hopf, M., Ertl, T., Accelerating 3d Convolution Using Graphics Hardware, Proc. IEEE Visualization, 1999, 5 pages.
Hudson, et al., Accelerated Image Reconstruction Using Ordered Subsets of Projection Data, IEEE Transactions on Medical Imaging, vol. 13, No. 4, Dec. 1994, pp. 601-609.
Image Registration Slideshow, 105 pages.
Iterative definition, Merriam-Webster on-line dictionary, printed Aug. 26, 2010, 3 pages.
Jain, Anju, A Programmable Graphics Chip, pcquest.com, Jun. 18, 2001.
Jones et al., Positron Emission Tomographic Images and Expectation Maximization: A VLSI Architecture for Multiple Iterations Per Second, Computer Technology and Imaging, Inc., 1988 IEEE, pp. 620-624.
Kajiya, J. T., Ray tracing volume densities, Proc. Siggraph, Jul. 1984, Computer Graphics, vol. 18, No. 3, pp. 165-174.
Karlsson, Filip; Ljungstedt, Carl Johan; Ray tracing fully implemented on programmable graphics hardware, Master's Thesis, Chalmers University of Technology, Dept. of Computer Engineering, Goteborg, Sweden, copyright © 2004, 29 pages.
Kruger J. and R. Westermann, Acceleration Techniques for GPU-based Volume Rendering, Proceedings of IEEE Visualization, 2003, 6 pages.
Lange et al., EM Reconstruction Algorithms for Emission and Transmission Tomography, J Computer Assisted Tomography 8, DD. 306, et seq. (1984).
Lange et al., Globally Convergent Algorithms for Maximum a Posteriori Transmission Tomography, IEEE Transactions on Image Processing, Vo. 4, No. 10, Oct. 1995, pp. 1430-1438.
Li et al., Tomographic Optical Breast Imaging Guided by Three-Dimensional Mammography, Applied Optics, Sep. 1, 2003, vol. 42, No. 25, pp. 5181-5190.
Li, et al., A Brick Caching Scheme for 30 Medical Imaging, Apr. 15-18, 2004, IEEE International Symposium on Biomedical Imaging: Macro to Nano 2004, vol. 1, pp. 563-566.
Maes, et al. Multimodality Image Registration by Maximization of Mutual Information, IEEE Tran. on Medical Imaging, vol. 16, No. 2, Apr. 1997. pp. 187-198).
Max, N., Optical Models for Direct Volume Rendering, IEEE Transactions on Visualization and Computer Graphics, Jun. 1995, 1(2): pp. 99-108.
McCool, M. et al., Shader Algebra, 2004, pp. 787-795.
McCool, Michael J., Smash: A Next-Generation API for Programmable Graphics Accelerators, Technical Report CS-200-14, Computer Graphics Lab Dept. of Computer Science, University of Waterloo, Aug. 1, 2000.
Microsoft, Architectural Overview Direct for 3D, http://msdn.microsoft.com/library/default.asp?url=/library/en-us/dx8_c/directx_cpp/Graphics/ProgrammersGuide/GettingStarted/ Architecture, 12120/2002, 22 pages.
Mitchell, Jason L., RadeonTM 9700 Shading, SIGGRAPH 2002—State of the Art in Hardware Shading Course Notes, DD.3.1-1-3.1-39, 39 pages.
Mitschke et al., Recovering the X-ray projection geometry for three-dimensional tomographic reconstruction with additional sensors: Attached camera versus external navigation system, 2003, Medical Image Analysis, vol. 7, pp. 65-78.
Mueller, K., and R. Yagel, Rapid 3-D Cone Beam Reconstruction With the Simultaneous Algebraic Reconstruction Technique (SART) Using 2-D Texture Mapping Hardware, IEEE Transactions on Medical Imaging, Dec. 2000, 19(12): pp. 1227-1237.
Navab, N., et al., 3D Reconstruction from Projection Matrices in a C-Arm Based 3D-Angiography System, W.M. Wells e al., eds., MICCAI'98, LNCS 1496, pp. 119-129, 1998.
Parker, S., et al., Interactive Ray Tracing for Isosurface rendering, IEEE, 1998, pp. 233-258.
PCT/US2008/084282, Preliminary and International Search Reports, dated May 11, 2011, 7 pages.
PCT/US2005/000837, Preliminary and International Search Reports, dated May 11, 2005, 7 pages.
PCT/US2008/74397, Preliminary and International Search Reports, dated Dec. 3, 2008 , 7 pages.
PCT/US2008/84368, Preliminary and International Search Reports, dated Jan. 13, 2009, 7 pages.
PCT/EP2016/067886, Preliminary and International Search Reports, dated Jan. 17, 2017, 18 pages.
PCT/EP2018/075744, Preliminary and International Search Reports, dated Feb. 1, 2019, 17 pages.
PCT/US2008/84376, Preliminary and International Search Reports, dated Jan. 12, 2009, 6 pages.
JP2018-524544, Office Action, dated Jun. 2, 2020, 4 pages (& English translation).
JP2018-524544, Office Action, dated Nov. 4, 2020, 4 pages (& English translation).
AU2016299367, Office Action, dated Nov. 12, 2020, 4 pages.
AU2022200601, Office Action, dated Dec. 8, 2022, 4 pages.
CA2991378, Office Action, dated Oct. 24, 2022, 7 pages.
EP3329405, Office Action, dated Apr. 6, 2020, 5 pages.
JP2021-078306, Office Action, dated Apr. 18, 2022, 3 pages (& English translation).
Pfister, H., et. al., The VolumePro real-time ray-casting System, Computer Graphics Proceedings of SIGGRAPH), Aug. 1999, No. 251-260.
Phong, B. T. Illumination for Computer Generated Pictures, Communications of the ACM, 18(6), Jun. 1975, pp. 311-317.
Porter, D. H. 2002. Volume Visualization of High Resolution Data using PC-Clusters. Tech. rep., University of Minnesota. Available at http://www.lcse.umn.edu/hvr/pc_vol_rend_L.pdf.
Potmesil, M. and Hoffert, E. M. 1989. The pixel machine: a parallel image computer. In Proceedings of the 16th Annual Conference on Computer Graphics and interactive Techniques SIGGRAPH '89. ACM, New York, NY, 69-78.
Purcell, T., et al., Real-time Ray Tracing on Programmable Graphics Hardware, Department of Computer Science, Stanford University, Stanford, CA, Submitted for review to SIGGRAPH 2002, 2002. http://graphics.stanford.edu/papers/rtongfx/rtongfx_submit.pdf.
Purcell, T., et. al., Ray tracings on Programmable Graphics Hardware, Computer Graphics (Proceedings of SIGGRAPH), 1998, pp. 703-712.
Purcell, Timothy J., Craig Donner, Mike Cammarano , Henrik Wann Jensen , Pat Hanrahan, Photon mapping on programmable graphics hardware, Proceedings of the ACM SIGGRAPH/Eurographics conference on Graphics hardware, Jul. 26-27, 2003, 11 pages.
Ramirez et al. (Prototypes stability analysis in the design of a binning strategy for mutual information based medical image registration, IEEE Annual Meeting of the Fuzzy Information, Jun. 27-30, 2004, vol. 2, pp. 862-866.
Rib Cage Projection, downloaded from http://www.colorado.edu/physics/2000/tomography/final_rib_cage.html on Dec. 26, 2002, 3 pages.
Roettger, Stefan, et al., Smart Hardware-Accelerated Volume Rendering, Joint Eurographics—IEEE TCVG Symposium on Visualization, 2003, pp. 231-238, 301.
Sandborg, Michael, Computed Tomography: Physical principles and biohazards, Department of Radiation Physics, Faculty of Health Sciences, Linkoping University, Sweden, Report 81 ISSN 1102-1799, Sep. 1995 ISRN ULI-RAD-R—81—SE, 18 pages.
Sarrut et al. (Fast 30 Image Transformations for Registration Procedures, Proc. Int. Conf. on Image Analysis and Processing, Sep. 27-29, 1999, pp. 446-451.
Selldin, Hakan, Design and Implementation of an Application Programming Interface for Volume Rendering, Linkopings Universitet.
Shekhar, R.; Zagrodsky, V., Cine MPR: interactive multiplanar reformatting of four-dimensional cardiac data using hardware-accelerated texture mapping, IEEE Transactions on Information Technology in Biomedicine, vol. 7, No. 4, pp. 384-393, Dec. 2003.
Silver, et al., Determination and correction of the wobble of a C-arm gantry, Medical Imaging 2000: Image Processing, Kenneth M. Hanson, ed., Proceedings of SPIE vol. 3970 (2000).
Stevens, Grant, et al., Alignment of a Volumetric Tomography System, Med. Phys., 28 (7), Jul. 2001.
Tao, W., Tomographic mammography using a limited number of low dose cone beam projection images, Medical Physics, AIP, Melville, NY vol. 30, pp. 365-380, Mar. 2003, ISSN: 0094-2405.
Tasdizen, T. , Ross Whitaker, Paul Burchard , Stanley Osher, Geometric surface processing via normal maps, ACM Transactions on Graphics (TOG), v.22 n.4, p. 1012-1033, Oct. 2003.
Tasdizen, T.; Whitaker, R.; Burchard, P.; Osher, S.; Geometric surface smoothing via anisotropic diffusion of normals, IEEE Visualization, VIS 2002, Nov. 2002, pp. 125-132.
Technical Brief: NVIDIA nfiniteFX Engine: Programmable Pixel Shaders, NVIDIA Corporation, 5 pages.
Technical Brief: NVIDIA nfiniteFX Engine: Programmable Vertex Shaders, NVIDIA Corporation, 12 pages.
Viola, I, et al., Hardware Based Nonlinear Filtering and Segmentation Using High Level Shading Languages, Technical Report TR-186-2-03-07, May 2003, 8 pages.
Viola, P., Alignment by Maximization of Mutual Information, PhD Thesis MIT (Also Referred to as—AI Technical report No. 1548), MIT Artificial Intelligence Lab, Jun. 1, 1995, pp. 1-29.
Weiler, M, M. Kraus and T. Ertl, Hardware-Based View-Independent Cell Projection, Proceedings IEEE Symposium on Volume Visualization 2002, pp. 13-22.
Weiler, M. et al., Hardware-based ray casting for tetrahedral meshes, IEEE Visualization, VIS 2003, Oct. 24-24, 2003, pp. 333-340.
Weiler, M. et al., Hardware-Based view—Independent Cell Projection, IEEE, 2002, pp. 13-22.
Weiskopf, D., T. Schafhitzel, T. Ertl, GPU-Based Nonlinear Ray Tracing, Eurographics, vol. 23, No. 3, Aug. 2004.
Wen, Junhai; Zigang Wang; Bin Li; Zhengrong Liang; An investigation on the property and fast implementation of a ray-driven method for inversion of the attenuated Radon transform with variable focusing fan-beam collimators, 2003 IEEE Nuclear Science Symposium Conference Record, vol. 3, Oct. 19-25, 2003, pp. 2138-2142.
Wikipedia, Anonymous, ‘Volume Rendering’ May 30, 2015, retrieved Nov. 4, 2016, https://en.wikipedia.org/w/index.php?title=Volume_rendering&oldid=664765767.
Wikipedia, Anonymous, ‘Tomographic Reconstruction’ Dec. 6, 2014, retrieved Nov. 4, 2016, https://en.wikipedia.org/w/index.php?title=Tomographic_Reconstruction&oldid=636925688.
Wu et al., Tomographic Mammography Using a Limited Number of Low-dose Conebeam Projection Images, Med. Phys., pp. 365-380 (2003).
Xu et al., Toward a Unified Framework for Rapid 30 Computed Tomography on Commodity GPUs, Oct. 19-25, 2003, IEEE Nuclear Science Symposium Conference 2003, vol. 4, pp. 2757-2759.
Xu et al., Ultra-fast 30 Filtered Backprojection on Commodity Graphics Hardware, Apr. 1-18, 2004, IEEE International symposium on Biomedical Imaging: Macro to Nano, vol. 1, pp. 571-574 and corresponding power point presentation.
Related Publications (1)
Number Date Country
20230089298 A1 Mar 2023 US
Provisional Applications (1)
Number Date Country
60989915 Nov 2007 US
Continuations (5)
Number Date Country
Parent 16913808 Jun 2020 US
Child 18070385 US
Parent 15988519 May 2018 US
Child 16913808 US
Parent 15276546 Sep 2016 US
Child 15988519 US
Parent 14040215 Sep 2013 US
Child 15276546 US
Parent 12275862 Nov 2008 US
Child 14040215 US