US 6,345,112 B1Grant

Method for segmenting medical images and detecting surface anomalies in anatomical structures

Issue Date:2002-02-05

•13 Claims

•9 Drawing Sheets

Abstract

A region growing method segments three-dimensional image data of an anatomical structure using a tortuous path length limit to constrain voxel growth. The path length limit constrains the number of successive generations of voxel growth from a seed point to prevent leakage of voxels outside the boundary of the anatomical structure. Once segmented, a process for detecting surface anomalies performs a curvature analysis on a computer model of the surface of the structure. This process detects surface anomalies automatically by traversing the vertices in the surface model, computing partial derivatives of the surface at the vertices, and computing curvature characteristics from the partial derivatives. To identify possible anomalies, the process compares the curvature characteristics with predetermined curvature characteristics of anomalies and classifies the vertices. The process further refines potential anomalies by segmenting neighboring vertices that are classified as being part of an anomaly using curvature characteristics. Finally, the process colorizes the anomalies and computes a camera position and direction for each one to assist the user in viewing 2D renderings of the computer model.

Metadata

Assignee

The United States of America as represented by the Department of Health and Human Services

Inventors

Ronald M. Summers
Scott Selbie
James D. Malley
Lynne M. Pusanik

Application Information

Application Number:US 09/765,826

Filing Date:2001-01-19

Priority Date:1997-08-19

Art Unit:7

Classifications

IPC:

G06K 900

Field of Search:

382128382131382154382203382204382206382218382220382225382277382285382286345420345424345425345441345442345443434403434211434256434257700 29700 31700 98700118

Patent Drawings (9 sheets)

Description

[0002] This application is a division of Ser. No. 09/136,136 filed Aug. 18, 1998, which claims priority to co-pending U.S. provisional patent application serial No. 60/056,452, filed on Aug. 19, 1997, which is hereby incorporated by reference.

FIELD OF THE INVENTION

[0003] The present invention relates to feature extraction and identification in medical imagery. More particularly, the invention relates to methods for generating efficient models of complex anatomical structures in the presence of “leakage,” and methods for employing such models as an aid to diagnosis.

BACKGROUND AND SUMMARY OF THE INVENTION

[0004] The science of medical image processing has taken tremendous strides in the past two decades, particularly in the field of three-dimensional visualization of internal anatomical structures. Such three dimensional models can be virtually rotated and viewed from any perspective, providing invaluable insights to surgeons, diagnosticians, researchers, and other scientists.

[0005] In its raw form, medical imagery typically consists of a large array of numbers representing the value of a physical property (e.g. radiological “density” or “intensity”) at each of a plurality of regularly-spaced locations within the patient. The methods for generating structural models from this data proceed by generally well known principles.

[0006] One familiar class of techniques is known as “volume growing” (sometimes termed “region growing”). In accordance with these techniques, a seed voxel (volume element) is first identified within the anatomical structure of interest. Other voxels are successively analyzed and identified as belonging to the same structure if (1) they adjoin a voxel already identified as belonging to the structure, and (2) they meet a specified physical attribute (typically a radiological density in a range characteristic of the structure of interest).

[0007] According to standard region growing methods, after the seed voxel is identified, the six voxels sharing a face with the seed voxel are analyzed to determine if their physical attribute is within the specified range. If so, such voxels are marked as belonging to the structure. These voxels form a first tier of volume growth.

[0008] Next, each voxel in the first tier of volume growth is processed like a seed voxel, with adjoining voxels analyzed to determine whether their physical attributes are within the specified range. Voxels so identified form a second tier of volume growth.

[0009] This process continues, each iteration adding a shell of further voxels within the structure of interest.

[0010] In the simple case, this march of voxel cubes proceeds until growth in each direction is stopped by an exhaustion of voxels meeting the specified physical criterion. Collectively, the set of voxels thus identified fills the volume of the anatomical structure being analyzed, permitting its three-dimensional modeling.

[0011] The below-cited General Electric patents more fully detail the foregoing volume growing techniques and improvements thereto, including techniques for particularly locating the structure's bounding surface with reference to the vertices of the outermost voxels, techniques for smoothing/shading the bounding surface to facilitate viewing, etc.

[0012] A problem with foregoing technique, and most other volume growing algorithms, is that of “leakage.” Leakage occurs when the march of cubes proceeds through the boundary of the structure being analyzed, rather than stopping as intended. Leakage causes the region growing to continue on the other side of the boundary, with a large number of voxels on the other side of the boundary spuriously identified as belonging to the structure of interest.

[0013] Leakage can occur for many reasons, including voxel dimensions larger than the boundary thickness, noise-induced imperfections in the bounding surface image data, etc.

[0014] As a general matter, leakage does not seriously impair the clinical usefulness of the extracted model. The leakage is an aesthetic distraction, but a reviewing physician can usually readily identify the leakage as a computer processing glitch. A more serious problem is the additional processing burden that leakage imposes on the three dimensional modeling software.

[0015] The computational complexity of three dimensional modeling is substantial. Such models typically include hundreds of thousands of data points, each of which must be processed every time the displayed model undergoes any change.

[0016] Much of the value of three dimensional modeling comes from the physician's ability to rotate the model, move his point of perspective, and zoom into and out from features of interest—all in real time. Each such operation requires that the display screen be “repainted” several times in quick succession to avoid the impression of jerky movement. Each such screen redraw, in turn, requires an enormous number of computations. The problem with leakage is that it vastly swells the dataset that must be processed, slowing the modeling software response time, and interfering with the physician's sense of real time interactivity.

[0017] The leakage problem in region/volume growing algorithms has been recognized for decades, and has been dealt with in various ways.

[0018] One way is simply to adopt a feature extraction technique relatively immune to leakage. One such class of techniques relies on deformable models. In “A Novel Volumetric Feature Extraction Technique, With Applications to MR Images,” Int'l. Conf. on Image Proc., pp. 564-67, IEEE (1995), for example, Ashton et al model an expanding bubble whose expansion continues until the bubble fills the structure of interest. The shape of the bubble is controlled by a constraining force imposed by surrounding tissue and by a penalty for deviation from the expected surface normal. More particularly, Ashton et al. expand a seed voxel outwardly in an ovoid shape until the expected volume is reached, or until no further expansion is possible due to constraining tissue. (The ovoid shape is tailored in accordance with a priori information about the expected shape and size of the structure of interest.)

[0019] Leakage is rarely an issue in such deformable model techniques because, like a balloon, the expanding outer surface will not generally tunnel through a small opening and spawn a large ballooned volume on the other side.

[0020] Feature extraction techniques offering immunity to leakage are rare, and suffer from various drawbacks that have prevented their widespread adoption. Accordingly, various other solutions to the leakage problem have been proposed.

[0021] One solution has keyed on the characteristic shape of leakage volumes (i.e. a growth volume linked to a more central volume by a single (or a few) voxels). Computerized feature recognition techniques can be applied to identify such characteristic shapes and automatically delete them from the dataset. However, such approaches are generally disfavored in medicine due to the possible inadvertent deletion of clinically significant features.

[0022] In cases where the boundary of concern is thin, leakage can sometimes be ameliorated by employing commensurately small voxels (or subvoxels). With this approach, a boundary won't be missed by a voxel simply spanning the physical boundary. However, halving the edge size of the voxel effects an eight-fold increase in the number of voxels to be processed, with a corresponding slow-down in manipulation of the resulting three-dimensional model. Moreover, thin boundaries are sometimes simply not manifested in the image data being analyzed, due to inherent resolution limitations of the data acquisition device (e.g. CT or MRI scanner). In such cases, small voxels offer no solution.

[0023] U.S. application Ser. No. 07/797,893, cited in U.S. Pat. No. 5,553,207 to Sekiguchi et al, proposes an interactive solution to the leakage problem in which an operator monitors progress of the volume growth on a plurality of display devices and interrupts the process if a leak extends to a volume outside the structure of interest. (Several display devices are required due to growth in three dimensions.) Sekiguchi's '207 Patent extends this technique by facilitating deletion of the spurious growth by reverse expansion from an operator-identified voxel within the leaked volume.

[0024] A drawback of Sekiguchi's technique is its requirement of human interaction and real-time vigilance, increasing the cost of the diagnostic imagery and reducing the clinician's productivity. Another drawback is its failing in the context of complex branching structures. In such structures, a leak may not be manifested as a swelling blob—readily apparent to an operator, but as a tunneling path that snakes and grows in a chaotically-bound volume outside the structure of interest. Such spurious growth may not be obvious to a monitoring operator, but nonetheless swells the dataset that is later manipulated for three dimensional display to a reviewing physician.

[0025] Another approach to the leakage problem is to define a boundary (e.g. a parallelepiped) beyond which volume growth is not permitted. Each time growth to a new voxel is considered, its x, y and z coordinates are checked to insure that each is within the prescribed limits.

[0026] While the foregoing boundary constraint avoids unbounded leakage, significant leakage can still occur, resulting in awkward delays in manipulation of the three-dimensional model.

[0027] U.S. Pat. No. 4,905,148 to Crawford considers and dismisses several approaches to the leakage problem, including (a) manually identifying potential bridges before the connectivity algorithm is applied; (b) circumscribing the structure of interest with a user-defined boundary; and (c) requiring a higher order of connectivity (e.g. several overlapping voxels) before extending region growth to a voxel. Finding none of these approaches generally suitable, Crawford instead proposes a technique employing several seeds: one inside the structure of interest, and one or more outside. Region growing is first applied to the outside seed(s) using a directional criteria chosen to avoid the structure of interest (e.g. by specifying growth only in directions away from the structure of interest). The values of voxels identified by this first operation are then modified. Region growing can then proceed from the first seed voxel without possibility of leakage to those voxels whose values were modified.

[0028] Crawford's method is illustrated in the context of preventing region growth in a skull from leaking outside through, e.g., eye socket cavities. In this context the area of potential leakage is large and obvious: the volume outside the skull. In many other contexts, however, this is not the case. Many anatomical structures have complex branching topologies, preventing a clinician from readily identifying regions of likely leakage. Moreover, Crawford's technique requires operator-assisted pre-processing of the data, a step which is costly and often impractical.

[0029] In accordance with one aspect of the present invention, the foregoing and other drawbacks of the prior art are overcome. Leakage outside a structure of interest is constrained by an operator-set distance parameter. Unlike the simple bounding volume constraint of the prior art, this distance parameter refers to the tortuous path length actually traversed by a branch of a growing volume, rather than a straight-line distance between the beginning and end points. (A conventional bounding volume can be imposed as a secondary, fail-safe constraint, in case the anatomy outside the structure does not impose a chaotic path on the leakage volume.) The relative growth rates in three dimensions can be specified independently to provide for more efficient extraction of features whose shapes are generally known.

[0030] By the foregoing arrangement, leakage in complex anatomical structures is controlled without human intervention, yielding models better suited for rapid three dimensional manipulation.

[0031] One type of rapid three dimensional manipulation that would be unthinkable if a model were burdened with the large leakage volumes, but which is practical if such volumes are controlled, is virtual navigation of the model. In such methods, a physician “steers” himself through the structure using a joystick or the like, with an associated display being updated—seemingly in real-time—in accordance with the joystick's movements. This arrangement allows a physician to conduct a virtual tour of an anatomical structure, visiting features of interest while ignoring others.

[0032] While a random virtual exploration of the anatomical structure can be informative, better use of the physician's time may be made by use of a guide. In accordance with a further aspect of the invention, a compilation of sites of potential interest is generated by a computer analysis of the imagery data, and serves to guide the physician in his virtual review of the anatomy. In one embodiment, this guide data is employed to direct the virtual tour, automatically navigating through the structure until a feature of interest is centered in view, and then pausing. The physician can then inspect the feature, using the joystick to move around as desired. After the physician has taken whatever note of the feature is merited, the tour is resumed, with the system navigating the physician to the next feature, and so on.

[0033] In another embodiment, the guide does not automatically navigate from virtual location to location for the physician. Instead, the guide data is used to highlight features of interest, e.g. by changing their color, so that the physician can take note of them on a self-guided tour.

[0034] In both these embodiments, a second 2D map-like display can be employed to identify the position of the physician's virtual perspective within the model, so as to avoid disorientation.

