The field of the disclosure relates generally to computer systems. More specifically, the disclosure relates to automatic analysis of blood vessel structures using a computer system to identify any pathologies in the blood vessels.
Chest pain is a common complaint in a hospital or clinic emergency room (ER). Evaluating and diagnosing chest pain remains an enormous challenge. The ER physician generally must quickly rule out three of the most serious and most common possible causes of the chest pain—aortic dissection (aneurysm), pulmonary embolism (PE), and myocardial infarction (coronary artery stenosis). This type of triage is known in the industry as “triple rule out.” Until recently, three different classes of diagnostic procedures have been used in the ER to diagnose the three potential possibilities. Today, 64-slice multi-detector, computed tomography systems provide visualization of all three vascular beds—the heart, the lungs, and the thoraco-abdominal aorta. Computed tomography (CT) combines the use of x-rays with computerized analysis of the images. Beams of x-rays are passed from a rotating device through an area of interest in a patient's body from several different angles to create cross-sectional images, which are assembled by computer into a three-dimensional (3-D) picture of the area being studied. 64-slice CT includes 64 rows of detectors, which enable the simultaneous scan of a larger cross sectional area. Thus, 64-slice CT provides an inclusive set of images for evaluating the three primary potential causes of the chest pain.
Existing methods for the analysis of CT image data are semi-automatic and require a radiologist to perform a series of procedures step by step. The radiologist analyzes blood vessels one by one by visually inspecting their lumen and looking for pathologies. This is a tedious, error-prone, and time consuming process. Thus, what is needed is a method and a system for automatically identifying and locating blood vessel pathologies. What is additionally needed is a method and a system for automatically quantifying a level of obstruction of a blood vessel. What is further needed is a method and a system for presenting blood vessel structures and identified pathologies.
A method and a system for automatic computerized analysis of imaging data is provided in an exemplary embodiment. Coronary tree branches of the coronary artery tree may further be labeled. The analyzed blood vessel may be traversed to determine a location and/or a size of any pathologies. A method and a system for displaying the pulmonary and coronary artery trees and/or aorta and/or pathologies detected by analyzing the image data also may be provided in another exemplary embodiment. The automatic computerized analysis of imaging studies can include any of the features described herein. Additionally, the automatic computerized analysis of imaging data can include any combination of the features described herein.
In an exemplary embodiment, a system for presenting information associated with a blood vessel to a user for assessment of the blood vessel is provided. The system includes, but is not limited to, an imaging apparatus configured to generate imaging data and a processor operably coupled to the imaging apparatus to receive the generated imaging data. The processor is configured to present a two-dimensional slice of three-dimensional imaging data of a blood vessel to a user in a first user interface; to receive a blood vessel selection from the user, wherein the user selects the blood vessel through an interaction with the first user interface; to identify a blood vessel path associated with the received blood vessel selection from the three-dimensional imaging data; and to present an intensity of the selected blood vessel along the identified blood vessel path to the user for analysis of the selected blood vessel.
In an exemplary embodiment, a device for presenting information associated with a blood vessel to a user for assessment of the blood vessel is provided. The device includes, but is not limited to, a memory, the memory capable of storing imaging data defined in three dimensions and a processor operably coupled to the memory to receive the imaging data. The processor is configured to present a two-dimensional slice of three-dimensional imaging data of a blood vessel to a user in a first user interface; to receive a blood vessel selection from the user, wherein the user selects the blood vessel through an interaction with the first user interface; to identify a blood vessel path associated with the received blood vessel selection from the three-dimensional imaging data; and to present an intensity of the selected blood vessel along the identified blood vessel path to the user for analysis of the selected blood vessel.
In another exemplary embodiment, a method of presenting information associated with a blood vessel to a user for assessment of the blood vessel is provided. A two-dimensional slice of three-dimensional imaging data of a blood vessel is presented to a user in a first user interface. A blood vessel selection is received from the user. The user selects the blood vessel through an interaction with the first user interface. A blood vessel path associated with the received blood vessel selection is identified from the three-dimensional imaging data. An intensity of the selected blood vessel along the identified blood vessel path is presented to the user for analysis of the selected blood vessel.
In yet another exemplary embodiment, computer-readable instructions are provided that, upon execution by a processor, cause the processor to implement the operations of the method.
Other principal features and advantages of the invention will become apparent to those skilled in the art upon review of the following drawings, the detailed description, and the appended claims.
Exemplary embodiments of the invention will hereafter be described with reference to the accompanying drawings, wherein like numerals will denote like elements.
a and 2b depict a flow diagram illustrating exemplary operations performed by the automated CT image processing system of
a and 5b depict a flow diagram illustrating exemplary operations performed in detecting and identifying the aorta in accordance with an exemplary embodiment.
a and 6b depict a flow diagram illustrating exemplary operations performed in identifying coronary artery vessel exit points from the aorta in accordance with an exemplary embodiment.
a and 7b depict a flow diagram illustrating exemplary operations performed in identifying coronary artery vessel tree in accordance with an exemplary embodiment.
With reference to
Display 104 presents information to a user of computing device 102 as known to those skilled in the art. For example, display 104 may be a thin film transistor display, a light emitting diode display, a liquid crystal display, or any of a variety of different displays known to those skilled in the art now or in the future.
Input interface 106 provides an interface for receiving information from the user for entry into computing device 102 as known to those skilled in the art. Input interface 106 may use various input technologies including, but not limited to, a keyboard, a pen and touch screen, a mouse, a track ball, a touch screen, a keypad, one or more buttons, etc. to allow the user to enter information into computing device 102 or to make selections presented in a user interface displayed on display 104. Input interface 106 may provide both an input and an output interface. For example, a touch screen both allows user input and presents output to the user.
Memory 108 is an electronic holding place or storage for information so that the information can be accessed by processor 110 as known to those skilled in the art. Computing device 102 may have one or more memories that use the same or a different memory technology. Memory technologies include, but are not limited to, any type of RAM, any type of ROM, any type of flash memory, etc. Computing device 102 also may have one or more drives that support the loading of a memory media such as a compact disk or digital video disk.
Processor 110 executes instructions as known to those skilled in the art. The instructions may be carried out by a special purpose computer, logic circuits, or hardware circuits. Thus, processor 110 may be implemented in hardware, firmware, software, or any combination of these methods. The term “execution” is the process of running an application or the carrying out of the operation called for by an instruction. The instructions may be written using one or more programming language, scripting language, assembly language, etc. Processor 110 executes an instruction, meaning that it performs the operations called for by that instruction. Processor 110 operably couples with display 104, with input interface 106, with memory 108, and with the communication interface to receive, to send, and to process information. Processor 110 may retrieve a set of instructions from a permanent memory device and copy the instructions in an executable form to a temporary memory device that is generally some form of RAM. Computing device 102 may include a plurality of processors that use the same or a different processing technology.
Pathology identification application 112 performs operations associated with analysis of blood vessel structures and with identification of pathologies associated with the analyzed blood vessels. Some or all of the operations and interfaces subsequently described may be embodied in pathology identification application 112. The operations may be implemented using hardware, firmware, software, or any combination of these methods. With reference to the exemplary embodiment of
Visualization application 114 performs operations associated with presentation of the blood vessel analysis and identification results to a user. Some or all of the operations and interfaces subsequently described may be embodied in visualization application 114. The operations may be implemented using hardware, firmware, software, or any combination of these methods. With reference to the exemplary embodiment of
CT apparatus 101 and computing device 102 may be integrated into a single system such as a CT imaging machine. CT apparatus 101 and computing device 102 may be connected directly. For example, CT apparatus 101 may connect to computing device 102 using a cable for transmitting information between CT apparatus 101 and computing device 102. CT apparatus 101 may connect to computing device 102 using a network. In an exemplary embodiment, computing device 102 is connected to a hospital computer network and a picture archive, and communication system (PACS) receives a CT study acquired on CT apparatus 101 in an ER. Using PACS, CT images are stored electronically and accessed using computing device 102. CT apparatus 101 and computing device 102 may not be connected. Instead, the CT study acquired on CT apparatus 101 may be manually provided to computing device 102. For example, the CT study may be stored on electronic media such as a CD or a DVD. After receiving the CT study, computing device 102 may start automatic processing of the set of images that comprise the CT study. In an exemplary embodiment, CT apparatus 101 is a 64-slice multi-detector advanced CT scanner having a reconstructed slice width and inter-slice distance less than or equal to approximately 0.5 millimeters (mm), which produces standard digital imaging and communications in medicine (DICOM) images. Computing device 102 may be a computer of any form factor.
Image processing system 100 may provide an initial classification and decision support system, which allows fast and accurate ruling out of the three major diseases associated with chest pain. Image processing system 100 can be provided as a primary CT study inspection tool assisting an ER physician. Additionally, image processing system 100 can be used either to completely rule out some or all of the three diseases (in case of negative results) or as a trigger to call a radiologist and/or a cardiologist to further analyze the case. Additionally, image processing system 100 may automatically identify and segment blood vessel trees and automatically analyze each blood vessel to detect and map all relevant pathologies, including calcified and soft plaque lesions and degree of stenosis.
With reference to
With reference to
In an operation 300, a first projection into an X-Y plane is defined. A positive X-axis is defined as extending out from the left side of the body. A positive Y-axis is defined as extending out from the back side of the body. A positive Z-axis is defined as extending out from the head of the body. The first projection is defined by summing the DICOM series along the Z-axis. In an operation 302, a threshold is applied to the first projection. For example, a threshold greater than approximately zero may be applied to eliminate the negative values of air which dominate the region outside the heart region and to retain the positive Hounsfeld unit (HU) values which include the fat, blood, and bones within the heart region. In an operation 304, a first largest connect component (CC) is identified in the thresholded first projection. In an operation 306, a first center of mass of the first largest CC is determined and denoted as Xc, Yc1.
In an operation 308, a second projection into a Y-Z plane is defined. The second projection is defined by summing the DICOM series along the X-axis. In an operation 310, a threshold is applied to the second projection data. For example, a threshold greater than approximately zero may be applied to eliminate the negative values of air which dominate the region outside the heart region and to retain the positive HU values which include the fat, blood, and bones within the heart region. In an operation 312, a second largest CC is identified in the thresholded second projection data. In an operation 314, a second center of mass of the second largest CC is determined and denoted as Yc2, Zc. A heart region center is defined as Xc, Yc1, Zc. In an operation 316, a heart region bounding box is defined from the heart region center and an average heart region width in each axis direction, WX, WY, WZ. In an operation 318, the defined heart region bounding box is stored at computing device 102. The X-axis, Y-axis, Z-axis system centered at Xc, Yc1, Zc defines a body coordinate system.
With reference again to
With reference again to
In an operation 210, the received CT image data is preprocessed. For example, preprocessing may include image enhancement, smoothing, noise reduction, acquisition artifacts detection, etc. Examples of image enhancement algorithms include Gaussian smoothing, median filtering, bilateral filtering, anisotropic diffusion, etc.
In an operation 214, the left and right main pulmonary artery trees are defined. In an operation 216, the lumen of the left and right main pulmonary artery trees is analyzed to identify any pulmonary embolism candidates. In an operation 218, any pulmonary embolism candidates are classified. In an operation 220, possible pulmonary embolism lesions are identified.
In an operation 222, the ascending and the visible part of the abdominal aorta are segmented. In an operation 224, the lumen of the abdominal aorta is segmented. In an operation 226, a 3-D geometry of the abdominal aorta is modeled. In an operation 228, the modeled aorta is compared to a hypothesized “normal” abdominal aorta to identify deviations from the hypothesized “normal” abdominal aorta. In an operation 230, suspicious locations are detected and analyzed to identify dissections and aneurysms.
In an operation 238, the aorta is identified. The aorta is detected in the first imaging slice of the heart region bounding box based, for example, on intensity and shape properties including circularity, compactness, and area. The remainder of the aorta is identified by moving from slice to slice and looking for a similar 2-D object in each slice. Data associated with the identified aorta is stored at computing device 102. In an exemplary embodiment, the data associated with the identified aorta includes an aorta shape and boundary in the identified heart region. It is assumed that the heart region bounding box detected on the previous step includes the aorta exit from the heart and that the cross section of the aorta in the upper slice of the heart region is approximately circular.
With reference to
In an operation 508, a compactness of each identified CC is determined. In an operation 510, identified CCs having a determined compactness that exceeds a compactness threshold are eliminated from further consideration. A compactness measure of a shape is a ratio of the area of the shape to the area of a circle (the most compact shape) having the same perimeter. The ratio may be expressed mathematically as M=4π(area)/2(perimeter). In an exemplary embodiment, the compactness threshold is 0.75. In an operation 512, a size of each identified connected component is determined. In an operation 514, identified CCs having a size that exceeds a maximum size threshold or that is below a minimum size threshold are eliminated from further consideration. In an exemplary embodiment, the maximum size threshold is 10,000 pixels. In an exemplary embodiment, the minimum size threshold is 1,000 pixels. In an operation 516, a determination is made concerning whether or not any identified CCs remain for consideration. If identified CCs remain for consideration, processing continues at an operation 518. If no identified CCs remain for consideration, processing continues at an operation 520. In operation 518, an initial aorta candidate is selected from the remaining CCs. For example, if a plurality of identified CCs remain for consideration, the largest candidate CC that is foremost in the body is selected as the initial aorta candidate.
In operation 520, a next slice is selected from the heart region data. In an operation 522, the aorta threshold is applied to the next slice of the DICOM series data. In an operation 524, the morphological filter is applied to the binary image. In an operation 526, one or more CCs are identified. In an operation 528, a compactness of each identified CC is determined. In an operation 530, the identified CCs having a determined compactness that exceeds the compactness threshold are eliminated from further consideration. In an operation 532, a size of each identified connected component is determined. In an operation 534, the identified CCs having a size that exceeds the maximum size threshold or that is below the minimum size threshold are eliminated from further consideration. In an operation 536, a determination is made concerning whether or not any identified CCs remain for consideration in the current slice. If identified CCs remain for consideration, processing continues at an operation 538. If no identified CCs remain for consideration, processing continues at operation 520.
In operation 538, the identified CCs from the current slice are compared with the aorta candidate object(s) created from the previous slice(s). In an operation 540, a determination is made concerning whether or not any identified CCs match CCs identified from the previous slices. In an operation 542, if a match is found between a CC and an aorta candidate object, the matched CC is assigned to the aorta candidate object. For example, if a center of a CC is closer than twenty pixels to the center of an aorta candidate object, the CC may be identified as matched with the aorta candidate object. In an operation 544, if a match is not found between a CC and an aorta candidate object, a new aorta candidate object is created based on the CC.
In an operation 546, a determination is made concerning whether or not all of the slices have been processed. If slices remain, processing continues at operation 520. If no slices remain, in an operation 548, aorta candidate objects are eliminated based on length. For example, aorta candidate objects that persist for less than 20 slices may be removed from further consideration. In an operation 550, an aorta object is selected from the remaining aorta candidate objects. For example, the aorta candidate object closest to the upper left corner of the image may be selected as the aorta object. In an operation 552, a bounding box is defined around the selected aorta object to identify a region in which the aorta is located in the CT image data. In an operation 554, the selected aorta object is stored at computing device 102.
With reference again to
With reference to
In an operation 604, the segmented image is post-processed. For example, small segmented objects are removed, possible vessels are removed from the segmented aorta candidates, and the segmented aorta candidates are intersected with the aorta detected in the previous slice. In an operation 606, the aorta candidates are validated by ensuring that there is at least one candidate that intersected the aorta detected in the previous slice and by ensuring that the aorta does not grow too fast. For example, if the aorta size in both a previous and a current slice is larger than 1500 pixels, the size growth ratio may be limited to 1.4. In an operation 608, the aorta candidates are selected. For example, CCs with a small intersection with the previously detected aorta are removed from consideration, and the upper-left-most candidate is chosen if a plurality of aorta candidates exist in the current slice. In an operation 610, the compactness of the selected aorta candidate is checked to ensure that the candidate is not compact. If the aorta candidate is not compact, the aorta search window is limited for the next slice. If the aorta candidate is compact, the whole image is used to search for the aorta in the next slice. In an operation 612, a bounding box for the aorta is calculated. If the aorta candidate is not compact, the bounding box size may be fixed and only the position of the bounding box updated to compensate for aorta movement. If the aorta candidate is compact, the bounding box may be attached to the upper left side of the aorta.
In an operation 614, a vesselness score is calculated for each voxel of the aorta object. As known to those skilled in the art, the vesselness score can be determined using a vesselness function. A vesselness function is a widely used function based on the analysis of Hessian eigen values. A good description of an exemplary vesselness function can be found for example in Frangi, A. F., Niessen, W. J., Vincken, K. L. and Viergever, M. A., 1998, “Multiscale Vessel Enhancement Filtering”, MICCAI'98, LNCS 1496, pp. 130-137. In an operation 616, a vesselness threshold is applied to the calculated vesselness score to identify possible exit points based on the HU value of a ring around the aorta object. Pixels in a ring around the detected aorta are grouped into CCs, which are analyzed to choose the most probable candidates for coronary tree exit points. In an operation 618, possible exit points are filtered to remove false candidates. For example, the possible exit points may be filtered based on a size of the CC corresponding to the possible exit, a location of the CC relative to the aorta, an incident angle of the CC relative to the aorta, etc. In an operation 620, a determination is made concerning whether or not any exit points are left. If no exit points are left for this slice, processing continues at an operation 624. If one or more exit points are left for this slice, processing continues at an operation 622. In operation 622, the one or more exit points left for this slice are added to a possible exit points list. In an operation 624, a determination is made whether or not the last slice has been processed. If the last slice has not been processed, processing continues at an operation 626. In operation 626, the next slice is selected from the aorta object data and processing continues at operation 602.
If the last slice has been processed, processing continues at an operation 628. In operation 628, a CC is identified for each exit point included in the possible exit points list. In an operation 630, a volume is calculated for each exit point CC (EPCC). In an operation 632, any EPCC having a volume below a volume threshold is eliminated from further consideration as an exit point. For example, the volume threshold may be 1500 voxels. In an operation 634, a maximum width of each EPCC is calculated. In an operation 636, any EPCC having a maximum width below a width threshold is eliminated from further consideration as an exit point. For example, the width threshold may be 2 mm. In an operation 638, a distance to the aorta is calculated for each EPCC. In an operation 640, the EPCC having a minimum distance to the aorta is selected. In an operation 642, a determination is made concerning whether or not a plurality of EPCCs remain. If a plurality of EPCCs remain, processing continues at an operation 644. If a plurality of EPCCs do not remain, processing continues at an operation 646. In operation 644, the EPCC having a maximum width is selected from the plurality of EPCCs remaining. In operation 646, the exit point is identified from the selected EPCCs.
With reference again to
With reference to
In an operation 708, the selected VCCs are labeled in the first binary volume. In an operation 710, a starting point or root is selected for a first VCC. In an operation 712, a width map is calculated for the first VCC. The width map includes the width of the VCC or the inverse distance from any point in the VCC to the boundary of the VCC. Thus, small values are near the centerline of the VCC and larger values are at the edges of the VCC. In an operation 714, the exit point of the selected VCC is identified in the binary volume. The right coronary artery tree has a single exit point. Additionally, the left main artery tree has a single exit point. In an operation 716, a distance map is calculated for the first VCC. The distance is calculated from any point in the VCC to the identified exit point. The distance map includes the calculated distance weighted by the width to ensure that the minimal path follows the vessel centerline. In an operation 718, candidate endpoints are identified. For example, during the calculation of the weighted distance map, one or more candidate endpoints may be saved. The candidate endpoints are voxels, which did not update any of their neighbors during the distance map calculation. In an operation 720, non-local maxima candidate endpoints are filtered. Thus, the candidate endpoints are scanned and only local maxima with respect to the distance from the root over a given window are kept. This process eliminates candidates that are not true blob vessel end points.
In an operation 722, an identifier for the candidate endpoint is created. In an operation 724, a new vertex is added to a symbolic graph of the vessel tree. In an operation 726, a first candidate endpoint is backtracked to the root to create graph edges. An auxiliary volume is used to mark voxels that have already been visited. The back-tracking may be a gradient descent iterative process (the gradient is in the distance field). Because the weighted distance map contains a single global minimum (the root), convergence is guaranteed. The method used to define the distance map ensures that the backtracking will be along the centerline or close to it. In an operation 728, all visited voxels in the auxiliary volume are marked with the current vertex identifier during the backtracking.
In an operation 730, a determination is made concerning whether or not a root is reached. If a root is reached, processing continues at an operation 732. If a root is not reached, processing continues at an operation 734. In operation 732, a new edge and vessel path are defined based on the backtracking. Processing continues at an operation 740. In an operation 734, a determination is made concerning whether or not an already visited voxel is reached. If an already visited voxel is reached, processing continues at an operation 736. If an already visited voxel is not reached, processing continues at an operation 726 to continue the backtracking to the endpoint. In an operation 736, a new edge and a new bifurcation vertex are defined. In an operation 738, the new bifurcation vertex is connected to the currently backtracked path, and the new edge and the new bifurcation vertex are added to the vessel tree.
In an operation 742, a determination is made concerning whether or not the endpoint is a leaf of the vessel tree or a vessel disconnected due to a low vesselness measure. In an exemplary embodiment, the determination is made based on the direction of the vessel at the endpoint and by searching for another VCC in a vacancy that contains a nearby endpoint. If the endpoint is a leaf, processing continues at operation 722 to create a new graph. The two graphs are joined together. If the endpoint is not a leaf, processing continues at an operation 744. In an operation 744, a determination is made concerning whether or not the last endpoint has been processed. If the last endpoint has not been processed, processing continues at operation 722.
If the last endpoint has been processed, processing continues at an operation 746. In operation 746, short branches are removed based on the rationale that they do not contribute to the analysis because important findings are usually located at the major blood vessels, which are thick and elongated. Therefore, in an exemplary embodiment, graph edges which lead to endpoints that are less than a length threshold are removed. An exemplary length threshold is 5 mm. In an operation 748, x-junctions are removed to eliminate veins. Veins are usually faint and spatially close to the arteries. X-junctions are defined as two very close bifurcation points. For example, close bifurcation points may be less than approximately 3 mm from each other. In an exemplary embodiment, a bifurcation may be two VCCs intersecting at angles between approximately 70 degrees and approximately 110 degrees. Additionally, a bifurcation may be two VCCs intersecting at angles approximately equal to 90 degrees. The sub-tree which remains is the one which has the closest direction to the edge arriving from the aorta.
For example, with reference to
With reference again to
In an operation 246, a radius of each blood vessel is determined. In an operation 248, a blood vessel centerline is determined. “Sausages” of blood vessels are obtained from the coronary artery vessel tree. Each “sausage” includes axial blood vessel cross-sections taken perpendicular to the blood vessel direction. Initially, a blood vessel center is presumed to be at the center of each section. Either “stretched” or “curved” blood vessels can be used. Any blood vessel radius and center line estimation method can be used. In an exemplary embodiment, low pass post-filtering between consecutive cross-sections is performed. Because a blood vessel may be surrounded by tissue having similar attenuation values, indirect indicators may be used to define the blood vessel edge. Areas having low values, which clearly don't belong to a blood vessel are identified, and the largest circle that lies outside the identified areas is defined. In an alternative embodiment, a largest circle that can be defined that fits into the valid (bright) area is defined. An arbitration process may be used to determine which approach should be used for each blood vessel. A blood vessel center consisting of a number of pixels can be defined, in particular when a cross section is elongated. In an exemplary embodiment, the blood vessel center is reduced to a single pixel.
In an operation 250, areas of calcium are identified in each blood vessel. Any high precision calcium identification method can be used. In an exemplary embodiment, a cross section based analysis aimed at location of the calcium seeds is performed, and a volume based analysis aimed at removal of spurious seeds created by the “salt noise” and by the growing of valid seeds into the correct calcium area is performed. With reference to
In an operation 806, a maximum intensity in a given cross-section is identified as a possible location of a Calcium seed. In an operation 808, a distance from the center to the maximum intensity is calculated. In an operation 810, a determination is made concerning whether or not the calculated distance exceeds a calcium distance threshold. The calcium distance threshold is based on a comparison with an estimated radius value. If the distance does not exceed the calcium distance threshold, processing continues in an operation 814. If the distance does exceed the calcium distance threshold, processing continues in an operation 812. In operation 812, an area of the calcium seed is calculated. In operation 814, a determination is made concerning whether or not any vessels remain for processing. If vessels remain, processing continues at operation 808. If no vessels remain, processing continues at an operation 816. In operation 816, a determination concerning whether or not any slices remain for processing is performed. If no slices remain, processing continues at an operation 820. If slices remain, processing continues at an operation 818. In operation 818, the next slice is selected from the heart region data and processing continues at operation 802. In operation 820, a volume of any identified calcium seed(s) is calculated based on the area calculated for each slice and the number of slices over which the identified calcium seed(s) extends. If a calcium seed is identified, it also is extended to the surrounding high intensity areas providing that no “spill to the center” occurs. An extent of the calcium seed may be determined based on a threshold. For example, lumen intensities exceeding approximately 650 HU may be considered to be calcified plaque or part of the Calcium seed.
With reference again to
In operation 908, a determination is made concerning whether or not a half-moon structure is located in the blood vessel lumen. If a half-moon structure is identified from the determination, processing continues at an operation 910. If a half-moon structure is not identified from the determination, processing continue at operation 911. In operation 910, a soft plaque area is identified. In operation 911, an area of the identified soft plaque is calculated. In operation 912, a determination concerning whether or not any slices remain for processing is performed. If no slices remain, processing continues at an operation 916. If slices remain, processing continues at an operation 914. In operation 914, the next slice is selected from the heart region data, and processing continues at operation 902. In operation 916, a volume of any identified soft plaque area(s) is calculated based on the area calculated for each slice and the number of slices over which the identified soft plaque area(s) extends. In an operation 918, a volume of any identified calcium seed(s) is updated to include areas between the calcium seed and the blood vessel border and between the calcium and soft plaque areas to compensate for natural intensity low passing that may have occurred during the CT image acquisition.
With reference again to
In some pathological cases, the cross section images may appear reasonably normal. In these cases, pathology must be identified based on the analysis of global variations. In an operation 256, global filters are applied to identify pathologies. For example, a first filter may be applied to identify a rapid decrease in the blood vessel radius. A second filter may be applied to identify a rapid decrease in the lumen intensity. A third filter may be applied to identify a rapid increase in the lumen intensity. The decisions from the series of filters may be cumulative. As a result, it is sufficient if a pathology is identified through use of one of the three filters. The filters may use the values of blood vessel radius and luminance as computed above. Use of the global filters takes into account that even healthy vessels feature significant radius and luminance variations in particular due to natural narrowing of the blood vessels, rapid changes in the vicinity of bifurcations (especially after the bifurcations), noise (in particular for relatively narrow vessels), etc. Anomalies identified by the global filters are discarded, if located in the vicinity of any bifurcations.
The operations described with reference to
With reference again to
User selection of a blood vessel 1106 in blood vessel list portion 1104 may cause display of a detailed description of the lesions associated with the selected blood vessel in a detail portion 1108. Detail portion 1108 may include a list of the lesions. For each lesion, a segment name, a lesion type, a degree of stenosis value, a volume, a distance from the aorta, a distance from the blood vessel origin, an eccentricity, a degree of positive remodeling, and a morphological regularity may be shown. First user interface 1100 further may include a totals portion 1110. Totals portion 1110 may include summary data associated with a degree of stenosis, lesions, the number of stents, etc.
With reference again to
First 3-D coronary vessel map 1204 provides a view of the blood vessel tree synchronized with first axial slice viewer 1202 to indicate the identified pathology 1203. First 3-D coronary vessel map 1204 may be presented in a top right area of second user interface 1200 and may include a 3-D grid to identify the length of the blood vessels in the blood vessel tree in each direction. Selecting an area of first stretched blood vessel image 1206 may cause image rotation of first 3-D coronary vessel map 1204 around its axis to facilitate a correct 3-D perception of the blood vessel structure. First 3-D coronary vessel map 1204 may be synchronized with first axial slice viewer 1202 to distinguish the selected blood vessel from the remaining blood vessels in the blood vessel tree. First 3-D coronary vessel map 1204 may be rotated using an input interface as known to those skilled in the art. Indicators may be provided in first 3-D coronary vessel map 1204 to indicate end points and bifurcations. For example, end points may be indicated using green circles and bifurcations may be indicated using red circles.
First stretched blood vessel image 1206 includes a vertical bar which denotes a location of the slice displayed in first axial slice viewer 1202 in a stretched view of a selected blood vessel. First stretched blood vessel image 1206 may be located in a bottom left area of second user interface 1200. The physician can superimpose corresponding plaque areas. For example, soft plaque may be indicated in red and calcified plaque indicated in blue. If desired, the physician can invoke an edit mode and correct automatic results.
With reference to
With reference to
Second stretched blood vessel image 1406 includes a vertical bar which denotes a location of the slice displayed in second axial slice viewer 1402 in a stretched view of a selected blood vessel. Second stretched blood vessel image 1406 may be presented in a bottom left area of second user interface 1400.
Pathology report type view 1408 may contain a pathology list 1409 of detected pathologies based on the processes described with reference to
With reference to
In an exemplary embodiment, fifth user interface 1500 may initially include third axial slice viewer 1502. When the user selects an artery from third axial slice viewer 1502, the selected blood vessel is presented in third stretched blood vessel image 1504 with vertical bar 1508 denoting the location of the slice presented in third axial slice viewer 1502. Execution of one or more of the processes described with reference to
Fifth user interface 1500 further may include an axial presentation only button 1510, a new study selection button 1512, a save current screen button 1514, and an exit program button 1516. User selection of axial presentation only button 1510 causes stretched blood vessel image 1504 to be removed from fifth user interface 1500. User selection of new study selection button 1512 causes presentation of a selection window that allows the user to select a new patient study for analysis. User selection of save current screen button 1514 causes presentation of a save window that allows the user to select a location and a name for a file to which the contents of fifth user interface 1500 are saved for review, for printing, for sending with a message, etc. User selection of exit program button 1516 may cause fifth user interface 1500 to close.
The foregoing description of exemplary embodiments of the invention have been presented for purposes of illustration and of description. It is not intended to be exhaustive or to limit the invention to the precise form disclosed, and modifications and variations are possible in light of the above teachings or may be acquired from practice of the invention. The functionality described may be implemented in a single executable or application or may be distributed among modules that differ in number and distribution of functionality from those described herein. Additionally, the order of execution of the functions may be changed depending on the embodiment. The embodiments were chosen and described in order to explain the principles of the invention and as practical applications of the invention to enable one skilled in the art to utilize the invention in various embodiments and with various modifications as suited to the particular use contemplated. It is intended that the scope of the invention be defined by the claims appended hereto and their equivalents.
The present application claims priority to U.S. Provisional Patent Application No. 60/862,912, filed on Oct. 25, 2006, and titled “METHOD AND SYSTEM FOR AUTOMATIC ANALYSIS OF BLOOD VESSEL STRUCTURES AND PATHOLOGIES,” the disclosure of which is incorporated herein by reference in its entirety.
Number | Name | Date | Kind |
---|---|---|---|
5095521 | Trousset et al. | Mar 1992 | A |
5187658 | Cline et al. | Feb 1993 | A |
5235510 | Yamada et al. | Aug 1993 | A |
5343390 | Doi et al. | Aug 1994 | A |
5412563 | Cline et al. | May 1995 | A |
5433199 | Cline et al. | Jul 1995 | A |
5435310 | Sheehan et al. | Jul 1995 | A |
5452367 | Bick et al. | Sep 1995 | A |
5457754 | Han et al. | Oct 1995 | A |
5458126 | Cline et al. | Oct 1995 | A |
5594638 | Iliff | Jan 1997 | A |
5647360 | Bani-Hashemi et al. | Jul 1997 | A |
5660176 | Iliff | Aug 1997 | A |
5671294 | Rogers et al. | Sep 1997 | A |
5724968 | Iliff | Mar 1998 | A |
5729620 | Wang | Mar 1998 | A |
5734739 | Sheehan et al. | Mar 1998 | A |
5768413 | Levin et al. | Jun 1998 | A |
5769074 | Barnhill et al. | Jun 1998 | A |
5779634 | Ema et al. | Jul 1998 | A |
5790690 | Doi et al. | Aug 1998 | A |
5797396 | Geiser et al. | Aug 1998 | A |
5807256 | Taguchi et al. | Sep 1998 | A |
5828774 | Wang | Oct 1998 | A |
5836877 | Zavisian | Nov 1998 | A |
5838815 | Gur et al. | Nov 1998 | A |
5854851 | Bamberger et al. | Dec 1998 | A |
5868669 | Iliff | Feb 1999 | A |
5872861 | Makram-Ebeid | Feb 1999 | A |
5881124 | Giger et al. | Mar 1999 | A |
5889524 | Sheehan et al. | Mar 1999 | A |
5903664 | Hartley et al. | May 1999 | A |
5970164 | Bamberger et al. | Oct 1999 | A |
6011862 | Doi et al. | Jan 2000 | A |
6021404 | Moukheibir | Feb 2000 | A |
6035014 | Hiraoglu et al. | Mar 2000 | A |
6047080 | Chen et al. | Apr 2000 | A |
6047090 | Makram-Ebeid | Apr 2000 | A |
6067372 | Gur et al. | May 2000 | A |
6075879 | Roehrig et al. | Jun 2000 | A |
6106466 | Sheehan et al. | Aug 2000 | A |
6113540 | Iliff | Sep 2000 | A |
6138045 | Kupinski et al. | Oct 2000 | A |
6148095 | Prause et al. | Nov 2000 | A |
6173077 | Trew et al. | Jan 2001 | B1 |
6185320 | Bick et al. | Feb 2001 | B1 |
6200268 | Vince et al. | Mar 2001 | B1 |
6205350 | Lorenz et al. | Mar 2001 | B1 |
6206829 | Iliff | Mar 2001 | B1 |
6246784 | Summers et al. | Jun 2001 | B1 |
6247004 | Moukheibir | Jun 2001 | B1 |
6248063 | Barnhill et al. | Jun 2001 | B1 |
6249590 | Young et al. | Jun 2001 | B1 |
6266435 | Wang | Jul 2001 | B1 |
6306087 | Barnhill et al. | Oct 2001 | B1 |
6317509 | Simanovsky et al. | Nov 2001 | B1 |
6317617 | Gilhuijs et al. | Nov 2001 | B1 |
6320976 | Murthy et al. | Nov 2001 | B1 |
6345112 | Summers et al. | Feb 2002 | B1 |
6351573 | Schneider | Feb 2002 | B1 |
6377832 | Bergman et al. | Apr 2002 | B1 |
6385474 | Rather et al. | May 2002 | B1 |
6396939 | Hu et al. | May 2002 | B1 |
6408201 | Foo et al. | Jun 2002 | B1 |
6415046 | Kerut, Sr. | Jul 2002 | B1 |
6434262 | Wang | Aug 2002 | B2 |
6477262 | Wang | Nov 2002 | B2 |
6482156 | Iliff | Nov 2002 | B2 |
6501848 | Carroll et al. | Dec 2002 | B1 |
6535821 | Wang et al. | Mar 2003 | B2 |
6553356 | Good et al. | Apr 2003 | B1 |
6556696 | Summers et al. | Apr 2003 | B1 |
6574304 | Hsieh et al. | Jun 2003 | B1 |
6574357 | Wang | Jun 2003 | B2 |
6597762 | Ferrant et al. | Jul 2003 | B1 |
6625303 | Young et al. | Sep 2003 | B1 |
6628815 | Wang | Sep 2003 | B2 |
6643533 | Knoplioch et al. | Nov 2003 | B2 |
6662038 | Prince | Dec 2003 | B2 |
6674894 | Parker et al. | Jan 2004 | B1 |
6684092 | Zavislan | Jan 2004 | B2 |
6687329 | Hsieh et al. | Feb 2004 | B1 |
6687405 | Trew et al. | Feb 2004 | B1 |
6708055 | Geiser et al. | Mar 2004 | B2 |
6728566 | Subramanyan et al. | Apr 2004 | B1 |
6730030 | Palti | May 2004 | B2 |
6741880 | Foo et al. | May 2004 | B1 |
6744911 | Avila et al. | Jun 2004 | B1 |
6754376 | Turek et al. | Jun 2004 | B1 |
6754380 | Suzuki et al. | Jun 2004 | B1 |
6771262 | Krishnan | Aug 2004 | B2 |
6771803 | Turek et al. | Aug 2004 | B1 |
6782284 | Subramanyan et al. | Aug 2004 | B1 |
6785409 | Suri | Aug 2004 | B1 |
6795521 | Hsu et al. | Sep 2004 | B2 |
6816743 | Moreno et al. | Nov 2004 | B2 |
6819735 | Bruder et al. | Nov 2004 | B2 |
6819790 | Suzuki et al. | Nov 2004 | B2 |
6842638 | Suri et al. | Jan 2005 | B1 |
6845260 | Liu et al. | Jan 2005 | B2 |
6898303 | Armato, III et al. | May 2005 | B2 |
6909797 | Romsdahl et al. | Jun 2005 | B2 |
6922462 | Acharya et al. | Jul 2005 | B2 |
6928314 | Johnson et al. | Aug 2005 | B1 |
6937776 | Li et al. | Aug 2005 | B2 |
6947040 | Tek et al. | Sep 2005 | B2 |
6950544 | Ashton | Sep 2005 | B2 |
6978039 | Cline et al. | Dec 2005 | B2 |
6983063 | Novak et al. | Jan 2006 | B1 |
6985612 | Hahn | Jan 2006 | B2 |
7003144 | Yim | Feb 2006 | B2 |
7343187 | Stetson | Mar 2008 | B2 |
20010027265 | Prince | Oct 2001 | A1 |
20010043729 | Giger et al. | Nov 2001 | A1 |
20020057825 | Evron et al. | May 2002 | A1 |
20020090121 | Schneider et al. | Jul 2002 | A1 |
20020097902 | Roehrig et al. | Jul 2002 | A1 |
20020168110 | Al-Kofahi et al. | Nov 2002 | A1 |
20030026470 | Kasai | Feb 2003 | A1 |
20030028100 | Tearney et al. | Feb 2003 | A1 |
20030031351 | Yim | Feb 2003 | A1 |
20030053670 | Hauper et al. | Mar 2003 | A1 |
20030056799 | Young et al. | Mar 2003 | A1 |
20030076987 | Wilson et al. | Apr 2003 | A1 |
20030095693 | Kaufman et al. | May 2003 | A1 |
20030099385 | Zeng et al. | May 2003 | A1 |
20030122824 | Chen et al. | Jul 2003 | A1 |
20030142857 | Alyassin | Jul 2003 | A1 |
20030156745 | Saito et al. | Aug 2003 | A1 |
20030169914 | Launay et al. | Sep 2003 | A1 |
20030174872 | Chalana et al. | Sep 2003 | A1 |
20030176780 | Arnold et al. | Sep 2003 | A1 |
20030190063 | Acharya et al. | Oct 2003 | A1 |
20030215119 | Uppaluri et al. | Nov 2003 | A1 |
20030215120 | Uppaluri et al. | Nov 2003 | A1 |
20030223627 | Yoshida et al. | Dec 2003 | A1 |
20030228040 | Oosawa | Dec 2003 | A1 |
20040022359 | Acharya et al. | Feb 2004 | A1 |
20040068167 | Hsieh et al. | Apr 2004 | A1 |
20040086175 | Parker et al. | May 2004 | A1 |
20040096088 | Kohle | May 2004 | A1 |
20040101179 | Suryanarayanan et al. | May 2004 | A1 |
20040101181 | Giger et al. | May 2004 | A1 |
20040101183 | Mullick et al. | May 2004 | A1 |
20040114800 | Ponomarev et al. | Jun 2004 | A1 |
20040120571 | Duvdevani et al. | Jun 2004 | A1 |
20040133094 | Becker et al. | Jul 2004 | A1 |
20040133100 | Naghavi et al. | Jul 2004 | A1 |
20040147838 | Londt et al. | Jul 2004 | A1 |
20040147840 | Duggirala et al. | Jul 2004 | A1 |
20040175034 | Wiemker et al. | Sep 2004 | A1 |
20040190763 | Giger et al. | Sep 2004 | A1 |
20040223636 | Edic et al. | Nov 2004 | A1 |
20040228529 | Jerebko et al. | Nov 2004 | A1 |
20040252870 | Reeves et al. | Dec 2004 | A1 |
20040258285 | Hansen et al. | Dec 2004 | A1 |
20050008210 | Evron et al. | Jan 2005 | A1 |
20050020903 | Krishnan et al. | Jan 2005 | A1 |
20050033139 | Li et al. | Feb 2005 | A1 |
20050033159 | Mistretta et al. | Feb 2005 | A1 |
20050043614 | Huizenga et al. | Feb 2005 | A1 |
20050059876 | Krishnan et al. | Mar 2005 | A1 |
20050069183 | Ashton | Mar 2005 | A1 |
20050074150 | Bruss | Apr 2005 | A1 |
20050093861 | Moreau-Gobard | May 2005 | A1 |
20050102315 | Krishnan | May 2005 | A1 |
20050105683 | Sato | May 2005 | A1 |
20050105786 | Moreau-Gobard et al. | May 2005 | A1 |
20050110791 | Krishnamoorthy et al. | May 2005 | A1 |
20050111719 | Pescatore et al. | May 2005 | A1 |
20050113679 | Suryanarayanan et al. | May 2005 | A1 |
20050113960 | Karau et al. | May 2005 | A1 |
20050129170 | Watson et al. | Jun 2005 | A1 |
20050136549 | Gholap et al. | Jun 2005 | A1 |
20050143654 | Zuiderveld et al. | Jun 2005 | A1 |
20050147297 | McLaughlin et al. | Jul 2005 | A1 |
20050157848 | Miyauchi et al. | Jul 2005 | A1 |
20050169526 | Romsdahl et al. | Aug 2005 | A1 |
20050185838 | Bogoni et al. | Aug 2005 | A1 |
20050195936 | Raman et al. | Sep 2005 | A1 |
20050201599 | Matsui | Sep 2005 | A1 |
20050201606 | Okada et al. | Sep 2005 | A1 |
20050201618 | Tek | Sep 2005 | A1 |
20050207628 | Kim | Sep 2005 | A1 |
20050207630 | Chan et al. | Sep 2005 | A1 |
20050213800 | Chen et al. | Sep 2005 | A1 |
20050232474 | Wei et al. | Oct 2005 | A1 |
20050240094 | Pichon et al. | Oct 2005 | A1 |
20050244794 | Kemp et al. | Nov 2005 | A1 |
20050249391 | Kimmel et al. | Nov 2005 | A1 |
20050249392 | Allain et al. | Nov 2005 | A1 |
20050249399 | Tek et al. | Nov 2005 | A1 |
20050251014 | Qian et al. | Nov 2005 | A1 |
20050254546 | Rittscher et al. | Nov 2005 | A1 |
20050256400 | Raman et al. | Nov 2005 | A1 |
20050259854 | Arimura et al. | Nov 2005 | A1 |
20050259855 | Dehmeshki | Nov 2005 | A1 |
20050267337 | Sakai et al. | Dec 2005 | A1 |
20050271271 | Noble et al. | Dec 2005 | A1 |
20050281381 | Guendel | Dec 2005 | A1 |
20050281447 | Moreau-Gobard et al. | Dec 2005 | A1 |
20050286750 | Dehmeshki | Dec 2005 | A1 |
20060004278 | Giger et al. | Jan 2006 | A1 |
20060008143 | Truyen et al. | Jan 2006 | A1 |
20060009694 | Yousefzadeh et al. | Jan 2006 | A1 |
20060013460 | Dehmeshki | Jan 2006 | A1 |
20060018524 | Suzuki et al. | Jan 2006 | A1 |
20060023924 | Asbeck et al. | Feb 2006 | A1 |
20060153451 | Hong et al. | Jul 2006 | A1 |
20070008317 | Lundstrom | Jan 2007 | A1 |
20070036418 | Pan et al. | Feb 2007 | A1 |
20080008366 | Desh et al. | Jan 2008 | A1 |
20080273652 | Arnold et al. | Nov 2008 | A1 |
20080279435 | Arnold et al. | Nov 2008 | A1 |
Number | Date | Country |
---|---|---|
1 225 541 | Jul 2002 | EP |
1 225 542 | Jul 2002 | EP |
1 387 320 | Feb 2004 | EP |
1 398 722 | Mar 2004 | EP |
1 400 910 | Mar 2004 | EP |
1 426 903 | Jun 2004 | EP |
1 465 109 | Oct 2004 | EP |
1 531 423 | May 2005 | EP |
1 531 425 | May 2005 | EP |
WO 02071319 | Sep 2002 | WO |
WO 03008989 | Jan 2003 | WO |
WO 03034176 | Apr 2003 | WO |
WO 03045223 | Jun 2003 | WO |
WO 03046833 | Jun 2003 | WO |
WO 03075209 | Sep 2003 | WO |
WO 03077758 | Sep 2003 | WO |
WO 03079137 | Sep 2003 | WO |
WO 03081529 | Oct 2003 | WO |
Number | Date | Country | |
---|---|---|---|
20080101667 A1 | May 2008 | US |
Number | Date | Country | |
---|---|---|---|
60862912 | Oct 2006 | US |