CN112308857A - Method and device for determining center line of blood vessel and readable storage medium - Google Patents
Method and device for determining center line of blood vessel and readable storage medium Download PDFInfo
- Publication number
- CN112308857A CN112308857A CN202011555568.1A CN202011555568A CN112308857A CN 112308857 A CN112308857 A CN 112308857A CN 202011555568 A CN202011555568 A CN 202011555568A CN 112308857 A CN112308857 A CN 112308857A
- Authority
- CN
- China
- Prior art keywords
- subgraph
- point
- starting point
- determining
- path
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 210000004204 blood vessel Anatomy 0.000 title claims abstract description 101
- 238000000034 method Methods 0.000 title claims abstract description 42
- 230000011218 segmentation Effects 0.000 claims abstract description 21
- 210000001367 artery Anatomy 0.000 claims description 6
- 238000010276 construction Methods 0.000 claims description 5
- 238000000605 extraction Methods 0.000 claims description 3
- 238000010586 diagram Methods 0.000 description 15
- 238000004590 computer program Methods 0.000 description 9
- 230000006870 function Effects 0.000 description 4
- 230000010365 information processing Effects 0.000 description 4
- 238000004422 calculation algorithm Methods 0.000 description 3
- 238000004364 calculation method Methods 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 230000005540 biological transmission Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 238000012805 post-processing Methods 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T7/00—Image analysis
- G06T7/0002—Inspection of images, e.g. flaw detection
- G06T7/0012—Biomedical image inspection
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T7/00—Image analysis
- G06T7/60—Analysis of geometric attributes
-
- G—PHYSICS
- G16—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS
- G16H—HEALTHCARE INFORMATICS, i.e. INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR THE HANDLING OR PROCESSING OF MEDICAL OR HEALTHCARE DATA
- G16H30/00—ICT specially adapted for the handling or processing of medical images
- G16H30/40—ICT specially adapted for the handling or processing of medical images for processing medical images, e.g. editing
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T2207/00—Indexing scheme for image analysis or image enhancement
- G06T2207/30—Subject of image; Context of image processing
- G06T2207/30004—Biomedical image processing
- G06T2207/30101—Blood vessel; Artery; Vein; Vascular
Landscapes
- Engineering & Computer Science (AREA)
- Health & Medical Sciences (AREA)
- Physics & Mathematics (AREA)
- Computer Vision & Pattern Recognition (AREA)
- Nuclear Medicine, Radiotherapy & Molecular Imaging (AREA)
- Radiology & Medical Imaging (AREA)
- General Health & Medical Sciences (AREA)
- Medical Informatics (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Epidemiology (AREA)
- Quality & Reliability (AREA)
- Public Health (AREA)
- Primary Health Care (AREA)
- Geometry (AREA)
- Image Analysis (AREA)
- Ultra Sonic Daignosis Equipment (AREA)
- Apparatus For Radiation Diagnosis (AREA)
Abstract
The invention discloses a method, a device and a readable storage medium for determining a blood vessel center line, wherein the method comprises the following steps: acquiring a blood vessel image; extracting a first central line of each blood vessel in the blood vessel image, wherein the first central line comprises a first starting point, an intersection point and a segmentation line; constructing an undirected graph according to the first starting point, the intersection point and the segmentation line; determining each connected component of the undirected graph; determining each subgraph in each connected component, wherein each subgraph comprises at least one vertex, and when each subgraph comprises a plurality of vertices, at least two connecting paths exist between any two vertices in the subgraph; for each connected component, constructing a spanning tree by taking a subgraph including a first starting point as a root node, taking a subgraph not including the first starting point as a child node and a leaf node and taking a connecting line between the subgraphs as an edge; acquiring at least one designated point selected by a user aiming at the vessel with the standby name; when the designated point does not include the second starting point, a first path from the root node to the designated point is determined in the spanning tree, and a second central line of the standby name vessel is obtained.
Description
Technical Field
The present application relates to the field of blood vessel naming technologies, and in particular, to a method and an apparatus for determining a blood vessel centerline, and a readable storage medium.
Background
In the post-processing process of the medical head and neck artery CT image, the central line of the head and neck blood vessel needs to be determined, and then a corresponding head and neck blood vessel curved surface or a straightening image is reconstructed according to the central line of the head and neck blood vessel. The step of determining the vessel centerline is referred to as vessel naming. At present, a blood vessel is generally named initially by using blood vessel naming software, and then a user adjusts a blood vessel central line point by point, so that all points on the blood vessel central line are adjusted to a central point of the trend of the blood vessel. Because the head and neck blood vessels are numerous and staggered, the user wastes time and labor when adjusting the center line of the blood vessel point by point.
Disclosure of Invention
The embodiment of the application provides a method and a device for determining a blood vessel center line and a readable storage medium, so as to solve the problem that time and labor are wasted when a blood vessel is named by adopting a method in the prior art.
In order to solve the above problem, in a first aspect, an embodiment of the present invention provides a method for determining a centerline of a blood vessel, including: acquiring a blood vessel image; extracting a first central line of each blood vessel in the blood vessel image, wherein the first central line comprises a first starting point, an intersection point and a segmentation line; constructing an undirected graph according to the first starting point, the intersection point and the segmentation line; determining each connected component of the undirected graph; determining each subgraph in each connected component, wherein each subgraph comprises at least one vertex, and when each subgraph comprises a plurality of vertices, at least two connecting paths exist between any two vertices in the subgraph; for each connected component, constructing a spanning tree by taking a subgraph including a first starting point as a root node, taking a subgraph not including the first starting point as a child node and a leaf node and taking a connecting line between the subgraphs as an edge; acquiring at least one designated point selected by a user aiming at the vessel with the standby name; when the designated point does not include the second starting point, a first path from the root node to the designated point is determined in the spanning tree, and a second central line of the standby name vessel is obtained.
Optionally, determining each subgraph in each connected component includes: determining each key edge of the connected component, wherein the key edges are used for indicating a unique path between two mutually connected vertexes in the connected component; and determining at least one vertex connected with each key edge and a connecting line between the vertices as a subgraph.
Optionally, when the node through which the first path passes includes a subgraph of a plurality of vertices, after determining the first path from the root node to the specified point in the spanning tree, the method further includes: when the designated point exists in the sub-graph, a second path passing through a third starting point, a first end point and the designated point of the sub-graph is determined in the sub-graph, and the second path has no loop; and combining the first path and the second path to obtain a second central line of the standby name vessel.
Optionally, the method for determining the centerline of the blood vessel further comprises: when no appointed point exists in the subgraph, a third path passing through a fourth starting point and a second ending point of the subgraph is determined in the subgraph, and the third path has no loop; and combining the first path and the third path to obtain a second central line of the standby name vessel.
Optionally, determining a second path in the sub-graph, the second path passing through a third starting point, the first end point and the designated point of the sub-graph, includes: a second path is determined in the sub-graph using traversal, which passes through a third start point, the first end point, and the designated point of the sub-graph.
Optionally, the method for determining the centerline of the blood vessel further comprises: and when the designated point comprises a second starting point, taking the second starting point as a root node of the spanning tree, returning to execute the step of constructing the spanning tree by taking the subgraph comprising the first starting point as the root node, taking the subgraph not comprising the first starting point as a child node and a leaf node and taking a connecting line between the subgraphs as an edge for each connected component.
Optionally, the method for determining the centerline of the blood vessel further comprises: and when the second starting point is not a leaf node, adding a virtual leaf node connected with the second starting point, taking the virtual leaf node as a root node of the spanning tree, returning to execute the step of constructing the spanning tree by taking the subgraph which does not comprise the first starting point as a child node and the leaf node and taking a connecting line between the subgraphs as an edge for each connected component.
According to a second aspect, the present invention provides a device for determining a centerline of a blood vessel, including: a first acquisition unit for acquiring a blood vessel image; the extraction unit is used for extracting a first central line of each blood vessel in the blood vessel image, wherein the first central line comprises a first starting point, an intersection point and a segmentation line; the first construction unit is used for constructing an undirected graph according to a first starting point, a junction point and a segmentation line; a first determination unit configured to determine each connected component of the undirected graph; the second determining unit is used for determining each subgraph in each connected component, each subgraph comprises at least one vertex, and when each subgraph comprises a plurality of vertices, at least two connecting paths exist between any two vertices in the subgraph; the second construction unit is used for constructing a spanning tree by taking a subgraph including the first starting point as a root node, taking a subgraph not including the first starting point as a child node and a leaf node and taking a connecting line between the subgraphs as an edge for each connected component; the second acquisition unit is used for acquiring at least one designated point selected by a user aiming at the standby name blood vessel; and a third determining unit, configured to determine a first path from the root node to the designated point in the spanning tree when the designated point does not include the second starting point, and obtain a second centerline of the first-order vessel.
In a third aspect, an embodiment of the present invention provides a computer, including: at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor, the instructions being executable by the at least one processor to cause the at least one processor to perform a method of determining a vessel centerline as in the first aspect or any of the embodiments of the first aspect.
In a fourth aspect, an embodiment of the present invention provides a computer-readable storage medium, where computer instructions are stored, and the computer instructions are configured to cause a computer to execute the method for determining a blood vessel centerline according to the first aspect or any implementation manner of the first aspect.
The method, the device and the readable storage medium for determining the center line of the blood vessel provided by the embodiment of the invention acquire the blood vessel image; extracting a first central line of each blood vessel in the blood vessel image, wherein the first central line comprises a first starting point, an intersection point and a segmentation line; constructing an undirected graph according to the first starting point, the intersection point and the segmentation line; determining each connected component of the undirected graph; determining each subgraph in each connected component, wherein each subgraph comprises at least one vertex, and when each subgraph comprises a plurality of vertices, at least two connecting paths exist between any two vertices in the subgraph; for each connected component, constructing a spanning tree by taking a subgraph including a first starting point as a root node, taking a subgraph not including the first starting point as a child node and a leaf node and taking a connecting line between the subgraphs as an edge; acquiring at least one designated point selected by a user aiming at the vessel with the standby name; when the appointed point does not comprise a second starting point, a first path from the root node to the appointed point is determined in the spanning tree to obtain a second center line of the blood vessel with the ready name, so that the first center line of each blood vessel in the blood vessel image is converted from a complex graph structure into a tree structure comprising a plurality of subgraphs, when at least one appointed point selected by a user for the blood vessel to be named is obtained, a proper path can be found in the tree structure to obtain the second center line of the blood vessel with the ready name, and the second center line of the blood vessel to be named can be simply and quickly determined; and the subgraph is set as the node of the tree structure, so that only one spanning tree needs to be established for one connected component, and the calculation amount can be reduced when the second central line of the blood vessel to be named is determined.
The foregoing description is only an overview of the technical solutions of the present application, and the present application can be implemented according to the content of the description in order to make the technical means of the present application more clearly understood, and the following detailed description of the present application is given in order to make the above and other objects, features, and advantages of the present application more clearly understandable.
Drawings
FIG. 1 is a flow chart illustrating a method for determining a centerline of a blood vessel according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of an undirected graph in an embodiment of the invention;
FIG. 3 is a schematic diagram of a structure of a subgraph in a connected component according to an embodiment of the present invention;
FIGS. 4-5 are schematic structural diagrams of a spanning tree according to an embodiment of the present invention;
FIG. 6 is a schematic diagram of a first path in an embodiment of the present invention;
FIG. 7 is a schematic diagram illustrating a searching process of a second path according to an embodiment of the present invention;
FIG. 8 is a schematic structural diagram of a device for determining a centerline of a blood vessel according to an embodiment of the present invention;
fig. 9 is a schematic diagram of a hardware structure of a computer according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
An embodiment of the present invention provides a method for determining a blood vessel centerline, as shown in fig. 1, including:
s101, obtaining a blood vessel image; specifically, the obtained blood vessel images include at least images of blood vessels to be named, and in the present embodiment, a head and neck artery blood vessel image is taken as an example for description, but not limited thereto, and other blood vessel images are also applicable.
S102, extracting a first central line of each blood vessel in the blood vessel image, wherein the first central line comprises a first starting point, an intersection point and a segmentation line; specifically, a skeleton extraction algorithm may be used to extract a first centerline of each blood vessel in the blood vessel image. The first centerline may include a first origin or a plurality of first origins, and when the first centerline includes a plurality of first origins, the first centerline is indicated to have a plurality of disconnected blood vessels. The first center line may include one intersection and one segment line, and may include a plurality of intersections and a plurality of segment lines. The first starting point is the center point of the lowest end of the blood vessel. The junction is the center point of the junction of the blood vessels. The segmentation line is a connection line of the center points of the segmented vessels.
S103, constructing an undirected graph according to the first starting point, the intersection point and the segmentation line; specifically, an undirected graph may be constructed with the first starting point and the intersection point as vertices and the segment line as a connecting line between the vertices. The constructed undirected graph can be as shown in fig. 2.
S104, determining each connected component of the undirected graph; specifically, for an undirected graph as shown in FIG. 2, two connected components are included.
S105, determining each subgraph in each connected component, wherein each subgraph comprises at least one vertex, and when each subgraph comprises a plurality of vertices, at least two connecting paths exist between any two vertices in each subgraph; specifically, subgraphs in each connected component can be determined by adopting a tarjan algorithm of a classical graph theory. For an undirected graph as shown in fig. 2, one of the connected components may comprise 7 subgraphs as shown in fig. 3. The subgraph may be a single vertex, or may be a plurality of vertices and connecting lines between the vertices.
S106, for each connected component, constructing a spanning tree by taking a subgraph including a first starting point as a root node, taking a subgraph not including the first starting point as a child node and a leaf node and taking a connecting line between the subgraphs as an edge; specifically, each subgraph can be regarded as an independent node, and then a spanning tree algorithm is used to construct a spanning tree by taking the subgraph comprising the first starting point as a root node. For each subgraph in fig. 3, a spanning tree may be constructed by taking the subgraph including the first starting point as a root node, taking the subgraph not including the first starting point as a child node and a leaf node, and taking a connecting line between the subgraphs as an edge, as shown in fig. 4 and fig. 5.
S107, acquiring at least one designated point selected by a user aiming at the blood vessel with the standby name; in particular, the user may choose at least one specified point for the vessel to be named.
And S108, when the designated point does not comprise the second starting point, determining a first path from the root node to the designated point in the spanning tree, and obtaining a second central line of the standby name vessel. Specifically, the second starting point is different from the first starting point, and is a new starting point selected by the user again. Since the tree structure is characterized by having only one path from the root node to any given point on the tree, when the given point selected by the user does not include the second starting point, only one first path from the root node to the given point can be determined in the spanning tree.
The method, the device and the readable storage medium for determining the center line of the blood vessel provided by the embodiment of the invention acquire the blood vessel image; extracting a first central line of each blood vessel in the blood vessel image, wherein the first central line comprises a first starting point, an intersection point and a segmentation line; constructing an undirected graph according to the first starting point, the intersection point and the segmentation line; determining each connected component of the undirected graph; determining each subgraph in each connected component, wherein each subgraph comprises at least one vertex, and when each subgraph comprises a plurality of vertices, at least two connecting paths exist between any two vertices in the subgraph; for each connected component, constructing a spanning tree by taking a subgraph including a first starting point as a root node, taking a subgraph not including the first starting point as a child node and a leaf node and taking a connecting line between the subgraphs as an edge; acquiring at least one designated point selected by a user aiming at the vessel with the standby name; when the appointed point does not comprise a second starting point, a first path from the root node to the appointed point is determined in the spanning tree to obtain a second center line of the blood vessel with the ready name, so that the first center line of each blood vessel in the blood vessel image is converted from a complex graph structure into a tree structure comprising a plurality of subgraphs, when at least one appointed point selected by a user for the blood vessel to be named is obtained, a proper path can be found in the tree structure to obtain the second center line of the blood vessel with the ready name, and the second center line of the blood vessel to be named can be simply and quickly determined; and the subgraph is set as the node of the tree structure, so that only one spanning tree needs to be established for one connected component, and the calculation amount can be reduced when the second central line of the blood vessel to be named is determined.
In an alternative embodiment, in step S105, determining each subgraph in each connected component includes: determining each key edge of the connected component, wherein the key edges are used for indicating a unique path between two mutually connected vertexes in the connected component; and determining at least one vertex connected with each key edge and a connecting line between the vertices as a subgraph.
Specifically, when determining each subgraph in each connected component, it may be obtained by determining each key edge in the connected component. The critical edge satisfies that if the connecting line is cut off, the original connected component is split into two connected components, that is, the critical edge is used for indicating a unique path between two mutually connected vertexes in the connected components.
By determining the key edges of the connected components, sub-graphs in the connected components can be determined quickly.
In an optional embodiment, when the node through which the first path passes includes a subgraph of a plurality of vertices, after determining the first path from the root node to the specified point in the spanning tree, the method further includes: when the designated point exists in the sub-graph, a second path passing through a third starting point, a first end point and the designated point of the sub-graph is determined in the sub-graph, and the second path has no loop; and combining the first path and the second path to obtain a second central line of the standby name vessel. When no appointed point exists in the subgraph, a third path passing through a fourth starting point and a second ending point of the subgraph is determined in the subgraph, and the third path has no loop; and combining the first path and the third path to obtain a second central line of the standby name vessel.
Specifically, the nodes passed by the first path include a root node and child nodes. When the node passed by the first path includes a subgraph of a plurality of vertices, as shown in fig. 6, the solid dots are the vertices of the subgraph, and the hollow dots are the designated points. Since there are many connecting lines in the subgraph composed of many vertices, it is necessary to determine the second path in the subgraph. In the subgraph, since the order of passing through the middle vertexes is unknown and no solution is possible, the second path can be determined by means of brute force search and setting an upper limit of the number of searches. Thus, if a specified point is present in the subgraph, a second path can be determined in the subgraph that is loop-free and passes through the third starting point, the first end point and the specified point of the subgraph by using the traversal method. By combining the first path and the second path, the second centerline of the artery with the first artery can be obtained. As shown in fig. 7, the sub-graph in the example finds the second path through 4 traversals.
If the specified point does not exist in the subgraph, a third path which is not a loop and passes through a fourth starting point and a second ending point of the subgraph can be determined in the subgraph by using a traversal method, and the first path and the third path are combined to reach a second central line of the artery with the first name.
Because the size of the sub-graph is limited, and a user generally does not select too many designated points in the sub-graph, the second path or the third path can be quickly found by using a traversal method under the general condition.
In an alternative embodiment, the method for determining the vessel centerline further comprises: and when the designated point comprises a second starting point, taking the second starting point as a root node of the spanning tree, returning to execute the step of constructing the spanning tree by taking the subgraph comprising the first starting point as the root node, taking the subgraph not comprising the first starting point as a child node and a leaf node and taking a connecting line between the subgraphs as an edge for each connected component.
Specifically, when the user specifies the second starting point, the spanning tree may be reconstructed with the second starting point as the root node of the spanning tree.
When the designated point comprises a second starting point, the spanning tree is reconstructed by taking the second starting point as a root node of the spanning tree, and the spanning tree which takes the second starting point selected by the user as the root node can be obtained, so that when the first path is determined, the second starting point is taken as the starting point of the first path, the first path of the standby name blood vessel at different starting points can be constructed, and the setting requirements of the user on different starting points are met.
In an alternative embodiment, the method for determining the vessel centerline further comprises: and when the second starting point is not a leaf node, adding a virtual leaf node connected with the second starting point, taking the virtual leaf node as a root node of the spanning tree, returning to execute the step of constructing the spanning tree by taking the subgraph which does not comprise the first starting point as a child node and the leaf node and taking a connecting line between the subgraphs as an edge for each connected component.
Specifically, when the second starting point selected by the user is not a leaf node, a virtual leaf node connected to the second starting point may be added, and the spanning tree is reconstructed by using the virtual leaf node as a root node of the spanning tree.
The spanning tree is reconstructed by adding a virtual leaf node linking the second starting point, taking the virtual leaf node as the root node of the spanning tree, so that the spanning tree is still suitable for determining the second central line of the blood vessel.
The present invention also provides a device for determining a centerline of a blood vessel, as shown in fig. 8, including: a first acquisition unit 201 for acquiring a blood vessel image; the detailed description of the specific implementation manner is given in step S101 in the above embodiments, and is not repeated herein.
An extracting unit 202, configured to extract a first center line of each blood vessel in the blood vessel image, where the first center line includes a first starting point, an intersection point, and a segmentation line; the detailed description of the specific implementation manner is given in step S102 in the above embodiments, and is not repeated herein.
The first construction unit is used for constructing an undirected graph according to a first starting point, a junction point and a segmentation line; the detailed description of the specific implementation manner is given in step S103 in the above embodiments, and is not repeated herein.
A first determination unit configured to determine each connected component of the undirected graph; the detailed description of the specific implementation manner is given in step S104 in the above embodiments, and is not repeated herein.
The second determining unit is used for determining each subgraph in each connected component, each subgraph comprises at least one vertex, and when each subgraph comprises a plurality of vertices, at least two connecting paths exist between any two vertices in the subgraph; the detailed description of the specific implementation manner is given in step S105 in the above embodiments, and is not repeated herein.
The second construction unit is used for constructing a spanning tree by taking a subgraph including the first starting point as a root node, taking a subgraph not including the first starting point as a child node and a leaf node and taking a connecting line between the subgraphs as an edge for each connected component; the detailed description of the specific implementation manner is given in step S106 in the above embodiments, and is not repeated herein.
The second acquisition unit is used for acquiring at least one designated point selected by a user aiming at the standby name blood vessel; the detailed description of the specific implementation manner is given in step S107 in the above embodiments, and is not repeated herein.
And a third determining unit, configured to determine a first path from the root node to the designated point in the spanning tree when the designated point does not include the second starting point, and obtain a second centerline of the first-order vessel. The detailed description of the specific implementation manner is given in step S108 in the above embodiments, and is not repeated herein.
The device for determining the center line of the blood vessel provided by the embodiment of the invention obtains the blood vessel image; extracting a first central line of each blood vessel in the blood vessel image, wherein the first central line comprises a first starting point, an intersection point and a segmentation line; constructing an undirected graph according to the first starting point, the intersection point and the segmentation line; determining each connected component of the undirected graph; determining each subgraph in each connected component, wherein each subgraph comprises at least one vertex, and when each subgraph comprises a plurality of vertices, at least two connecting paths exist between any two vertices in the subgraph; for each connected component, constructing a spanning tree by taking a subgraph including a first starting point as a root node, taking a subgraph not including the first starting point as a child node and a leaf node and taking a connecting line between the subgraphs as an edge; acquiring at least one designated point selected by a user aiming at the vessel with the standby name; when the appointed point does not comprise a second starting point, a first path from the root node to the appointed point is determined in the spanning tree to obtain a second center line of the blood vessel with the ready name, so that the first center line of each blood vessel in the blood vessel image is converted from a complex graph structure into a tree structure comprising a plurality of subgraphs, when at least one appointed point selected by a user for the blood vessel to be named is obtained, a proper path can be found in the tree structure to obtain the second center line of the blood vessel with the ready name, and the second center line of the blood vessel to be named can be simply and quickly determined; and the subgraph is set as the node of the tree structure, so that only one spanning tree needs to be established for one connected component, and the calculation amount can be reduced when the second central line of the blood vessel to be named is determined.
Based on the same inventive concept as the method for determining a blood vessel centerline in the previous embodiment, the present invention also provides a computer having a computer program stored thereon, which when executed by a processor implements the steps of any one of the methods for determining a blood vessel centerline as described above.
Where in fig. 9 a bus architecture (represented by bus 300), bus 300 may include any number of interconnected buses and bridges, bus 300 linking together various circuits including one or more processors, represented by processor 302, and memory, represented by memory 304. The bus 300 may also link together various other circuits such as peripherals, voltage regulators, power management circuits, and the like, which are well known in the art, and therefore, will not be described any further herein. A bus interface 306 provides an interface between the bus 300 and the receiver 301 and transmitter 303. The receiver 301 and the transmitter 303 may be the same element, i.e., a transceiver, providing a means for communicating with various other apparatus over a transmission medium.
The processor 302 is responsible for managing the bus 300 and general processing, and the memory 304 may be used for storing data used by the processor 302 in performing operations.
Based on the same inventive concept as the method of determining a blood vessel centerline in the foregoing embodiments, the present invention also provides a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements the steps of:
acquiring a blood vessel image; extracting a first central line of each blood vessel in the blood vessel image, wherein the first central line comprises a first starting point, an intersection point and a segmentation line; constructing an undirected graph according to the first starting point, the intersection point and the segmentation line; determining each connected component of the undirected graph; determining each subgraph in each connected component, wherein each subgraph comprises at least one vertex, and when each subgraph comprises a plurality of vertices, at least two connecting paths exist between any two vertices in the subgraph; for each connected component, constructing a spanning tree by taking a subgraph including a first starting point as a root node, taking a subgraph not including the first starting point as a child node and a leaf node and taking a connecting line between the subgraphs as an edge; acquiring at least one designated point selected by a user aiming at the vessel with the standby name; when the designated point does not include the second starting point, a first path from the root node to the designated point is determined in the spanning tree, and a second central line of the standby name vessel is obtained.
In a specific implementation, when the program is executed by a processor, any method step in the first embodiment may be further implemented.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams 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, embedded processor, or other programmable information processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable information processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable information processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable information processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
It will be apparent to those skilled in the art that various changes and modifications may be made in the present invention without departing from the spirit and scope of the invention. Thus, if such modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalents, the present invention is also intended to include such modifications and variations.
Claims (10)
1. A method of determining a centerline of a blood vessel, comprising:
acquiring a blood vessel image;
extracting a first central line of each blood vessel in the blood vessel image, wherein the first central line comprises a first starting point, an intersection point and a segmentation line;
constructing an undirected graph from the first starting point, the intersection points, and the segment lines;
determining connected components of the undirected graph;
determining each subgraph in each connected component, wherein each subgraph comprises at least one vertex, and when the subgraph comprises a plurality of vertices, at least two connecting paths exist between any two vertices in the subgraph;
for each connected component, constructing a spanning tree by taking a subgraph including the first starting point as a root node, taking a subgraph not including the first starting point as a child node and a leaf node and taking a connecting line between the subgraphs as an edge;
acquiring at least one designated point selected by a user aiming at the vessel with the standby name;
when the designated point does not comprise a second starting point, a first path from a root node to the designated point is determined in the spanning tree, and a second central line of the standby name vessel is obtained.
2. The method of claim 1, wherein said determining each sub-graph in each of said connected components comprises:
determining each key edge of the connected component, wherein the key edge is used for indicating a unique path between two mutually connected vertexes in the connected component;
and determining at least one vertex connected by each key edge and a connecting line between the vertices as a subgraph.
3. The method of determining a vessel centerline according to claim 2, wherein when the node traversed by the first path includes a subgraph of a plurality of vertices,
after determining the first path from the root node to the designated point in the spanning tree, further comprising:
when the specified point exists in the subgraph, a second path which passes through a third starting point, a first end point and the specified point of the subgraph is determined in the subgraph, and the second path has no loop;
and combining the first path and the second path to obtain a second central line of the standby name vessel.
4. The method for determining a vessel centerline according to claim 3, further comprising:
when the specified point does not exist in the subgraph, determining a third path which passes through a fourth starting point and a second ending point of the subgraph in the subgraph, wherein the third path has no loop;
and combining the first path and the third path to obtain a second central line of the standby name vessel.
5. The method of claim 3, wherein determining a second path in the sub-graph that passes through a third starting point, a first end point, and the designated point of the sub-graph comprises:
determining a second path in the sub-graph using traversal, the second path passing through a third starting point, a first end point, and the designated point of the sub-graph.
6. The method of determining a vessel centerline as set forth in claim 1, further comprising:
and when the designated point comprises the second starting point, taking the second starting point as a root node of the spanning tree, returning to execute the step of constructing the spanning tree by taking the subgraph comprising the first starting point as the root node, taking the subgraph not comprising the first starting point as a child node and a leaf node and taking a connecting line between the subgraphs as an edge for each connected component.
7. The method of determining a vessel centerline as set forth in claim 6, further comprising:
and when the second starting point is not a leaf node, adding a virtual leaf node connected with the second starting point, taking the virtual leaf node as a root node of the spanning tree, returning to execute the step of constructing the spanning tree by taking the subgraph which does not comprise the first starting point as a child node and the leaf node and taking a connecting line between the subgraphs as an edge for each connected component.
8. A device for determining a centerline of a blood vessel, comprising:
a first acquisition unit for acquiring a blood vessel image;
an extraction unit, configured to extract a first center line of each blood vessel in the blood vessel image, where the first center line includes a first start point, an intersection point, and a segmentation line;
a first construction unit, configured to construct an undirected graph according to the first starting point, the intersection point, and the segment line;
a first determination unit, configured to determine each connected component of the undirected graph;
a second determining unit, configured to determine each subgraph in each connected component, where the subgraph includes at least one vertex, and when the subgraph includes multiple vertices, there are at least two connection paths between any two vertices in the subgraph;
a second constructing unit, configured to construct, for each connected component, a spanning tree by using a subgraph including the first starting point as a root node, using a subgraph not including the first starting point as a child node and a leaf node, and using a connecting line between the subgraphs as an edge;
the second acquisition unit is used for acquiring at least one designated point selected by a user aiming at the standby name blood vessel;
and a third determining unit, configured to determine, when the designated point does not include a second starting point, a first path from a root node to the designated point in the spanning tree, and obtain a second centerline of the vessel with the first artery.
9. A computer, comprising:
at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor to cause the at least one processor to perform the method of vessel centerline determination of any of claims 1-7.
10. A computer-readable storage medium storing computer instructions for causing a computer to perform the method for determining a vessel centerline according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011555568.1A CN112308857B (en) | 2020-12-25 | 2020-12-25 | Method and device for determining center line of blood vessel and readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011555568.1A CN112308857B (en) | 2020-12-25 | 2020-12-25 | Method and device for determining center line of blood vessel and readable storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112308857A true CN112308857A (en) | 2021-02-02 |
| CN112308857B CN112308857B (en) | 2021-05-11 |
Family
ID=74487584
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011555568.1A Active CN112308857B (en) | 2020-12-25 | 2020-12-25 | Method and device for determining center line of blood vessel and readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112308857B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115953495A (en) * | 2023-03-14 | 2023-04-11 | 北京唯迈医疗设备有限公司 | Intelligent path planning device, system and storage medium based on two-dimensional radiography image |
| CN117830200A (en) * | 2023-04-20 | 2024-04-05 | 强联智创（北京）科技有限公司 | Method, apparatus and storage medium for supplementing a vessel segment centerline |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109448860A (en) * | 2018-09-10 | 2019-03-08 | 平安科技（深圳）有限公司 | Disease data mapping method, device, computer equipment and storage medium |
| US20190325579A1 (en) * | 2018-04-24 | 2019-10-24 | Shenzhen Keya Medical Technology Corporation | Automatic method and system for vessel refine segmentation in biomedical images using tree structure based deep learning model |
| CN110688503A (en) * | 2019-09-18 | 2020-01-14 | 艾瑞迈迪科技石家庄有限公司 | Object separation processing method and device for tree-structured image |
| CN111311583A (en) * | 2020-02-24 | 2020-06-19 | 广州柏视医疗科技有限公司 | Method and system for naming pulmonary trachea and blood vessel in segmented mode |
| CN111507981A (en) * | 2019-01-31 | 2020-08-07 | 数坤（北京）网络科技有限公司 | Image processing method and device, electronic equipment and computer readable storage medium |
| CN111612743A (en) * | 2020-04-24 | 2020-09-01 | 杭州电子科技大学 | Coronary artery central line extraction method based on CT image |
| CN111784698A (en) * | 2020-07-02 | 2020-10-16 | 广州信瑞医疗技术有限公司 | Image self-adaptive segmentation method and device, electronic equipment and storage medium |
| CN112017176A (en) * | 2020-09-08 | 2020-12-01 | 杭州深睿博联科技有限公司 | Automatic naming method and device for heart coronary vessels |
| CN112017167A (en) * | 2020-08-24 | 2020-12-01 | 杭州深睿博联科技有限公司 | Coronary artery central line generation method and device based on bidirectional coronary artery blood vessel tracking |
-
2020
- 2020-12-25 CN CN202011555568.1A patent/CN112308857B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20190325579A1 (en) * | 2018-04-24 | 2019-10-24 | Shenzhen Keya Medical Technology Corporation | Automatic method and system for vessel refine segmentation in biomedical images using tree structure based deep learning model |
| CN112070776A (en) * | 2018-04-24 | 2020-12-11 | 深圳科亚医疗科技有限公司 | Medical image segmentation method, segmentation device, segmentation system and computer readable medium |
| CN109448860A (en) * | 2018-09-10 | 2019-03-08 | 平安科技（深圳）有限公司 | Disease data mapping method, device, computer equipment and storage medium |
| CN111507981A (en) * | 2019-01-31 | 2020-08-07 | 数坤（北京）网络科技有限公司 | Image processing method and device, electronic equipment and computer readable storage medium |
| CN110688503A (en) * | 2019-09-18 | 2020-01-14 | 艾瑞迈迪科技石家庄有限公司 | Object separation processing method and device for tree-structured image |
| CN111311583A (en) * | 2020-02-24 | 2020-06-19 | 广州柏视医疗科技有限公司 | Method and system for naming pulmonary trachea and blood vessel in segmented mode |
| CN111612743A (en) * | 2020-04-24 | 2020-09-01 | 杭州电子科技大学 | Coronary artery central line extraction method based on CT image |
| CN111784698A (en) * | 2020-07-02 | 2020-10-16 | 广州信瑞医疗技术有限公司 | Image self-adaptive segmentation method and device, electronic equipment and storage medium |
| CN112017167A (en) * | 2020-08-24 | 2020-12-01 | 杭州深睿博联科技有限公司 | Coronary artery central line generation method and device based on bidirectional coronary artery blood vessel tracking |
| CN112017176A (en) * | 2020-09-08 | 2020-12-01 | 杭州深睿博联科技有限公司 | Automatic naming method and device for heart coronary vessels |
Non-Patent Citations (1)
| Title |
|---|
| HANS-CHRISTOPHWIRTH 等: "Reload cost problems: minimum diameter spanning tree", 《DISCRETE APPLIED MATHEMATICS》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115953495A (en) * | 2023-03-14 | 2023-04-11 | 北京唯迈医疗设备有限公司 | Intelligent path planning device, system and storage medium based on two-dimensional radiography image |
| CN117830200A (en) * | 2023-04-20 | 2024-04-05 | 强联智创（北京）科技有限公司 | Method, apparatus and storage medium for supplementing a vessel segment centerline |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112308857B (en) | 2021-05-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112308857B (en) | Method and device for determining center line of blood vessel and readable storage medium | |
| KR20190100005A (en) | Method and apparatus for generating blood vessel model | |
| US11341288B2 (en) | Methods and system for incremental exploration of design changes in large computer-aided design models | |
| CN113767388A (en) | Techniques for workflow analysis and design task optimization | |
| US10255716B1 (en) | Multi-resolution tiled 2.5D delaunay triangulation stitching | |
| CN110084894B (en) | Local amplification display method and device of three-dimensional model and electronic equipment | |
| CN110728735A (en) | Road-level topological layer construction method and system | |
| US7734559B2 (en) | Rule processing method and apparatus providing exclude cover removal to simplify selection and/or conflict advice | |
| CN108388576B (en) | Method and system for interactively generating map | |
| CN110175047B (en) | Automatic generation method and device of processor instruction codes | |
| CN110688503B (en) | Object separation processing method and device for tree-structured image | |
| CN110489131A (en) | A kind of gray scale user choosing method and device | |
| CN112632957A (en) | Power drawing management method and device, terminal equipment and server | |
| CN109063265B (en) | Cross-domain allopatric collaborative design method and device in mass data environment | |
| Yau et al. | A region-growing algorithm using parallel computing for surface reconstruction from unorganized points | |
| CN114237824A (en) | Fault positioning method and device, computer readable medium and electronic equipment | |
| CN115617333A (en) | Data updating method and device, electronic equipment and storage medium | |
| CN109299337B (en) | Graph searching method based on iteration | |
| CN113434143A (en) | iOS application interface layout device and method | |
| CN107944489B (en) | Extensive combination chart feature learning method based on structure semantics fusion | |
| JP2010204855A (en) | Program generation device and block diagram generation device | |
| CN110569065B (en) | Processor instruction code automatic generation method and device based on domain filling | |
| Kehrbusch et al. | Interface-based similarity analysis of software components for the automotive industry | |
| CN115439640A (en) | Virtual model cloning method and device | |
| CN110119814B (en) | Knowledge rule modeling and reasoning method based on object relation chain |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CP01 | Change in the name or title of a patent holder |
Address after: Rooms 303, 304, 305, 321 and 322, building 3, No. 11, Chuangxin Road, science and Technology Park, Changping District, Beijing Patentee after: Shukun (Beijing) Network Technology Co.,Ltd. Address before: Rooms 303, 304, 305, 321 and 322, building 3, No. 11, Chuangxin Road, science and Technology Park, Changping District, Beijing Patentee before: SHUKUN (BEIJING) NETWORK TECHNOLOGY Co.,Ltd. |
|
| CP01 | Change in the name or title of a patent holder | ||
| CP01 | Change in the name or title of a patent holder |
Address after: Rooms 303, 304, 305, 321 and 322, building 3, No. 11, Chuangxin Road, science and Technology Park, Changping District, Beijing Patentee after: Shukun Technology Co.,Ltd. Address before: Rooms 303, 304, 305, 321 and 322, building 3, No. 11, Chuangxin Road, science and Technology Park, Changping District, Beijing Patentee before: Shukun (Beijing) Network Technology Co.,Ltd. |
|
| CP01 | Change in the name or title of a patent holder | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20241008 Address after: Room 313 and 315, Building No. 11, Innovation Road, Changping District, Beijing 102200 Patentee after: YUKUN (BEIJING) NETWORK TECHNOLOGY Co.,Ltd. Country or region after: China Address before: Rooms 303, 304, 305, 321 and 322, building 3, No. 11, Chuangxin Road, science and Technology Park, Changping District, Beijing Patentee before: Shukun Technology Co.,Ltd. Country or region before: China |