[0035] In an illustrative embodiment, the discernment of features for inclusion in the guide is performed by reference to their shape. In an embodiment tailored for diagnosis of bronchial pathologies, for example, functions of partial derivatives of a parameterized surface, and functions of a surface displacement vector, are employed. In another embodiment, a 3D filter computes partial derivatives of a surface model. The 3D filter visits each vertex in the model and filters neighboring voxels to compute the partial derivatives of the surface at the vertex. In both embodiments, the partial derivatives are used to compute curvature characteristics. By comparing the curvature characteristics with predetermined characteristics, surface anomalies can be detected and highlighted for review. These methods have been found to accurately characterize the shape of polypoid lesions found in the bronchus and can be adapted for other anatomical structures as well.

[0036] By the foregoing arrangement, a physician's attention is advantageously focused on features of potential clinical significance, enhancing the physician's effectiveness and improving patient care.

[0037] The foregoing and additional features and advantages of the invention will be more readily apparent from the following detailed description, which proceeds with reference to the accompanying drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

[0038] FIG. 1 is a simplified 2D voxel map of a branching structure, such as the bronchus, showing constraint of voxel leakage according to one embodiment of the present invention.

[0039] FIG. 2 is a flow diagram illustrating a region growing segmentation method that employs a path length limit to constrain voxel growth.

[0040] FIG. 3 is a voxel map showing an example of ratioed growth.

[0041] FIG. 4 is a voxel map showing another example of ratioed growth.

[0042] FIG. 5 shows how a bronchial wall can be located from CT data according to one embodiment of the present invention.

[0043] FIG. 6 shows an excerpt of a 3D model of the bronchus composed of a myriad of tiny triangles.

[0044] FIGS. 7A-7E illustrate different curved surfaces.

[0045] FIG. 8 is a flow diagram illustrating a process for detecting and viewing surface anomalies in a computer model of an anatomical structure.

[0046] FIG. 9 is a block diagram of a computer system employed in one embodiment of the present invention.

DETAILED DESCRIPTION

[0047] For expository convenience, the following disclosure focuses on use of the present technology in the context of bronchoscopy. As will be apparent to those skilled in the art, the technology is not so limited, but can be applied to extraction and analysis of models of any other anatomical structure.

[0048] Similarly, the invention is particularly illustrated with reference to data generated by X-ray computed tomography processes, but can likewise be applied to any other medical image data, including data generated by magnetic resonance imaging, positron emission tomography, ultrasound imaging, etc.

[0049] Computed tomographic (CT) bronchoscopy, or virtual bronchoscopy (VB) as it is also known, is a recently developed technique in which thin-section CT data (commonly helical scan CT data) are reformulated to provide a realistic surface rendering of the inner walls of hollow structures, which can then be inspected with use of an endoscope-like paradigm. Several preliminary studies have investigated this technique for virtual endoscopy of the colon. Exploration of the airways, however, is just as feasible. One source of difficulty has been the multiple branching of the airways. One approach to this problem is to use region-growing techniques: With use of a seed point, all connected voxels within the airway lumen with thresholds that are within a specified range can be selected.

[0050] In practice, use of region-growing methods is limited because the segmented region tends to also include undesired portions of the volume. In addition to the leakage mechanisms discussed above, leakage occurs in bronchoscopy data because the threshold for region growing cannot be set to both include the smaller airways but exclude the pulmonary parenchyma. This is a particular problem in the smaller bronchi, owing to partial-volume effects.

[0051] As noted, segmentation leakage is a problem because it increases the complexity of the three-dimensional (3D) model of the bronchi. Inclusion of the adjacent unwanted lung in the desired volume results in the generation of surfaces along the pleura and pulmonary vessels in addition to surfaces specific to the airway wall. If the processing power and display speed of computer graphics were unlimited, this would not pose a problem because the huge number of elements that make up the shaded surface display could be rotated, zoomed, panned, and manipulated at will interactively. Shaded surface displays composed of a million triangles or more, however, cannot be rendered with a sufficient frame rate to allow interactive manipulation of the object at practical graphics workstations. Thus, segmentation leakage results in airway models that are too complex to be rendered in real time.

[0052] In addition to creating complex surface models, leakage also inhibits further automated and semi-automated analyses on the segmented structure. For example, it complicates and potentially prevents the detection of surface anomalies and other geometric shapes using automated techniques. Moreover, leakage may also cause such detection methods to identify leakage as an area of interest.

[0053] In accordance with a preferred embodiment for imaging the bronchial walls, a region-growing technique is applied in which the tortuous path length distance from a seed point is controlled to avoid selection of unwanted voxels in the pulmonary parenchyma. Additional seed points can be placed to fine-tune the segmentation. The surface-rendered models created with this method typically have fewer than 100,000 triangles and can be readily manipulated in real time. The resulting model provides a faithful representation of the CT data and can be used for accurate measurement of bronchial diameters. A review of an experimental setup verifying the efficacy of these methods follows.

[0054] Protocol for CT.—Fourteen patients (four men and ten women, aged 19-67 years [mean, 36 years]) with a clinically relevant indication to undergo thin-section CT of the airways underwent helical CT (High Speed Advantage scanner; GE Medical Systems, Milwaukee, Wis.). Scans were acquired with use of 3-mm collimation, 140 kVp, 160 mA, and a helical pitch of 2:1, according to the method of Vining et al, “Virtual Bronchoscopy,” Radiology, 193(P):261; see also Chest, Vo. 109, No. 2, pp. 549-553 (February, 1996). Scanning extended from the level of the thoracic inlet through the dome of the diaphragm. To reduce the effect of section misregistration between breath holds, a 15-second breath hold was used and a 15-second rest period was provided to allow patients to catch their breath. It was found that even very ill patients could easily tolerate this regimen. Typically, the entire bronchial tree could be scanned in two to three breath holds. To reduce the problem of section misregistration in the complex anatomic structures of the lobar bifurcations, breath-hold clusters were arranged to encompass this area in a single breath hold. The digital scout view was used as a guide for planning the location of the scanning clusters. The display field of view was reduced to 26 cm or less, depending on the size of the patient, to provide the highest possible in-plane resolution for the smaller bronchi without clipping them from the field of view. Images were retrospectively reconstructed by using a 1-mm section index and a high-frequency bone algorithm.

[0055] Generation and Display of 3D Surface-Rendered Model

[0056] The number of reconstructed images ranged from 137 to 326, with a 512×512 matrix. The 16-bit gray-scale data were first converted to 8 bits by using a window level of −600 HU and a window width of 600 HU.

[0057] Segmentation was achieved by means of a six-face region-growing method. A first seed point was placed at the coordinates (x_s, y_s, z_s). The voxels at coordinates (x_s±1, y_s, z_s), (x_s, y_s±1, z_s), and (x_s, y_s, z_s±1) were investigated to determine whether they were within the acceptable threshold range. If so, the new voxel became the seed point and the process was repeated. The segmentation threshold chosen was −675 HU. Empirically, it was found that use of higher thresholds generally resulted in increased segmentation leakage.

[0058] The tortuous path length in the illustrated embodiment is determined by the generation of growth to which a particular voxel corresponds. Referring to FIG. 1, a simplified bronchus is shown with a seed voxel (104) placed in the tracheal lumen (106) (i.e. the main stem). The seed voxel is regarded as generation zero. The dark lines (108) indicate boundaries (e.g. the bronchial wall, or other tissue) having physical attributes outside the range that permits continued voxel spreading. Voxels spread from the seed voxel in successively numbered generations of voxel growth unless growth is stopped by a boundary (108).

[0059] Due to noise or otherwise, a segmentation leak (110) exists in the upper right arm of the illustrated bronchus. Voxels spread from this leak back down along the outside of the structure. In the illustrated embodiment, a generational limit of 16 is imposed on voxel spreading, so after the 16^thvoxel (112), growth stops. Note that the terminal, 16^thgenerational voxel illustrated in the drawing is just 3 voxels away from the seed voxel in the x dimension, and 4 voxels away in the y dimension. If prior art volume constraints had been applied to such leakage, it would not have been arrested until it was 16 voxels away in one of the x, y, or z dimensions—far off the illustrated page. Thus, by the present arrangement voxel leakage is greatly reduced as compared with prior art techniques.

[0060] Voxels spread throughout the illustrated bronchus until this generational growth limit is met, or unless localized growth is stopped earlier due to a boundary having a physical attribute outside the specified range.

[0061] Desirably, several initial seeds are placed in the bronchus. One in the tracheal lumen, as illustrated. Others are typically placed within lobar bronchi. The use of multiple seeds allows greater control of the segmentation and contributes to the amount of segmentation leakage (by permitting lower generational limits).

[0062] FIG. 2 is a flow diagram illustrating the operation of the segmentation method illustrated in FIG. 1. In the first pass, the segmentation process begins with the initial seeds placed in the airway. The process selects a seed point (210), which initially represents generation zero or a path length value of zero. In subsequent generations of growth, the process increments the path length value of new seed voxels, and the path length limit serves as a constraint on further processing of the segmented region at the new seed voxels. To avoid further processing in these cases, the process evaluates the accumulated path length (222), and if it exceeds a path length limit, the process terminates further growth originating from the current voxel. Processing then continues so long as other seed voxels remain.

[0063] If the path length is not exceeded, the segmentation process computes the new voxel coordinates of a voxel location that represents the next generation of growth from the voxel currently acting as the seed (224). As described above, the coordinates of the current seed are modified to compute a new voxel location. The specific location of each new voxel computed from the current seed depends on the desired rate and direction of growth from the voxel.

[0064] The characteristic value of the voxel at the new coordinates is evaluated (224) to determine whether it falls within a predetermined threshold (228). Typically the characteristic value represents an intensity or radiological density value, but can also represent other characteristic data. If the characteristic value is within the threshold, the new location becomes a potential seed voxel in a subsequent generation of growth (230). The segmentation process tracks the path length to each new seed voxel by incrementing the path length value representing the number of generations of growth to the new seed (232).

[0065] Since several new voxels are potentially evaluated in the current generation of growth from a voxel (i.e. the six adjacent voxels), the segmentation process continues to process any additional voxels in the current generation as reflected in steps 234 and 236. Once there are no more voxels in the current generation of growth, the segmentation process proceeds to another seed voxel as shown in steps 238 and 240. This new seed voxel may be one of the initial seeds or a seed created in an earlier generation. Processing halts when there are no additional seeds.

[0066] In a further refinement, a directional criteria is employed for the region growing process. This involves ratioing the relative rates of growth in the left, right, anterior, posterior, superior and inferior directions, so growth proceeds slowly in directions where little growth is expected. Consider, for example, a situation in which a unity growth factor is applied in the superior and inferior directions, and a growth factor of 0.5 is applied in the other four directions. Starting with the seed voxel, the process begins by consideration of just the superior and anterior faces of the seed voxel. Two voxels are thereby identified in this first generation of growth (assuming a physical characteristic within the specified range). In the second generation of growth, all faces of the two voxels identified in the first generation are considered, together with the four faces of the seed voxel not considered during the first generation of growth.

[0067] This process continues, with odd generations of growth considering only voxels superior or anterior to those just identified, and the even generations of growth considering adjoining voxels in all six directions. By this arrangement, voxel growth spreads twice as quickly along the superior-inferior axis as along the others.

[0068] In this ratioed growth context, the tortuous path limit is still keyed to total generations of growth, notwithstanding that growth does not occur in all directions during each generation.

[0069] The effects of such ratioed growth on leakage are illustrated by FIG. 3. Growth in the vertical directions proceeds in every generation; growth in the horizontal directions proceeds only in even numbered generations. As a consequence (in this example), growth does not extend to a voxel horizontally adjacent to an even generation voxel until the succeeding even generation of voxel growth. Comparison of FIG. 3 with FIG. 1 shows that the leakage is arrested earlier.

[0070] As interesting as the early arrest of leakage is the fact that such ratioing has very little effect on the rate of voxel growth through the intended structure (none in the illustration). Because the width of the bronchial structure is less than twice its height, the half-paced growth in the horizontal direction does not impair the spread of voxels through the desired structure.

