IP Library Granted Patent US 12,288,411
Granted Patent B2
US 12,288,411 · App. 17/961,337 · Granted Apr 29, 2025

Techniques for extracting associations between text labels and symbols and links in schematic diagrams

Inventors: Marc-Andrè Gardner (Quebec, CA); Simon Savary (Quebec, CA); Louis-Philippe Asselin (Quebec, CA)
Assignee: Bentley Systems, Incorporated
G06V30/19173G06T9/00G06V10/82G06V30/1448G06V30/19147G06V30/1916G06V30/422
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,288,411
App. No.
17/961,337
Granted
Apr 29, 2025
Kind
B2
Abstract

In example embodiments, techniques are provided that use two different ML models (a symbol association ML model and a link association ML model), one to extract associations between text labels and one to extract associations between symbols and links, in a schematic diagram (e.g., P&ID) in an image-only format. The two models may use different ML architectures. For example, the symbol association ML model may use a deep learning neural network architecture that receives for each possible text label and symbol pair both a context and a request, and produces a score indicating confidence the pair is associated. The link association ML model may use a gradient boosting tree architecture that receives for each possible text label and link pair a set of multiple features describing at least the geometric relationship between the possible text label and link pair and produces a score indicating confidence the pair is associated.

Claims (68)

1. A method for extracting associations between text labels and symbols or links in a schematic diagram in an image-only format, comprising:

accessing, by an application executing on one or more computing devices, the schematic diagram and a set of texts labels, a set of symbols, and a set of links that have been extracted from the schematic diagram;

determining possible text label and symbol pairs from the set of texts labels and the set of symbols;

for each possible text label and symbol pair, applying to a symbol association machine learning (ML) model a context that describes a region of the schematic diagram surrounding the possible text label and symbol pair and a request that precisely designates the possible text label and symbol pair, to produce a text label-symbol score indicating confidence in association;

selecting, by the application, associations between text labels and symbols based on the text label-symbol scores;

determining possible text label and link pairs from the set of texts labels and the set of links;

for each possible text label and link pair, applying to a link association ML model of the application a set of multiple features describing at least the geometric relationship between the possible text label and link pair, to produce a text label-link score indicating confidence in association;

selecting, by the application, associations between text labels and symbols and text labels and links based on the text label-link scores; and

outputting the selected associations between text labels and symbols and text labels and links in a machine-readable format.

2. The method of claim 1 , wherein the symbol association ML model and the link association ML model use different ML architectures.

3. The method of claim 2 , wherein the symbol association ML model uses a deep learning neural network architecture, and the link association ML model uses a gradient boosting tree architecture.

4. The method of claim 1 , wherein, the applying to the symbol association ML model further comprises:

extracting as the context an image of the region, wherein the region encloses at least a bounding box of the text label and a bounding box of the symbol;

providing the context to an image encoder to produce an encoded context;

determining coordinates of the bounding box of the text label and the bounding box of the symbol; and

providing the coordinates to a coordinate encoder to produce an encoded request.

5. The method of claim 4 , wherein the applying to the symbol association ML model further comprises:

providing the encoded context and the encoded request to a merge and classification neural network that includes a set of fully connected layers that is trained to produce the text label-symbol score.

6. The method of claim 1 , wherein the determining possible text label and symbol pairs further comprises:

automatically associating a given text label and a given symbol when a bounding box of the given text label is within a bounding box of the symbol; and

excluding the given text label and given symbol pair from the possible text label and symbol pairs.

7. The method of claim 1 , wherein the determining possible text label and symbol pairs further comprises:

automatically associating a given text label and a given symbol when the bounding box of the given text label is under a threshold distance of the bounding box of the symbol, and the given text label and the given symbol mutually see each other as the closest region; and

excluding the given text label and given symbol pair from the possible text label and symbol pairs.

8. The method of claim 1 , wherein the determining possible text label and symbol pairs further comprises:

determining a distance from a bounding box of a given text label to a bounding box of a given symbol is greater than a maximum distance; and

excluding the given text label and given symbol pair from the possible text label and symbol pairs.

9. The method of claim 1 , wherein the symbol association ML model uses a loss function during training that includes a penalty to associations that is quadratically increasing with distance.

10. The method of claim 1 , wherein the applying to the link association ML model further comprises:

computing a multidimensional feature vector that represents the multiple features; and

applying the possible text label and link pair and the multidimensional feature vector to the link association ML model to produce an initial text label-link score.

11. The method of claim 10 , wherein the computing the multidimensional feature vector further comprises:

encoding two or more features into a single value included in the multidimensional feature vector to indicate dependency between features.

