CN111814803A - Graph segmentation method, device and equipment and computer readable storage medium - Google Patents
Graph segmentation method, device and equipment and computer readable storage medium Download PDFInfo
- Publication number
- CN111814803A CN111814803A CN202010962552.6A CN202010962552A CN111814803A CN 111814803 A CN111814803 A CN 111814803A CN 202010962552 A CN202010962552 A CN 202010962552A CN 111814803 A CN111814803 A CN 111814803A
- Authority
- CN
- China
- Prior art keywords
- graph
- path information
- coordinate path
- coordinate
- information corresponding
- 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.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06V—IMAGE OR VIDEO RECOGNITION OR UNDERSTANDING
- G06V10/00—Arrangements for image or video recognition or understanding
- G06V10/20—Image preprocessing
- G06V10/26—Segmentation of patterns in the image field; Cutting or merging of image elements to establish the pattern region, e.g. clustering-based techniques; Detection of occlusion
- G06V10/267—Segmentation of patterns in the image field; Cutting or merging of image elements to establish the pattern region, e.g. clustering-based techniques; Detection of occlusion by performing operations on regions, e.g. growing, shrinking or watersheds
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T7/00—Image analysis
- G06T7/10—Segmentation; Edge detection
- G06T7/11—Region-based segmentation
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Multimedia (AREA)
- Computer Vision & Pattern Recognition (AREA)
- Image Generation (AREA)
Abstract
The invention discloses a graph segmentation method, which comprises the following steps: respectively acquiring first coordinate path information corresponding to a first graph and second coordinate path information corresponding to a second graph; judging whether intersection point coordinates exist in the first coordinate path information and the second coordinate path information; if so, determining that the first graph and the second graph have an overlapping area; calculating third coordinate path information corresponding to the overlapping area according to the first coordinate path information and the second coordinate path information; and performing segmentation operation on the first graph or the second graph according to the third coordinate path information. By applying the technical scheme provided by the embodiment of the invention, the type of the dividing line is not limited, and the effective division of the graph is realized. The invention also discloses a graph dividing device, equipment and a storage medium, and the graph dividing device, the equipment and the storage medium have corresponding technical effects.
Description
Technical Field
The present invention relates to the field of image processing technologies, and in particular, to a method, an apparatus, a device, and a computer-readable storage medium for graph segmentation.
Background
Graph partitioning is a technique and process that divides a graph into specific regions with unique properties and proposes objects of interest. From a mathematical perspective, graph partitioning is the process of dividing a graph into mutually disjoint regions. The process of graph partitioning is also a labeling process.
The existing graph dividing mode is to divide a graph based on a straight line dividing line, when the dividing line is an irregular curve, an intersection point of the graph and the dividing line cannot be accurately obtained, and the graph cannot be effectively divided.
In summary, how to effectively solve the problems that when the dividing line is an irregular curve, the intersection point of the graph and the dividing line can not be accurately obtained, the graph can not be effectively divided, and the like, is a problem that needs to be solved by those skilled in the art at present.
Disclosure of Invention
The invention aims to provide a graph segmentation method, which does not limit the type of a segmentation line and realizes effective segmentation of a graph; another object of the present invention is to provide a graphic segmentation apparatus, a device and a computer-readable storage medium.
In order to solve the technical problems, the invention provides the following technical scheme:
a method of graph partitioning, comprising:
respectively acquiring first coordinate path information corresponding to a first graph and second coordinate path information corresponding to a second graph;
judging whether intersection point coordinates exist in the first coordinate path information and the second coordinate path information or not;
if so, determining that an overlapping area exists between the first graph and the second graph;
calculating third coordinate path information corresponding to the overlapping area according to the first coordinate path information and the second coordinate path information;
and performing segmentation operation on the first graph or the second graph according to the third coordinate path information.
In an embodiment of the present invention, performing a dividing operation on the first graph or the second graph according to the third coordinate path information includes:
and segmenting the first graph or the second graph to obtain the overlapping area by utilizing a graph intersection mode function according to the third coordinate path information.
In an embodiment of the present invention, performing a dividing operation on the first graph or the second graph according to the third coordinate path information includes:
and segmenting a residual region except the overlapping region from the first graph or the second graph by utilizing a graph exclusion mode function according to the third coordinate path information.
In an embodiment of the present invention, calculating third coordinate path information corresponding to the overlap area according to the first coordinate path information and the second coordinate path information includes:
acquiring coordinates of each intersection point of the first coordinate path information and the second coordinate path information;
and calculating third coordinate path information corresponding to the overlapping area by combining the first coordinate path information, the second coordinate path information and the coordinates of the intersection points.
A graph dividing apparatus comprising:
the path information acquisition module is used for respectively acquiring first coordinate path information corresponding to the first graph and second coordinate path information corresponding to the second graph;
the judging module is used for judging whether intersection point coordinates exist in the first coordinate path information and the second coordinate path information;
an overlap region determining module, configured to determine that an overlap region exists between the first graph and the second graph when it is determined that intersection coordinates exist between the first coordinate path information and the second coordinate path information;
the path information calculation module is used for calculating third coordinate path information corresponding to the overlapping area according to the first coordinate path information and the second coordinate path information;
and the graph dividing module is used for carrying out dividing operation on the first graph or the second graph according to the third coordinate path information.
In an embodiment of the present invention, the graph dividing module is a module that divides the first graph or the second graph into the overlapping region according to the third coordinate path information by using a graph intersection mode function.
In an embodiment of the present invention, the graph dividing module is a module that divides the first graph or the second graph into remaining regions except the overlapping region according to the third coordinate path information by using a graph exclusion mode function.
In a specific embodiment of the present invention, the path information calculation module includes:
an intersection coordinate obtaining sub-module, configured to obtain coordinates of each intersection of the first coordinate path information and the second coordinate path information;
and the path information calculation submodule is used for calculating third coordinate path information corresponding to the overlapping area by combining the first coordinate path information, the second coordinate path information and the coordinates of the intersection points.
A graph dividing apparatus comprising:
a memory for storing a computer program;
a processor for implementing the steps of the graph partitioning method as described above when executing the computer program.
A computer-readable storage medium, having stored thereon a computer program which, when being executed by a processor, carries out the steps of the graph cut method as set forth above.
By applying the method provided by the embodiment of the invention, first coordinate path information corresponding to a first graph and second coordinate path information corresponding to a second graph are respectively obtained; judging whether intersection point coordinates exist in the first coordinate path information and the second coordinate path information; if so, determining that the first graph and the second graph have an overlapping area; calculating third coordinate path information corresponding to the overlapping area according to the first coordinate path information and the second coordinate path information; and performing segmentation operation on the first graph or the second graph according to the third coordinate path information. The coordinate path information of the first graph and the second graph with the overlapping area is obtained respectively, the coordinate path information corresponding to the overlapping area is calculated according to the coordinate path information corresponding to the two graphs respectively, and graph segmentation is achieved according to the coordinate path information corresponding to the overlapping area. The invention does not limit the type of the dividing line and realizes the effective division of the graph.
Accordingly, embodiments of the present invention further provide a graph partitioning apparatus, a device and a computer readable storage medium corresponding to the graph partitioning method, which have the above technical effects, and are not described herein again.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
FIG. 1 is a flow chart of an embodiment of a graph partitioning method according to the present invention;
FIG. 2 is a diagram illustrating a graph to be divided according to an embodiment of the present invention;
FIG. 3 is a diagram illustrating a combination of graphics with overlapping regions according to an embodiment of the present invention;
FIG. 4 is a flowchart illustrating another embodiment of a graph partitioning method according to the present invention;
FIG. 5 is a diagram illustrating a segmented region obtained by graph segmentation according to an embodiment of the present invention;
FIG. 6 is a schematic diagram of a residual region obtained after dividing an overlapped region according to an embodiment of the present invention;
FIG. 7 is a block diagram of a graph partitioning apparatus according to an embodiment of the present invention;
fig. 8 is a block diagram of a graph partitioning apparatus according to an embodiment of the present invention.
Detailed Description
In order that those skilled in the art will better understand the disclosure, the invention will be described in further detail with reference to the accompanying drawings and specific embodiments. It is to be understood that the described embodiments are merely exemplary of the invention, and not restrictive of the full scope of the 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.
The first embodiment is as follows:
referring to fig. 1, fig. 1 is a flowchart of an implementation of a graph partitioning method according to an embodiment of the present invention, where the method may include the following steps:
s101: and respectively acquiring first coordinate path information corresponding to the first graph and second coordinate path information corresponding to the second graph.
And a coordinate system is established in advance, and first coordinate path information corresponding to the first graph and second coordinate path information corresponding to the second graph are respectively obtained, namely position information of the edges of the first graph and the second graph in the coordinate system is respectively obtained.
Referring to fig. 2, fig. 2 is a schematic diagram of a graph to be divided according to an embodiment of the present invention. And (3) taking the upper edge of the system screen as an x axis, taking the upper edge of the system screen as a positive direction of the x axis to the right, taking the left edge of the system screen as a y axis, and downwards locating the positive direction of the y axis to establish a coordinate system in advance. If the coordinates of the upper left corner of the system screen are (0, 0), the coordinates of the lower right corner are (1920, 1080), and the resolution of the system screen is 1920 x 1080. If the area a is a graph to be divided, the area a and the area B may be regarded as one of the first graph and the second graph, respectively, and if the area a is regarded as the first graph and the area B is regarded as the second graph, the area a may also be regarded as the second graph and the area B is regarded as the first graph, which is not limited in the embodiment of the present invention.
S102: and judging whether the first coordinate path information and the second coordinate path information have intersection point coordinates or not, if so, executing the step S103, and if not, not processing.
After first coordinate path information corresponding to the first graph and second coordinate path information corresponding to the second graph are respectively obtained, whether intersection point coordinates exist in the first coordinate path information and the second coordinate path information is judged. Such as determining whether there is a coincident coordinate point in a first set of coordinate points that constitute the first coordinate path information and a second set of coordinate points that constitute the second coordinate path information.
S103: determining that there is an overlapping area between the first graphic and the second graphic.
When the first coordinate path information and the second coordinate path information are determined to have intersection point coordinates, it is determined that the first graph and the second graph have an overlapping area.
Referring to fig. 3, fig. 3 is a schematic diagram of a combination of graphs with an overlapping area according to an embodiment of the present invention. There is an overlapping area of area a and area B, i.e., area C.
S104: and calculating third coordinate path information corresponding to the overlapping area according to the first coordinate path information and the second coordinate path information.
After first coordinate path information corresponding to the first graph and second coordinate path information corresponding to the second graph are respectively obtained, third coordinate path information corresponding to the overlapping area is calculated according to the first coordinate path information and the second coordinate path information. For example, the intersection coordinates of the first coordinate path information and the second coordinate path information are obtained, and the third coordinate path information corresponding to the overlapping area of the two graphs is obtained by cutting the first coordinate path information and the second coordinate path information by the intersection coordinates. To support the above example, after the coordinate path information of the area a and the area B are acquired, the coordinate path information of the area C is calculated.
S105: and performing segmentation operation on the first graph or the second graph according to the third coordinate path information.
And after the third coordinate path information corresponding to the overlapping area is obtained through calculation, the first graph or the second graph is subjected to segmentation operation according to the third coordinate path information. In connection with the above example, after the coordinate path information of the area C is calculated, the area a may be divided according to the coordinate path information of the area C, or the area B may be divided according to the coordinate path information of the area C.
By applying the method provided by the embodiment of the invention, first coordinate path information corresponding to a first graph and second coordinate path information corresponding to a second graph are respectively obtained; judging whether intersection point coordinates exist in the first coordinate path information and the second coordinate path information; if so, determining that the first graph and the second graph have an overlapping area; calculating third coordinate path information corresponding to the overlapping area according to the first coordinate path information and the second coordinate path information; and performing segmentation operation on the first graph or the second graph according to the third coordinate path information. The coordinate path information of the first graph and the second graph with the overlapping area is obtained respectively, the coordinate path information corresponding to the overlapping area is calculated according to the coordinate path information corresponding to the two graphs respectively, and graph segmentation is achieved according to the coordinate path information corresponding to the overlapping area. The invention does not limit the type of the dividing line and realizes the effective division of the graph.
It should be noted that, based on the first embodiment, the embodiment of the present invention further provides a corresponding improvement scheme. In the following embodiments, steps that are the same as or correspond to those in the first embodiment may be referred to each other, and corresponding advantageous effects may also be referred to each other, which are not described in detail in the following modified embodiments.
Referring to fig. 4, fig. 4 is a flowchart of another implementation of a graph partitioning method according to an embodiment of the present invention, where the method may include the following steps:
s401: and respectively acquiring first coordinate path information corresponding to the first graph and second coordinate path information corresponding to the second graph.
S402: and judging whether the first coordinate path information and the second coordinate path information have intersection point coordinates, if so, executing step S403, and if not, not processing.
S403: determining that there is an overlapping area between the first graphic and the second graphic.
S404: and acquiring coordinates of each intersection point of the first coordinate path information and the second coordinate path information.
After first coordinate path information corresponding to the first graph and second coordinate path information corresponding to the second graph are respectively obtained, coordinates of each intersection point of the first coordinate path information and the second coordinate path information are obtained.
S405: and calculating third coordinate path information corresponding to the overlapping area by combining the first coordinate path information, the second coordinate path information and the coordinates of the intersection points.
After the coordinates of each intersection point of the first coordinate path information and the second coordinate path information are obtained, the third coordinate path information corresponding to the overlapping area is calculated by combining the first coordinate path information, the second coordinate path information and the coordinates of each intersection point. If the first sub-paths of the first coordinate path information belonging to the overlapping region are respectively obtained according to the intersection point coordinates, the first sub-paths can be obtained by calculation according to the intersection point coordinates and the path direction of the first coordinate path information; and respectively acquiring a second sub-path of which the second coordinate path information belongs to the overlapping area according to the intersection point coordinates, and specifically calculating according to the intersection point coordinates and the path direction of the second coordinate path information to obtain the second sub-path. And a closed path formed by the first sub-path and the second sub-path is the third coordinate path information corresponding to the overlapping area.
S406: and segmenting the first graph or the second graph to obtain an overlapping area by utilizing a graph intersection mode function according to the third coordinate path information.
After the third coordinate path information corresponding to the overlapping region of the first graph and the second graph is obtained through calculation, the overlapping region is obtained by dividing the first graph or the second graph according to the third coordinate path information through a graph intersection mode function (geometri composite. Thus, the overlapping area of the two graphs is obtained by utilizing the graph intersection mode function through segmentation.
The graph intersection mode function is a function of the overlapping area obtained by automatically selecting the internal part of the closed area enclosed by the third coordinate path information according to the third coordinate path information corresponding to the overlapping area.
Referring to fig. 5, fig. 5 is a schematic diagram of a divided region obtained by dividing a graph according to an embodiment of the present invention. And dividing the region A into regions C according to the coordinate path information of the region C by using a graph intersection mode function. In such a ratio, the region C may be obtained by dividing the region B by the graph intersection mode function based on the coordinate path information of the region C.
S407: and dividing the residual region except the overlapped region from the first graph or the second graph by utilizing a graph exclusion mode function according to the third coordinate path information.
After the third coordinate path information corresponding to the overlapping region of the first graph and the second graph is obtained through calculation, a graph exclusion mode function (geometropic) is used for obtaining a residual region except the overlapping region by dividing the first graph or the second graph according to the third coordinate path information. Thereby, the remaining regions of the two patterns except the overlapped region are obtained by dividing by using the pattern exclusion mode function.
And the graph exclusion mode function is a function for automatically selecting the outer part of the closed area surrounded by the third coordinate path information in the graph according to the third coordinate path information corresponding to the overlapped area, so that the residual area is obtained.
Referring to fig. 6, fig. 6 is a schematic diagram of a residual region obtained after dividing the overlapping region according to an embodiment of the present invention. And dividing the area A by using a graph exclusion mode function according to the coordinate path information of the area C to obtain a divided area D. In such a ratio, the remaining region other than the region C may be obtained by dividing the region B by the graph exclusion mode function from the coordinate path information of the region C.
Corresponding to the above method embodiments, the embodiments of the present invention further provide a graph partitioning apparatus, and the graph partitioning apparatus described below and the graph partitioning method described above may be referred to in correspondence with each other.
Referring to fig. 7, fig. 7 is a block diagram of a graph partitioning apparatus according to an embodiment of the present invention, where the apparatus may include:
a path information obtaining module 71, configured to obtain first coordinate path information corresponding to the first graph and second coordinate path information corresponding to the second graph respectively; wherein the first graph and the second graph have an overlapping region;
a judging module 72, configured to judge whether intersection coordinates exist in the first coordinate path information and the second coordinate path information;
an overlap region determining module 73, configured to determine that an overlap region exists between the first graph and the second graph when it is determined that intersection coordinates exist between the first coordinate path information and the second coordinate path information;
a path information calculation module 74, configured to calculate third coordinate path information corresponding to the overlap area according to the first coordinate path information and the second coordinate path information;
and a graph dividing module 75, configured to perform a dividing operation on the first graph or the second graph according to the third coordinate path information.
By applying the device provided by the embodiment of the invention, first coordinate path information corresponding to a first graph and second coordinate path information corresponding to a second graph are respectively obtained; judging whether intersection point coordinates exist in the first coordinate path information and the second coordinate path information; if so, determining that the first graph and the second graph have an overlapping area; calculating third coordinate path information corresponding to the overlapping area according to the first coordinate path information and the second coordinate path information; and performing segmentation operation on the first graph or the second graph according to the third coordinate path information. The coordinate path information of the first graph and the second graph with the overlapping area is obtained respectively, the coordinate path information corresponding to the overlapping area is calculated according to the coordinate path information corresponding to the two graphs respectively, and graph segmentation is achieved according to the coordinate path information corresponding to the overlapping area. The invention does not limit the type of the dividing line and realizes the effective division of the graph.
In an embodiment of the present invention, the graph dividing module 73 is a module that divides the first graph or the second graph into the overlapping region according to the third coordinate path information by using the graph intersection mode function.
In an embodiment of the present invention, the graph dividing module 73 is a module that divides the first graph or the second graph into a remaining region excluding the overlapping region according to the third coordinate path information by using the graph excluding mode function.
In one embodiment of the present invention, the path information calculation module 72 includes:
the intersection point coordinate acquisition submodule is used for acquiring each intersection point coordinate of the first coordinate path information and the second coordinate path information;
and the path information calculation submodule is used for combining the first coordinate path information, the second coordinate path information and the coordinates of the intersection points to calculate third coordinate path information corresponding to the overlapping area.
Corresponding to the above method embodiment, referring to fig. 8, fig. 8 is a schematic diagram of a graph partitioning apparatus provided by the present invention, where the apparatus may include:
a memory 81 for storing a computer program;
the processor 82, when executing the computer program stored in the memory 81, may implement the following steps:
respectively acquiring first coordinate path information corresponding to a first graph and second coordinate path information corresponding to a second graph; judging whether intersection point coordinates exist in the first coordinate path information and the second coordinate path information; if so, determining that the first graph and the second graph have an overlapping area; calculating third coordinate path information corresponding to the overlapping area according to the first coordinate path information and the second coordinate path information; and performing segmentation operation on the first graph or the second graph according to the third coordinate path information.
For the introduction of the device provided by the present invention, please refer to the above method embodiment, which is not described herein again.
Corresponding to the above method embodiment, the present invention further provides a computer-readable storage medium having a computer program stored thereon, the computer program, when executed by a processor, implementing the steps of:
respectively acquiring first coordinate path information corresponding to a first graph and second coordinate path information corresponding to a second graph; judging whether intersection point coordinates exist in the first coordinate path information and the second coordinate path information; if so, determining that the first graph and the second graph have an overlapping area; calculating third coordinate path information corresponding to the overlapping area according to the first coordinate path information and the second coordinate path information; and performing segmentation operation on the first graph or the second graph according to the third coordinate path information.
The computer-readable storage medium may include: various media capable of storing program codes, such as a usb disk, a removable hard disk, a Read-only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk.
For the introduction of the computer-readable storage medium provided by the present invention, please refer to the above method embodiments, which are not described herein again.
The embodiments are described in a progressive manner, each embodiment focuses on differences from other embodiments, and the same or similar parts among the embodiments are referred to each other. The device, the apparatus and the computer-readable storage medium disclosed in the embodiments correspond to the method disclosed in the embodiments, so that the description is simple, and the relevant points can be referred to the description of the method.
The principle and the implementation of the present invention are explained in the present application by using specific examples, and the above description of the embodiments is only used to help understanding the technical solution and the core idea of the present invention. It should be noted that, for those skilled in the art, it is possible to make various improvements and modifications to the present invention without departing from the principle of the present invention, and those improvements and modifications also fall within the scope of the claims of the present invention.
Claims (10)
1. A method of graph partitioning, comprising:
respectively acquiring first coordinate path information corresponding to a first graph and second coordinate path information corresponding to a second graph;
judging whether intersection point coordinates exist in the first coordinate path information and the second coordinate path information or not;
if so, determining that an overlapping area exists between the first graph and the second graph;
calculating third coordinate path information corresponding to the overlapping area according to the first coordinate path information and the second coordinate path information;
and performing segmentation operation on the first graph or the second graph according to the third coordinate path information.
2. The graph splitting method according to claim 1, wherein performing a splitting operation on the first graph or the second graph according to the third coordinate path information includes:
and segmenting the first graph or the second graph to obtain the overlapping area by utilizing a graph intersection mode function according to the third coordinate path information.
3. The graph splitting method according to claim 1, wherein performing a splitting operation on the first graph or the second graph according to the third coordinate path information includes:
and segmenting a residual region except the overlapping region from the first graph or the second graph by utilizing a graph exclusion mode function according to the third coordinate path information.
4. The graph partitioning method according to any one of claims 1 to 3, wherein calculating third coordinate path information corresponding to the overlap region based on the first coordinate path information and the second coordinate path information includes:
acquiring coordinates of each intersection point of the first coordinate path information and the second coordinate path information;
and calculating third coordinate path information corresponding to the overlapping area by combining the first coordinate path information, the second coordinate path information and the coordinates of the intersection points.
5. A pattern segmentation apparatus, comprising:
the path information acquisition module is used for respectively acquiring first coordinate path information corresponding to the first graph and second coordinate path information corresponding to the second graph;
the judging module is used for judging whether intersection point coordinates exist in the first coordinate path information and the second coordinate path information;
an overlap region determining module, configured to determine that an overlap region exists between the first graph and the second graph when it is determined that intersection coordinates exist between the first coordinate path information and the second coordinate path information;
the path information calculation module is used for calculating third coordinate path information corresponding to the overlapping area according to the first coordinate path information and the second coordinate path information;
and the graph dividing module is used for carrying out dividing operation on the first graph or the second graph according to the third coordinate path information.
6. The graph partitioning apparatus according to claim 5, wherein the graph partitioning module is a module that partitions the overlapping area from the first graph or the second graph according to the third coordinate path information by using a graph intersection mode function.
7. The graph dividing apparatus according to claim 5, wherein the graph dividing module is specifically a module that divides a remaining region other than the overlap region from the first graph or the second graph according to the third coordinate path information by using a graph excluding mode function.
8. The graph partitioning apparatus according to any one of claims 5 to 7, wherein the path information calculating module includes:
an intersection coordinate obtaining sub-module, configured to obtain coordinates of each intersection of the first coordinate path information and the second coordinate path information;
and the path information calculation submodule is used for calculating third coordinate path information corresponding to the overlapping area by combining the first coordinate path information, the second coordinate path information and the coordinates of the intersection points.
9. A pattern segmentation apparatus, comprising:
a memory for storing a computer program;
a processor for implementing the steps of the graph partitioning method according to any one of claims 1 to 4 when executing the computer program.
10. A computer-readable storage medium, in which a computer program is stored which, when being executed by a processor, carries out the steps of the graph cut method according to any one of claims 1 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010962552.6A CN111814803A (en) | 2020-09-14 | 2020-09-14 | Graph segmentation method, device and equipment and computer readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010962552.6A CN111814803A (en) | 2020-09-14 | 2020-09-14 | Graph segmentation method, device and equipment and computer readable storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111814803A true CN111814803A (en) | 2020-10-23 |
Family
ID=72860098
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010962552.6A Pending CN111814803A (en) | 2020-09-14 | 2020-09-14 | Graph segmentation method, device and equipment and computer readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111814803A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112288756A (en) * | 2020-12-28 | 2021-01-29 | 湖南新云网科技有限公司 | Graph segmentation method and device, electronic equipment and readable storage medium |
| CN115810042A (en) * | 2023-02-14 | 2023-03-17 | 成都数联云算科技有限公司 | Method, apparatus, medium, device, and program product for acquiring graphics overlay area |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109727252A (en) * | 2019-01-29 | 2019-05-07 | 广联达科技股份有限公司 | A kind of method of any cut-off rule segmentation polygon |
| US20190266781A1 (en) * | 2018-02-23 | 2019-08-29 | Ephere Inc. | Method of rendering computer graphics curves |
-
2020
- 2020-09-14 CN CN202010962552.6A patent/CN111814803A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20190266781A1 (en) * | 2018-02-23 | 2019-08-29 | Ephere Inc. | Method of rendering computer graphics curves |
| CN109727252A (en) * | 2019-01-29 | 2019-05-07 | 广联达科技股份有限公司 | A kind of method of any cut-off rule segmentation polygon |
Non-Patent Citations (3)
| Title |
|---|
| ADEGEO: ""How to: Create a Combined Geometry"", 《HTTPS://DOCS.MICROSOFT.COM/EN-US/DOTNET/DESKTOP/WPF/GRAPHICS-MULTIMEDIA/HOW-TO-CREATE-A-COMBINED-GEOMETRY?VIEW=NETFRAMEWORKDESKTOP-4.8》 * |
| LEGENDLYC: ""Adobe Illustrator 中的路径查找器"", 《HTTPS://BLOG.CSDN.NET/QQ_26900233/ARTICLE/DETAILS/88712758?UTM_MEDIUM=DISTRIBUTE.PC_AGGPAGE_SEARCH_RESULT.NONE-TASK-BLOG-2~ALL~FIRST_RANK_V2~RANK_V25-1-88712758.NONECASE&UTM_TERM=AI怎么减去重叠部分&SPM=1000.2123.3001.4430》 * |
| 百度经验: ""Adobe Illustrator 剪切、裁割重叠图形"", 《HTTPS://JINGYAN.BAIDU.COM/ARTICLE/CA41422F29E26C1EAE99ED12.HTML》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112288756A (en) * | 2020-12-28 | 2021-01-29 | 湖南新云网科技有限公司 | Graph segmentation method and device, electronic equipment and readable storage medium |
| CN112288756B (en) * | 2020-12-28 | 2021-04-30 | 湖南新云网科技有限公司 | Graph segmentation method and device, electronic equipment and readable storage medium |
| CN115810042A (en) * | 2023-02-14 | 2023-03-17 | 成都数联云算科技有限公司 | Method, apparatus, medium, device, and program product for acquiring graphics overlay area |
| CN115810042B (en) * | 2023-02-14 | 2023-05-05 | 成都数联云算科技有限公司 | Image IOU acquisition method, device, medium and equipment based on target detection |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111814803A (en) | Graph segmentation method, device and equipment and computer readable storage medium | |
| CN113313083B (en) | Text detection method and device | |
| CN104517109A (en) | QR code image correction method and system | |
| CN111523531B (en) | Word processing method, word processing device, electronic equipment and computer readable storage medium | |
| CN113269280B (en) | Text detection method and device, electronic equipment and computer readable storage medium | |
| CN112388710B (en) | Method and device for cutting edges of board separator, storage medium and board separator | |
| CN116542926B (en) | Method, device, equipment and storage medium for identifying defects of two-dimension codes of battery | |
| CN103837135A (en) | Workpiece detecting method and system | |
| CN109949421B (en) | Triangular net cutting method and device | |
| CN109360215B (en) | Method, device and equipment for searching outer contour of three-dimensional model and storage medium | |
| CN114115117B (en) | Tool path generation method and system with normal machining allowance | |
| CN116385415A (en) | Edge defect detection method, device, equipment and storage medium | |
| CN111489446B (en) | Multi-hole surface splitting method and device, electronic equipment and readable storage medium | |
| CN109496284B (en) | Method for recording machining track by bitmap and numerical control equipment | |
| CN115187469A (en) | Image processing method and device in 3D printing, storage medium and terminal | |
| CN114283436A (en) | Table identification method, device, equipment and storage medium | |
| US11423612B2 (en) | Correcting segmented surfaces to align with a rendering of volumetric data | |
| CN109410304B (en) | Projection determination method, device and equipment | |
| CN112906708A (en) | Picture processing method and device, electronic equipment and computer storage medium | |
| CN113034366A (en) | Splicing seam-free SAR image segmentation parallel acceleration processing method | |
| CN113538460B (en) | Shale CT image cutting method and system | |
| US20240020846A1 (en) | Corner point detection method and apparatus | |
| CN115412928B (en) | Flower arrangement base station identification method and device based on space technology | |
| CN116721100B (en) | Industrial vision narrow-area cutting method and device, electronic equipment and storage medium | |
| KR101555989B1 (en) | Uncertain boundary detecting system of cadastral data and method thereof |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20201023 |