[0071] If the aspect ratio of the desired structure is exaggerated, the ratioed growth causes both leakage and desired voxel spread to be curtailed. In FIG. 4, for example, growth in the horizontal direction occurs only every fourth generation. In this case, leakage is arrested still earlier (only a single voxel of leakage in this example), but at the price of a shortening of the part of the desired structure. (e.g., the voxels in the two upper comers (410, 412) of FIG. 4 are not reached in 16 generations of growth.) This latter price can be ameliorated by selecting more closely spaced initial seed locations through the structure. Different growth ratios can be applied to each seed.

[0072] For example, a posterior segmental bronchus in the right lower lobe tends to be oriented in the inferior direction, so any propagation of region growing in the five other directions likely relates to leakage and can be minimized by ratioing accordingly. Similar logic can be applied to each of the twenty-some segmental bronchi.

[0073] Further consider segmenting a lobe. Bronchi in that lobe tend to ramify in a particular preferred direction (away from the hilum). So right upper lobe bronchi tend to ramify to the patient's right side and in a superior direction. Bronchi in the right middle lobe tend to ramify to the right and/or anteriorly. Right lower lobe bronchi ramify inferiorly and to the right. Left upper lobe bronchi ramify superiorly and to the left. Lingular bronchi ramify to the left. Left lower lobe bronchi ramify interiorly and/or to the left.

[0074] There is an evident balance to be struck between the number of seeds and the tortuous growth limit (and the ratioing of directional growth). A suitable starting point is usually to specify between one and four seeds. The first is located in the proximal trachea, with a tortuous growth limit of 500 generations (this corresponds to 250 millimeters with a half millimeter voxel dimension), and equal growth in all directions. This arrangement is used as a trial to determine how many bronchi are segmented and how much leakage has been encountered. Then the growth limit can be reduced, the ratios can be adjusted asymmetrically, and/or a new seed can be placed.

[0075] If a second seed is added at the level of a lobar bronchus, a tortuous growth limit of 20-100 generations may be set (typically 40), with ratioed growth favoring the principal axis by a factor of two.

[0076] It will be recognized that ratioed growth can be implemented in various ways; the foregoing is simply illustrative.

[0077] In addition to the tortuous growth limitation, a conventional parallelepiped constraining volume can also be employed, in case growth in the leakage volume does not follow a chaotic path.

[0078] Desirably, the software provides a convenient graphical user interface through which the foregoing parameters can be interactively adjusted in accordance with segmentation results as displayed in near real-time on associated display devices.

[0079] After segmentation is completed, 3D surface rendering is generated by application of an isosurface algorithm. With this method, eight adjacent voxels that share a common vertex are used to create a virtual cube. The voxel intensity of each of the eight voxels is assigned to the corresponding vertex of the virtual cube. Given these vertex intensities, a surface is created through this virtual cube that represents the desired isosurface. Thus, to generate an appropriate isosurface, gray-scale values of wall-surface voxels at least two voxels deep are provided to the algorithm. The remainder of the 3D array is filled with a large constant value. Therefore, when wall voxels are detected during the segmentation, the gray-scale value of the wall voxel and a voxel beyond the wall are transferred to an array. Placement of the additional voxel beyond the wall allows flexibility in the choice of the isosurface threshold. A threshold value near that of the segmentation threshold places the wall partially through a lumen voxel. Use of a higher isosurface threshold moves the wall surface out just beyond lumen voxels and places the surface completely through wall voxels. The resulting array, after segmentation, is passed to the isosurface algorithm to generate the desired surface.

[0080] The isosurface algorithm also necessitates use of a threshold to determine the location of the isosurface in the virtual cube. A value of −380 HU is used for this threshold in the illustrated embodiment. Initially, a threshold value of −500 HU was used, but it was found that this setting tended to result in underestimation of bronchial diameter. This is in keeping with the range suggested by Zeiberg et al., “Helical (Spiral) CT of the Upper Airway with Three-Dimensional Imaging,” AJR 166:293-299 (1996), who found in phantom experiments that measurement errors were reduced for thresholds in the range of −500 to −300 HU.

[0081] The foregoing may be made clearer by reference to FIG. 5. This illustration shows how the bronchial wall is located from the CT data. Three adjacent columns (510, 512, 514) of voxels are illustrated in the Figure, with different shadings given to each. The four darkest voxels (514) are within the bronchial lumen. Gray voxels (512) are partially within the voxel wall. White voxels (510) are entirely within the bronchial wall. The position of the wall (shown as a plane traversing the voxels e.g., planes 516 and 518) is determined by the isosurface threshold. Increasing the isosurface threshold moves the wall further to the left in the Figure. The patch (520) of the wall that intersects the voxels is triangulated in the right part of the Figure. This process is repeated for each small patch of the wall.

[0082] In the preferred embodiment, the model surface is composed of many tiny triangles, as shown in FIG. 6. As a final step in processing of data, the 3D bronchial model is compressed by using a process known as triangle decimation. This method increases the display frame rate by reducing the number of triangles needed to form flat parts of the model, but it preserves the global morphologic characteristics. A decimation tolerance level of 0.1% can be used.

[0083] The segmentation algorithm described above was written and implemented by using an Indigo II computer with Extreme graphics (Silicon Graphics, Mountain View, Calif.). This computer has 320 Mbyte of main memory and a 9-Gigabyte disk drive. We interfaced this software with a commercial visualization package, which was used to render and manipulate the shaded surface display (Explorer Version 3.0; Numerical Applications Group, Downers Grove, Ill.). The Explorer program has a viewer that allows a “fly through” of any 3D data set. The fly-through capability is used to simulate bronchoscopy, as more particularly detailed below. Image compression was achieved by using IMCompress (InnovMetrics Software, Quebec, Canada).

[0084] Method of Image Analysis

[0085] To illustrate that the 3D surface rendering achieved by the foregoing technique is a true representation of the two-dimensional CT data from which it was derived, bronchial dimensions on both the CT images and the surface-rendered models were measured for four patients. The source CT data were analyzed at a graphics workstation by using the Advantage Windows program (GE Medical Systems). Coronal, sagittal, and axial localizer images were generated from the 3D volume set. The window level was set at −150 HU, and the window width was set at 1,000 HU. The orientation of each bronchus was determined by obtaining a section that included the bronchus within its plane; from this image, a section perpendicular to the lumen was generated. From this section perpendicular to the bronchial cross section, the maximum and minimum diameters were measured. To simplify the analysis, the bronchial cross section was modeled as an ellipse, with the minimum diameter placed along an axis perpendicular to that of the maximum dimension. This assumption was probably of greater validity in segmental bronchi and of lesser validity in the trachea, in which the incomplete cartilage ring resulted in a cross-sectional shape that was not a classic ellipse. In the trachea, main-stem bronchi, bronchus intermedius, and lobar bronchi measurements were made in the proximal, middle, and distal portions of the bronchus. Only a proximal measurement was made in the segmental bronchi. There were therefore 49 potential locations at which measurements could be made in each patient. All measurements were made by the same observer. The measurements were repeated at three different reading sessions, so a total of three measurements of each dimension were obtained at each site for a total of 294 measurements per patient. The bronchial cross-sectional area was computed from the equation of an ellipse: πab, where a and b are the major and minor semiaxes, respectively.

[0086] The 3D surface-rendered models were analyzed using the Silicon Graphics workstation. Software was developed to make linear measurements in the interior of the model. We implemented pick correlation to identify locations on the bronchial wall. Pick correlation was used to locate the coordinates of a point on the bronchial wall (selected by clicking a mouse). The Pythagorean theorem was then applied in a straightforward manner to compute the distance between any two locations on the wall. These measurements were then calibrated in centimeters, on the basis of voxel dimensions of the source CT data. While the observer traversed the 3D model during a simulated bronchoscopic examination, locations in the proximal, middle, and distal portions of the larger bronchi and in the proximal portions of the segmental bronchi were again selected for measurement. To determine the appropriate measurement plane, the line of sight was set interactively to point along the orientation of the bronchus. The maximum and minimum dimensions were measured within a plane perpendicular to the view direction. Measurements were performed three times at each site to determine intraobserver variability.

[0087] Method of Statistical Analysis

[0088] Analysis of the bronchial diameters and cross-sectional areas determined at CT and at VB was performed. Because the true diameter and area value were unknown, the method of Bland and Altman (“Statistical Methods for Assessing Agreement Between Two Methods of Clinical Measurement,” Lancet, Vol. 1, pp. 307-310 (1986)) was employed to assess the level of agreement between the CT and VB measurements. The difference between the measurements obtained with each technique was compared with the average measurement obtained with the two methods. This comparison was more illuminating than a correlation coefficient because the latter showed the CT and VB measurements to be highly correlated, a finding that was expected because the VB is derived from the CT data. According to Bland and Altman, the VB measurements are interchangeable with the CT measurements if twice the standard deviation of the differences (which encompass 95% of the data) is not clinically important.

[0089] Results

[0090] Imaging was well tolerated by all 14 patients. Of the total bronchi expected to be visible, 91% and 82% were measurable with CT and VB, respectively. CT demonstrated 85% and VB showed 76% of segmental bronchi. A bronchus was considered measurable at VB if the proximal portion of the bronchus was visible and could be entered during the fly-through. Overall, 90% of bronchi through the third order that were measurable at CT could be measured at VB. Among the total of 196 bronchial measurements, 175 could be made on the CT images (89%) and 153 could be made on the VB renderings (78%). The most difficult bronchi to measure were the superior and inferior lingular segmental bronchi. This difficulty was probably a result of their small size and obliquity to the place of section and of the presence of cardiac pulsation artifacts.

[0091] The mean differences between the measurements of maximum lumen diameter and the measurements of lumen cross-sectional area with CT and VB are listed in Table 1. Given the segmentation and isosurface thresholds chosen, VB (compared with CT) tended to result in overestimation of lumen diameter and cross-sectional area by less than 0.5 mm and 5 mm²on average, respectively. To detect systematic errors associated with bronchus size, the differences in lumen diameter and cross-sectional area were also expressed as a percentage of the mean difference between the CT and VB measurements. These percentages were typically less than 10%, and there was no apparent correlation with bronchus size (P>0.05).

Differences in Measurements of Diameter and Area of Bronchal Lumen with CT and VB

TABLE 1

	Mean Difference in Maximum	Mean Different in Area