12. The method of claim 10 , wherein the determining possible text label and link pairs further comprises:

determining a distance from a given link to a bounding box of a given text label is greater than a maximum distance; and

excluding the given text label and given link pair from the possible text label and link pairs.

13. The method of claim 10 , wherein the applying to the link association ML model further comprises:

determining a given text label is already associated with greater than a limit for number of links; and

preventing association of the given text label and given link.

14. The method of claim 1 , wherein the multiple features comprise one or more of a link type feature, a link to text label distance feature, a relative position between the text label and the link feature, an orientation of the text label feature, an orientation of the link feature, a projection of a baseline of the text label onto the link feature, a projection angle between the link and a baseline of the text label feature, a collision cost feature or an aspect ratio of a bounding box that includes both the text label and the link feature.

15. The method of claim 1 , wherein the schematic diagram is a piping and instrumentation diagram (P&ID).

16. A computing device comprising:

a display screen;

a processor; and

a memory coupled to the processor and configured to store a schematic diagram in an image-only format and a schematic diagram data extraction application that includes a symbol association machine learning (ML) model having a first ML architecture and a link association ML model having a second, different ML architecture, the schematic diagram data extraction application when executed operable to:

access a schematic diagram and a set of texts labels, a set of symbols, and a set of links that have been extracted from the schematic diagram,

determine possible text label and symbol pairs from the set of texts labels and the set of symbols,

for each possible text label and symbol pair, apply a description of the possible text label and symbol pair to the symbol association ML model to produce a text label to symbol association,

determine possible text label and link pairs from the set of texts labels and the set of links,

for each possible text label and link pair, apply a description of the possible text label and link pair to the link association ML model to produce a text label to link association, and

output the text label to symbol associations and the text label to link associations in a machine-readable format.

17. A non-transitory computing device readable medium having instructions stored thereon, the instructions when executed by one or more computing devices operable to:

access a schematic diagram and a set of texts labels, set of symbols, and set of links that have been extracted from the schematic diagram;

determine possible text label and symbol pairs from the set of texts labels and the set of symbols;

for each possible text label and symbol pair, apply to a symbol association machine learning (ML) model a context that describes a region of the schematic diagram surrounding the possible text label and symbol pair and a request that precisely designates the possible text label and symbol pair to produce a text label to symbol association;

for each possible text label and link pair, apply to a link association ML model a set of multiple features describing at least the geometric relationship between the possible text label and link pair to produce a text label to link association; and

output the text label to symbol associations and the text label to link associations in a machine-readable format.

18. The non-transitory electronic-device readable medium of claim 17 , wherein the symbol association ML model uses a deep learning neural network architecture, and the link association ML model uses a gradient boosting tree architecture.

19. The non-transitory electronic-device readable medium of claim 17 , wherein the instructions that when executed are operable to apply the symbol association ML model further comprise instructions that when executed are operable to:

extract as the context as an image to the region, wherein the region encloses at least a bounding box of the text label and a bounding box of the symbol;

provide the context to an image encoder to produce an encoded context;

determine coordinates of the bounding box of the text label and the bounding box of the symbol;

provide the coordinates to a coordinate encoder to produce an encoded request; and

provide the encoded context and the encoded request to a merge and classification neural network that includes a set of fully connected layers that is trained to produce the text label to symbol association.

20. The non-transitory electronic-device readable medium of claim 17 , wherein the instructions that when executed are operable to apply the link association ML model further comprise instructions that when executed are operable to:

compute a multidimensional feature vector that represents the multiple features;

apply the possible text label and link pair and the multidimensional feature vector to the link association ML model to produce an initial text label to link association; and

adjust the initial text label to link association when one or more criteria are met to produce the text label to link association.

