The present disclosure relates in general to the field of anatomical segmentation and more particularly, to manually assisted segmentation of branched vascular anatomy.
Vascular segmentation and feature identification is a preliminary stage of image-based measurement of vascular state. Though many stages of vascular segmentation and feature identification can be performed based primarily on automated analysis, relevant image features are often of low contrast and/or embedded in a complex environment comprising elements of ambiguous geometry and extraneous features. Human supervision may be introduced into the workflow to make corrections and help ensure quality of results, resulting in a semi-automated process, for example as in the Livewire and related procedures (discussed, for example, in Ryan Dickie, et al.; Live-vessel: Interactive vascular image segmentation with simultaneous extraction of optimal medial and boundary paths. Technical report TR 2009-23, School of Computing Science, Simon Fraser University, Burnaby, BC, Canada, November 2009).
Additional background art includes:
an article titled: “Snakes: Active contour models”, by M. Kass, A. Witkin, and D. Terzopoulos, published in Int. J. Comput. Vis. (1987), 1:321-331;
an article titled: “Multiscale vessel enhancement filtering”, by A. F Frangi, W. J. Niessen, K. L. Vincken, M. A. Viergever, published in Medical Image Computing and Computer-Assisted Intervention—MICCA'98; and
an article titled: “Snakes, Shapes, and Gradient Vector Flow”, by C. Xu and J. L. Prince, published in IEEE Transactions on Image Processing (1998), 7:359-369.
There is provided, in accordance with some exemplary embodiments, a method of segmenting a vascular image into vascular paths for defining paths of blood flow. The method includes defining first and second targeted vascular path end regions within the vascular image, identifying the positions of vascular portions in the vascular image, and automatically generating a plurality of vascular path options from the identified vascular portions, each vascular path option defining a potential vascular path which extends between the first and second targeted vascular path end regions. The method may also include displaying the plurality of vascular path options registered to the vascular image for selection by a user, each of the displayed vascular path options including the first and second targeted vascular path end regions. The example method may further include receiving a path option selected by the user for defining a path of blood flow.
According to some embodiments, the plurality of paths are automatically generated based on a first set of criteria, and the path option selected by the user is selected based on a second set of criteria.
According to some embodiments, the predetermining comprises ranking the vascular path options in an order, based on assessment of a likelihood that each vascular path option corresponds to an actual path of blood flow in blood vessels imaged in the vascular image.
According to some embodiments, the predetermining comprises applying a cost function which assigns numerical costs to one or more features related to the vascular path options.
According to some embodiments, the cost function assigns numerical costs based on features of a plurality of vascular segment centerlines from which the vascular path option is concatenated.
According to some embodiments, the features of the plurality of vascular segment centerlines include one or more from the group consisting of centerline orientation, centerline offset, and a count of centerlines extending from a nodal region.
According to some embodiments, the cost function assigns numerical costs based on features of the vascular image over which the vascular path option extends.
According to some embodiments, the features of the vascular image include one or more of the group consisting of: continuity of vascular segment image intensity, continuity of vascular segment image width, and the position of a relative change in vascular intensity with respect to a nodal region from which three or more vascular segments extend.
According to some embodiments, the predetermining comprises applying a cost function which assigns numerical costs based on an estimated relative position of a vascular segment image in depth, relative to an axis extending perpendicular to a plane of the vascular image.
According to some embodiments, the presenting comprises presenting the plurality of vascular path options in a sequential order determined by the order of selection.
According to some embodiments, the presenting comprises presenting the plurality of vascular path options simultaneously, and the order of selection corresponds to an order in which the vascular path options are displayed as active for selection.
According to some embodiments, each vascular path option defines a vascular path which extends through an image region between the first and second targeted vascular path end regions, ending at a vascular region of the image which is nearest to one of the first and second targeted vascular path end positions.
There is provided, in accordance with some exemplary embodiments, a method of editing a vascular path to more accurately delineate a segmentation of a blood vessel in a vascular image. The example method includes receiving an indication of a selected region along the segmentation of the blood vessel, defining an energy functional defined as a function of position along the segmentation of the blood vessel, wherein non-zero regions of the energy functional are set based on the position of the selected region. The method may also include moving regions of the segmentation in accordance with energy minimization within the non-zero regions of the energy functional.
According to some embodiments, energy functional values in the non-zero regions are set based on features of the underlying vascular image.
According to some embodiments, energy functional values in the non-zero regions are set based on movement of a user-controlled position indication.
According to some embodiments, the user-controlled position indication comprises the indication of the selected region.
There is provided, in accordance with some exemplary embodiments, a user interface for semi-automatic segmentation of a vascular path, the user interface comprising: at least one interface module operable to present an automatically generated to default vascular path extending between two target end points; at least one interface module operable to present at least one additional automatically generated vascular path extending between the two target end points.
According to some embodiments, the user interface further comprises at least one interface module allowing definition of at least one way point, and operable to present an automatically generated vascular path extending between the two target end points via the at least one way point.
According to some embodiments, the user interface further comprises at least one interface module operable to modify a previously defined vascular path by dragging a portion of the vascular path to a new location.
Unless otherwise defined, all technical and/or scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which the disclosure pertains. Although a system, a method, an apparatus, and/or a computer program product similar or equivalent to those described herein can be used in the practice or testing of embodiments disclosed herein, exemplary systems, methods, apparatuses, and/or computer program products are described below. In case of conflict, the patent specification, including definitions, will control. In addition, the systems, methods, apparatuses, computer program products, and examples are illustrative only and are not intended to be necessarily limiting.
As will be appreciated by one skilled in the art, aspects of the present disclosure may be embodied as a system, a method or a computer program product. Accordingly, aspects of the present disclosure may take the form of an entirely hardware embodiment, an entirely software embodiment (including firmware, resident software, micro-code, etc.) or an embodiment combining software and hardware aspects that may all generally be referred to herein as a “circuit,” “module” or “system.” Furthermore, some embodiments of the present disclosure may take the form of a computer program product embodied in one or more computer readable medium(s) having computer readable program code embodied thereon. Implementation of the method and/or system of some embodiments of the disclosure can involve performing and/or completing selected tasks manually, automatically, or a combination thereof. Moreover, according to actual instrumentation and equipment of some embodiments of the method and/or system of the disclosure, several selected tasks could be implemented by hardware, by software or by firmware and/or by a combination thereof (e.g., using an operating system).
For example, hardware for performing selected tasks according to some embodiments of the disclosure could be implemented as a chip or a circuit. As software, selected tasks according to some embodiments of the disclosure could be implemented as a plurality of software instructions executed by a computer using any suitable operating system. In an exemplary embodiment of the disclosure, one or more tasks, according to some exemplary embodiments of a method and/or a system as described herein, are performed by a data processor, such as a computing platform for executing a plurality of instructions. Optionally, the data processor includes a volatile memory for storing instructions and/or data and/or a non-volatile storage, for example, a magnetic hard-disk and/or removable media, for storing instructions and/or data. Optionally, a network connection may be provided. A display and/or a user input device such as a keyboard or mouse may also be provided.
Any combination of one or more computer readable medium(s) may be utilized for some embodiments of the disclosure. The computer readable medium may be a computer readable signal medium or a computer readable storage medium. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this document, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
A computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.
Program code embodied on a computer readable medium and/or data used thereby may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
Computer program code for carrying out operations for some embodiments of the present disclosure may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C++ or the like and conventional procedural programming languages, such as the “C” programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider).
Some embodiments of the present disclosure may be described below with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the disclosure. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer readable medium that can direct a computer, other programmable data processing apparatuses, or other devices to function in a particular manner, such that the instructions stored in the computer readable medium produce an article of manufacture including instructions which implement the function/act specified in the flowchart and/or block diagram block or blocks.
The computer program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other devices to cause a series of operational steps to be performed on the computer, other programmable apparatus or other devices to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide processes for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
Additional features and advantages of the disclosed system, method, and apparatus are described in, and will be apparent from, the following Detailed Description and the Figures.
Some embodiments of the example systems, methods, apparatuses, and/or computer program products are herein described, by way of example only, with reference to the accompanying drawings. With specific reference now to the drawings in detail, it is stressed that the particulars shown are by way of example, and for purposes of illustrative discussion of embodiments of the systems, methods, apparatuses, and/or computer program products. In this regard, the description taken with the drawings makes apparent to those skilled in the art how embodiments of the systems, methods, apparatuses, and/or computer program products may be practiced.
In the drawings:
The present disclosure, in some embodiments thereof, relates to the field of anatomical segmentation and more particularly, to manually assisted segmentation of branched vascular anatomy.
Overview
A broad aspect of some embodiments of the current disclosure relates to methods for combining manual and automatic segmentation techniques, which potentially allows for efficient, reliable vascular tree generation.
Vascular segmentation is an early step in the characterization of vascular anatomy and function from medical image data for a range of applications, including studies of blood flow. However, automatic segmentation methods typically display degraded performance as requirements become more stringent. In addition, contrast agents are limited in their usable concentration; injectable contrast agents quickly dilute, limiting available imaging time. Further, for safety reasons, radiation doses used in some types of imaging are preferably kept to a minimum necessary for reliable visualization. Even though high contrast and/or high signal-to-noise can often be achieved for large blood vessels, there is also a need in some applications to analyze smaller vessels. However, imaging quality rapidly degrades with decreased vascular diameter, as the signal intensity approaches the limit of background noise, or even quantum noise inherent to the signal itself. Apart from these technical considerations, vasculature itself is highly complicated in form. This potentially gives rise, particularly in 2-D images, to many cases of ambiguous structure; difficult to resolve to a particular branch structure by inspection at the level of local features. Global feature detection, on the other hand, is difficult to address by general automatic methods, as interpreting such features potentially relies on particularities of the constraints applicable for a particular structure and/or imaging method.
For these and other reasons, the practical case often results that the quality of medical images available for analysis is, at least for some vascular structures of interest, near or beyond the limits of present techniques for machine vision and/or image processing. Even if the boundaries of these limits should shift over time as technology develops, it is to be expected that there will continue to be interesting segmentation problems for which automatic vascular segmentation alone is inadequate.
Semi-automatic segmentation methods seek to address limitations of purely automatic segmentation methods by augmenting them with human judgement and/or control. However, human intervention is expensive in terms of time, money, and/or availability. In view of this, a goal in some semi-automatic segmentation methods is to reduce human time and/or effort spent in supervising automatic segmentation. Considered as a problem in optimization, the goal, in some embodiments of the disclosure, may be to bring human intervention in semi-automatic segmentation to the lowest achievable level which is consistent with results of sufficiently quality for the use to which they are applied. Accordingly, preferred methods for semi-automatic segmentation may include features which are specific to application in particular problem domains.
An aspect of some embodiments of the present disclosure relates to cascading methods for semi-automatic vascular segmentation of angiographic images. More particularly, in some embodiments, the aspect relates to cascading methods for semi-automatic segmentation of angiographic images while working within the constraints of producing results in real-time. Optionally, segmentation is completed while a catheter procedure, which may be been used to produce the images, is still underway, while leaving sufficient time for subsequent analysis (e.g., analysis leading to diagnosis and/or treatment planning).
In some embodiments, the manually supervised operations of the semi-automatic vascular segmentation are structured to cascade through an increasingly attention-demanding set of user operations, where the cascading is stopped once the user is satisfied that a sufficient quality of result has been obtained. There may be one or more routes through this cascade of operations; for example, the order of operations chosen optionally depends on whether nearly adequate results are obtained early that only need minor editing, or whether a suitable path needs to be defined by a user de novo. In some embodiments, the cascade is structured so that more likely options are presented earlier and/or with greater emphasis, potentially reducing time and/or effort spent by a user in making selections. Optionally, the order of operations is selected to emphasize getting “close enough” results with minimum input, while also providing an opportunity for the correction of errors in automatically identified results as necessary.
In some embodiments, the method optionally starts with the definition of two vascular path end regions (e.g., regions within some maximum distance from a selection point); after which a most-likely and automatically detected path is presented to the user for acceptance or rejection. For a suitable definition of “most-likely” (e.g., a suitable cost function), this potentially allows most or a plurality of user interventions to be limited to simple acceptance of a default. Optionally a plurality of vascular path end region pairs are defined initially, and a corresponding plurality of default options are presented simultaneously, and user interaction is limited still further to correcting defaults. In some embodiments, definition of one of the endpoints is simplified by defining at least one endpoint at a root position of the vascular tree, positioned such that it may be considered to be at one end of any vascular path leading back from one of its branches. In some embodiments, definition of a plurality of vascular terminal positions is based on fully automatic detection (e.g., positions where a vascular skeleton defining vascular centerlines naturally ends), or a semi-automatic method such as positions where a selection line swept out by the user intersects segments of an automatically detected vascular skeletonization.
If a default path is not accepted, in some embodiments, then decreasingly likely (higher cost function scored), automatically suggested paths are optionally presented as available. For example, the user can use a scroll wheel or other control to quickly show alternative paths that extend between some pair of target vascular path end regions.
Failing to find an adequate path among automatically suggested alternatives, in some embodiments, the user is provided with a user interface tool which is operable to define a vascular path based on the definition of one or more additional waypoints.
Additionally or alternatively, one or more editing tools are optionally provided, which allow a nearly-acceptable presented alternative to be modified. For example, a path may be cut, extended, and/or merged with a portion of another existing path. In some embodiments, a path is optionally edited along its length, for example, by re-tracing, redefinition of anchor points, and/or dragging of erroneously segments regions into their correct position.
In some embodiments of the disclosure, a target of the semi-automatic vascular segmentation is the production of one or more vascular paths corresponding to anatomically valid paths of blood flow. In some embodiments, a vascular path comprises a numerically stored sequence of positions corresponding to vascular image positions. In some embodiments, the vascular path comprises a vascular center-line. Optionally, the vascular path is defined at one end by a root position, located at the path end, which is for example, within the least-branched vessel the path traverses. At the other end, the vascular path is optionally defined by a terminal position, which is, for example, located within the most-branched vessel the path traverses.
In some embodiments, vascular paths are defined by the concatenation of one or more vascular segments. Optionally, vascular segments are defined by one or more methods, at one or more levels of fidelity. In some embodiments, a vascular segment may be defined within a skeletonized representation of a vascular image (e.g., a binary pixel-array representation which extends through the detected extent of the vasculature with a one-pixel width). Such a vascular segment optionally comprises a sequence of pixel locations extending between two pixels which mark its end points. The end points are optionally selected by any convenient method, even arbitrarily (e.g., by breaking the skeleton into segments of at most N pixels in length). Preferably, however, vascular segment end points are defined at branches and/or crossings (e.g., skeleton pixels from which branches lead in at least three directions), and/or at free ends (e.g., skeleton pixels from which only one branch leads).
In some embodiments, vascular paths are defined separately from one another. In some embodiments, vascular paths are defined by their different extents along a branched vascular tree (e.g., defined by a particular path of traversing the branches of vascular tree; optionally a vascular tree defined as a set of linked vascular segments). In some embodiments, in contrast, a vascular tree is defined by the merger of a set of vascular paths (e.g., paths which share a common vascular segment are also considered to share a common root segment).
An aspect of some embodiments of the present disclosure relates to methods of selecting vascular paths based on the ordered presentation of automatically generated vascular path options.
In some embodiments of the disclosure, a plurality of path routes extending along detected vascular segments (e.g., vascular segments defined according to criteria of gradient, curvature, and/or relative intensity) are generated for a pair of end regions. Optionally, the generated path routes are those which reach to segment points which are within some region; optionally the region is defined, for example, as the region within some maximum distance from an end-point. This distinction is relevant, for example, in case one of the end points is not itself on a segment.
In some embodiments, the plurality of path routes is presented as a range of vascular path options in a pre-determined order. Optionally, the pre-determined order is based on a cost function constructed to rank path routes according to criteria (optionally, heuristic criteria) that assign more-likely actual paths of blood flow between two end points a lower cost value than less-likely actual paths of blood flow. Preferably, path routes are presented along with image data from which they derive, for example, as graphical overlays on the image. In some embodiments, image data is presented as an animated sequence of images (e.g., images between which the vasculature moves slightly, and/or is viewed from a different angle). Potentially, these differences harness visual capabilities more particular to the user than to the automatic detection algorithm, for example, by emphasizing connectedness among portions of the vasculature which move together.
In some embodiments, cost function criteria include aspects of vascular continuity, vascular branching anatomy, criteria based on the three-dimensional shape of an organ which the vasculature perfuses, vascular image opacity, and/or other criteria.
In some embodiments, automatic segmentation results potentially do not unambiguously distinguish which path, among a plurality of alternative vascular paths between two vascular positions, corresponds to an actual path of blood flow. Particularly in the case of 2-D images of 3-D vascular structures (e.g., vascular structure that is typically visualized extending through two or more layers of depth) branches of the same vascular tree may appear to cross over each other. Although same-tree crossover is seldom observed in structures which are typically imaged within a single focal plane, such as inner retinal vasculature, ambiguities may arise in cases where distinguishing between venous and arterial structures is difficult.
It is noted that dynamic path extending methods, such as Livewire, partially mitigate automatic segmentation ambiguities by allowing the definition of waypoints that can be set to force the automatic result into the correct segmentation. However, this is potentially more time-consuming than simply defining start and end points. In some embodiments, there is a tradeoff between a certain but slow vascular path definition by use of waypoints, and a less certain but potentially faster vascular path definition by selection from among automatically predefined vascular path options.
An aspect of some embodiments of the present disclosure relates to methods of editing vascular paths by dragging an erroneously segmented region into alignment with a more correctly segmented position.
In some embodiments, the method comprises receiving an indication of a selected region along the segmentation of the blood vessel. In some embodiments, the indication comprises a screen coordinate point selection, for example, by pressing a button in conjunction with a particular position of a screen cursor, and/or a gesture input to a touch screen. In some embodiments, the indication comprises directly selecting an erroneously segmented region.
In some embodiments, the method comprises assigning motion susceptibility characteristics to a segmentation path region surrounding the selected region that enable it to be moved, preferably while maintaining the remainder of the segmentation in a state which is not susceptible to movement. In some embodiments, the assigning of susceptibility to motion comprises defining an energy functional defined as a function of position along the segmentation of the blood vessel. Optionally, non-zero regions of the energy functional are set based on the position of the selected region. In some embodiments, the method comprises moving regions of the segmentation in accordance with energy minimization within the non-zero regions of the energy functional.
Optionally, motion of the motion-susceptible portion of the segmentation path region is in coordination with movement of a cursor. Optionally, motion of the motion-susceptible portion is at least partially governed by values and/or gradients of image intensity in vicinity of the selected region, such that the selected region behaves as though attracted to vascular regions as it moves.
Before explaining at least one embodiment of the disclosure in detail, it is to be understood that the example systems, methods, apparatuses, and/or computer program products are not necessarily limited in its application to the details of construction and the arrangement of the components and/or methods set forth in the following description and/or illustrated in the drawings. The example systems, methods, apparatuses, and/or computer program products are capable of other embodiments or of being practiced or carried out in various ways.
Method of Defining Paths Along a Vascular Tree
Reference is now made to
In some embodiments, an editing mode of a computer program configured for interactive vascular path definition via user interaction through a user interface is activated. At block 102, in some embodiments, a root position (corresponding, for example, to root positions 401, 501 of
At block 110, in some embodiments, the defined root position is used as an input for the definition of path data including listing of alternative path options and path option costs, for example as described in relation to
At block 112, in some embodiments, a vascular path representing a path of continuous vascular connection between some point in a vascular tree image and the root position is optionally defined (and/or selected, for example, based on the listing of path alternative path options and path option costs defined at block 110). Examples of the implementation of details of block 112 are described in relation to
At block 114, a vascular path representing a previously defined path of continuous vascular connection between some point in a vascular tree image and the root position is optionally edited. Examples of the implementation of details of block 114 are described in relation to
At block 104, in some embodiments, a determination is made as to whether or not edit mode is continuing; if not the flowchart exits. Otherwise, flow returns to before block 112 (optionally, to before block 102, to allow redefinition of the root position).
Vascular Paths and Cost Functions
Reference is now made to
The flowchart begins; and at block 208, in some embodiments, a vascular skeleton graph 206 is split into branches. In some embodiments, the vascular skeleton graph is derived from image processing of an angiographic image. Images 400 of
At block 208, in some embodiments, the vascular skeleton graph 206 is split into branches. Optionally, this comprises noting pixels at which three or more skeleton segments converge (e.g., pixels with three or more neighbors; optionally, short spurs are excluded from consideration), and assigning these points to be path breaks. Optionally, it is also noted which branches connect to which (connection may be merely apparent, as the branches may also cross one another and/or approach closely enough to appear to merge). The result of the operations of block 208 is branch list 210. It should be noted that the “branches” of branch list 210 are potentially linked into loops, either due to the actual underlying anatomy (for example, the development of shunting vessels), and/or due to apparent connection arising from vascular near approaches and/or crossings at the provided angle and/or resolution of the image.
In some embodiments, branches preserved in the branch list are only those for which a continuously connected route exists to a root position (e.g., root positions 401, 501 of
At block 212, in some embodiments, paths leading from each branch to the defined root position are calculated, for example, by use of a search algorithm. Optionally, there is more than one such path available, for example due to crossings, close approaches, or other ambiguities present in the image, as previously mentioned. Paths that internally include the same vascular segment more than once are optionally excluded from this list (to avoid paths that loop and/or double back on themselves). The data structure resulting from the operations of block 212 comprises path list 214. In some embodiments, path list 214 comprises each non-excluded path identified that extends between the root position and each vascular skeleton segment.
At block 216, in some embodiments, path costs for each path in path list 214 are calculated to produce a path cost list 218. Path cost list 218, in some embodiments, is structured so that members of a potential plurality of paths in path list 214 reaching from any vascular segment to the root can be rank ordered for likelihood of being an actual path of blood flow. Use of path list 214 and/or path cost list 218 is described further in connection with operations of block 112 of
According to a convention adopted herein, higher cost paths are optionally considered less likely as candidates to be an actual path of blood flow in the vascular anatomy. Path cost criteria are optionally evaluated, for example, to receiving a binary value (0 or 1, for example), a ranked value, and/or a score on a continuous scale. Path cost criteria optionally add, multiply, or are otherwise combined into an overall cost function.
In some embodiments, results of machine learning are used to assign criteria cost values, and/or contribution to overall cost relative to other criteria. In some embodiments, a machine learning technique comprises one or more implementations of decision tree learning, association rule learning, an artificial neural network, inductive logic programming, a support vector machine, cluster analysis, Bayesian networks, reinforcement learning, representation learning, similarity and metric learning, and/or a technique related to machine learning. The machine learning is optionally based on a set of angiographic images which have been separately marked for vascular tree morphology, and/or based on results of self-learning.
Cost Criteria
In some embodiments, path costs recorded in the path cost list 218 are calculated with respect to one or more of the following considerations and/or criteria.
Node Type Classification
Herein, vascular skeleton segment connection points are referred to as nodes. Nodes may be defined as single pixels, or optionally, as regions of larger size (e.g., a radius of 2, 3, 4, 5 or more pixels) within which three or more vascular skeleton segments meet. In some embodiments, the overall cost function which is applicable to a node depends at least in part on a node type classification.
Where two vascular segments happen to cross in an image (e.g. due to being in different planes of the heart image), the vascular skeleton will show four branches arising from approximately the region of a central node. The corresponding vascular skeleton is optionally analyzed as defining a crossing-type node. In some embodiments, where a blood vessel branches, bifurcation is typical. In such cases, the node is optionally defined as a junction node from which three vascular skeleton branches arise. Cost function criteria applicable to these two basic node types are optionally differently assigned.
In some embodiments, there are other junction orders which can appear in the path list. For example, a bifurcation may happen to be at the same position as a vascular crossing point. Another situation which potentially arises is where two junction nodes appear so close to one another that they could also be analyzed as four-branched node. Contrariwise, skeletonization artifacts potentially introduce a slight offset to the same blood vessel on either side of a crossing, making it appear more like two adjacent junction-type nodes. Three- and four-branched nodes can also arise where a terminal vascular segment (that is, a vascular segment which is the last segment visible in the image on its branch) happens to have a free end located at or near the position of another vascular segment. Optionally, nodes comprising five, six, or more segments are analyzed as being composed of a suitable combination of junction nodes, crossing nodes, and/or free-end terminations.
In some embodiments, morphological criteria besides branch counts are used in node classification for purposes of cost function assignment. For example, some close sequential bifurcations comprise just one continuously oriented pair of segments, while the other two segments run at a relative sharp angle (e.g., about 90°) relative to one another. In another example, bifurcation angles typically (though not exclusively) display forward-direction (in the direction of arterial flow) acute angles. Backward-branching oblique angles are more likely to signify a crossing-type node. In yet another example, regions of vascular crossings may appear as regions of increased radiopacity (due to the cumulative contribution of two overlapping vascular thicknesses), compared to regions of vascular branching. On the other hand, sudden variations in apparent radiopacity on either side of anode potentially indicate a branching-type node, due to changes in vascular orientation (and corresponding changes in absorbing path length) relative to an axis perpendicular to the plane of the image.
Optionally, for example, for classification of more complex nodes, Murray's principle is applied, wherein rp3=rd
In some embodiments, the appropriate cost function for the node is dependent on which analysis of the node-type is correct. In some embodiments, node-type determination is subject to probabilistic assignment (e.g., a node is assigned an 80% chance of being a crossing of two vessels, a 15% chance of being a double bifurcation (or trifurcation), and a 5% chance of being a bifurcation in the region of the free end of a terminal vascular segment).
In some embodiments, there is no explicit classification made in the cost function between junction-type and crossing-type nodes (or free ends, or combinations of any of these types); rather, heuristics are adopted which operate on the basic relative vascular morphologies as such. This approach may be suitable, for example, for certain types of machine learning-based implementations like artificial neural networks. Nevertheless, node type provides a convenient organizing concept for purposes of explaining further vascular path cost function criteria.
Continuity and/or Consistency at Crossing-Type Nodes
In some embodiments of the disclosure, continuity of vascular morphology at nodes is used as a basis of cost function value assignment.
The convergence of four vascular skeleton branches considered as a potential crossing-type node is optionally analyzed as defining an a priori choice of three directions to continue in (exit-side) from some fourth direction of approach (entrance-side). In some embodiments, one or more criteria relating to continuity of morphology are applied to determine which exit-side branch is the branch of most likely continuation from a given entrance-side.
One such criterion is vascular radius, wherein the exit-side vascular branch, which is most similar in radius to the entrance-side, receives the correspondingly lowest cost assignment. Optionally, vascular radius is measured as half the apparent width of a filled lumen in the image. Optionally continuity of image intensity values (which is partially, but not only, a function of radius) is also taken into account (e.g., by direct comparison of intensity values). Optionally, principles of densitometry are applied: for example, the blood vessel is modeled as cylinder of a certain radius filled with a substance having a particular concentration and/or coefficient of absorption; and the cost function is based jointly on continuity of radius and absorption properties that satisfy observed intensity values in the image.
In some embodiments, continuity of direction is a criterion: the exit-side vascular segment that is most similar in direction to the entrance-side segment optionally receives the correspondingly lowest cost assignment as its continuation. It is noted that densitometry differences can also arise based on the orientation of blood vessels in the direction perpendicular to the plane of the image (e.g., a blood vessel appears darker when seen more nearly end-on). Thus, continuity of vascular intensity values is optionally a proxy for continuity of vascular direction in this dimension.
In some embodiments, these criteria include one or more further refinements. For example, a criterion of direction applied to a junction may optionally comprise a cost assignment based on the continuing rate and/or direction of angle change before and after a node (e.g., continuation between two segments having a more similar radius of curvature receives a lower cost assignment). This is potentially of particular relevance for vascular segments that are rounding a bulge of the 3-D heart surface through a portion of the vascular image. In some embodiments, a criterion of the cost function favors paths along which vascular width monotonically changes (e.g., increasing in the direction of the root).
In some embodiments, paths from segments A, B, C, D meeting at a junction (particularly a crossing-type junction) are treated as “entangled”, such that a low cost for a path leading from A→B corresponding lowers the cost of the path C→D relative to alternative path C→B. Optionally, a definitive indication by a user during some stage of vascular tree drawing that path A→B is a preferred path of vascular flow is similarly entangled to lowering the cost assignment of path C→D compared to C→B.
Continuity and/or Consistency at Branching-Type Nodes
In some embodiments, where a blood vessel branches, bifurcation is typical. Optionally, a greater branch number, such as trifurcation, is treated as being composed of adjacent bifurcations. In a bifurcation, there is optionally defined a junction node at which there is an a priori choice of two directions to continue in (exit-side) from any third direction of approach (entrance-side). In some embodiments, the heuristic is adopted that the exit-side branch which requires the minimal change in direction through the junction node receives the lower cost assignment.
Optionally, cost scoring based on vascular radius similarity is reduced in its influence on the cost function (e.g., by lower weighting) when a three-way junction node is detected, to account for two thin branches being potentially nearer in size to each other than their mutual trunk. Additionally or alternatively, radius-based cost functions are assigned in a different way for branching-type nodes (e.g., the thickest vascular segment (which generally lies in the direction of the root position) is given the lowest cost score for both of the two thinner branches). Optionally, a cost score assignment is more particularly based on Murray's principle, wherein paths that better satisfy this theoretical relationship are given correspondingly lower cost scores.
Other Criteria
In some embodiments, paths using vascular segments which run in relatively straight and/or continuously arcing lines are optionally scored with lower costs. This is a potential advantage for favoring image features that are “more vascular” in character, as opposed to image features which might end up in the vascular skeleton, but are actually non-vascular in origin. Cost is optionally calculated, for example, based on the total area under the curve (above or below zero) of the derivative of the angle of local vascular segment orientation.
In some embodiments, vascular position in three dimensions is estimated. Optionally, use of this information is part of node classification, and/or used in continuity/consistency cost scoring. In some embodiments, a vascular tree is known a priori to extend across a three-dimensionally curved surface, such as a surface defined by the shape of the heart muscle. In some embodiments, parameters of this curved surface are derived from an image shadow delineating boundaries of the shape being followed. In some embodiments, shapes and/or intensities of the vessels themselves identify shape boundaries. For example, as blood vessels curve to be oriented more inwardly/outwardly from the plane of the image, they potentially begin to appear more radiopaque at some boundary limit as they present a longer absorbing cross-section. Vessel rounding a curve in the third dimension may appear to first approach, and then bend away from, some boundary limit in the 2-D image. In some embodiments, a shell is modeled as comprising two portions, generally occupying different depths, but joined together at such a boundary limit. Optionally, vascular segments are scored for their likely position on the overlying or underlying portion of the shell, while treating the boundary limit as a transition zone. Paths which require abrupt transitions between two different shell portions (particularly away from the boundary limit), are optionally given a higher cost value.
Contrariwise, it is noted that vessels of the same type (artery or vein) which occupy the same anatomical plane may be assumed, in some embodiments, to be relatively unlikely to cross over one another. Optionally, where a crossing-type node is identified with high probability (additionally or alternatively, where consistency and continuity suggests a vascular crossing with relatively low associated path cost), this is also used to increase the estimated likelihood that the two different vessels occupy two separated shell portions. Then other vascular segments which directly contact them are also correspondingly more likely to be in the same shell portion, information which is optionally used to disambiguate assignment of path costs across nearby nodes.
Vascular Path Selection and/or Definition
Reference is now made to
In some embodiments of the disclosure, there are provided one or more manually guided methods of confirming, selecting, and/or defining vascular tree topology. In this context, there is introduced an “accepted path list” 324. Accepted path list 324 optionally includes paths selected from path list 214, edited paths based on paths in path list 214, and/or paths generated de novo, for example, on the basis of user input. In some embodiments, path cost list 214 is used in determining default selections from path list 214, and/or an order presentation of additional selections from path list 214, as needed.
In connection with block 212 of
At block 310, in some embodiments, a path terminus is indicated (e.g., by a user). In some embodiments, indication of the path terminus comprises a “hover” cursor input event (e.g., cursor 405 moved into the vicinity of a potential vascular path, and paused long enough to be detected for processing; a long touch on a touch screen, etc.). In some embodiments, another input event indicates the path terminus: for example, a screen tap. In some embodiments, the user indication is referred to a region (e.g., a pixel) on the closest available segment which is represented in path list 214. Optionally, the user indication is referred to the region of the segment which is closest to the position of the indication. For example, vascular path 407 of
For purposes of explanation, the conversion of an indicated path terminus to a path in the accepted path list 324 is primarily presented in terms of manual operations relating to one path at a time. However, it is to be understood that these descriptions also apply, changed as necessary, to the processing of multiple and/or automatically selected paths.
For example, in some embodiments, one or more candidate path termini are detected automatically (for example, at the free ends of vascular skeleton segments which are in continuous connection with the root position 401). Additionally or alternatively, a plurality of path termini are optionally indicated by a user as part of a single input action (e.g., by dragging out a path (by cursor movement, touch input, or otherwise) which crosses among several candidate path termini). The indicated termini are taken as the positions at which the dragged out path intersects segments of the vascular skeleton.
When a plurality of candidate path termini are available, a user is optionally presented with the option to step through candidate path termini (e.g., by a sequence of key presses, finger drags across a touch input screen, scroll wheel movements, or another input), and a selected terminus becomes an indicated path terminus. Optionally, initial paths are defined (and optionally accepted as members of the accepted path list by default) for each of the plurality of candidate path termini.
Upon a first entry into block 311, in some embodiments, the lowest cost available path (based on path cost list 218) from path list 214 that is among those reaching to the indicated path terminus is initially selected for presentation to the user. Optionally, the presentation is differentiated as being active for current definition; for example highlighted with special coloration and/or thickness. It should be noted that although paths from path list 214 are optionally the basis of what is presented, in some embodiments, the actual path shown is derived from an entry in path list 214 by application of an active contour or dynamic “snake” algorithm, for example as described herein.
At block 312, in some embodiments, a user determines if the correct path (suitable for use as a “true” vascular path) has been displayed or not. If yes, then the flowchart optionally proceeds with the user issuing a confirmation input (for example, a double click, screen tap, key press, or other input) at block 316. The currently selected path is then added to the accepted path list 324, and the flowchart exits block 112 of
Otherwise, if in block 312 the correct path has not been displayed, the flowchart continues; optionally to an option selection event at block 314. In some embodiments, the option selection event comprises movement of a scroll wheel, a touch screen gesture (for example, a sliding motion), a key press, or another user input event. Optionally, this selection is interpreted in software as indicating that the current path display should move to another candidate (e.g. the next candidate available in order of cost as defined in path cost list 218). In a variant of the method, a plurality of vascular path candidates are presented simultaneously for a single pair of end points, and the selection is used to indicate which candidate should be drawn as actively selected. A potential advantage of this variant is to allow more rapid realization that no suitable candidate is available, and/or to allow simultaneous comparison of available options.
At block 316, in some embodiments, the user may decide that no pre-defined path of path list 214 is suitable for the currently indicated path terminus, and proceed to block 320 in order to define a new path manually. Otherwise, in some embodiments, the flowchart returns to block 311, at which the newly selected path candidate is shown.
With respect to iteration through blocks 311, 312, and 314, reference is now made to
Finding that the path as intended is unavailable (per block 316), the user optionally proceeds to block 320. With respect to this block, reference is now made to
At
In some embodiments, another method of manually defining a vascular path is used, for example, a variation of the Livewire technique, in which a segment position is optionally drawn live as between clicks defining waypoints (“growing” to meet the cursor position from a previous anchor point), rather than all at once after all waypoints are initially defined.
Active Contour Method for Vascular Paths
In some embodiments of the disclosure, an active contour method, also commonly referred to as a “snake” dynamics method (Kaas et al. 1987) is implemented. In this method, the behavior of the contour, c(s)=(x(s), y(s)), is governed by simulated intrinsic and extrinsic forces that are applied on the contour. These forces are derived from a minimization of an energy functional:
The internal energy term is:
The external energy term Eext(c(s)) is implicitly defined by a force field
As a force field, there is calculated in some embodiments the GGVF field (Xu and Prince, 1998) over a Frangi-filtered grayscale image (Frangi et al., 1998), although in general any force field can be used.
Active Contours for Initial Path Definition
When a vessel is first defined from the vascular path list 214, the initial input may be taken from a concatenation of pixels in vascular skeleton segments that connect along a selected path. Optionally, coordinates actually used in the path are repositioned to fall at uniform intervals along the vascular path length (actual center-to-center distances of pixels themselves may be non-uniform due to alternating movements in diagonal and cardinal directions). Then, as the active contour method iterates, the vascular path positions are drawn into new positions according to the various force and field terms used. Once the path anneals to a sufficiently stable configuration, the force terms are set to zero, and the process stops.
Optionally, when a vessel is defined by sparsely provided anchor points as described, for example, in relation to
Active Contours for Path Editing
Reference is now made to
At block 340, in some embodiments, a user makes a position selection along length s of a displayed vascular path (which, in some embodiments, is a path from accepted path list 324). In some embodiments, the position selection comprises a button press at some selected position of a cursor, a gesture on a touch screen, or another input method. In subsequent operations, the position selection is taken to define a dragging point (e.g., dragging point 519A of
At block 342, in some embodiments, energy terms of α(s), β(s) and/or γ(s) are set to non-zero only for s within a restricted vicinity of the dragging point. Optionally, the external force field of EQU. 3 is defined to comprise an attractor to the current cursor position, or another position defined by further user interface actions by which the user drags the dragging point to a new location.
At block 344, in some embodiments, the energy functionals of (EQu. 2 and EQU. 3) are numerically minimized, which may result in the displayed vascular path (e.g., path 517 of
At block 346, in some embodiments, display of the vascular path 517 is updated.
At block 348, the system determines whether or not the dragging operation is to be ended; for example, based on user input (e.g. release of a button or termination of a touch screen gesture). If not, at block 350 in some embodiments, the user optionally drags the dragging point to a new location, for example, location 519B of
Vascular Path Definitions from a Plurality of Views
Reference is now made to
In some embodiments, vascular image views 400, 500, 600, 610 each present views from different angles of the same vasculature (e.g., a region of a cardiac vasculature). Partially defined vascular path groups 620, 622, and 624 are shown for views 400, 500, and 600. In some embodiments, homology among vascular image features (homologous image features represent the same anatomical location, optionally from different viewpoints) is established at least in part on the basis of structures identified in one or more of the vascular skeleton graph 216, the branch list 210, the path list 214, and or the accepted path list 324. In some embodiments, the accepted path allows identification of homologous vascular features, optionally without detailed 3-D information: for example, based on considerations of branch numbers and/or positions; root positions 611, 601, 501, 401; and/or relative vascular length. Optionally, basic 3-D information (for example, angle of view specified within about 45°, 90°, or another greater or lesser amount) helps in identifications by setting general relative orientation correctly, and/or identifying mirror-image views. In some embodiments, fuller 3-D information is available, for example, vascular centerline positions reconstructed based on stereoscopic projection from two or more images into a common 3-D frame of reference (for example as described in International Patent Publication No. WO2014/111930 to the applicant, filed Jan. 15, 2014, the contents of which are incorporated by reference herein in their entirety). Optionally, vascular paths generated with respect to one image view are transformed so that they can be superimposed on one or more alternative image views, based on the reconstructed 3-D frame of reference. In some embodiments, such transforms of vascular skeleton graphs 216, branch list 210, and/or path list 214 are performed, for example to assist in validating image processing results. For example, missing segment portions in path and/or skeleton data from one image can be filled in from data available in views taken from another image. Conversely, spurious segment portions in one image view are optionally identified, for example, based on their absence and/or lack of connection to the root position in other image views.
Reference is now made to
Blocks 206, 210, 214, and 218, in some embodiments, comprise data structures generated and/or used by the software modules of the system 702. They correspond, for example, to the correspondingly numbered blocks of
Block 703, in some embodiments, comprises a vascular skeletonizer, configured for producing a skeletonized representation of vascular segments (skeleton graph), for example as described in relation to block 206 of
Block 705, in some embodiments, comprises a path option manager. In some embodiments, path option manager 705 comprises software functions for implementing operations of blocks 208, 212, and/or 216 of
Editing module 710, in some embodiments, comprises sub-modules for handling, for example, operations described in connection with
In some embodiments, system 702 additionally comprises display 760 and/or input device(s) 770.
As used herein with reference to quantity or value, the term “about” means “within ±10% of”.
The terms “comprises”, “comprising”, “includes”, “including”, “having” and their conjugates mean: “including but not limited to”.
The term “consisting of” means: “including and limited to”.
The term “consisting essentially of” means that the composition, method or structure may include additional ingredients, steps and/or parts, but only if the additional ingredients, steps and/or parts do not materially alter the basic and novel characteristics of the claimed composition, method or structure.
As used herein, the singular form “a”, “an” and “the” include plural references unless the context clearly dictates otherwise. For example, the term “a compound” or “at least one compound” may include a plurality of compounds, including mixtures thereof.
The words “example” and “exemplary” are used herein to mean “serving as an example, instance or illustration”. Any embodiment described as an “example” or “exemplary” is not necessarily to be construed as preferred or advantageous over other embodiments and/or to exclude the incorporation of features from other embodiments.
The word “optionally” is used herein to mean “is provided in some embodiments and not provided in other embodiments”. Any particular embodiment of the disclosure may include a plurality of “optional” features except insofar as such features conflict.
As used herein the term “method” refers to manners, means, techniques and procedures for accomplishing a given task including, but not limited to, those manners, means, techniques and procedures either known to, or readily developed from known manners, means, techniques and procedures by practitioners of the chemical, pharmacological, biological, biochemical and medical arts.
As used herein, the term “treating” includes abrogating, substantially inhibiting, slowing or reversing the progression of a condition, substantially ameliorating clinical or aesthetical symptoms of a condition or substantially preventing the appearance of clinical or aesthetical symptoms of a condition.
Throughout this application, embodiments of this disclosure may be presented with reference to a range format. It should be understood that the description in range format is merely for convenience and brevity and should not be construed as an inflexible limitation on the scope of the disclosure. Accordingly, the description of a range should be considered to have specifically disclosed all the possible subranges as well as individual numerical values within that range. For example, description of a range such as “from 1 to 6” should be considered to have specifically disclosed subranges such as “from 1 to 3”, “from 1 to 4”, “from 1 to 5”, “from 2 to 4”, “from 2 to 6”, “from 3 to 6”, etc.; as well as individual numbers within that range, for example, 1, 2, 3, 4, 5, and 6. This applies regardless of the breadth of the range.
Whenever a numerical range is indicated herein (for example “10-15”, “10 to 15”, or any pair of numbers linked by these another such range indication), it is meant to include any number (fractional or integral) within the indicated range limits, including the range limits, unless the context clearly dictates otherwise. The phrases “range/ranging/ranges between” a first indicate number and a second indicate number and “range/ranging/ranges from” a first indicate number “to”, “up to”, “until” or “through” (or another such range-indicating term) a second indicate number are used herein interchangeably and are meant to include the first and second indicated numbers and all the fractional and integral numbers therebetween.
Although the example systems, methods, apparatuses, and/or computer program products have been described in conjunction with specific embodiments thereof, it is evident that many alternatives, modifications and variations will be apparent to those skilled in the art. Accordingly, it is intended to embrace all such alternatives, modifications and variations that fall within the spirit and broad scope of the appended claims.
All publications, patents and patent applications mentioned in this specification are herein incorporated in their entirety by reference into the specification, to the same extent as if each individual publication, patent or patent application was specifically and individually indicated to be incorporated herein by reference. In addition, citation or identification of any reference in this application shall not be construed as an admission that such reference is available as prior art to the present disclosure. To the extent that section headings are used, they should not be construed as necessarily limiting.
It is appreciated that certain features of the example systems, methods, apparatuses, and/or computer program products, which are, for clarity, described in the context of separate embodiments, may also be provided in combination in a single embodiment. Conversely, various features of the systems, methods, apparatuses, and/or computer program products, which are, for brevity, described in the context of a single embodiment, may also be provided separately or in any suitable subcombination or as suitable in any other described embodiment of the disclosure. Certain features described in the context of various embodiments are not to be considered essential features of those embodiments, unless the embodiment is inoperative without those elements.
The present application is a continuation of U.S. patent application Ser. No. 16/600,871, filed on Oct. 14, 2019, which is a divisional application of U.S. patent application Ser. No. 15/959,024, filed on Apr. 20, 2018, now U.S. Pat. No. 10,441,235, which is a continuation application of International Application No. PCT/IL2017/050544, filed on May 16, 2017, which claims priority to U.S. Provisional Patent Application No. 62/336,848, filed May 16, 2016, the entire contents of each of which are incorporated herein by reference and relied upon.
Number | Name | Date | Kind |
---|---|---|---|
5150292 | Hoffmann et al. | Sep 1992 | A |
5638823 | Akay et al. | Jun 1997 | A |
6047080 | Chen et al. | Apr 2000 | A |
6236878 | Taylor et al. | May 2001 | B1 |
6842638 | Suri et al. | Jan 2005 | B1 |
7113623 | Chen et al. | Sep 2006 | B2 |
7339585 | Verstraelen et al. | Mar 2008 | B2 |
7369691 | Kondo et al. | May 2008 | B2 |
7574026 | Rasche et al. | Aug 2009 | B2 |
7657299 | Huizenga et al. | Feb 2010 | B2 |
7693315 | Krishnan et al. | Apr 2010 | B2 |
7738626 | Weese | Jun 2010 | B2 |
7808503 | Duluk, Jr. et al. | Oct 2010 | B2 |
7864997 | Aben | Jan 2011 | B2 |
7912260 | Breeuwer et al. | Mar 2011 | B2 |
7970187 | Puts et al. | Jun 2011 | B2 |
8073224 | Strobel et al. | Dec 2011 | B2 |
8086000 | Weijers et al. | Dec 2011 | B2 |
8090164 | Bullitt et al. | Jan 2012 | B2 |
8155411 | Hof et al. | Apr 2012 | B2 |
8298147 | Huennekens et al. | Oct 2012 | B2 |
8311748 | Taylor et al. | Nov 2012 | B2 |
8311750 | Taylor | Nov 2012 | B2 |
8315812 | Taylor | Nov 2012 | B2 |
8321150 | Taylor | Nov 2012 | B2 |
8331314 | Quiang et al. | Dec 2012 | B2 |
8496594 | Taylor et al. | Jul 2013 | B2 |
8523779 | Taylor et al. | Sep 2013 | B2 |
8548778 | Hart et al. | Oct 2013 | B1 |
8554490 | Tang et al. | Oct 2013 | B2 |
8560968 | Nair | Oct 2013 | B1 |
8768669 | Hart et al. | Jul 2014 | B1 |
8771195 | Kim et al. | Jul 2014 | B2 |
8787641 | Hof et al. | Jul 2014 | B2 |
8812246 | Taylor | Aug 2014 | B2 |
8824752 | Fonte et al. | Sep 2014 | B1 |
8837860 | Grady et al. | Sep 2014 | B1 |
8861820 | Fonte et al. | Oct 2014 | B2 |
8917925 | Grady et al. | Dec 2014 | B1 |
8970578 | Voros et al. | Mar 2015 | B2 |
9008405 | Fonte et al. | Apr 2015 | B2 |
9042613 | Spilker et al. | May 2015 | B2 |
9070214 | Grady et al. | Jun 2015 | B1 |
9078564 | Taylor | Jul 2015 | B2 |
9087147 | Fonte | Jul 2015 | B1 |
9129418 | Schormans et al. | Sep 2015 | B2 |
9138147 | Schmitt et al. | Sep 2015 | B2 |
9153047 | Grady et al. | Oct 2015 | B1 |
9189600 | Spilker et al. | Nov 2015 | B2 |
9256936 | Jacobs et al. | Feb 2016 | B2 |
9314584 | Riley et al. | Apr 2016 | B1 |
9375191 | Verstraelen et al. | Jun 2016 | B2 |
9406141 | Kelm et al. | Aug 2016 | B2 |
9430827 | Kelm et al. | Aug 2016 | B2 |
9466117 | Habets et al. | Oct 2016 | B2 |
9471999 | Ishii et al. | Oct 2016 | B2 |
9572495 | Schmitt et al. | Feb 2017 | B2 |
9576360 | Schormans et al. | Feb 2017 | B2 |
9613186 | Fonte | Apr 2017 | B2 |
9615755 | Riley et al. | Apr 2017 | B2 |
9633454 | Lauritsch et al. | Apr 2017 | B2 |
9646361 | Koo et al. | May 2017 | B2 |
9743835 | Taylor | Aug 2017 | B2 |
9754082 | Taylor et al. | Sep 2017 | B2 |
9786068 | Ishii et al. | Oct 2017 | B2 |
9814433 | Benishti et al. | Nov 2017 | B2 |
9858387 | Lavi et al. | Jan 2018 | B2 |
9870634 | Grady et al. | Jan 2018 | B2 |
9888896 | Lauritsch et al. | Feb 2018 | B2 |
9934566 | Sun et al. | Apr 2018 | B2 |
9940736 | Ishii et al. | Apr 2018 | B2 |
9943233 | Lavi et al. | Apr 2018 | B2 |
9965873 | Grady et al. | May 2018 | B2 |
9968256 | Taokowsky et al. | May 2018 | B2 |
9977869 | Lavi et al. | May 2018 | B2 |
9999361 | Sharma et al. | Jun 2018 | B2 |
10141074 | Lavi et al. | Nov 2018 | B2 |
10143390 | Ledoux et al. | Dec 2018 | B2 |
10159529 | Taylor | Dec 2018 | B2 |
10176575 | Isgum et al. | Jan 2019 | B2 |
10210956 | Lavi et al. | Feb 2019 | B2 |
10219704 | Lavi et al. | Mar 2019 | B2 |
10229516 | Aben et al. | Mar 2019 | B2 |
10235796 | Aben et al. | Mar 2019 | B2 |
10245001 | Redel et al. | Apr 2019 | B2 |
10342442 | Hattangadi et al. | Jul 2019 | B2 |
10354744 | Sharma et al. | Jul 2019 | B2 |
10360674 | Contini et al. | Jul 2019 | B2 |
10363018 | Fukuda et al. | Jul 2019 | B2 |
10373700 | Sharma et al. | Aug 2019 | B2 |
10376165 | Lavi et al. | Aug 2019 | B2 |
10395366 | Isgum et al. | Aug 2019 | B2 |
10395774 | Lavi et al. | Aug 2019 | B2 |
10420610 | Bai et al. | Sep 2019 | B2 |
10424063 | Lavi et al. | Sep 2019 | B2 |
10441235 | Lavi et al. | Oct 2019 | B2 |
10441239 | Abe | Oct 2019 | B2 |
10456094 | Fonte et al. | Oct 2019 | B2 |
10463336 | Itu et al. | Nov 2019 | B2 |
10470730 | Benishti et al. | Nov 2019 | B2 |
10559388 | Lavi et al. | Feb 2020 | B2 |
10595807 | Lavi et al. | Mar 2020 | B2 |
10631737 | Lavi et al. | Apr 2020 | B2 |
10636146 | Zhong et al. | Apr 2020 | B2 |
10650522 | Hoi et al. | May 2020 | B2 |
10682180 | Taylor | Jun 2020 | B2 |
10733792 | Aben et al. | Aug 2020 | B2 |
10740961 | Reiber et al. | Aug 2020 | B2 |
10748285 | Igarashi et al. | Aug 2020 | B2 |
10803994 | Lavi et al. | Oct 2020 | B2 |
10803995 | Sharma et al. | Oct 2020 | B2 |
10828109 | Redel | Nov 2020 | B2 |
10964071 | Grady et al. | Mar 2021 | B2 |
11004198 | Isgum et al. | May 2021 | B2 |
11017531 | Harish et al. | May 2021 | B2 |
11031136 | Grass et al. | Jun 2021 | B2 |
11055845 | Nickisch et al. | Jul 2021 | B2 |
11076770 | Lavi et al. | Aug 2021 | B2 |
11081237 | Lavi et al. | Aug 2021 | B2 |
11083524 | Taylor | Aug 2021 | B2 |
11087884 | Sankaran et al. | Aug 2021 | B2 |
11090118 | Taylor | Aug 2021 | B2 |
11116575 | Taylor | Sep 2021 | B2 |
11138733 | Lavi et al. | Oct 2021 | B2 |
11141123 | Homann et al. | Oct 2021 | B2 |
11160524 | Lavi et al. | Nov 2021 | B2 |
11179043 | Haase et al. | Nov 2021 | B2 |
11185368 | Spilker et al. | Nov 2021 | B2 |
11195278 | Nickisch et al. | Dec 2021 | B2 |
11202612 | Sakaguchi | Dec 2021 | B2 |
11272845 | Cheline et al. | Mar 2022 | B2 |
11278208 | Lavi et al. | Mar 2022 | B2 |
11282170 | Gauriau et al. | Mar 2022 | B2 |
11288813 | Grady et al. | Mar 2022 | B2 |
11295864 | Benishti et al. | Apr 2022 | B2 |
11298187 | Taylor | Apr 2022 | B2 |
11304665 | Sharma et al. | Apr 2022 | B2 |
11328824 | Fonte | May 2022 | B2 |
11375904 | Igarashi | Jul 2022 | B2 |
11382569 | Grady et al. | Jul 2022 | B2 |
11398029 | Grady et al. | Jul 2022 | B2 |
11406337 | Lavi et al. | Aug 2022 | B2 |
11423532 | Takahashi et al. | Aug 2022 | B2 |
11424036 | Fonte et al. | Aug 2022 | B2 |
11424038 | Grady et al. | Aug 2022 | B2 |
11443428 | Petersen et al. | Sep 2022 | B2 |
11482339 | Koo et al. | Oct 2022 | B2 |
11490867 | Homann et al. | Nov 2022 | B2 |
11501485 | Grady et al. | Nov 2022 | B2 |
11521755 | Taylor et al. | Dec 2022 | B2 |
11523744 | Freiman et al. | Dec 2022 | B2 |
11538161 | Wang et al. | Dec 2022 | B2 |
11557036 | Liao et al. | Jan 2023 | B2 |
11557069 | Senzig et al. | Jan 2023 | B2 |
11559274 | Auvray et al. | Jan 2023 | B2 |
11564746 | Spilker et al. | Jan 2023 | B2 |
11564748 | Thienphrapa et al. | Jan 2023 | B2 |
11576621 | Sharma et al. | Feb 2023 | B2 |
11576626 | Fonte et al. | Feb 2023 | B2 |
11576637 | Schmitt et al. | Feb 2023 | B2 |
11583340 | Taylor | Feb 2023 | B2 |
11610318 | Grady et al. | Mar 2023 | B2 |
11615894 | Lavi et al. | Mar 2023 | B2 |
11617620 | Tran et al. | Apr 2023 | B2 |
11638609 | Sankaran et al. | May 2023 | B2 |
11642171 | Jaquet et al. | May 2023 | B2 |
11653833 | Sanders et al. | May 2023 | B2 |
11666236 | Lavi et al. | Jun 2023 | B2 |
11688502 | Anderson et al. | Jun 2023 | B2 |
11690518 | Haase et al. | Jul 2023 | B2 |
11694339 | Schormans et al. | Jul 2023 | B2 |
11707196 | Lavi et al. | Jul 2023 | B2 |
11710569 | Grass et al. | Jul 2023 | B2 |
11728037 | Lavi et al. | Aug 2023 | B2 |
11744544 | Sheehan et al. | Sep 2023 | B2 |
20030105401 | Jago et al. | Jun 2003 | A1 |
20040019264 | Suurmond et al. | Jan 2004 | A1 |
20040066958 | Chen et al. | Apr 2004 | A1 |
20050043614 | Huizenga et al. | Feb 2005 | A1 |
20050249327 | Wink et al. | Nov 2005 | A1 |
20050272992 | O'Donnell et al. | Dec 2005 | A1 |
20060036167 | Shina | Feb 2006 | A1 |
20060084862 | Suurmond et al. | Apr 2006 | A1 |
20070031019 | Lesage et al. | Feb 2007 | A1 |
20070167833 | Redel et al. | Jul 2007 | A1 |
20080020362 | Cotin et al. | Jan 2008 | A1 |
20080187199 | Gulsun | Aug 2008 | A1 |
20080205722 | Schaefer et al. | Aug 2008 | A1 |
20090016483 | Kawasaki et al. | Jan 2009 | A1 |
20090171321 | Callaghan | Jul 2009 | A1 |
20090312648 | Zhang et al. | Dec 2009 | A1 |
20100010428 | Yu et al. | Jan 2010 | A1 |
20100017171 | Spilker et al. | Jan 2010 | A1 |
20100021025 | Hof et al. | Jan 2010 | A1 |
20100067760 | Zhang et al. | Mar 2010 | A1 |
20100125197 | Fishel | May 2010 | A1 |
20100160764 | Steinberg et al. | Jun 2010 | A1 |
20100220917 | Steinberg et al. | Sep 2010 | A1 |
20100296709 | Ostrovsky-Berman | Nov 2010 | A1 |
20100298719 | Thrysoe et al. | Nov 2010 | A1 |
20110015530 | Misawa | Jan 2011 | A1 |
20110096907 | Mohamed | Apr 2011 | A1 |
20110134433 | Yamada | Jun 2011 | A1 |
20110135175 | Ostrovsky-Berman et al. | Jun 2011 | A1 |
20110142313 | Pack et al. | Jun 2011 | A1 |
20110182492 | Grass et al. | Jul 2011 | A1 |
20120014574 | Ferschel et al. | Jan 2012 | A1 |
20120041318 | Taylor | Feb 2012 | A1 |
20120041739 | Taylor | Feb 2012 | A1 |
20120053918 | Taylor | Mar 2012 | A1 |
20120053919 | Taylor | Mar 2012 | A1 |
20120053921 | Taylor | Mar 2012 | A1 |
20120059246 | Taylor | Mar 2012 | A1 |
20120059249 | Verard et al. | Mar 2012 | A1 |
20120062841 | Stetson et al. | Mar 2012 | A1 |
20120072190 | Sharma et al. | Mar 2012 | A1 |
20120150048 | Kang et al. | Jun 2012 | A1 |
20120177275 | Suri | Jul 2012 | A1 |
20120230565 | Steinberg et al. | Sep 2012 | A1 |
20120236032 | Arvidsson | Sep 2012 | A1 |
20120243761 | Senzig et al. | Sep 2012 | A1 |
20130060133 | Kassab et al. | Mar 2013 | A1 |
20130094745 | Sundar | Apr 2013 | A1 |
20130158476 | Olson | Jun 2013 | A1 |
20130226003 | Edic et al. | Aug 2013 | A1 |
20130229621 | Stetson et al. | Sep 2013 | A1 |
20130324842 | Mittal et al. | Dec 2013 | A1 |
20140005535 | Edic et al. | Jan 2014 | A1 |
20140086461 | Yao et al. | Mar 2014 | A1 |
20140094693 | Cohen et al. | Apr 2014 | A1 |
20140100451 | Tolkowsky et al. | Apr 2014 | A1 |
20140121513 | Tolkowsky et al. | May 2014 | A1 |
20140142398 | Patil et al. | May 2014 | A1 |
20140200867 | Lavi et al. | Jul 2014 | A1 |
20140303495 | Fonte et al. | Oct 2014 | A1 |
20140371578 | Auvray et al. | Dec 2014 | A1 |
20150201897 | Kyriakou | Jul 2015 | A1 |
20150265162 | Lavi | Sep 2015 | A1 |
20150302578 | Grady et al. | Oct 2015 | A1 |
20150335304 | Lavi et al. | Nov 2015 | A1 |
20150339847 | Benishti | Nov 2015 | A1 |
20150342551 | Lavi et al. | Dec 2015 | A1 |
20160007945 | Taylor | Jan 2016 | A1 |
20160022371 | Sauer et al. | Jan 2016 | A1 |
20160073928 | Soper et al. | Mar 2016 | A1 |
20160110866 | Taylor | Apr 2016 | A1 |
20160110867 | Taylor | Apr 2016 | A1 |
20160128661 | Taylor | May 2016 | A1 |
20160157802 | Anderson | Jun 2016 | A1 |
20160228000 | Spaide | Aug 2016 | A1 |
20160247279 | Lavi | Aug 2016 | A1 |
20160371456 | Taylor et al. | Dec 2016 | A1 |
20170018116 | Sun et al. | Jan 2017 | A1 |
20170039736 | Aben et al. | Feb 2017 | A1 |
20170224418 | Boettner et al. | Aug 2017 | A1 |
20170286628 | Shim | Oct 2017 | A1 |
20170325770 | Edic et al. | Nov 2017 | A1 |
20180032653 | Aben et al. | Feb 2018 | A1 |
20180075221 | Vergaro et al. | Mar 2018 | A1 |
20180089829 | Zhong et al. | Mar 2018 | A1 |
20180182096 | Grady et al. | Jun 2018 | A1 |
20180235561 | Lavi et al. | Aug 2018 | A1 |
20180243033 | Tran et al. | Aug 2018 | A1 |
20180268941 | Lavi et al. | Sep 2018 | A1 |
20180330507 | Schormans et al. | Nov 2018 | A1 |
20180344173 | Tu et al. | Dec 2018 | A1 |
20180344174 | Schmitt et al. | Dec 2018 | A9 |
20190005737 | Auvray et al. | Jan 2019 | A1 |
20190019347 | Auvray et al. | Jan 2019 | A1 |
20200126229 | Lavi et al. | Apr 2020 | A1 |
20200337664 | Homann et al. | Oct 2020 | A1 |
20210244475 | Taylor | Aug 2021 | A1 |
20210267690 | Taylor | Sep 2021 | A1 |
20210272030 | Sankaran et al. | Sep 2021 | A1 |
20210282860 | Taylor | Sep 2021 | A1 |
20210334963 | Isgum et al. | Oct 2021 | A1 |
20210358634 | Sankaran et al. | Nov 2021 | A1 |
20210361174 | Lavi et al. | Nov 2021 | A1 |
20210375474 | Lavi et al. | Dec 2021 | A1 |
20210401400 | Sheehan et al. | Dec 2021 | A1 |
20220028080 | Lavi et al. | Jan 2022 | A1 |
20220079455 | Haase et al. | Mar 2022 | A1 |
20220079540 | Sankaran et al. | Mar 2022 | A1 |
20220079563 | Kemp | Mar 2022 | A1 |
20220087544 | Schmitt et al. | Mar 2022 | A1 |
20220110687 | Spilker et al. | Apr 2022 | A1 |
20220167938 | Grass et al. | Jun 2022 | A1 |
20220211280 | Lavi et al. | Jul 2022 | A1 |
20220211439 | Sankaran et al. | Jul 2022 | A1 |
20220230312 | Choi et al. | Jul 2022 | A1 |
20220233081 | Cheline et al. | Jul 2022 | A1 |
20220277447 | Wang et al. | Sep 2022 | A1 |
20220285034 | Lavi et al. | Sep 2022 | A1 |
20230084748 | Lavi et al. | Mar 2023 | A1 |
20230148977 | Fonte et al. | May 2023 | A1 |
20230196582 | Grady et al. | Jun 2023 | A1 |
20230197286 | Grady et al. | Jun 2023 | A1 |
20230277247 | Taylor et al. | Sep 2023 | A1 |
20230282365 | Lavi et al. | Sep 2023 | A1 |
20230298176 | Choi et al. | Sep 2023 | A1 |
20230346236 | Lavi et al. | Nov 2023 | A1 |
Number | Date | Country |
---|---|---|
2010298333 | Jan 2012 | AU |
104282009 | Jan 2015 | CN |
1396274 | Mar 2004 | EP |
2163272 | Mar 2010 | EP |
2633815 | Sep 2013 | EP |
2779907 | Sep 2014 | EP |
2873371 | May 2015 | EP |
3125764 | Feb 2017 | EP |
2633815 | Jun 2017 | EP |
3363350 | Aug 2018 | EP |
3460688 | Mar 2019 | EP |
2776960 | Sep 2021 | EP |
3534372 | Sep 2021 | EP |
3282380 | Nov 2021 | EP |
3282381 | Nov 2021 | EP |
3903672 | Nov 2021 | EP |
3664026 | Feb 2022 | EP |
3076854 | Apr 2022 | EP |
3979259 | Apr 2022 | EP |
3258446 | May 2022 | EP |
3298959 | Sep 2022 | EP |
3157411 | Dec 2022 | EP |
3606437 | Dec 2022 | EP |
4145391 | Mar 2023 | EP |
3169237 | Apr 2023 | EP |
3403582 | Jun 2023 | EP |
H08-131429 | May 1996 | JP |
2003-508152 | Mar 2003 | JP |
2003-514600 | Apr 2003 | JP |
2004-243117 | Sep 2004 | JP |
2007-502644 | Feb 2007 | JP |
2007-325920 | Dec 2007 | JP |
4177217 | Nov 2008 | JP |
4177217 | Nov 2008 | JP |
2010-042247 | Feb 2010 | JP |
2011-212314 | Oct 2011 | JP |
2013-090799 | May 2013 | JP |
2010-505493 | Jul 2013 | JP |
2013-534154 | Sep 2013 | JP |
2014-064915 | Apr 2014 | JP |
2015-527901 | Sep 2015 | JP |
2016-509501 | Mar 2016 | JP |
2012324 | Aug 2015 | NL |
WO 200121057 | Mar 2001 | WO |
WO 2007066249 | Jun 2007 | WO |
WO 2010033971 | Mar 2010 | WO |
WO 2011038044 | Mar 2011 | WO |
WO 2012021037 | Feb 2012 | WO |
WO 2012021307 | Feb 2012 | WO |
WO 2012173697 | Dec 2012 | WO |
WO 2014027692 | Feb 2014 | WO |
WO 2014064702 | May 2014 | WO |
WO 2014111927 | Jul 2014 | WO |
WO 2014111929 | Jul 2014 | WO |
WO 2014111930 | Jul 2014 | WO |
WO 2015059706 | Apr 2015 | WO |
WO 2017199245 | Nov 2017 | WO |
WO 2017199246 | Nov 2017 | WO |
WO 2018165478 | Sep 2018 | WO |
Entry |
---|
Y. Jiang, Z. Zhuang, A. J. Sinusas and X. Papademetris, “Vascular tree reconstruction by minimizing a physiological functional cost,” 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition—Workshops, San Francisco, CA, USA, 2010, pp. 178-185, doi: 10.1109/CVPRW.2010.5543593 (Year: 2010). |
Machine translation of JP 4177217 B2 (Year: 2008). |
Machine translation of CN104282009A (Year: 2015). |
Abraham et al., “Alternative routes in road networks”, ACM Journal of Experimental Algorithmics, Association of Computing Machinery, vol. 18(1):1.3:2-1.3:17 (2013). |
Andriotis et al., “A new method of three-dimensional coronary artery reconstruction from X-Ray angiography: Validation against a virtual phantom and multislice computed tomography”, Catheterization and Cardiovascular Interventions, vol. 71:28-43 (2008). |
Barratt et al., “Reconstruction and quantification of the carotid artery bifurcation from 3-D ultrasound images”, IEEE Transactions on Medical Imaging, vol. 23(5):567-583 (2004). |
Bullitt et al., “Determining malignancy of brain tumors by analysis of vessel shape”, Medical Image Computing and Computer-Assisted Intervention, MICCAI 2004 Conference Proceedings, Lecture notes in Computer Science, LNCS, 3217:645-653. |
Caiati et al., “New noninvasive method for coronary flow reserve assessment: Contrast-enhanced transthoracic second harmonic echo doppler”, Circulation, vol. 99:771-778 (1999). |
Caiati et al., “Detection, location, and severity assessment of left anterior descneding coronary artery stenoses by means of contrast-enhanced transthoracic harmonic echo dopper”, European Heart Journal, vol. 30:1797-1806 (2009). |
Chung, “Image segmentation methods for detecting blood vessels in angiography”, 2006 9th International Conference on Control, Automation, Robotics and Vision, Singapore, pp. 1-6 (2006). |
Dickie et al., “Live-vessel: interactive vascular image segmentation with simultaneous extraction of optimal medial and boundary paths”, Technical Report TR 2009-23, School of Computing Science, Simon Fraser University, Burnaby, BC, Canada, Nov. 2009. |
Frangi et al., “Multiscale vessel and enhancement filtering”, Medical Image Computing and Computer-Assisted Intervention, MICCA '98 Lecture Notes in Computer Science, vol. 1496:130-137 (1998). |
Fraz, “Blood vessel segmentation methodologies, in retinal images—a survey”, Computer Methods and Programs in Biomedicine, vol. 108:407-433 (2012). |
Fusejima, “Noninvasive measurement of coronary artery blood flow using combined two-dimensional and doppler echocardiography”, JACC vol. 10(5):1024-1031 (1987). |
Hawkes et al., “Validation of volume blood flow measurements using three-dimensional distance-concentration functions detived from digital X-Ray angiograms”, Investigative Radiology, vol. 29(4):434-442 (1994). |
Hoffmann et al., “Determination of instantaneous and average blood flow rates from digital angiograms of vessel phantoms using distance-density curves”, Investigative Radiology, vol. 26(3):207-212 (1991). |
Holdsworth et al., “Quantitative angiographic blood-flow measurement using pulsed intra-arterial injection”, Medical Physics, vol. 26(10):2168-2175 (1999). |
Huo et al., “Intraspecific scaling laws of vascular trees”, J.R. Soc. Interface vol. 9:190-200 (2012). |
Janssen et al., “New approaches for the assessment of vessel sizes in quantitative (cardio-)vascular X-ray analysis”, Int J Cardiovasc Imaging vol. 26:259-271 (2010). |
Kappetein et al., “Current percutaneous coronary intervention and coronary artery bypass grafting practices for three-vessel and left main coronary artery disease: Insights from the SYNTAX run-in phase”, European Journal of Cardio-Thoracic Surgery, vol. 29:486-491 (2010). |
Kass et al., “Snakes: active contour models”, Int. J. Comput. Vis. vol. 1:321-331 (1987). |
Kirkeeide, “Coronary obstructions, morphology and physiologic significance”, Quantitative Coronary Arteriography, Chap. 11:229-244 (1991). |
Lethen et al., “Validation of noninvasive assessment of coronary flow velocity reserve in the right coronary artery—A comparison of transthoracic echocardiographic results with intracoronary doppler flow wire measurements”, European Heart Journal, vol. 24:1567-1575 (2003). |
Li et al, “Minimization of region-scalable fitting energy for image segmentation”, in IEEE Transactions on Image Processing, vol. 17(10):1940-1949 (2008). |
Meimoun et al., “Non-invasive assessment of coronary flow and coronary flow reserve by transthoracic doppler echocardiography: a magic tool for the real world”, European Journal of Echocardiography, vol. 9:449-457 (2008). |
Mercer-Rosa et al., “Illustration of the additional value of real-time 3-dimensional echocardiography to conventional transthoracic and transesophageal 2-dimensional echocardiography in imaging muscular ventricular septal defects: does this have any impact on individual patient treatment”, Journal of the American Society of Echocardiography, vol. 19(12):1511-1519 (2006). |
Molloi et al., “Quantification of fractional flow reserve using angiographic image data”, World Congress on Medical Physics and Biomedical Engineering, Munich, Germany, Sep. 7-12, 2009. |
Molloi et al., “Estimation of coronary artery hyperemic blood flow based on arterial lumen volume using angiographic images”, Int J Cardiovasc Imaging, vol. 28:1-11 (2012). |
Ng et al., “Novel QCA methodologies and angiographic scores”, Int J Cardiovasc Imaging vol. 27:157-165 (2011). |
Pellot et al, “A 3D reconstruction of vascular structures from two X-Ray angiograms using an adapted simulated annealing algorithm”, IEEE Transactions of Medical Imaging, vol. 13(1):48-60 (1994). |
Pinho et al., “Assessment and stenting of tracheal stenosis using deformable shape models”, Medical Image Analysis, vol. 15(2):250-266 (2010). |
Polytimi et al., “Close to transplant renal artery stenosis and percutaneous transluminal treatment”, Journal of Transplantation, vol. 2011, 7 pages (2011). |
Sarwal et al., “3-D reconstruction of coronary arteries”, Proceedings of the 16th Annual Intl. Conference of the IEEE Engineering in Medicine and Biology Society, Engineering Advances: New Opportunities for Biomedical Engineers, Nov. 3, 1994, pp. 504-505. |
Seifalian et al., “A new algorithm for deriving pulsatile blood flow waveforms tested using simulated dynamic angiographic data”, Neuroradiology, vol. 31:263-269 (1989). |
Seifalian et al., “Blood flow measurements using 3D distance-concentration functions derived from digital x-ray angiograms”, Cardiovascular Imaging, Chap. 33:425-442 (1996). |
Seifalian et al., “Validation of a quantitative radiographic technique to estimate pulsatile blood flow waveforms using digital subtraction angiographic data”, Journal of Biomedical Engineering, vol. 13(3):225-233 (1991). |
Shang et al., “Vascular active contour for vessel tree segmentation”, in IEEE Transactions on Biomedical Engineering, vol. 58(4):1023-1032 (2011). |
Shpilfoygel et al., “Comparison of methods for instantaneous angiographic blood flow measurement”, Medical Physics, vol. 26(6):862-871 (1999). |
Sianos et al., “The SYNTAX score: an angiographic tool grading the complexity of coronary artery disease”, Euro Intervention, vol. 1(2):219-227 (2005). |
Siogkas et al., “Quantification of the effect of percutaneous coronary angioplasty on a stenosed right coronary artery”, 2010 10th IEEE Intl. Conference on Information Technology and Applications in Biomedicine, November 3-5, 210, pp. 1-4 (2010). |
Slomka et al., “Fully automated wall motion and thickening scoring system for myocardial perfusion SPECT: Method development and validation in large population”, Journal of Nuclear Cardiology, vol. 19(2):291-302 (2012). |
Sprague et al., “Coronary x-ray angiographic reconstruction and image orientation”, Medical Physics, vol. 33(3):707-718 (2006). |
Sun et al., “Coronary CT angiography: current status and continuing challenges”, The British Journal of Radiology, vol. 85:495-510 (2012). |
Takarada et al., “An angiographic technique for coronary fractional flow reserve measurement: in vivo validation”, International Journal of Cardiovascular Imaging, published online pp. 1-10, Aug. 31, 2012. |
Termeer et al., “Visualization of myocardial perfusion derived from coronary anatomy”, IEEE Transactions on Visualization and Computer Graphics, vol. 14(6):1595-1602 (2008). |
Tomasello et al., “Quantitative coronary angiography in the interventional cardiology”, Advances in the Diagnosis of Coronary Atherosclerosis, Chap. 14:255-272 (2011). |
Tu et al., Assessment of obstruction length and optimal viewing angle from biplane X-ray angiograms, Int J Cardiovasc Imaging, vol. 26:5-17 (2010). |
Tu et al., “In vivo assessment of optimal viewing angles from X-ray coronary angiography”, EuroIntervention, vol. 7:112-120 (2011). |
Tu et al., “In vivo assessment of bifurcation optimal viewing angles and bifurcation angles by three-dimentional (3D) quantitative coronary angiography”, Int J Cardiovasc Imaging, published online Dec. 15, 2011, in 9 pages. |
Tu et al., “The impact of acquisition angle differences on three-dimensional quantitative coronary angiography”, Catheterization and Cardiovascular Interventions, vol. 78:214-222 (2011). |
Tuinenburg et al., “Dedicated bifurcation analysis: basic principles”, Int J Cardiovasc Imaging, vol. 27:167-174 (2001). |
Voci et al., “Coronary flow: a new asset for the echo lab?”, European Heart Journal, vol. 25:1867-1879 (2004). |
Weickert et al., “A scheme for coherence-enhancing diffusion filtering with optimized rotation invariance”, Computer Vision, Graphics, and Pattern Recognition Group, Technical Report, Computer Science Series, pp. 1-20 (2000). |
Weickert, “Anisotropic diffusion in image processing”, ECMI, published by Teubner Stuttgart, Germany, 181 pages (2008). |
Weickert et al., “A scheme for coherence-enhancing diffusion filtering with optimized rotation invariance”, Journal of Visual Communication and Image Representation, vol. 13(1-2):103-118 (2002). |
Wong et al., “Quantification of fractional flow reserve based on angiographic image data”, The International Journal of Cardiac Imaging, vol. 28(1):13-22 (2012). |
Wong et al., “Determination of fractional flow reserve (FFR) based on scaling laws: a simulation study”, Physics in Medicine and Biology, vol. 53:3995-4011 (2008). |
Wong et al., “Automated technique for angiographic determination of coronary blood flow and lumen volume”, Acad. Radiol. vol. 13:186-194 (2006). |
Xu et al., “Snakes, shapes, and gradient vector flow”, IEEE Transactions on Image Processing, vol. 7:359-369 (1998). |
Yang et al., “Novel approach for 3-D reconstruction of coronary arteries from two uncalibrated angiographic images”, IEEE Transactions on Image Processing, vol. 18(7):1563-1572 (2009). |
Youssef et al., “Role of computed tomography coronary angiography in the detection of vulnerable plaque, where does it stand among others?”, Angiology, vol. 1(2):1000111-1-1000111-8 (2013). |
Zhang et al., “Quantification of coronary microvascular resistance using angiographic images for volumetric blood flow measurement: in vivo validation”, Am J Physio Heart Circ vol. 300(6):H2096-H2104 (2011). |
International Search Report and Written Opinion in application No. PCT/IL2014/050923, dated Jul. 10, 2015, in 17 pages. |
International Preliminary Report on Patentability and Written Opinion in application No. PCT/IL2014/050923, dated May 6, 2016. |
International Preliminary Report on Patentability and Written Opinion in application No. PCT/IL2013/050869, dated May 7, 2015. |
International Search Report and Written Opinion in application No. PCT/IL2013/050869, dated May 23, 2014. |
International Search Report and Written Opinion in application No. PCT/IL2014/050043, dated May 16, 2014. |
International Preliminary Report on Patentability in application No. PCT/IL2014/050043, dated Jul. 30, 2015. |
International Search Report and Written Opinion in application No. PCT/IL2014/050044, dated May 16, 2014. |
International Preliminary Report on Patentability in application No. PCT/IL2014/050044, dated Jul. 30, 2015. |
International Search Report and Written Opinion in application No. PCT/IL2014/050039, dated May 28, 2014. |
International Preliminary Report on Patentability in application No. PCT/IL2014/050039, dated Jul. 30, 2015. |
International Search Report and Written Opinion in application No. PCT/IL2017/050543, dated Aug. 24, 2017. |
International Search Report and Written Opinion in application No. PCT/IL2017/050544, dated Oct. 2, 2017. |
Barnea, “Model-based estimation of coronary vessel diameter in angiographic images”, Proceedings of the 20th Annual International Conference of the IEEE Engineering in Medicine and Biology Society, vol. 20:513-516 (1998). |
Sato et al., “A viewpoint determination system for stenosis diagnosis and quantification in coronary angiogrphic image acquisition”, IEEE Transactions on Medical Imaging, vol. 17(1):121-137 (1998). |
International Search Report and Written Opinion in application No. PCT/US2020/042500, dated Oct. 16, 2020. |
International Search Report and Written Opinion in application No. PCT/IB20/52879, dated Sep. 3, 2020, in 9 pages. |
International Preliminary Report on Patentability and Written Opinion in application No. PCT/IB20/52879, dated Jul. 3, 2020, in 6 pages. |
Chen et al., “3-D reconstruction of coronary arterial tree to optimize angiographic visualization”, IEEE Transactions on Medical Imaging, vol. 19(4):318-336 (2000). |
Rabbat et al., “Interpreting results of coronary computed tomography angiography-derived fractional flow reserve in clinical practice”, Journal of Cardiovascular Computed Tomography, vol. 11(5):1-6 (2017). |
Wang et al., “Optimal viewing angle determination for multiple vessel segments in coronary angiographic image”, IEEE Transactions on Nuclear Science, vol. 61(3):1290-1303 (2014). |
Wang et al., “Global optimization angiographic viewing angles for coronary arteries with multiple segments”, 35th Annual International Conference of the IEEE EMBS, pp. 2640-2643, Osaka, Japan, Jul. 3-7, 2013. |
Number | Date | Country | |
---|---|---|---|
20220047236 A1 | Feb 2022 | US |
Number | Date | Country | |
---|---|---|---|
62336848 | May 2016 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 15959024 | Apr 2018 | US |
Child | 16600871 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 16600871 | Oct 2019 | US |
Child | 17516319 | US | |
Parent | PCT/IL2017/050544 | May 2017 | US |
Child | 15959024 | US |