CN114842494A - Method for automatically identifying connection relation of station wiring diagrams of power system - Google Patents
Method for automatically identifying connection relation of station wiring diagrams of power system Download PDFInfo
- Publication number
- CN114842494A CN114842494A CN202111589662.3A CN202111589662A CN114842494A CN 114842494 A CN114842494 A CN 114842494A CN 202111589662 A CN202111589662 A CN 202111589662A CN 114842494 A CN114842494 A CN 114842494A
- Authority
- CN
- China
- Prior art keywords
- straight line
- lines
- straight
- horizontal
- line
- 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
- 238000010586 diagram Methods 0.000 title claims abstract description 74
- 238000000034 method Methods 0.000 title claims abstract description 40
- 238000001514 detection method Methods 0.000 claims abstract description 22
- 238000012216 screening Methods 0.000 claims abstract description 17
- 238000013138 pruning Methods 0.000 claims abstract description 11
- 238000001914 filtration Methods 0.000 claims abstract description 6
- 238000007781 pre-processing Methods 0.000 claims abstract description 4
- 238000010422 painting Methods 0.000 claims description 5
- 230000009191 jumping Effects 0.000 claims description 2
- 238000012805 post-processing Methods 0.000 abstract description 3
- 238000011284 combination treatment Methods 0.000 abstract description 2
- 239000011248 coating agent Substances 0.000 description 2
- 238000000576 coating method Methods 0.000 description 2
- 238000011960 computer-aided design Methods 0.000 description 2
- 238000012423 maintenance Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012360 testing method Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000000926 separation method Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000011282 treatment Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F18/00—Pattern recognition
- G06F18/20—Analysing
- G06F18/22—Matching criteria, e.g. proximity measures
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/06—Energy or water supply
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02E—REDUCTION OF GREENHOUSE GAS [GHG] EMISSIONS, RELATED TO ENERGY GENERATION, TRANSMISSION OR DISTRIBUTION
- Y02E60/00—Enabling technologies; Technologies with a potential or indirect contribution to GHG emissions mitigation
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Business, Economics & Management (AREA)
- Physics & Mathematics (AREA)
- Health & Medical Sciences (AREA)
- Economics (AREA)
- Data Mining & Analysis (AREA)
- General Physics & Mathematics (AREA)
- General Health & Medical Sciences (AREA)
- Life Sciences & Earth Sciences (AREA)
- Strategic Management (AREA)
- Tourism & Hospitality (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Water Supply & Treatment (AREA)
- Public Health (AREA)
- Primary Health Care (AREA)
- Artificial Intelligence (AREA)
- Bioinformatics & Cheminformatics (AREA)
- Bioinformatics & Computational Biology (AREA)
- Computer Vision & Pattern Recognition (AREA)
- Evolutionary Biology (AREA)
- Evolutionary Computation (AREA)
- General Engineering & Computer Science (AREA)
- Image Analysis (AREA)
Abstract
The invention discloses a method for automatically identifying the connection relation of a station wiring diagram of an electric power system, which comprises the following steps of firstly, carrying out preprocessing operation on the station wiring diagram, whitewashing primitives and characters and whitewashing a frame; and then, detecting the straight lines of the plant station wiring diagram by using an LSD straight line detection algorithm, screening and classifying, and carrying out multi-step combination treatment on the screened and classified straight lines to obtain complete straight lines. And cutting according to the intersection point between the complete straight lines and the intersection point between the straight line and the bus to obtain an independent straight line section. And then matching the end points of the primitives or other straight line segments on all the straight line segments to obtain a preliminary connecting line list. Performing post-processing operation on the connecting line list, wherein the post-processing operation comprises filtering the connecting lines of which two end points are connected with the same graphic primitive; pruning the connecting wires for many times; some connecting lines are reconnected, and finally the identified connecting line list is output. The method has higher identification accuracy and identification speed, and solves the problems of complex manual drawing and easy error of the plant station wiring diagram.
Description
Technical Field
The invention relates to the technical field of electrical and computer vision, in particular to a method for automatically identifying the connection relation of power system station wiring diagrams, which is particularly suitable for identifying and arranging the connection relation of CAD (computer-aided design) pictures which are referred to when a scheduling technical support system draws.
Background
The scheduling control system adopts CIM/G format files based on a general information model to describe the pictures of the plant station diagrams, and the current CIM/G pictures are mainly drawn and recorded manually by scheduling operation and maintenance personnel by referring to original design pictures of the plant station diagrams. Due to the complex pattern of the factory station wiring diagram and the numerous types of equipment, the workload of manual drawing is large, the maintenance work is complicated, and the problems of attribute loss, association error, virtual connection of connecting lines and the like are easy to occur.
The current line detection method is mainly realized by methods such as Hough transform, LSD line detection and the like. Compared with Hough transform, the accuracy and the detection speed of LSD line detection are higher, but the problems of breakage, separation and the like of the detected line still exist.
Disclosure of Invention
The invention aims to overcome the defects of the prior art and provide a method for automatically identifying the connection relation of the plant station wiring diagram of the power system.
In order to realize the purpose, the technical scheme provided by the invention is as follows: a method for automatically identifying the connection relation of a power system plant station wiring diagram comprises the following steps:
1) picture preprocessing: painting primitives and characters on a plant station wiring diagram and painting a frame of the plant station wiring diagram;
2) detecting straight lines of a plant station wiring diagram by using an LSD (least squares) straight line detection algorithm, screening and classifying the straight lines into horizontal straight lines and vertical straight lines;
3) merging the screened and classified horizontal straight lines and vertical straight lines to obtain complete straight lines;
4) cutting the complete straight line obtained in the step 3) according to the intersection point of the horizontal straight line and the vertical straight line and the intersection point of the vertical straight line and the horizontal bus to obtain an independent straight line section;
5) matching the end points of the primitives or other straight line segments to obtain a primary connecting line list;
6) filtering connecting lines of which two end points are connected with the same primitive, and directly jumping to the step 9) without executing the subsequent step 7) and the step 8) if the connecting lines of the plant station wiring diagram are completely identified after filtering, otherwise executing the subsequent step 7) and the step 8);
7) carrying out multiple connecting line pruning to screen out redundant connecting lines caused by the existence of non-standard primitives;
8) reconnecting some connecting lines which are cut due to the appearance of the non-standard primitives;
9) and outputting the identified connecting line list, namely the final connecting line list, which comprises a horizontal connecting line list and a vertical connecting line list.
Further, in the step 1), a primitive frame and a text frame are whitewashed on the plant station wiring diagram according to the recognition result of the primitive and the text, and the interference of the primitive and the text in the plant station wiring diagram on the subsequent straight line detection is eliminated; and according to the primitive and character recognition result, obtaining the position information of the recognized primitives and characters, finding out boundary primitives or characters of the plant station wiring diagram, taking the boundary primitives or characters as new boundaries, whitewashing out the parts outside the boundaries, eliminating picture borders, and eliminating the interference of the original picture borders on the subsequent straight line detection.
Further, in step 2), the operations of screening and classifying the lines detected by the LSD line detection algorithm are specifically: from the detected straight lines, straight lines having angles in the range of [ -5 °,5 ° ] and [85 °,95 ° ] are screened and classified into horizontal and vertical straight lines, respectively.
Further, in step 3), performing operation of merging straight lines twice on the horizontal and vertical straight lines which are broken and separated after screening and classification according to the coordinate, angle and length information of two end points of the straight lines, wherein the specific operation is as follows: the first merging is to merge parallel straight lines with only one end point adjacent, and the second merging is to merge parallel straight lines with two corresponding end points adjacent to obtain all complete straight lines.
Further, in step 4), according to the intersection point of the horizontal straight line and the vertical straight line, cutting the two intersected horizontal straight lines and vertical straight lines into independent straight line segments, and the specific steps are as follows: and traversing all the horizontal straight lines and all the vertical straight lines, judging whether the horizontal straight line i and the vertical straight line j are intersected according to the position information of the horizontal straight line i and the vertical straight line j, and cutting the horizontal straight line and the vertical straight line into independent straight line sections according to the intersection point of the horizontal straight line i and the vertical straight line j if the horizontal straight line i and the vertical straight line j are intersected.
Further, in step 4), the vertical straight line is cut into independent straight line segments according to the intersection point of the vertical straight line and the horizontal bus, and the method specifically comprises the following steps: and traversing all the vertical straight lines and all the buses, judging whether the vertical straight line i 'and the horizontal bus j' are intersected or not according to the position information of the vertical straight line i 'and the horizontal bus j', and if so, cutting the vertical straight line into independent straight line sections according to the intersection point of the vertical straight line i 'and the horizontal bus j'.
Further, in step 5), matching the end points of the primitives or other straight line segments on all the straight line segments, specifically: one end point of one connecting line can only be matched with one primitive or matched with one or more connecting lines, so that all the straight line segments are traversed, one end point of each straight line segment is tried to be matched with the primitive, the matching rule is that if the distance between the end point of each straight line segment and the primitive is smaller than a set value, the matching is successful, and if the matching is successful, the other end point is matched; if the matching fails, trying to match the end points of other straight-line segments, wherein the matching rule is that if the distance between a certain end point of one straight-line segment and a certain end point of another straight-line segment is smaller than a set value, the matching is successful; if both end points of a straight line segment can be matched with the end points of a primitive or other straight line segments, the straight line segment is added into the connecting line list.
Further, in step 6), a connecting line is screened out, wherein the two end points are connected with the same primitive, and the specific operation is as follows: and traversing all the connecting lines to obtain the connection relation of the two end points of one connecting line, and deleting the connecting line from the connecting line list if the primitives connected by the two end points are the same.
Further, in step 7), some nonstandard primitives which do not need to be identified exist in the plant station wiring diagram, and straight line segments connecting the nonstandard primitives also do not need to be identified, so that the connecting line is subjected to multiple pruning treatments, and the specific steps are as follows: traversing all the existing connecting line lists, and for the connecting line i ', if the two end points of the connecting line i ' have a connection relation with the straight line segment j ', if the straight line segment j ' does not exist in the connecting line lists, indicating that the straight line segment j ' is a straight line segment which does not need to be identified, and deleting the connection relation with the straight line segment j ' in the connecting line i '; if the connection relation between the connecting line i ' and the straight line segment j ' is deleted, and the connection relation does not exist between a certain end point of the connecting line i ' and the primitive or other straight line segments, the connecting line i ' is also the straight line segment which does not need to be identified, and the connecting line i ' is deleted; the process is a process of pruning the connecting line once, and the connecting line pruning is carried out for a plurality of times, and all the straight line segments which are not required to be identified are deleted.
Further, in step 8), some connecting lines cut due to the appearance of non-standard primitives are reconnected, that is, some connecting lines cut due to crossing with straight line segments which do not need to be recognized are reconnected, and the specific steps are as follows: and combining all the horizontal connecting lines of the identified horizontal connecting line list in pairs, combining the two horizontal connecting lines i ' and j ' of any combination into a new horizontal connecting line k if some end point of the i ' is provided with j ' and only j ' is connected with the end point, deleting the i ' and the j ' in the original horizontal connecting line list, adding k into the horizontal connecting line list, and similarly, adopting the same operation for the vertical connecting line list.
Compared with the prior art, the invention has the following advantages and beneficial effects:
1. the invention realizes the function of automatically identifying the connection relation of the plant station wiring diagrams of the power system, solves the problems of complexity and easy error in manual drawing of the traditional plant station wiring diagrams, and simultaneously reduces the repeated working pressure of automation personnel.
2. The invention has fast identification speed, the time required for identification is within 3 seconds for the pictures with the size less than 5000 multiplied by 5000, and the time required for identification is within 5 seconds for the pictures with the size less than 10000 multiplied by 10000.
3. The method has high identification accuracy, is applied to a test set with 20 pictures, carries out manual standard on the connection relation of each picture in the test set, and obtains the accuracy rate of more than 90 percent after calculating the accuracy rate of the connection relation.
4. The method can be applied to more complex scenes, and can effectively eliminate the interference of non-standard primitives when the non-standard primitives which do not need to be identified exist in the graph, thereby ensuring higher identification accuracy.
Drawings
FIG. 1 is a flow chart of the present invention.
FIG. 2 is an example factory floor wiring diagram used by embodiments.
Fig. 3 is a schematic diagram of the result of whiteout the primitives and characters.
FIG. 4 is a new boundary diagram of a plant wiring diagram.
FIG. 5 is a diagram illustrating the result of deleting the frame of the plant wiring diagram.
FIG. 6 is a diagram showing the results of the linear detection, screening and classification.
FIG. 7 is a graph showing the results after linear combination.
Fig. 8 is a schematic view of a multi-branch type connection line module of a factory station wiring diagram before linear cutting.
Fig. 9 is a schematic diagram of a multi-branch type connection line module of a plant station wiring diagram after linear cutting.
Fig. 10 is a schematic diagram of a connecting line intersecting a bus in a factory station wiring diagram before linear cutting.
FIG. 11 is a schematic diagram of a connecting line intersecting a bus in a plant station wiring diagram after linear cutting.
Fig. 12 is a diagram illustrating the result obtained by visualizing the obtained connection line list in the drawing.
Fig. 13 is a schematic diagram of a result obtained by filtering a connecting line connecting two end points to the same primitive, and is also a schematic diagram of a final result obtained by identifying the connecting line of the example.
Detailed Description
The present invention will be described in further detail with reference to examples and drawings, but the present invention is not limited thereto.
As shown in fig. 1, the method for automatically identifying the connection relationship of the plant station wiring diagram of the power system provided by the present invention includes the following steps in the execution process:
1) picture preprocessing: the method comprises the following steps of coating graphic elements and characters on a plant station wiring diagram and coating a frame of the plant station wiring diagram with white color, wherein the method specifically comprises the following steps:
painting the primitive frame and the text frame on the plant station wiring diagram according to the primitive and text recognition result, and eliminating the interference of the primitive and the text in the plant station wiring diagram on the subsequent straight line detection; and according to the primitive and character recognition result, obtaining the position information of the recognized primitives and characters, finding out boundary primitives or characters of the plant station wiring diagram, taking the boundary primitives or characters as new boundaries, whitewashing out the parts outside the boundaries, eliminating picture borders, and eliminating the interference of the original picture borders on the subsequent straight line detection.
2) Detecting straight lines of a plant station wiring diagram by using an LSD (Line Segment Detection) algorithm, screening and classifying the straight lines into horizontal straight lines and vertical straight lines, wherein the method specifically comprises the following steps:
and (3) carrying out linear detection on the plant wiring diagram by using an LSD linear detection algorithm, screening out linear lines with angles of [ -5 degrees, 5 degrees ] and [85 degrees, 95 degrees ] from the detected result, and classifying the linear lines into horizontal and vertical linear lines.
3) Combining the screened and classified horizontal straight lines and vertical straight lines to obtain complete straight lines, which are as follows:
carrying out operation of merging straight lines twice respectively for horizontal and vertical straight lines which are broken and separated after screening and classification according to coordinates, angles, lengths and other information of two end points of the straight lines, wherein the specific operation is as follows: the first merging is to merge parallel straight lines with only one end point adjacent, and the second merging is to merge parallel straight lines with two corresponding end points adjacent to obtain all complete straight lines.
4) Cutting the complete straight line obtained in the step 3) according to the intersection point of the horizontal straight line and the vertical straight line and the intersection point of the vertical straight line and the horizontal bus to obtain an independent straight line section, which is as follows:
according to the intersection point of the horizontal straight line and the vertical straight line, cutting the two intersected horizontal straight lines and vertical straight lines into independent straight line segments, and the method specifically comprises the following steps: and traversing all the horizontal straight lines and all the vertical straight lines, judging whether the horizontal straight line i and the vertical straight line j are intersected according to the position information of the horizontal straight line i and the vertical straight line j, and cutting the horizontal straight line and the vertical straight line into independent straight line sections according to the intersection point of the horizontal straight line i and the vertical straight line j if the horizontal straight line i and the vertical straight line j are intersected. According to the intersection point of the vertical straight line and the horizontal bus, the vertical straight line is cut into independent straight line sections, and the method specifically comprises the following steps: and traversing all the vertical straight lines and all the buses, judging whether the vertical straight line i 'and the horizontal bus j' are intersected or not according to the position information of the vertical straight line i 'and the horizontal bus j', and if so, cutting the vertical straight line into independent straight line sections according to the intersection point of the vertical straight line i 'and the horizontal bus j'.
5) Matching the end points of the primitives or other straight line segments to obtain a preliminary connecting line list, which is as follows:
one end point of one connecting line can only be matched with one primitive or matched with one or more connecting lines, so that all the straight line segments are traversed, one end point of each straight line segment is tried to be matched with the primitive, the matching rule is that if the distance between the end point of each straight line segment and the primitive is smaller than a set value, the matching is successful, and if the matching is successful, the other end point is matched; if the matching fails, trying to match the end points of other straight-line segments, wherein the matching rule is that if the distance between a certain end point of one straight-line segment and a certain end point of another straight-line segment is smaller than a set value, the matching is successful; if both end points of a straight line segment can be matched with the end points of a primitive or other straight line segments, the straight line segment is added into the connecting line list.
6) Because primitive recognition and word recognition may have certain error, lead to primitive and word not by complete frame, consequently appear some redundant connecting wires easily, the characteristic of these redundant connecting wires is that two endpoints have all connected the same primitive, screens out these redundant connecting wires according to this characteristic, and concrete operation is: and traversing all the connecting lines to obtain the connection relation of the two end points of one connecting line, and deleting the connecting line from the connecting line list if the primitives connected by the two end points are the same.
If the connecting lines of the plant station wiring diagram are all identified after screening out the redundant connecting lines, the subsequent steps 7) and 8) are not required to be executed, and the step 9) is directly skipped, otherwise the subsequent steps 7) and 8) are executed.
7) And (3) pruning connecting lines for many times, and screening out redundant connecting lines caused by the existence of non-standard primitives, wherein the method specifically comprises the following steps:
because some nonstandard graphic elements which do not need to be identified exist in the factory station wiring diagram, and straight line segments connecting the nonstandard graphic elements do not need to be identified, the connecting lines are pruned for multiple times, and the method specifically comprises the following steps: traversing all the existing connecting line lists, and for the connecting line i ', if the two end points of the connecting line i ' have a connection relation with the straight line segment j ', if the straight line segment j ' does not exist in the connecting line lists, indicating that the straight line segment j ' is a straight line segment which does not need to be identified, and deleting the connection relation with the straight line segment j ' in the connecting line i '; if the connection relation between the connecting line i ' and the straight line segment j ' is deleted, and the connection relation does not exist between a certain end point of the connecting line i ' and the primitive or other straight line segments, the connecting line i ' is also the straight line segment which does not need to be identified, and the connecting line i ' is deleted; the process is a process of pruning the connecting line once, and the connecting line pruning is carried out for a plurality of times, and all the straight line segments which are not required to be identified are deleted.
8) Because the straight line cutting in the step 4) cuts the two intersected horizontal straight lines and vertical straight lines into independent straight line segments, and because straight line segments which are not required to be identified and are used for connecting non-standard primitives exist, some connecting lines which are cut due to the appearance of the non-standard primitives are reconnected, namely some connecting lines which are cut due to the fact that the connecting lines intersect with the straight line segments which are not required to be identified are reconnected, the method specifically comprises the following steps: and combining all the horizontal connecting lines of the identified horizontal connecting line list in pairs, combining the two horizontal connecting lines i ' and j ' of any combination into a new horizontal connecting line k if some end point of the i ' is provided with j ' and only j ' is connected with the end point, deleting the i ' and the j ' in the original horizontal connecting line list, adding k into the horizontal connecting line list, and similarly, adopting the same operation for the vertical connecting line list.
9) And outputting the identified connecting line list, namely the final connecting line list, which comprises a horizontal connecting line list and a vertical connecting line list.
In the following, we use the plant wiring diagram shown in fig. 2 as an example, and use the method provided by the present invention to automatically identify the connection relationship of the plant wiring diagram of the power system, and the execution process includes the following contents:
1) based on the results of primitive recognition and character recognition, the primitives and characters are whited on the plant station wiring diagram, and the whited result is shown in fig. 3, so that a non-standard primitive which is named as '51 PT' and does not need to be recognized exists in the diagram, and the primitive does not need to be recognized and is not whited.
Based on the result of primitive and character recognition, all the recognized primitives and characters are traversed, and according to the position information, the outermost primitive or character is obtained, and the outermost primitive or character is taken as the boundary, and the obtained new boundary is shown in fig. 4. The areas outside the boundary are whitewashed to realize the function of screening out the frames of the plant station wiring diagram, and the result after screening out the frames is shown in fig. 5.
2) And detecting, screening and classifying the straight lines of the plant station wiring diagram by using an LSD straight line detection algorithm. And (3) carrying out linear detection on the plant wiring diagram by using an LSD linear detection algorithm, screening out linear lines with angles of [ -5 degrees, 5 degrees ] and [85 degrees, 95 degrees ] from the detected result, and classifying the linear lines into horizontal and vertical linear lines. The horizontal and vertical straight line results obtained are shown in fig. 6.
3) And (4) carrying out multi-step combination treatment on the screened and classified straight lines to obtain complete straight lines. And combining the broken and separated straight lines after screening and classification according to the information such as coordinates, angles, lengths and the like of the two end points of the straight lines. All the combined horizontal and vertical lines are shown in fig. 7.
4) And cutting the complete straight line obtained in the last step according to the intersection point of the horizontal straight line and the vertical straight line and the intersection point of the vertical straight line and the horizontal bus to obtain an independent straight line section. Firstly, cutting the straight line in the connecting line module of the multi-branch type broken line into independent straight line segments according to the intersection point of the horizontal straight line and the vertical straight line. And cutting the vertical straight line into independent straight line segments according to the intersection point of the vertical straight line and the horizontal bus. The straight line before cutting and the straight line after cutting are numbered respectively, and the vertical straight line with the number of L19 before cutting intersects with the horizontal connecting line L12, as shown in FIG. 8; the vertical straight line numbered L19 after the cut is cut into two vertical straight lines L10 and L11, as shown in FIG. 9. The vertical straight line numbered L9 before cutting intersects the horizontal generatrix as shown in fig. 10; the vertical straight line numbered L9 after the cut is cut into two vertical straight lines L9 and L11, as shown in FIG. 11. (for ease of viewing, the identified primitives are labeled with blue boxes).
5) And matching the end points of the primitives or other straight line segments on all the straight lines to obtain a connecting line list. The list of connected lines is visualized as shown in fig. 12.
6) The connecting lines connecting the two endpoints to the same primitive are filtered, as shown in FIG. 13. Since the number of non-standard primitives of the station wiring diagram is small, it can be seen that all the connecting lines of the station wiring diagram have been identified after step 6) is completed. Therefore, the present example does not need to perform the steps 7) and 8) subsequent to the inventive method described above, whereas for other plant wiring diagrams, steps 7) and 8) are necessary post-processing steps of wiring identification.
The above embodiments are preferred embodiments of the present invention, but the present invention is not limited to the above embodiments, and any other changes, modifications, substitutions, combinations, and simplifications which do not depart from the spirit and principle of the present invention should be construed as equivalents thereof, and all such modifications are intended to be included in the scope of the present invention.
Claims (10)
1. A method for automatically identifying the connection relation of a wiring diagram of a power system plant station is characterized by comprising the following steps:
1) picture preprocessing: painting primitives and characters on a plant station wiring diagram and painting a frame of the plant station wiring diagram;
2) detecting straight lines of a plant station wiring diagram by using an LSD (least squares) straight line detection algorithm, screening and classifying the straight lines into horizontal straight lines and vertical straight lines;
3) merging the screened and classified horizontal straight lines and vertical straight lines to obtain complete straight lines;
4) cutting the complete straight line obtained in the step 3) according to the intersection point of the horizontal straight line and the vertical straight line and the intersection point of the vertical straight line and the horizontal bus to obtain an independent straight line section;
5) matching the end points of the primitives or other straight line segments to obtain a primary connecting line list;
6) filtering connecting lines of which two end points are connected with the same primitive, and if the connecting lines of the substation wiring diagram are completely identified after filtering, directly jumping to the step 9) without executing the subsequent step 7) and the step 8), otherwise, executing the subsequent step 7) and the step 8);
7) carrying out multiple connecting line pruning to screen out redundant connecting lines caused by the existence of non-standard primitives;
8) reconnecting some connecting lines which are cut due to the appearance of the non-standard primitives;
9) and outputting the identified connecting line list, namely the final connecting line list, which comprises a horizontal connecting line list and a vertical connecting line list.
2. The method for automatically identifying the connection relationship of the plant station wiring diagram of the power system as claimed in claim 1, wherein in the step 1), the primitive frame and the text frame are whitelined on the plant station wiring diagram according to the recognition result of the primitive and the text, so as to eliminate the interference of the primitive and the text in the plant station wiring diagram on the subsequent straight line detection; and according to the primitive and character recognition result, obtaining the position information of the recognized primitives and characters, finding out boundary primitives or characters of the plant station wiring diagram, taking the boundary primitives or characters as new boundaries, whitewashing out the parts outside the boundaries, eliminating picture borders, and eliminating the interference of the original picture borders on the subsequent straight line detection.
3. The method for automatically identifying the connection relationship of the plant station wiring diagram of the power system as claimed in claim 1, wherein in the step 2), the operations of screening and classifying the straight lines detected by the LSD straight line detection algorithm are specifically performed as follows: from the detected straight lines, straight lines having angles in the range of [ -5 °,5 ° ] and [85 °,95 ° ] are screened and classified into horizontal and vertical straight lines, respectively.
4. The method for automatically identifying the connection relationship of the station wiring diagrams of the power system as claimed in claim 1, wherein in the step 3), the operations of merging the straight lines are respectively performed twice on the horizontal and vertical straight lines which are broken and separated after being screened and classified according to the coordinate, angle and length information of two end points of the straight lines, and the specific operations are as follows: the first merging is to merge parallel straight lines with only one end point adjacent, and the second merging is to merge parallel straight lines with two corresponding end points adjacent to obtain all complete straight lines.
5. The method for automatically identifying the connection relationship of the power system plant station wiring diagram according to claim 1, wherein in the step 4), two intersected horizontal straight lines and vertical straight lines are cut into independent straight line segments according to the intersection point of the horizontal straight line and the vertical straight line, and the specific steps are as follows: and traversing all the horizontal straight lines and all the vertical straight lines, judging whether the horizontal straight line i and the vertical straight line j are intersected according to the position information of the horizontal straight line i and the vertical straight line j, and cutting the horizontal straight line and the vertical straight line into independent straight line sections according to the intersection point of the horizontal straight line i and the vertical straight line j if the horizontal straight line i and the vertical straight line j are intersected.
6. The method for automatically identifying the connection relationship of the power system plant station wiring diagrams as claimed in claim 1, wherein in the step 4), the vertical straight line is cut into independent straight line segments according to the intersection point of the vertical straight line and the horizontal bus, and the specific steps are as follows: and traversing all the vertical straight lines and all the buses, judging whether the vertical straight line i 'and the horizontal bus j' are intersected or not according to the position information of the vertical straight line i 'and the horizontal bus j', and if so, cutting the vertical straight line into independent straight line sections according to the intersection point of the vertical straight line i 'and the horizontal bus j'.
7. The method as claimed in claim 1, wherein in step 5), the matching of primitives or other straight-line segment end points is performed on all straight-line segments by: one end point of one connecting line can only be matched with one primitive or matched with one or more connecting lines, so that all the straight line segments are traversed, one end point of each straight line segment is tried to be matched with the primitive, the matching rule is that if the distance between the end point of each straight line segment and the primitive is smaller than a set value, the matching is successful, and if the matching is successful, the other end point is matched; if the matching fails, trying to match the end points of other straight-line segments, wherein the matching rule is that if the distance between a certain end point of one straight-line segment and a certain end point of another straight-line segment is smaller than a set value, the matching is successful; if both end points of a straight line segment can be matched with the end points of a primitive or other straight line segments, the straight line segment is added into the connecting line list.
8. The method for automatically identifying the connection relationship of the plant station wiring diagram of the power system as claimed in claim 1, wherein in the step 6), the connection lines with two end points connected with the same primitive are screened out, and the specific operation is as follows: and traversing all the connecting lines to obtain the connection relation of the two end points of one connecting line, and deleting the connecting line from the connecting line list if the primitives connected by the two end points are the same.
9. The method as claimed in claim 1, wherein in step 7), the station wiring diagram has some non-standard primitives that need not be identified, and the straight line segments connecting the non-standard primitives also need not be identified, so that the connecting lines are pruned multiple times, which comprises the following steps: traversing all the existing connecting line lists, and for the connecting line i ', if the two end points of the connecting line i ' have a connection relation with the straight line segment j ', if the straight line segment j ' does not exist in the connecting line lists, indicating that the straight line segment j ' is a straight line segment which does not need to be identified, and deleting the connection relation with the straight line segment j ' in the connecting line i '; if the connection relation between the connecting line i ' and the straight line segment j ' is deleted, and the connection relation does not exist between a certain end point of the connecting line i ' and the primitive or other straight line segments, the connecting line i ' is also the straight line segment which does not need to be identified, and the connecting line i ' is deleted; the process is a process of pruning the connecting line once, and the connecting line pruning is carried out for a plurality of times, and all the straight line segments which are not required to be identified are deleted.
10. The method as claimed in claim 1, wherein in step 8), some connection lines cut due to the appearance of non-standard primitives are reconnected, that is, some connection lines cut due to crossing with straight line segments which are not to be identified are reconnected, and the specific steps are as follows: and combining all the horizontal connecting lines of the identified horizontal connecting line list in pairs, combining the two horizontal connecting lines i ' and j ' of any combination into a new horizontal connecting line k if some end point of the i ' is provided with j ' and only j ' is connected with the end point, deleting the i ' and the j ' in the original horizontal connecting line list, adding k into the horizontal connecting line list, and similarly, adopting the same operation for the vertical connecting line list.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111589662.3A CN114842494B (en) | 2021-12-23 | 2021-12-23 | Method for automatically identifying connection relation of power system station wiring diagrams |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111589662.3A CN114842494B (en) | 2021-12-23 | 2021-12-23 | Method for automatically identifying connection relation of power system station wiring diagrams |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114842494A true CN114842494A (en) | 2022-08-02 |
| CN114842494B CN114842494B (en) | 2024-04-05 |
Family
ID=82561701
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111589662.3A Active CN114842494B (en) | 2021-12-23 | 2021-12-23 | Method for automatically identifying connection relation of power system station wiring diagrams |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114842494B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116310765A (en) * | 2023-05-23 | 2023-06-23 | 华雁智能科技(集团)股份有限公司 | Electrical wiring graphic primitive identification method |
| CN116756896A (en) * | 2023-08-17 | 2023-09-15 | 东方电子股份有限公司 | Method for generating CIM-G format wiring diagram |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102750703A (en) * | 2012-06-27 | 2012-10-24 | 北京航空航天大学 | Remote sensing image airport automatic detecting method based on linear cutting |
| CN108763813A (en) * | 2018-06-08 | 2018-11-06 | 杭州群核信息技术有限公司 | It is a kind of to identify the method and apparatus for copying wall in figure based on deep learning |
| CN108805076A (en) * | 2018-06-07 | 2018-11-13 | 浙江大学 | The extracting method and system of environmental impact assessment report table word |
| CN110119680A (en) * | 2019-04-03 | 2019-08-13 | 上海工程技术大学 | A kind of electrical cabinet wiring automatic errordetecting system based on image recognition |
| CN112101627A (en) * | 2020-08-14 | 2020-12-18 | 华南理工大学 | High-privacy distributed optimal scheduling method for electric and thermal interconnection system |
-
2021
- 2021-12-23 CN CN202111589662.3A patent/CN114842494B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102750703A (en) * | 2012-06-27 | 2012-10-24 | 北京航空航天大学 | Remote sensing image airport automatic detecting method based on linear cutting |
| CN108805076A (en) * | 2018-06-07 | 2018-11-13 | 浙江大学 | The extracting method and system of environmental impact assessment report table word |
| CN108763813A (en) * | 2018-06-08 | 2018-11-06 | 杭州群核信息技术有限公司 | It is a kind of to identify the method and apparatus for copying wall in figure based on deep learning |
| CN110119680A (en) * | 2019-04-03 | 2019-08-13 | 上海工程技术大学 | A kind of electrical cabinet wiring automatic errordetecting system based on image recognition |
| CN112101627A (en) * | 2020-08-14 | 2020-12-18 | 华南理工大学 | High-privacy distributed optimal scheduling method for electric and thermal interconnection system |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116310765A (en) * | 2023-05-23 | 2023-06-23 | 华雁智能科技(集团)股份有限公司 | Electrical wiring graphic primitive identification method |
| CN116310765B (en) * | 2023-05-23 | 2023-09-01 | 华雁智能科技(集团)股份有限公司 | Electrical wiring graphic primitive identification method |
| CN116756896A (en) * | 2023-08-17 | 2023-09-15 | 东方电子股份有限公司 | Method for generating CIM-G format wiring diagram |
| CN116756896B (en) * | 2023-08-17 | 2023-10-27 | 东方电子股份有限公司 | Method for generating CIM-G format wiring diagram |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114842494B (en) | 2024-04-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN114842494A (en) | Method for automatically identifying connection relation of station wiring diagrams of power system | |
| CN111008597B (en) | Space identification method and device for CAD drawing, electronic equipment and storage medium | |
| CN110210377B (en) | Wall body and door and window information acquisition method for three-dimensional house type reconstruction | |
| CN110321933B (en) | Fault identification method and device based on deep learning | |
| CN112560816A (en) | Equipment indicator lamp identification method and system based on YOLOv4 | |
| CN105931246A (en) | Fabric flaw detection method based on wavelet transformation and genetic algorithm | |
| CN109242776B (en) | Double-lane line detection method based on visual system | |
| CN111859805B (en) | Method for detecting topological relation of electric power drawing based on artificial intelligence | |
| CN115376155A (en) | Station wiring diagram detection method based on YOLOv6 and traditional image processing technology | |
| CN114612741A (en) | Defect recognition model training method and device, electronic equipment and storage medium | |
| CN114627239A (en) | Bounding box generation method, device, equipment and storage medium | |
| CN112215211B (en) | Method for extracting chamber branch link topological relation based on CAD drawing data | |
| KR102366396B1 (en) | RGB-D Data and Deep Learning Based 3D Instance Segmentation Method and System | |
| CN112084103B (en) | Interface test method, device, equipment and medium | |
| CN115294595A (en) | Intelligent analysis method for primary wiring diagram of transformer substation | |
| CN116541912A (en) | Method and device for generating wiring diagram based on CAD image recognition | |
| CN113947529B (en) | Image enhancement method, model training method, component identification method and related equipment | |
| CN111784059B (en) | Method for predicting dominant development azimuth of coal seam macroscopic crack | |
| CN114638847A (en) | Insulator hardware trimming method and system based on image processing | |
| CN112967224A (en) | Electronic circuit board detection system, method and medium based on artificial intelligence | |
| CN113255499B (en) | Digital automatic modeling method for secondary loop of transformer substation cable | |
| CN117612195A (en) | Graph model generation method and device based on main wiring graph recognition technology | |
| CN116883880B (en) | Crane identification method and device based on AR technology and electronic equipment | |
| Rossa et al. | 3D Model Generation from Freehand Drawings | |
| CN107908832B (en) | Air conditioning system model identification and conversion method and terminal equipment |
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 |