Assignments (2)
SECURITY INTEREST Recorded Oct 25, 2024
From: BENTLEY SYSTEMS, INCORPORATED
To: PNC BANK, NATIONAL ASSOCIATION
Reel/Frame 069268/0042 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 14, 2022
From: GARDNER, MARC-ANDRÉ; SAVARY, SIMON; ASSELIN, LOUIS-PHILIPPE
To: BENTLEY SYSTEMS, INCORPORATED
Reel/Frame 061756/0904 →
Continuity (1)
Related Publication 20240119751A1 · Apr 11, 2024
References Cited (82)
US 5097422A · Corbin, II · 1992 [cited by examiner]
US 5111413A · Lazansky · 1992 [cited by examiner]
US 5164911A · Juran · 1992 [cited by examiner]
US 5351197A · Upton · 1994 [cited by examiner]
US 5594809A · Kopec et al. · 1997 [cited by applicant]
US 5617327A · Duncan · 1997 [cited by examiner]
US 5625798A · Badders et al. · 1997 [cited by applicant]
US 7574048B2 · Shilman et al. · 2009 [cited by applicant]
US 8775934B2 · Nasle · 2014 [cited by examiner]
US 8837294B2 · Frishberg · 2014 [cited by examiner]
US 8977527B2 · McKim et al. · 2015 [cited by applicant]
US 9015016B2 · Lorenz · 2015 [cited by examiner]
US 9721157B2 · Frank et al. · 2017 [cited by applicant]
US 9811251B2 · Kling et al. · 2017 [cited by applicant]
US 10558780B1 · Kukal · 2020 [cited by examiner]
US 11501470B2 · Hassan et al. · 2022 [cited by applicant]
US 11521026B2 · Lapointe et al. · 2022 [cited by applicant]
US 11593666B2 · McCarthy · 2023 [cited by examiner]
US 11842035B2 · Jahjah et al. · 2023 [cited by applicant]
US 20010033694A1 · Goodman et al. · 2001 [cited by applicant]
US 20030130992A1 · Tyan et al. · 2003 [cited by applicant]
US 20050155030A1 · DeWitt, Jr. et al. · 2005 [cited by applicant]
US 20070022399A1 · Tsai · 2007 [cited by examiner]
US 20070201752A1 · Gormish et al. · 2007 [cited by applicant]
US 20080052638A1 · Frank et al. · 2008 [cited by applicant]
US 20080063279A1 · Vincent et al. · 2008 [cited by applicant]
US 20090074300A1 · Hull et al. · 2009 [cited by applicant]
US 20090100050A1 · Erol et al. · 2009 [cited by applicant]
US 20090292514A1 · McKim et al. · 2009 [cited by applicant]
US 20090313245A1 · Weyl et al. · 2009 [cited by applicant]
US 20110007366A1 · Sarkar et al. · 2011 [cited by applicant]
US 20120116559A1 · Davis et al. · 2012 [cited by applicant]
US 20120134576A1 · Sharma et al. · 2012 [cited by applicant]
US 20120284012A1 · Rodriguez et al. · 2012 [cited by applicant]
US 20130173632A1 · Birdwell et al. · 2013 [cited by applicant]
US 20140009612A1 · King · 2014 [cited by applicant]
US 20140080428A1 · Rhoads et al. · 2014 [cited by applicant]
US 20140336992A1 · Kling et al. · 2014 [cited by applicant]
US 20150269431A1 · Haji et al. · 2015 [cited by applicant]
US 20160161930A1 · Jirkovsky et al. · 2016 [cited by applicant]
US 20170061031A1 · Jammikunta et al. · 2017 [cited by applicant]
US 20170351708A1 · Lahmann et al. · 2017 [cited by applicant]
US 20180114101A1 · Desai et al. · 2018 [cited by applicant]
US 20190012424A1 · Brookshire · 2019 [cited by applicant]
US 20200005094A1 · Sinha et al. · 2020 [cited by applicant]
US 20200175211A1 · Kang et al. · 2020 [cited by applicant]
US 20200175372A1 · Sharma et al. · 2020 [cited by applicant]
US 20200184278A1 · Zadeh et al. · 2020 [cited by applicant]
US 20210096523A1 · Stump et al. · 2021 [cited by applicant]
US 20210174128A1 · Charnock et al. · 2021 [cited by applicant]
US 20210278960A1 · Mabote · 2021 [cited by applicant]
US 20210279271A1 · Khanafer et al. · 2021 [cited by applicant]
US 20220044146A1 · Gardner et al. · 2022 [cited by applicant]
US 20220319219A1 · Tsibulevskiy et al. · 2022 [cited by applicant]
US 20240119751A1 · Gardner · 2024 [cited by examiner]
EP 3660743A1 · 2020 [cited by applicant]
JP 3445394B2 · 2003 [cited by applicant]
WO WO2014075174A1 · 2014 [cited by applicant]
WO WO2020005541A1 · 2020 [cited by applicant]
WO WO2021021624A1 · 2021 [cited by applicant]
Bunke, Horst, “Automatic Interpretation of Lines and Text in Circuit Diagrams,” J. Kittler, K. S. Fu, and L. F. Pau (editors), D. Reidel Publishing Company, Pattern Recognition Theory and Applications, 1982, pp. 297-310. [cited by applicant]
Duda, Richard O., et al., “Use of the Hough Transformation to Detect Lines and Curves in Pictures,” Association of Computing Machinery, Inc., Graphics and Image Processing, Communications of the ACM, vol. 15, No. 1, Jan… [cited by applicant]
“European Search Report and Written Opinion,” European Application No. 21 150 316.4-1207, Applicant: Bentley Systems, Incorporated, Date of Mailing: Jun. 8, 2021, pp. 1-10. [cited by applicant]
“European Search Report and Written Opinion,” European Application No. 21 150 319.8-1207, Applicant: Bentley Systems, Incorporated, Date of Mailing: Jun. 9, 2021, pp. 1-8. [cited by applicant]
Julca-Aguilar, Frank D., et al., “Symbol Detection in Online Handwritten Graphics Using Faster R-CNN,” IEEE, 2018 13 [cited by applicant]
Mani, Shouvik, et al., “Automatic Digitization of Engineering Diagrams using Deep Learning and Graph Search,” IEEE, 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW), Jun. 14, 2020, p… [cited by applicant]
Moon, Yoochan, et al., “Deep Learning-Based Method to Recognize Line Objects and Flow Arrows from Image-Format Piping and Instrumentation Diagrams for Digitization,” MDPI, Applied Sciences, vol. 11, No. 10054, Oct. 27, … [cited by applicant]
Moreno-Garcia, et al., “New Trends on Digitization of Complex Engineering Drawings,” Springer, Neural Computing and Applications, vol. 31, Jun. 13, 2018, pp. 1695-1712. [cited by applicant]
Paliwal, Shubham, et al., “Digitize-PID: Automatic Digitization of Piping and Instrumentation Diagrams,” arXiv, arXiv: 2109.03794v1 [cs.CV], Sep. 8, 2021, pp. 1-13. [cited by applicant]
Rezvanifar, Alireza, et al., “Symbol Spotting on Digital Architectural Floor Plans Using A Deep Learning-Based Framework,” IEEE, 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW), Jun… [cited by applicant]
U.S. Appl. No. 17/034,844, filed Sep. 28, 2020 by Marc-André Lapointe, et al. for Classifying Individual Elements of an Infrastructure Model, pp. 1-27. [cited by applicant]
U.S. Appl. No. 17/128,912, filed Dec. 21, 2020 by Karl-Alexandre Jahjah, et al. for Techniques for Labeling, Reviewing and Correcting Label Predictions for P&Ids, pp. 1-44. [cited by applicant]
U.S. Appl. No. 17/129,205, filed Dec. 21, 2020 by Marc-André Lapointe, et al. for Techniques for Extracting Machine-Readable Information From P&IDS, pp. 1-29. [cited by applicant]
Yu, Eun-seop, et al., “Features Recognition from Piping and Instrumentation Diagrams in Image Format Using a Deep Learning Network,” MDPI, Engines, vol. 12, No. 4425, Nov. 21, 2019, pp. 1-19. [cited by applicant]
Zhou, Xingyi, et al., “Objects as Points,” arXiv, arXiv: 1904.07850v2 [cs.CV], Apr. 25, 2019, pp. 1-12. [cited by applicant]
Adam, S., et al., “Symbol and Character Recognition: Application to engineering Drawings,” Springer-Verlag 2000, International Journal on Document Analysis and Recognition, IJDAR, vol. 3, Dec. 2000, pp. 89-101. [cited by applicant]
Ghadekar, Premanand, et al., “Automatic Digitization of Engineering Diagrams Using Intelligent Algorithms,” Science Publications, Journal of Computer Science, vol. 17, No. 9, Sep. 28, 2021, pp. 848-854. [cited by applicant]
Kang, Sung-O, et al., “A Digitization and Conversion Tool for Imaged Drawings to Intelligent Piping and Instrumentation Diagrams (P&ID),” MDPI, Energies, vol. 12, No. 2593, Jul. 5, 2019, pp. 1-26. [cited by applicant]
Kim, Byung Chui, et al., “End-to-End Digitization of Image Format Piping and Instrumentation Diagrams at an Industrially Applicable Level,” Oxford University Press, Oxford, CDE, Journal of Computational Design and engin… [cited by applicant]
Llados, Josep, et al., “Symbol Recognition: Current Advances and Perspectives,” Springer-Verlag Berlin Heidelberg, GREC 2002, Graphics Recognition Algorithms and Applications, LNCS, Lecture Notes in Computer Science, vo… [cited by applicant]
Rahul, Rohit, et al., “Automatic Information Extraction from Piping and Instrumentation Diagrams,” arXiv, arXiv:1901.11383v1 [cs.CV], Jan. 28, 2019, pp. 1-10. [cited by applicant]
U.S. Appl. No. 17/877,560, filed Jul. 29, 2022 by Marc-André Gardner, et al. for Techniques for Extracting Links and Connectivity From Schematic Diagrams, pp. 1-37. [cited by applicant]