Patient No.	Diameter (mm)	(mm

1	−0.3 (0.3)	−2.3 (4.3)
2	−0.1 (0.4)	−2.2 (5.7)
3	−0.2 (0.4)	−4.3 (6.9)
4	−0.1 (0.4)	−2.9 (4.6)

[0092] The number of triangles in the 3D surface-rendered models of the 14 patients' airways and the approximate frame rates in the trachea are listed in Table 2. The number of triangles gives a sense of the complexity of each 3D model, and the frame rate is an indication of the ability to interactively manipulate the model in real time. We found frame rates of one to two frames per second to be adequate for this application. Three of the models comprised more than 100,000 triangles and had rendering speeds of less than one frame per second. In these three patients, the models contained large cavities, which increased the number of triangles dramatically. If only the airways were of interest, the cavities could be eliminated from the model and the rendering speeds would increase. Table 2 details rendering speeds for different analyses.

Patient Information and Rendering Speeds for VB

TABLE 2

Patient No/		No. of	No. of	Frame Rate in Trachea
Age (y) Sex	Clinical Data	Triangles	Seeds	(frames per second)

1/24/M	WG	67,000	4	1.5
2/39/M	WG	51,000	4	2.0
3/35/M	WG	84,000	4	1.3
4/28/M	CGD	65,000	6	2.4
5/54/F	WG	63,000	3	1.7
6/19/F	WG	49,000	3	2.2
7/45/F	RP	47,000	3	2.0
8/67/F	LG	99,000	1	1.2
9/22/F	JS	103,000	5	0.8
10/22/F	JS	60,000	3	1.9
11/52/F	MAI	184,000	7	0.7
12/25/F	JS	199,000	8	0.8
13/37/F	MDRTB	108,000	6	1.5
14/38/F	JS	21,000	1	3.3

[0093] Standard deviations of the diameter measurements were slightly larger for VB; they were typically less than 0.25 mm for CT and less than 0.35 mm for VB. The slightly greater standard deviation for VB measurements was attributed to the fact that selection of wall points was less reproducible with VB than with CT.

[0094] In other tests, results of fiberoptic bronchoscopy were compared with the virtual bronchoscopy findings. Lesions due to Wegener granulomatosis were noted in the VB analysis. Findings with fiberoptic bronchoscopy confirmed the lesions. One of the lesions was 5.1 mm wide. The patient with this lesion also had a tight stenosis in the bronchus intermedius. The diameter of the lumen was 3.0 mm±0.3 at CT and 3.2 mm±0.1 at VB. The length of the stricture was 9.8 mm±0.2 at VB. A fiberoptic bronchoscope could not be passed through this stricture. VB views of the lumen proximal and distal to the stenosis were also obtained. This segment could not be visualized at fiberoptic bronchoscopy.

[0095] VB imagery was also taken of a patient with chronic granulomatous disease. Large cavities were noted in both upper lobes. For each cavity, a macroscopic site of communication was detected between a segmental bronchus and the cavity. Segmentation of the cavities alone showed that the volume of one cavity was 13.6 mL and of the other was 24.1 mL.

[0096] Processing of an examination necessitated approximately 1 hour and consisted of iteratively varying the tortuous distance parameters and number of seeds to attain the desired level of completeness of visualization of the tracheobronchial tree (i.e., to see more third-order bronchi). At least 75% of this time was spent waiting for the computer to perform the segmentation. Processing time could thus be reduced substantially by using a faster computer and by further optimizing the algorithm.

[0097] Discussion

[0098] The above-detailed segmentation method produces realtime, detailed, shaded surface displays of VB. Although the segmentation can be time-consuming, owing to the necessity for trained operator intervention, the detailed method ameliorates the problem of segmentation leakage and thereby reduces the number of triangles that needed to be rendered; the net result is a real-time interactive display. This method allows visualization of bronchi to the third order (segmental bronchi) and optimizes both image quality and viewing speed.

[0099] Once the airway model is formed, it is possible to make many 3D size measurements and to view the entire airways quickly and in detail during fly through up and down the different bronchi. A comparable speed capability has been suggested in which cine mode is used to page through a large number of transaxial images (Gur et al, “Sequential Viewing of Abdominal CT Images at Varying Rates,” Radiology, 191:119-122 (1992). The cine method was proposed for detection of abdominal masses, but its usefulness has not been established for the detection of abnormalities in the thorax. Virtual endoscopy is a recently developed technology, and there are few data reported that describe its time-saving aspects. Cline et al. (“Three Dimensional Segmentation of MR Images of the Head Using Probability and Connectivity,” J. Comput. Assist. Tomography, 14:1037-1045 (1990))report that a method of tissue segmentation with magnetic resonance (MR) imaging of the brain necessitated only 5 minutes of user interaction. Their method employs a multispectral analysis (several MR sequences), yielding greater tissue contrast than is provided at CT. In an earlier study by the same group, presumably at an earlier stage of development of the technology, a processing time of 1 hour was reported for segmentation of the brain. In a study of 3D reconstruction of the upper airway, development of a model took less than 10 minutes. None of these methods, however, reportedly allowed virtual endoscopy to be performed in real time. The amount of operator time necessary with the above-described method appears reasonable given the early stage of development of the method, which is expected to be amenable to further automation. Because of the large number (several hundred) of images in a typical dat set, this method is expected to be faster and more accurate than interactive editing of individual sections.

[0100] The problem of segmentation leakage is most important in the lung periphery adjacent the segmental bronchi. At these locations, bronchial dimensions are on the order of the section thickness, and partial-volume artifacts can cause artifactual holes in the bronchial walls. The segmentation algorithm tends to leak through these holes and thus generate unwanted surfaces of pulmonary arteries and veins. A large number of unwanted surfaces can be generated in this way within a short distance of the structure of interest. By reducing the tortuous distance parameter, this segmentation leakage is controlled. More distal portions of segmental bronchi—outside the generational limit—are handled by establishing additional seed locations in such distal portions.

[0101] In the illustrated embodiment, a compromise is reached between the desire to include smaller segmental bronchi in the reconstruction and the need to reduce the number of triangles in the model. It was found that for a display field of view of 26 cm, a tortuous distance limit of 250 voxels from a seed voxel in the trachea at the level of the thoracic inlet is a good starting point for reconstructing the majority of the bronchi through the level of the proximal segmental bronchi.

[0102] At CT and VB, 91% and 82%, respectively, of the total bronchi expected to be visible were actually measurable. Measurements could be made at CT in 85% and at VB in 76% of segmental bronchi. These values are in reasonable agreement with those of Osborne et al. (“CT Identification of Bronchopulmonary Segments,” AJR 142:47-52 (1984)), who reported that 70% of segmental bronchi were visible. They also used a 10-mm section thickness; one would therefore expect that in the present system more bronchi could be expected to be visible due to use of 3-mm-thick sections. The requirement that a bronchus be not only visible but also measurable in the above-described setup is more stringent than their requirements, and so the percentage could be expected to be reduced. The main factors that reduced the visibility of bronchi at VB were use of a distance parameter that was too small during segmentation, the presence of bronchi with lumen attenuation substantially higher than that of air (because of partial-volume effect, noise, or intraluminal filling defect), the presence of bronchi that were obliterated by stricture, and a decrease in the attenuation of the bronchial wall (caused by partial-volume effect and motion artifact as a result of respiratory or cardiac motion). These factors help explain the slightly lower percentage of bronchi measurable at VB compared with at CT. The bronchi that were most difficult to visualize were the lingular segmental bronchi. This finding is in agreement with other reported research. If the requirement to visualize bronchi were relaxed so that only trachea and bronchi to the second order would be rendered, the number of measurable bronchi would increase to 100% at CT and 94% at VB. It is likely that this is a more clinically relevant criterion.

[0103] It is difficult to accurately measure lesion width or length through the fiberoptic bronchoscope because of magnification problems, although in principle these magnification problems can be corrected. The technique described above makes such measurements easy once the 3D model has been generated.

[0104] Another approach to generating VB displays is to use so-called robot path-planning techniques. In this method, the initial and final locations of a one-way bronchoscopic trip through the airway are designated. Distances from a starting voxel to each voxel in the lumen are computed, and a path of steepest descent is determined. The path of the fly through is computed, and VB is rendered off line. The resulting static images are combined into a movie, which can be run forward or backward. In principle, this technique can be used to generate VB of the entire airway by planning paths through each bronchus. One drawback to this technique is that the digital movie files can be very large, on the order of hundreds or thousands of megabytes. The present arrangement, in contrast, generates files on the order of 5 Mbyte. Perhaps a more serious problem is that the advantage of real-time interactivity is lost. With real-time interactivity, lesions can be quickly viewed from a variety of perspectives, and these perspectives can be matched with those obtained at actual fiberoptic bronchoscopy. Also, it is difficult to generate the global view of the airways when a robot path-planning technique is used because a clear view of the entire bronchial system is not generated.

[0105] Threshold-based segmentation schemes, such as used in the illustrative embodiment, have known limitations, including sensitivity to partial-volume effects and to the choice of reconstruction algorithm and threshold settings. The imaging parameters (section thickness, pitch, milliampere-second settings) may also need to be optimized. For example, the resolution along the z axis could be improved by reducing the helical pitch to 1:1, although this normally would result in decreased anatomic coverage per breath hold with current scanner technology.

[0106] In the illustrative embodiment, different threshold settings were used for the multiplanar reconstructions and 3D models. Different settings were used to retain detail in reconstruction of the bronchial wall; this detail might be lost with use of a larger window width setting. The use of different threshold settings may account for the slight overestimation of lumen diameter and cross-sectional area at VB compared with at CT. Further optimization of threshold settings will be necessary to optimize the use of VB for distance measurements.

[0107] The 3D models we produces were stored in a standard file format called Open Inventor (Silicon Graphics). Recently, a specification for a file format has been developed for virtual reality distributable over the Internet and based on Open Inventor and is called the Virtual Reality Modeling Language, or VRML. Open Inventor models are readily converted to the format of Virtual Reality Modeling Language. The practical consequence of this development is that VB models can be viewed on any computer connected to the Internet by using publicly available browser software. The real-time display, however, still necessitates use of special graphics hardware.

[0108] The methods detailed in this disclosure are general and are applicable to any structure, and are particularly well suited to segmentation of complex branching structures (e.g. the vasculature, biliary tree, and intrarenal collecting system). The segmentation method is not limited to human anatomical structures, but instead, also applies to other hollow structures including mechanical devices such as pipes, and other biological structures such as plants.

[0109] Rendering speeds of graphics hardware are expected to continue to increase rapidly, as has been the case in the past. Improvements in segmentation software are also expected and should reduce the amount of intervention necessary by trained operators to produce the 3D models. Routine performance of VB for enhanced analysis of endobronchial disease, cavitary lung disease, and bronchiectasis will then become a practical reality.

[0110] Additional information on the foregoing technique, including photographs, can be found in Summers et al, “Virtual Bronchoscopy: Segmentation Method for Real-Time Display,” Radiology, 200:857-862 (1996).

[0111] Computer-Aided Guides

[0112] As noted above, it is possible to interactively navigate a three-dimensional reconstruction of the bronchial tree to effect a virtual bronchoscopy (VB). Further computer processing of the image data allows compilation of a guide that serves to aid, or direct, a physician in his review of the bronchial tree. (Manually evaluating the entire bronchogram is time consuming and lesions may be missed due to fatigue.)

[0113] This guide recognizes polypoid airway lesions by segmenting the bronchial surface based on particular curvature classifications. Our implementation of this guide employs locally invariant quantities called the first and second fundamental forms. These first and second forms are functions of the partial derivatives of a parameterized surface and of a surface displacement vector. Some implementations may also make use of additional local surface descriptors including the tangent plane, the unit normal, and the normal curvature. The following discussion further details the preferred forms of mathematical analysis.

[0114] The “normal curvature represents” the curvature at a point p on a surface. It is defined to be the ratio of the second and first fundamental forms and varies as a function of the direction of the surface displacement vector. The extrema of the normal curvature at point p as a function of direction are termed the minimum (κ_m) and maximum (κ_M) “principle curvatures” and are oriented in the “principle directions.” Additional useful quantities are the “mean curvature” H=(κ_m+κ_M)/²and “Gaussian curvature” K=κ_mκ_M. These latter quantities are invariant to arbitrary transformations of the parameterization and invariant to arbitrary rotations and translations. These curvature quantities are also viewpoint independent, another important feature.

[0115] The mean and Gaussian curvatures can be computed from the following equations, which are functions of the vector S describing the surface and its partial derivatives.

[0116] A={overscore (Q)}·{overscore (S_uu+L )}

[0117] B={overscore (Q)}·{overscore (S_uv+L )}

[0118] C={overscore (Q)}·{overscore (S_vv+L )}

[0119] {overscore (Q)}={overscore (S_u+L )}×{overscore (S

[0120]

H = \frac{A | \overline{S_{v}} |^{2} - 2 {BS}_{u} \cdot S_{v} + C | \overline{S_{u}} |^{2}}{2 | \overline{Q} |^{3}}

K = \frac{AC - B^{2}}{| \overline{Q} |^{4}}

[0121] where the subscript notation indicates partial differentiation, e.g.

\overline{S_{u}} (u, v) = \frac{\partial \overline{S}}{\partial u}

[0122] The vector Q is parallel to the surface normal. The principle curvatures can then be computed from

[0123] b={square root over (H

[0124] and κ_m=H−b, and κ_M=H+b.

[0125] These curvatures are important because they can be used to classify surface shape. Based on the sign of K, κ_mand κ_M, the surface can be classified locally into 3 major shapes: elliptical, hyperbolic, or cylindrical, as shown in Table 3.

TABLE 3

Class	Shape	H	K	K

Elliptical	Peak, Pit	<0, >0	same sign	>0
Hyperbolic	Saddle Point	varies	opposite sign	<0
Cylindrical	Ridge, Valley,	<0, >0, 0	one or both zero	0
	Plane

[0126] FIG. 7 shows different types of surface curvatures. FIG. 7A shows elliptical curvature of the pit type; FIG. 7B shows elliptical curvature of the peak type; FIG. 7C shows hyperbolic curvature (saddle point); FIG. 7D shows cylindrical curvature of the valley type; and FIG. 7E shows cylindrical curvature of the ridge type.

[0127] Normal (lesion-free) bronchial walls can be characterized by surfaces of hyperbolic and cylindrical shape, or of elliptical shape of the pit variety. Polypoid lesions which are of interest to the clinician are of elliptical curvature of the peak subtype. For example, a spherical polypoid lesion of radius r has elliptical curvature of the peak type and its mean and principle curvatures are identical: 1/r (neglecting the lesion edge, which may have higher curvature where it meets the bronchial wall). A spherical crater or ulceration of radius r has elliptical curvature of the pit type and its mean and principle curvatures are −1/r. The Gaussian curvature of both lesions is the same: 1/r².

[0128] In our implementation that uses patch fitting to analyze curvature, it is sometimes necessary to smooth the surface model before beginning curvature analysis. For example, when the surface model is generated from the segmented structure as described above, a smoothing routine smooths the surface using 50 iterations of the smoothing algorithm of Taubin (SIGGRAPH, ACM, pp. 351-348 (1995)). Next, a biparametric fourth order b-spline patch is fit to local neighborhoods of radius 5 mm. The first and second order partial derivatives of the fitted patch are then computed. The vertex is then classified according to the scheme of Table 3. Vertices in regions of hyperbolic and cylindrical curvature are discarded. Only vertices in regions of elliptical curvature with positive mean curvature above a threshold (ε) are retained. This process is repeated for each vertex on the surface.

[0129] The processed vertices are filtered to discard isolated ones or those comprising lesions smaller than a specified minimum size arbitrarily chosen to be 30 vertices (approx. 5 mm diameter). Lesions are then defined as a cluster of connected vertices sharing the desired curvature classification and exceeding the minimum size. Vertex connectivity is determined using a region growing process which begins with those local neighbors which form a triangle and proceeds recursively enlarged until it runs out of neighbors with the appropriate curvature classification. Lesion sites identified by the foregoing method can be noted in a virtual guide (e.g. a software construct with an entry for each potential lesion, noting its location and optionally other data, such as curvature parameters, size, etc.).

[0130] As an alternative to finding curvature characteristics using a parametric patch, the surface curvature of anatomical model can also be analyzed by applying a 3D filter to neighboring voxels of points on the surface. In this alternative approach, a 3D filter is used to compute partial derivatives at selected points on the surface, such as vertices in the tessellated surface model. The partial derivatives of the surface are then used to compute the curvature characteristics at each vertex. In particular, the partial derivatives are used to compute the minimum and maximum principal curvatures, the mean curvature, and the Gaussian curvature as described above.

[0131] In the literature, the 3D filters are sometimes referred to as Deriche filters. The expressions for the partial derivatives with respect to the spatial coordinate, x, are set forth below:

[0132] 𝑓₀(x)=c₀(1+α|x|)e^−α|x|(smoothing operator);

[0133] 𝑓₁(x)=i c₁xα²e^−α|x|(first derivative operator);

[0134] 𝑓₂(x)=c₂(1−c₃α|x|)e^−α|x|(second derivative operator)

[0135] The coefficients, c₁, c₂and c₃, are normalization coefficients, which are chosen to ensure that convolution by the filters 𝑓₀, 𝑓₁and 𝑓₂yield the proper derivatives. The value of a controls the degree of smoothing.

[0136] These functions can be used as convolution filters on a discrete 3D data set such as a voxel array to compute smoothed zero, first and second derivatives. See O. Monga and S. Benayoun, “Using Partial Derivatives of 3D Images to Extract Typical Surface Features,” Comput Vision Image Understand61, pp. 171-189, 1995 and J.-P. Thirion and A. Gourdon, “Computing the Differential Characteristics of Isointensity Surfaces,” Comput Vision Image Understand61, pp. 190-202, 1995.

[0137] Given a 3D data set in the form I(x, y, z), the following expressions represent separable filters that compute smoothed partial derivatives at the surface of a 3D structure by convolving the 3D filter with the discrete voxel data at vertex coordinates (x, y, z).

[0138] I=(𝑓₁(x)𝑓₀(y)𝑓₀(z))*I,

[0139] Ixx=(𝑓₂(x)𝑓₀(y)𝑓₀(z))*I,

[0140] Ixy=(𝑓₁(x)𝑓₁(y)𝑓₀(z))*I,

[0141] Ixyz=(𝑓₁(x)𝑓₁(y)𝑓₁(z))*I,

[0142] Ixxz=(𝑓₂(x)𝑓₀(y)𝑓₁(z))*I,

[0143] Ixxx=(η₃(x)𝑓₀(y)𝑓₀(z))*I

[0144] As above, the subscript notation represents the partial derivative with respect to a spatial coordinate, e.g., x, y, and z. The asterisk “*” represents the convolution operator.

[0145] An implementation of the 3D filtering approach designed to detect lesions on the surface of an airway (e.g., bronchi or trachea) computes partial derivatives from the grey-scale voxel data at vertices of the airway surface. The segmentation method described above first computes the voxel data that forms the anatomical structure of interest. An isosurface representing the airway wall then acts as a guide to determine where to apply the 3D filter. In the implementation, the isosurface method detailed above computes the tessellated surface model, comprising a mesh of vertices. Note however that 3D filtering may also be used to compute the location of the surface in the segmented voxel data as well.

[0146] For selected points on the surface of the model (e.g., the vertices in the surface model), the 3D filtering method applies the 3D filters to compute the first and second order partial derivatives of the surface coordinates. The 3D filtering method begins by forming the filters to compute the partial derivatives according to the expressions listed above. The filters then sample voxels in a predetermined neighborhood around each vertex to compute the partial derivatives.

[0147] In the implementation used in our experiments, for example, the size of the 3D filters was set to approximately 5×5×5 mm³with an adjustment made for the anisotropy of the 3D dataset. For example, a kernel of size 11×11×11 voxels actually used an 11×11 voxel component in the plane of section (0.5 mm in-plane voxel size) but along the longitudinal direction (1 mm section thickness) the kernel was only 5 voxels thick. The normalization coefficients of these filters were computed using discrete sums performed over the size of the kernel. The implementation applied the separable filters to the image I(x, y, z) using convolutions to compute smoothed partial derivatives. These partial derivatives were used to compute the Gaussian (K), mean (H), and principal curvatures (K_MIN, K_MAX) at each vertex on the isosurface. The curvature values were used to colorize the surface based on various selection criteria (type of curvature, range of values, connectivity of neighboring vertices of like curvature classification).

[0148] In experiments comparing both the patch-fitting and 3D filtering methods, the filtering method was more computationally efficient. The type of curvature characteristic used to detect lesions was significant in this comparison. For example, using the mean curvature (H) with the 3D filtering method, there were two to three times as many lesion detections for a curvature threshold of −1 and −2 compared to processing which used the maximum curvature as the curvature characteristic to classify lesions. The 3D filtering method produced more visually appealing color-encoded surfaces because potential lesions were painted more homogenously.

[0149] In general, the 3D filtering method tends to have a more efficient implementation because it can combine isosurface generation, smoothing, and lesion detection in one step, whereas the patch fitting method involves a series of steps. The 3D filtering approach has other potential advantages in that it performs better for highly curved surfaces that are difficult to fit with a parametric patch. Since the 3D filtering method does not need a smoothing routine as a pre-processing step, it operates on a model that is closer to the actual data. Characteristics of both approaches are compared and contrasted in Table 4 below.

TABLE 4

		Parameters
Parameter	Possible Choices	Used

Curvature Type	Gaussian (K), Mean (H), Principal	K, K
	(K

Secondary and Derived curvatures		N/A

Filter settings	Arbitrary	Upper limit:
for desirable		0, −1, or
curvature values		−2 cm
		Lower limit:
		−20 cm
Kernel size+	Arbitrary	7 × 7 × 9,
		9 × 9 × 9,
		11 × 11 × 11
		voxels(˜3, 4,
		5 mm in
		each direc-
		tion, respec-
		tively.)
Connected	Arbitrary	30 vertices
component size		(˜3 mm
(minimum		diameter)
region size
having
homogeneous
curvature
classification)
Patch size*	Arbitrary	5 mm

[0150] FIG. 8 is a flow diagram illustrating an overview of the lesion detection processes described above. Starting with a set of voxels, the process computes an isosurface of the anatomical structure depicted in the voxel data as shown in step 810. The isosurface represents the surface of an anatomical structure where lesion detection is to take place. Optionally, the surface is smoothed as shown in step 812. As noted, the smoothing process is usually only needed for complex models where the patch-fitting method is used to compute partial derivatives of the surface. As noted, the isosurface generation and smoothing steps may be combined with the lesion detection process.

[0151] As shown in steps 814-824, the lesion detection process traverses the isosurface, visiting vertices and computing partial derivatives at these vertices (816). In the patch fitting approach, the partial derivatives are computed from the patch fitted to the surface located at the vertex. In the 3D filtering approach, the partial derivatives are computed by convolving the filter over the discrete voxel data at neighboring voxels.

[0152] As shown in step 818, the lesion detection process computes the curvature characteristics, such as the Gaussian, mean and minimum and maximum principal curvatures from the partial derivatives of the surface at the vertex. In step 820, the process compares these characteristics with predetermined characteristics associated with surface anomalies of interest, and classifies a vertex as to whether or not it is located on a lesion in step 822. The process iterates on vertices in the isosurface, and then, proceeds to a post-processing phase.

[0153] Post-processing functions optionally include refining lesion classification based on curvature characteristics, colorizing the surface of lesions, and computing camera positions as a navigational guide for rendering the surface into 2D images. As reflected in step 826, post processing is preferably targeted toward potential lesion sites on the surface. To further refine lesion detection and reduce false positives, the post-processor filters the vertices to remove lesions below a predetermined size (e.g., having a number of vertices below a predetermined number). The vertex connectivity method of step 828 refers to the region growing process described above that segments neighborhoods of connected vertices sharing a predetermined curvature characteristic.

[0154] To visually flag an identified lesion, the process colorizes the vertices associated with an identified lesion. Note, this step may also be combined with the classification step 822 such that vertices are assigned color values when they have a predetermined curvature characteristic.

[0155] Steps 832-836 are additional steps used to assist viewing of the lesions in an interactive rendering process performed on the surface model. In step 832, the process computes a lesion position, for example, by computing the centroid of a cluster of vertices classified as a lesion. In step 834, the process computes a camera position and direction, for example, by averaging the surface normals of the vertices in the cluster and placing the camera at a selected distance from the lesion within the airway. Note that positioning the camera should take into account the surrounding surface structure to ensure that the lesion is not occluded by another structure in a later 2D image rendering. Each of the lesions are recorded in a navigational guide comprising a list of 3D scenes for rendering to 2D images. This list includes the camera position and direction, and possibly other scene parameters for each lesion such as the type of projection, the image resolution, etc. Finally, step 838 represents the graphics rendering process that creates two-dimensional image renderings of the surface model at the pre-computed camera positions.

[0156] VB surface renderings are generated using software written in C++ using the OpenInventor 3-D modeling application programming interface (Silicon Graphics, Mountain View, Calif.). The surfaces are displayed and manipulated on a Silicon Graphics Indigo Maximum Impact workstation with 320MB memory and 195 MHZ R 10000 CPU. A block diagram of a suitable computer system is shown in FIG. 9 (only illustrative ones of the applications programs are listed).

[0157] In implementations of both the patch fitting and 3D filtering methods, potential lesions are painted red to distinguish them from the background anatomy, which is colored a fleshy tone. The reviewing physician can then tour the 3D model by use of a joystick control in conjunction with fly-through software, identifying the potential lesion sites from their color and inspecting them as they are encountered.

[0158] As noted, this random virtual exploration of the anatomical structure can be informative, but may not make best use of the physician's time. Accordingly, in an alternative implementation, navigational software directs a guided tour of the structure, repositioning the viewpoint successively to each lesion listed in the guide. (The repositioning can be stepwise—one lesion to the next, or can proceed by a visualized fly-through to successive sites.)

[0159] In the implementation, the position of the visualization software viewpoint is aimed using a three step process. First, the centroid of the lesion is determined using the coordinates of each vertex that comprises the lesion. Second, the normal to the lesion is determined by averaging the normals of all the vertices which comprise the lesion. Third, the camera viewpoint is moved 1 cm away from the centroid along the averaged normal, and set to point toward the centroid. This procedure places the viewpoint inside the bronchial lumen pointing toward the lesion. Once the viewpoint has been so located, the physician can use the joystick to manipulate the viewpoint as desired, to view the site from different angles and distances. After the physician has taken whatever note of the lesion is merited, the software proceeds to display the next lesion listed in the guide.

[0160] By this viewpoint positioning procedure, apparent lesions at sites of segmentation leakage can often be identified and discarded since the resulting view is recognized as not being within a bronchial passage.

[0161] In an additional feature, segmentation leakage is identified by pattern recognition techniques, as reviewed in the Background discussion. As there noted, deletion of leakage in reliance on automatic techniques is disfavored in medicine due to the possible deletion of clinically significant features. But here, the leakage is not deleted. Rather, it is flagged to the reviewing physician. For example, lesions in areas of possible leakage can be falsely colored to provide a visual cue to the physician of the likely leakage context. Alternatively, a tabular listing of the detected lesions (e.g. a printout of the guide) can be marked to indicate those lesions that are found in areas of likely leakage.

[0162] Some physicians, of course, will prefer to manually identify areas of segmentation leakage by cross-referencing the lesion location to the orthogonal two-dimensional source images (axial, coronal and sagittal) and eliminate those that are not within a bronchus.

[0163] Both the curve fitting and 3D filtering methods were tested on elemental surfaces (sphere and torus), an airway phantom fitted with simulated lesions, cadaver lung specimens, and patient airway studies. The phantom, cadaver, and patient studies were each done at a number of different thresholds for mean curvatures (ε≧0, ε≧1, ε≧2 cm⁻¹).

[0164] Tessellated surfaces representing a sphere and a torus were generated by taking isosurfaces of the corresponding implicit functions. The surface normals were set to point outward. A sphere has constant elliptical curvature, and its minimum and maximum principle curvatures an equal everywhere on its surface. A torus is a useful surface because it has curvature on all three types: elliptical curvature along its outer margin, hyperbolic curvature on the inside (the hole in the torus), and cylindrical curvature at the junction between the two

[0165] A latex airway phantom was fitted with spherical simulated lesions consisting of plastic beads ranging in size from 3 to 10 mm. The phantom was scanned with a High-Speed Advantage helical CT scanner (General Electric Medical Systems, Milwaukee, Wis.) using 3 mm collimation, pitch 2, and section index 1 mm. A surface-rendered virtual bronchoscopy was produced from the CT images using the region-growing and threshold based segmentation method detailed earlier.

[0166] Intact human whole lung specimens were obtained from autopsies. Whole lung specimens included the central airways. Specimens were scanned helically on the CT scanner within 3 hours of autopsy using 3 mm collimation, pitch 1, and section index 1 or 1.5 mm.

[0167] Virtual bronchoscopy of patients was done using helical CT scans of the chest obtained with 3 mm collimation, pitch 2, and section index 1 mm. Eighteen studies from 16 patients were obtained. In one study, scanning began at the level of the mainstem carina. The patients were a mixture of those having known or suspected airway disease and those with lung cavities who were not suspected of having airway disease. Patients in the first category included four patients with Wegener's granulomatosis, and three with endobronchial masses due to neoplasm (lymphoma, melanoma) or infection (aspergilloma). One patient with Wegener's was scanned three times. Patients in the second category included nine with cavitary lung disease (five with Job's syndrome, one with Mycobacterium avium intracellulare infection, one with multiple drug resistant tuberculosis, one with chronic granulomatous disease, one with echinoccus). The mean patient age was 35±11 years (range: 14 to 59). There were 9 male and 7 female patients.

[0168] The gold standard for lesion detection for cadaver specimens was the histopathologic analysis. The gold standard for lesion detection for the VB studies was the two-dimensional source CT images. True lesion sites determined by analyzing the CT scans and lesion detections determined automatically by the software were recorded on an anatomical drawings of the airway for each specimen and patient study. True lesion size was measured from the CT images using calipers. Lesion sites and sizes on the CT scans were determined by a single radiologist experienced with chest CT and VB.

[0169] Sensitivity (from the true positives and false negatives) was computed both on the basis of lesions and bronchial segments. Specificity (from the true positives and false negatives) was computed both on the basis of lesions and bronchial segments. Specificity (from the true negatives and false positives) was computed on the basis of bronchial segments. The bronchial segment method was devised to determine specificity because if lesion sites were used there are a potential infinity of true negative lesion sites yielding a specificity of 1. Five bronchial segments were defined: the trachea, left and right mainstem bronchi, and left and right lobar/segmental bronchi. The data were further subdivided to analyze lesions <5 mm and those ≧5 mm. Sensitivity and specificity for this segment data as a function of lesion size and mean curvature threshold (ε) were plotted as a receiver-operating characteristic (ROC) curve. The effect of changes in ε can be understood by reference to the spherical polyp analogy. For ε=0, all lesions are detected. For greater ε, progressively more highly curved (smaller) lesions are detected and more gently curved larger ones are excluded. In practice, more gently curved areas (small ε) tend to represent minor undulations in the bronchial wall rather than true lesions.

[0170] Results

[0171] The curvature of the sphere and torus were correctly classified by both methods. The computer mean curvature for the sphere was 1.96±0.03 cm⁻¹and for the outer edge of the torus was 0.10±0.01 cm⁻¹, which agree closely with the expected values (2.0 and 0.10 cm⁻¹, respectively). The junction between elliptical and cylindrical curvature on the torus was somewhat irregular. This was due to slight variations in the orientation and size of the biparametric spline patches and to a finite number of vertices in these areas of low curvature.

[0172] The airway phantom experiment, the curve fitting method correctly detected 10 of 10 lesions 5 mm in size or greater (sensitivity 100%). Of 5 lesions less than 5 mm, none were detected (sensitivity 0%).

[0173] In the five lung cadaver specimens having no endobroncial lesions, there were three false positive lesion sites, all in the same specimen. Six lesion sites in areas of segmentation leakage were easily discarded.

[0174] There were 31 known lesions on the VB patient studies. After discarding 40, 23, and 11 detections at sites of segmentation leakage, the curve-fitting method correctly detected 27, 26, and 19 of these lesions for εof 0, 1, and 2 cm⁻¹, yielding sensitivities of 87, 84, and 61%, respectively. There were 76, 36, and 10 false positive lesions sites, respectively. On the basis of bronchial segments, specificity ranged from 63 to 89% and sensitivity from 56 to 94%. Sensitivity and specificity were greater for larger lesions as expected.

[0175] The most frequent causes of false positive detections were a posterior indentation of the proximal trachea by the esophagus (8 of 89 segments) and an irregular bronchial wall (7 of 89 segments). Other less frequent causes were artifacts from breathing and beam hardening from vascular clips, vascular impressions, and bronchial webs (each<four segments).

[0176] Discussion

[0177] The sensitivity and specificity of the curve-fitting method are greater for lesions greater than 5 mm in size and are dependent on the choice of the threshold parameter ε. There is a trade-off: a greater εyields fewer false positives at the expense of some true positives, and vice versa. The sensitivity and specificity are quite high and it may be possible to improve them with further optimization.

[0178] False positive sites occur in regions of segmentation leakage. The above-described technique for constraining leakage reduces the number of such false positive sites, but some still persist.

[0179] The smallest lesions in the airway phantom were not detected, yet lesions of similar size in the patient studies were detected. The reason for this discrepancy is that high curvature regions were poorly fit by the spline algorithm. The small simulated lesions in the airway phantom had uniformly high curvature values (because they are spherical). True lesions are not spherical and their curvature spans a range of values which are more readily detected by our algorithm.

[0180] In the experiments, the curve-fitting method makes the assumption that pathologic structures have elliptical curvature of the peak type. It is of interest to speculate on whether this assumption is generally valid. In order to do so, a geometrical anatomical (“geoanatomical”) argument is made. The airways consist of branching tubular structures which in humans bifurcate at variable intervals. More proximal airways contain cartilage in their walls which ripple the wall like an accordion. More distal airways do not contain cartilage but are below the resolution of current CT scanners. Each generation of bronchi are progressively smaller in caliber, and individual bronchi tend to taper. Based on these characteristics, normal bronchi consist of surfaces of cylindrical curvature, and the crotch at bifurcations are saddle points of hyperbolic curvature since they are junctions of two intersection tubular bronchi. Therefore, elliptical surfaces of peak type are uncharacteristic of normal airway.

[0181] A geometric taxonomy of other tubular hollow anatomic structures yields similar generalizations and indicates that the same method may be generally applicable. For example, blood vessels are also tubular branching structures but without rippling striations. Atherosclerotic plaque may modify curvature in this situation. A distended colon is a series of concave-walled chambers of elliptical curvature of the pit type (as seen from the lumen) interspersed with haustral folds which are saddle points of hyperbolic curvature. Colonic polyp, precursor malignant lesions, may be plaque-like or may extend into the lumen, in which case their abnormal curvature may be detected. Thus, the curvature analysis methods described above can be used in a variety of applications to identify anomalies. These methods are not limited to anatomical structures, but instead, also apply to detecting surface anomalies on mechanical structures such as pipes and biological structures such as plants.

[0182] Another method of lesion detection from virtual endoscopy has been proposed by Vining et al. in an abstract (“Technical Improvements in Virtual Colonoscopy,” Radiology 201(P) 424-25 (1996)). In this method, abnormal thickness of the bronchial or colonic wall is used to detect malignancy. As in the foregoing method, Vining's method is prone to a high rate of false positive lesion sites because the outer wall of the tubular structure needs to be detected but is easily misidentified. Detection of the outer edge of the wall is routinely difficult because juxtaposed structures of similar CT attenuation are common in the mediastinum and abdomen and promote overestimation of wall thickness. In addition, colonic wall thickness varies with degree of distention.

[0183] As noted, there is a relatively high rate of false positive lesion detections using the above-described techniques. Unfortunately, a high rate of false positives may be intrinsic to any scheme of automatic detection. Computer-assisted diagnosis is an inherently difficult problem due to the heterogeneity of possible pathology affecting various organs and the variable appearance of normal anatomy. With this in mind, the foregoing method does well with a manageable number of false positive lesion sites per patient and a high sensitivity.

[0184] Additional information on the foregoing techniques can be found in Summers et al, “Virtual Bronchoscopy of Endobronchial Lesions: Computer-Assisted Detection of Polypoid Lesions Using Surface Curvature,” Proc. Int'l Conf on Mathematical Models and Methods in the Health Sciences, May, 1997.

[0185] Additional information relating to the subject matter of this invention, and different contexts in which the improvements discussed above can be employed, can be found in U.S. Pat. Nos. 559,847, 5,345,490, 5,291,402, 5,187,658, 5,166,876, 5,113,357, 4,989,142, 4,985,834, 4,984,157, 4,953,087, 4,914,589, 4,905,1484,903,202, 4,879,668, 4,868,748, 4,831,528, 4,821,213, 4,821,210, 4,791,567, 4,751,643, 4,729,098, 4,719,585, 4,710,876, to General Electric, the disclosures of which are incorporated by reference herein.

[0186] Operating Environment

[0187] FIG. 9 illustrates an example of a computer workstation that serves as an operating environment for the invention. The computer system includes a workstation 920, including a processing unit 921, a system memory 922, and a system bus 923 that interconnects various system components including the system memory to the processing unit 921.

[0188] The system bus may comprise any of several types of bus structures including a memory bus or memory controller, a peripheral bus, and a local bus using a bus architecture such as PCI, VESA, Microchannel (MCA), ISA and EISA, to name a few.

[0189] The system memory includes read only memory (ROM) 924 and random access memory (RAM) 925. A basic input/output system 926 (BIOS), containing the basic routines that help to transfer information between elements within the personal computer 920, such as during start-up, is stored in ROM 924.

[0190] The workstation 920 further includes a hard disk drive 927, and another disk drive such as a magnetic disk drive 928, e.g., to read from or write to a removable disk 929, or an optical disk drive, e.g., for reading a CD-ROM disk or to read from or write to other optical media. The hard disk drive 927, and additional disk drive 928 are connected to the system bus 923 by a drive interface. The drives and their associated computer-readable media provide nonvolatile storage of data, data structures, computer-executable instructions (program code such as dynamic link libraries, and executable files), etc. for the workstation 920.

[0191] Although the description of computer-readable media above refers to a hard disk, a removable magnetic disk and a CD, it can also include other types of media that are readable by a computer, such as magnetic cassettes, flash memory cards, digital video disks, Bernoulli cartridges, and the like.

[0192] A number of program modules may be stored in the drives and RAM 925, including an operating system 935, one or more application programs 936, other program modules 937-940, and program data 938. For example, the program modules may include a segmentation program 937, a 3D graphics rendering program 938, a curve analysis program 939, and a navigational fly-through program 940 that operates in conjunction with the renderer 938 to position the camera interactively using the pre-computed camera positions for lesions in the navigational guide 942.

[0193] A user may enter commands and information into the workstation 920 through a keyboard 943 and pointing device, such as a mouse 944 and joystick 945. These and other input devices are often connected to the processing unit 921 through a serial port interface 946 that is coupled to the system bus, but may be connected by other interfaces, such as a parallel port, game port or a universal serial bus (USB).

[0194] One or more monitors 947a-cor other types of display devices are also connected to the system bus 923 via an interface, such as a video adapter 948a-c. Graphics workstations typically include graphics acceleration hardware to off-load graphics rendering tasks from the processing unit 921. Such hardware is typically implemented in a video adapter or in a separate peripheral connected to the bus 923.

CONCLUSION

[0195] Having described and illustrated the features of our invention, it will be apparent that the embodiments shown can be modified in arrangement and detail without departing from the principles of the invention.

[0196] The variant features described above and in the cited patents can each be combined with each other in numerous ways, depending on the application to be served. For brevity's sake, however, such permutations and combinations are not each individually detailed herein. We claim all that falls within the spirit and scope of the following claims.

Claims

Certificate of Correction present

The claims shown below may not include correction changes. Use the corrected PDF for authoritative text.

We claim:

1. A computer assisted method for detecting surface anomalies in a three-dimensional surface model representing a three-dimensional structure, the method comprising:

fitting a parametric patch to a local neighborhood around a vertex in the surface model;

computing a curvature characteristic of the fitted patch in the local neighborhood around the vertex;

classifying curvature of a cluster of connected vertices by comparing the computed curvature characteristic to a predetermined curvature classification; and

defining a surface anomaly as a cluster of connected vertices having a predetermined curvature classification.

2. The method of claim 1 wherein the three-dimensional structure is an anatomical structure.

3. The method of claim 1 wherein the parametric patch comprises an nth order parametric patch where n is greater than or equal to three.

4. The method of claim 3 wherein the parametric patch comprises a b-spline patch.

5. The method of claim 1 further including:

segmenting a region of the surface model by evaluating neighboring vertices of the vertex, and combining together a cluster of neighboring vertices that satisfy a predetermined curvature classification.

6. The method of claim 1 further including:

finding partial derivatives of the parametric patch at a vertex, deriving principal curvatures at the vertex, classifying curvature at the vertex as one of a predetermined curvature type based on the principal curvatures, and determining whether the curvature matches a known curvature characteristic of a surface anomaly to evaluate whether a surface anomaly exists at the vertex.

7. The method of claim 1 further including:

starting from a point in a three-dimensional data set derived from a scan of the structure, growing a region in the structure by modifying coordinates of a voxel in the region to find a next generation voxel, examining a characteristic of the next generation voxel, and adding the next generation voxel to the region when the characteristic of the voxel is within a threshold;

growing the region with successive generations of voxels along a path in the three-dimensional data set using a path length limit to limit the number of generations of voxel growth from the starting point;

creating the 3D surface model approximating points on a surface of the structure from the voxels identified as being part of the region; and

rendering the 3D surface model from a camera position directed at the surface anomaly to create a two-dimensional image representing the structure and the surface anomaly.

8. The method of claim 1 further including:

traversing the surface model to identify surface anomalies that have a predetermined curvature; and

flagging the surface anomalies to enable a user to view each of surface anomalies selectively as 2D image renderings of the surface model from camera positions directed at the surface anomalies.

9. A computer readable medium having instructions for performing the steps of claim 1.

10. A method for viewing 2D image renderings of a 3D surface model representing a surface of a three-dimensional structure, the method including:

identifying surface anomalies on the surface by identifying regions of the surface that have a predetermined curvature:

for each surface anomaly, computing representative coordinates approximating a location of the surface anomaly in the surface model, and computing a camera position for viewing the anomaly by aligning the camera position in a direction toward the representative coordinates and located at predetermined distance from the representative coordinates; and

in a 3D graphics rendering process used to view 2D image renderings of the surface model from selected camera positions, using the camera positions computed for each surface anomaly to enable a user to view selectively 2D image renderings of the 3D representation that include a rendering of the surface anomalies;

wherein the step of identifying surface anomalies includes:

fitting a parametric patch to a local neighborhood around a vertex in the surface model;

computing an extent of curvature in the local neighborhood around the vertex;

defining a surface anomaly as a cluster of connected vertices having a predetermined curvature classification.

11. A method for viewing 2D image renderings of a 3D surface model representing a surface of a three-dimensional structure, the method including:

identifying surface anomalies on the surface by identifying regions of the surface that have a predetermined curvature:

wherein the step of identifying surface anomalies includes:

fitting a parametric patch to a local neighborhood around a vertex in the surface model;

computing an extent of curvature in the local neighborhood around the vertex;

defining a surface anomaly as a cluster of connected vertices having a predetermined curvature classification.

12. A method for viewing 2D image renderings of a 3D surface model representing a surface of a three-dimensional structure, the method including:

identifying surface anomalies on the surface by identifying regions of the surface that have a predetermined curvature:

starting from a point in a three-dimensional data set produced in a scan of a real anatomical structure, growing a region in the structure by modifying coordinates of a voxel in the region to find a next generation voxel, examining a characteristic of the next generation voxel, and adding the next generation voxel to the region when the characteristic of the voxel is within a threshold; and growing the region with successive generations of voxels along a path in the three-dimensional data set using a path length limit to limit the number of generations of voxel growth from the starting point.

13. A method for viewing 2D image renderings of a 3D surface model representing a surface of a three-dimensional structure, the method including:

identifying surface anomalies on the surface by identifying regions of the surface that have a predetermined curvature:

wherein the step of identifying the surface anomalies includes:

applying a 3D filter to an array of voxels representing the structure to compute partial derivatives of the surface, where the surface model is used as a guide to determine where to apply the 3D filter in the array of voxels;

from the partial derivatives, computing curvature characteristics of the surface; and

comparing the curvature characteristics with the predetermined curvature characteristics to identify regions having the predetermined curvature characteristics.

Patent Citations (56)

Patent	Date	Inventor	Cited By
US4710876(A)	1987-12-01	Cline et al.	Applicant
US4719585(A)	1988-01-01	Cline et al.	Applicant
US4729098(A)	1988-03-01	Cline et al.	Applicant
US4751643(A)	1988-06-01	Lorensen et al.	Applicant
US4791567(A)	1988-12-01	Cline et al.	Applicant
US4821210(A)	1989-04-01	Rumbaugh	Applicant
US4821213(A)	1989-04-01	Cline et al.	Applicant
US4831528(A)	1989-05-01	Crawford et al.	Applicant
US4868748(A)	1989-09-01	Crawford et al.	Applicant
US4879668(A)	1989-11-01	Cline et al.	Applicant
US4882679(A)	1989-11-01	Tuy et al.	Applicant
US4896278(A)	1990-01-01	Grove	Applicant
US4903202(A)	1990-02-01	Crawford	Applicant
US4905148(A)	1990-02-01	Crawford	Applicant
US4914589(A)	1990-04-01	Crawford	Applicant
US4953087(A)	1990-08-01	Crawford	Applicant
US4984157(A)	1991-01-01	Cline et al.	Applicant
US4985834(A)	1991-01-01	Cline et al.	Applicant
US4989142(A)	1991-01-01	Crawford	Applicant
US4999789(A)	1991-03-01	Fiasconaro	Examiner
US5038302(A)	1991-08-01	Kaufman	Applicant
US5068788(A)	1991-11-01	Goodenough et al.	Applicant
US5113357(A)	1992-05-01	Johnson et al.	Applicant
US5133020(A)	1992-07-01	Giger et al.	Applicant
US5150427(A)	1992-09-01	Frazee et al.	Applicant
US5166876(A)	1992-11-01	Cline et al.	Applicant
US5170347(A)	1992-12-01	Tuy et al.	Applicant
US5187658(A)	1993-02-01	Cline et al.	Applicant
US5257203(A)	1993-10-01	Riley et al.	Examiner
US5268967(A)	1993-12-01	Jang et al.	Applicant
US5277182(A)	1994-01-01	Koizumi et al.	Applicant
US5289374(A)	1994-02-01	Doi et al.	Applicant
US5291402(A)	1994-03-01	Pfoh	Applicant
US5297550(A)	1994-03-01	Margosian	Applicant
US5319551(A)	1994-06-01	Sekiguchi et al.	Applicant
US5345490(A)	1994-09-01	Finnigan et al.	Applicant
US5412763(A)	1995-05-01	Knoplioch et al.	Applicant
US5425368(A)	1995-06-01	Brandt	Applicant
US5452367(A)	1995-09-01	Bick et al.	Applicant
US5489782(A)	1996-02-01	Wernikoff	Applicant
US5499322(A)	1996-03-01	Thirion et al.	Applicant
US5506785(A)	1996-04-01	Blank et al.	Applicant
US5517602(A)	1996-05-01	Natarajan	Applicant
US5531227(A)	1996-07-01	Schneider	Applicant
US5537485(A)	1996-07-01	Nishikawa et al.	Applicant
US5550376(A)	1996-08-01	Gupta et al.	Applicant
US5553207(A)	1996-09-01	Sekiguchi et al.	Applicant
US5559847(A)	1996-09-01	Hu et al.	Applicant
US5574763(A)	1996-11-01	Dehner	Applicant
US5604778(A)	1997-02-01	Polacin et al.	Applicant
US5611000(A)	1997-03-01	Szeliski et al.	Examiner
US5611025(A)	1997-03-01	Lorensen et al.	Applicant
US5627907(A)	1997-05-01	Gur et al.	Applicant
US5636338(A)	1997-06-01	Moreton	Examiner
US5782762(A)	1998-07-01	Vining	Applicant
US5920319(A)	1999-07-01	Vining et al.	Examiner

Non-Patent Literature (35)

Besl; “Surfaces in Range Image Understanding,” Springer-Verlag, New York, Chapters 3 & 4, pp. 63-160, 1988.Applicant
Rogers et al., “Mathematical Elements for Computer Graphics,” McGraw-Hill Publishing Co., New York, 2nd Ed., pp. 420-421.Applicant
Kawata et al., “Measurement of Blood Vessel Characteristics for Disease Detection Based on Cone-Beam CT Images,” Abstract, IEEE Transactions on Nuclear Science, vol. 43, No. 6, pp. 3348-3354, Part 2, Dec. 1996.Applicant
Ashton et al., “A Novel Volumetric Feature Extraction Technique, with Applications to MR Images,” IEEE, pp. 564-567, Sep. 1995.Applicant
Besl, et al., “Segmentation Through Variable-Order Surface Fitting,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 10, No. 2, pp. 167-192, Mar. 1988.Applicant
Besl, “Surface Curvature Characteristics,” Surfaces in Range Image Understanding, Springer-Verlag, New York, Inc., pp. 63-114 and 157-160, 1988.Applicant
Cai et al., “Displaying of Details in Subvoxel Accuracy,” Abstract, Journal of Computer Science and Technology, vol. 11, p. 5, Sep. 1996.Applicant
Cline et al., “Three Dimensional Segmentation of MR Images of the Head Using Probability and Connectivity,” Journal of Computer Assisted Tomography, vol. 14, No. 6, pp. 1037-1045, Nov.-Dec. 1990.Applicant
Davatzikos et al., “Using a Deformable Surface Model to Obtain a Shape Representation of the Cortex,” IEEE Transactions on Medical Imaging, vol. 15, No. 6, pp. 785-795, Dec. 1996.Applicant
Dill, “An Application of Color Graphics to the Display of Surface Curvature,” Computer Graphics, vol. 15, No. 3, pp. 153-161, Aug. 1981.Applicant
Guo et al., “A New Method for Computer Recognition of Small Rounded Pneumoconiosis Opacities in Chest X-Rays,” Eighth International Conference on Pattern Recognition, IEEE Computer Society Press, pp. 475-477, 1986.Applicant
Kawata et al., “Feature Extraction of Convex Surfaces on Blood Vessels Using Cone-Beam CT Images,” International Conference on Image Processing, IEEE, vol. 3, pp. 315-318, Sep. 1996.Applicant
Lacrosse et al., “3D Spiral CT of the Tracheobronchial Tree,” Journal of Computer Assisted Tomography, vol. 19, No. 3, pp. 347-347, May/Jun. 1995.Applicant
Lorensen et al., “The Exploration of Cross-Sectional Data with a Virtual Endoscope,” Interactive Technology and the New Health Paradigm, pp. 221-230, Jan. 1995.Applicant
Lorensen et al., “Marching Cubes: A High Resolution 3D Surface Construction Algorithm,” Computer Graphics, vol. 21, No. 4, pp. 163-169, 1987.Applicant
Mergo et al., “Three-dimensional CT of the Tracheobronchial Tree: Correlative Study with Bronchoscopy in 30 Cases,” Abstract, Scientific Sessions, p. 261.Applicant
Monga et al., “Using Partial Derivatives of 3D Images to Extract Typical Surface Features,” Computer Vision and Image Understanding, vol. 61, No. 2, pp. 171-189, Mar. 1995.Applicant
Röll et al., “Fast Generation of Leakproof Surfaces from Well-Defined Objects by a Modified Marching Cubes Algorithm,” Computer Graphics Forum, vol. 14, No. 2, pp. 127-138, 1995.Applicant
Sandor et al., “Segmentation of Brain CT Images Using the Concept of Region Growing,” Int J. Biomed. Comput., vol. 29, pp. 133-147, 1991.Applicant
Sekiguchi et al., “Interactive 3-Dimensional Segmentation Method Based on Region Growing Method,” Systems and Computers in Japan, vol. 25, No. 1, pp. 88-97, 1994.Applicant
Sonka et al., “Rule-Based Detection of Intrathoracic Airway Trees,” IEEE Transactions on Medical Imaging, vol. 15, No. 3, pp. 314-326, Jun. 1996.Applicant
Stringham et al., “Probabilistic Segmentation Using Edge Detection and Region Growing,” Visualization in Biomedical Computing 40/SPIE: 1808, pp. 40-51, 1992.Applicant
Summers et al., “CT Virtual Bronchoscopy of Simulated Endobronchial Lesions: Effect of Scanning, Reconstruction, and Display Settings and Potential Pitfalls,” AJR, vol. 170, pp. 947-950, Apr. 1998.Applicant
Summers, “Image Gallery: A Tool for Rapid Endobronchial Lesion Detection and Display Using Virtual Bronchoscopy,” Journal of Digital Imaging, vol. 11, No. 3, Suppl 1, pp. 53-55, Aug. 1998.Applicant
Summers et al., “Automatic Detection of Endobronchial Lesions with Virtual Bronchoscopy: Comparison of Two Methods,” Medical Imaging, pp. 327-335, Feb. 1998.Applicant
Summers, “Navigational Aids for Real-Time Virtual Bronchoscopy,” AJR, vol. 168, pp. 1165-1170, May 1997.Applicant
Summers et al., “Polypoid Lesions of Airways: Early Experience with Computer-assisted Detection by Using Virtual Bronchoscopy and Surface Curvature,” Radiology, vol. 208, No. 2, pp. 331-337, Aug. 1998.Applicant
Summers et al., “Virtual Bronchoscopy: Segmentation Method for Real-Time Display,” Radiology, vol. 200, No. 3, pp. 857-862, Sep. 1996.Applicant
Summers et al., “Computer-Assisted Detection of Endobronchial Lesions Using Virtual Bronchoscopy: Application of Concepts From Differential Geometry,” Abstract, May 27, 1997.Applicant
Taubin, “A Signal Processing Approach to Fair Surface Design,” Computer Graphics Proceedings, pp. 351-358, 1995.Applicant
Thirion et al., “Computing the Differential Characteristics of Isointensity Surfaces,” Computer Vision and Image Understanding, vol. 61, No. 2, pp. 190-202, Mar. 1995.Applicant
Udupa, “Interactive Segmentation and Boundary Surface Formation for 3-D Digital Images,” Computer Vision and Image Understanding, vol. 18, pp. 213-235, 1982.Applicant
Vining et al., “Virtual Bronchoscopy; Relationships of Virtual Reality Endobronchial Simulations to Actual Bronchoscopic Findings,” Chest, vol. 109, No. 2, pp. 549-552, Feb. 1996.Applicant
Wood et al., “Measurement of Three-Dimensional Lung Tree Structures by Using Computed Tomography,” American Physiological Society, vol. 0161-7567 pp. 1687-1697, 1995.Applicant
Wood et al., “A Method for Measurement of Cross Sectional Area, Segment Length, and Branching Angle of Airway Tree Structures in Situ,” Computerized Medical Imaging and Graphics, vol. 19, No. 1, pp. 145-152, 1995.Applicant

Abstract

Description

FIELD OF THE INVENTION

BACKGROUND AND SUMMARY OF THE INVENTION

[0009] This process continues, each iteration adding a shell of further voxels within the structure of interest.

[0013] Leakage can occur for many reasons, including voxel dimensions larger than the boundary thickness, noise-induced imperfections in the bounding surface image data, etc.

[0017] The leakage problem in region/volume growing algorithms has been recognized for decades, and has been dealt with in various ways.

[0026] While the foregoing boundary constraint avoids unbounded leakage, significant leakage can still occur, resulting in awkward delays in manipulation of the three-dimensional model.

[0030] By the foregoing arrangement, leakage in complex anatomical structures is controlled without human intervention, yielding models better suited for rapid three dimensional manipulation.

[0034] In both these embodiments, a second 2D map-like display can be employed to identify the position of the physician's virtual perspective within the model, so as to avoid disorientation.

BRIEF DESCRIPTION OF THE DRAWINGS

[0038] FIG. 1 is a simplified 2D voxel map of a branching structure, such as the bronchus, showing constraint of voxel leakage according to one embodiment of the present invention.

[0039] FIG. 2 is a flow diagram illustrating a region growing segmentation method that employs a path length limit to constrain voxel growth.

[0040] FIG. 3 is a voxel map showing an example of ratioed growth.

[0041] FIG. 4 is a voxel map showing another example of ratioed growth.

[0042] FIG. 5 shows how a bronchial wall can be located from CT data according to one embodiment of the present invention.

[0043] FIG. 6 shows an excerpt of a 3D model of the bronchus composed of a myriad of tiny triangles.

[0044] FIGS. 7A-7E illustrate different curved surfaces.

[0045] FIG. 8 is a flow diagram illustrating a process for detecting and viewing surface anomalies in a computer model of an anatomical structure.

[0046] FIG. 9 is a block diagram of a computer system employed in one embodiment of the present invention.

DETAILED DESCRIPTION

[0055] Generation and Display of 3D Surface-Rendered Model

[0068] In this ratioed growth context, the tortuous path limit is still keyed to total generations of growth, notwithstanding that growth does not occur in all directions during each generation.

[0076] It will be recognized that ratioed growth can be implemented in various ways; the foregoing is simply illustrative.

[0077] In addition to the tortuous growth limitation, a conventional parallelepiped constraining volume can also be employed, in case growth in the leakage volume does not follow a chaotic path.

[0084] Method of Image Analysis

[0087] Method of Statistical Analysis

[0089] Results

Differences in Measurements of Diameter and Area of Bronchal Lumen with CT and VB

TABLE 1

	Mean Difference in Maximum	Mean Different in Area
Patient No.	Diameter (mm)	(mm

1	−0.3 (0.3)	−2.3 (4.3)
2	−0.1 (0.4)	−2.2 (5.7)
3	−0.2 (0.4)	−4.3 (6.9)
4	−0.1 (0.4)	−2.9 (4.6)

Patient Information and Rendering Speeds for VB

TABLE 2

Patient No/		No. of	No. of	Frame Rate in Trachea
Age (y) Sex	Clinical Data	Triangles	Seeds	(frames per second)

1/24/M	WG	67,000	4	1.5
2/39/M	WG	51,000	4	2.0
3/35/M	WG	84,000	4	1.3
4/28/M	CGD	65,000	6	2.4
5/54/F	WG	63,000	3	1.7
6/19/F	WG	49,000	3	2.2
7/45/F	RP	47,000	3	2.0
8/67/F	LG	99,000	1	1.2
9/22/F	JS	103,000	5	0.8
10/22/F	JS	60,000	3	1.9
11/52/F	MAI	184,000	7	0.7
12/25/F	JS	199,000	8	0.8
13/37/F	MDRTB	108,000	6	1.5
14/38/F	JS	21,000	1	3.3

[0097] Discussion

[0111] Computer-Aided Guides

[0115] The mean and Gaussian curvatures can be computed from the following equations, which are functions of the vector S describing the surface and its partial derivatives.

[0116] A={overscore (Q)}·{overscore (S_uu+L )}

[0117] B={overscore (Q)}·{overscore (S_uv+L )}

[0118] C={overscore (Q)}·{overscore (S_vv+L )}

[0119] {overscore (Q)}={overscore (S_u+L )}×{overscore (S

[0120]

H = \frac{A | \overline{S_{v}} |^{2} - 2 {BS}_{u} \cdot S_{v} + C | \overline{S_{u}} |^{2}}{2 | \overline{Q} |^{3}}

K = \frac{AC - B^{2}}{| \overline{Q} |^{4}}

[0121] where the subscript notation indicates partial differentiation, e.g.

\overline{S_{u}} (u, v) = \frac{\partial \overline{S}}{\partial u}

[0122] The vector Q is parallel to the surface normal. The principle curvatures can then be computed from

[0123] b={square root over (H

[0124] and κ_m=H−b, and κ_M=H+b.

TABLE 3

Class	Shape	H	K	K

Elliptical	Peak, Pit	<0, >0	same sign	>0
Hyperbolic	Saddle Point	varies	opposite sign	<0
Cylindrical	Ridge, Valley,	<0, >0, 0	one or both zero	0
	Plane

[0131] In the literature, the 3D filters are sometimes referred to as Deriche filters. The expressions for the partial derivatives with respect to the spatial coordinate, x, are set forth below:

[0132] 𝑓₀(x)=c₀(1+α|x|)e^−α|x|(smoothing operator);

[0133] 𝑓₁(x)=i c₁xα²e^−α|x|(first derivative operator);

[0134] 𝑓₂(x)=c₂(1−c₃α|x|)e^−α|x|(second derivative operator)

[0138] I=(𝑓₁(x)𝑓₀(y)𝑓₀(z))*I,

[0139] Ixx=(𝑓₂(x)𝑓₀(y)𝑓₀(z))*I,

[0140] Ixy=(𝑓₁(x)𝑓₁(y)𝑓₀(z))*I,

[0141] Ixyz=(𝑓₁(x)𝑓₁(y)𝑓₁(z))*I,

[0142] Ixxz=(𝑓₂(x)𝑓₀(y)𝑓₁(z))*I,

[0143] Ixxx=(η₃(x)𝑓₀(y)𝑓₀(z))*I

[0144] As above, the subscript notation represents the partial derivative with respect to a spatial coordinate, e.g., x, y, and z. The asterisk “*” represents the convolution operator.

TABLE 4

		Parameters
Parameter	Possible Choices	Used

Curvature Type	Gaussian (K), Mean (H), Principal	K, K
	(K

Secondary and Derived curvatures		N/A

Filter settings	Arbitrary	Upper limit:
for desirable		0, −1, or
curvature values		−2 cm
		Lower limit:
		−20 cm
Kernel size+	Arbitrary	7 × 7 × 9,
		9 × 9 × 9,
		11 × 11 × 11
		voxels(˜3, 4,
		5 mm in
		each direc-
		tion, respec-
		tively.)
Connected	Arbitrary	30 vertices
component size		(˜3 mm
(minimum		diameter)
region size
having
homogeneous
curvature
classification)
Patch size*	Arbitrary	5 mm