Granted Patent
B2
US 12,190,618 · App. 18/191,642 · Granted Jan 7, 2025
Methods, systems, articles of manufacture and apparatus to decode receipts based on neural graph architecture
Assignee:
Nielsen Consumer LLC
View Patent ↗
Loading inventors, assignments & file history…
Abstract
Methods, apparatus, systems, and articles of manufacture are disclosed to decode receipts based on neural graph architecture. An apparatus includes interface circuitry to obtain an image of a document; machine readable instructions; and programmable circuitry to execute the machine readable instructions to at least generate nodes for a feature graph based on features extracted from text boxes, the nodes including polar coordinates indicative of angular positions of the text boxes; pass the feature graph through a graph neural network to generate an adjacency matrix; and identify text lines in the image of the document by clustering the nodes by line based on the adjacency matrix.
Claims (33)
1. An apparatus comprising:
interface circuitry to obtain an image of a document;
machine readable instructions; and
programmable circuitry to execute the machine readable instructions to at least:
generate nodes for a feature graph based on features extracted from text boxes, the nodes including polar coordinates indicative of angular positions of the text boxes;
pass the feature graph through a graph neural network to generate an adjacency matrix; and
identify text lines in the image of the document by clustering the nodes by line based on the adjacency matrix.
2. The apparatus of claim 1 , wherein the nodes further include cartesian coordinates of the text boxes.
3. The apparatus of claim 2 , wherein the programmable circuitry is to execute the machine readable instructions to calculate the polar coordinates of the text boxes based on the cartesian coordinates of the text boxes.
4. The apparatus of claim 1 , wherein the nodes further include (a) slopes and (b) y-intercepts of the text boxes.
5. The apparatus of claim 1 , wherein the nodes correspond to vectors representing respective words extracted from the image of the document.
6. The apparatus of claim 5 , wherein the programmable circuitry is to execute the machine readable instructions to cause the graph neural network to identify connections among the words based on the feature graph, the adjacency matrix to indicate the identified connections.
7. The apparatus of claim 1 , wherein the programmable circuitry is to execute the machine readable instructions to extract words from the image of the document by applying an optical character recognition algorithm to the image of the document, ones of the words to include respective ones of the text boxes defining cartesian coordinates corresponding to the ones of the words.
8. A non-transitory machine readable storage medium comprising instructions to cause programmable circuitry to at least:
generate a feature graph based on nodes representative of words in a document image, the nodes including polar coordinates indicative of angular positions of text boxes representing the words;
pass the feature graph through layers of a graph neural network to generate an adjacency matrix; and
cluster the nodes based on the adjacency matrix to group ones of the nodes that belong to a same line.
9. The non-transitory machine readable storage medium of claim 8 , wherein the nodes further include cartesian coordinates of the text boxes.
10. The non-transitory machine readable storage medium of claim 9 , wherein the instructions are to cause programmable circuitry to calculate the polar coordinates of the text boxes based on the cartesian coordinates of the text boxes.
11. The non-transitory machine readable storage medium of claim 8 , wherein the nodes further include (a) slopes and (b) y-intercepts of the text boxes.
12. The non-transitory machine readable storage medium of claim 8 , wherein the nodes correspond to vectors representing respective words extracted from the document image.
13. The non-transitory machine readable storage medium of claim 12 , wherein the instructions are to cause programmable circuitry to cause the graph neural network to identify connections among the words based on the feature graph, the adjacency matrix to indicate the identified connections.
14. The non-transitory machine readable storage medium of claim 8 , wherein the instructions are to cause programmable circuitry to extract words from the document image by applying an optical character recognition algorithm to the document image, ones of the words to include respective ones of the text boxes defining cartesian coordinates of the ones of the words.
15. A method comprising:
obtaining an image of a document;
generating, by executing machine readable instructions with programmable circuitry, nodes for a feature graph based on features extracted from bounding boxes of machine-readable words, the nodes including polar coordinates indicative of angular positions of the bounding boxes;
generating, by executing the machine readable instructions with the programmable circuitry, an adjacency matrix by passing the feature graph through a graph neural network; and
grouping, by executing the machine readable instructions with the programmable circuitry, the nodes based on the adjacency matrix to identify text lines in the image of the document.
16. The method of claim 15 , wherein the nodes further include cartesian coordinates of the bounding boxes.
17. The method of claim 16 , further including calculating the polar coordinates of the bounding boxes based on the cartesian coordinates of the bounding boxes.
18. The method of claim 15 , wherein the nodes further include (a) slopes and (b) y-intercepts of the bounding boxes.
19. The method of claim 15 , wherein the nodes correspond to vectors representing respective machine readable words extracted from the image of the document.
20. The method of claim 15 , further including extracting the machine readable words from the image of the document by applying an optical character recognition algorithm to the image of the document, ones of the words to include respective ones of the bounding boxes defining cartesian coordinates of the ones of the words.
Assignments (2)
INTELLECTUAL PROPERTY SECURITY AGREEMENT
Recorded Jan 19, 2024
From: NIELSEN CONSUMER LLC
To: BANK OF AMERICA, N.A., AS ADMINISTRATIVE AND COLLATERAL AGENT
Reel/Frame 066355/0213 →
ASSIGNMENT OF ASSIGNOR'S INTEREST
Recorded Jan 12, 2024
From: RODRIGUEZ, DAYRON RIZO; TORRES, JOSE JAVIER YEBES
To: NIELSEN CONSUMER LLC
Reel/Frame 066112/0037 →
Continuity (2)
References Cited (358)
US 3323135A
· Miller
· 1967
[cited by applicant]
US 5410611A
· Huttenlocher et al.
· 1995
[cited by applicant]
US 5606690A
· Hunter et al.
· 1997
[cited by applicant]
US 7454063B1
· Kneisl et al.
· 2008
[cited by applicant]
US 7792709B1
· Trandal et al.
· 2010
[cited by applicant]
US 8285047B2
· Nagarajan et al.
· 2012
[cited by applicant]
US 8494281B2
· Nagarajan
· 2013
[cited by applicant]
US 8787695B2
· Wu
· 2014
[cited by applicant]
US 8792141B2
· Moore et al.
· 2014
[cited by applicant]
US 8983170B2
· Nepomniachtchi et al.
· 2015
[cited by applicant]
US 9014432B2
· Fan et al.
· 2015
[cited by applicant]
US 9158744B2
· Rao et al.
· 2015
[cited by applicant]
US 9239952B2
· Hsu
· 2016
[cited by applicant]
US 9262686B1
· Singer et al.
· 2016
[cited by applicant]
US 9290022B2
· Makabe
· 2016
[cited by applicant]
US 9298685B2
· Barrus
· 2016
[cited by applicant]
US 9298979B2
· Nepomniachtchi et al.
· 2016
[cited by applicant]
US 9323135B1
· Veloso
· 2016
[cited by applicant]
US 9324073B2
· Nepomniachtchi et al.
· 2016
[cited by applicant]
US 9384839B2
· Avila et al.
· 2016
[cited by applicant]
US 9396540B1
· Sampson
· 2016
[cited by applicant]
US 9684842B2
· Deng
· 2017
[cited by applicant]
US 9710702B2
· Nepomniachtchi et al.
· 2017
[cited by applicant]
US 9747504B2
· Ma et al.
· 2017
[cited by applicant]
US 9760786B2
· Sahagun et al.
· 2017
[cited by applicant]
US 9824270B1
· Mao
· 2017
[cited by applicant]
US 9875385B1
· Humphreys et al.
· 2018
[cited by applicant]
US 20020037097A1
· Hoyos et al.
· 2002
[cited by applicant]
US 20030185448A1
· Seeger et al.
· 2003
[cited by applicant]
US 20060232619A1
· Otsuka et al.
· 2006
[cited by applicant]
US 20070041642A1
· Romanoff et al.
· 2007
[cited by applicant]
US 20080205759A1
· Zandifar et al.
· 2008
[cited by applicant]
US 20090164422A1
· Pacella
· 2009
[cited by applicant]
US 20100306080A1
· Trandal et al.
· 2010
[cited by applicant]
US 20110122443A1
· Otsuka et al.
· 2011
[cited by applicant]
US 20110243445A1
· Uzelac et al.
· 2011
[cited by applicant]
US 20110311145A1
· Bern et al.
· 2011
[cited by applicant]
US 20120183211A1
· Hsu et al.
· 2012
[cited by applicant]
US 20120274953A1
· Makabe
· 2012
[cited by applicant]
US 20120330971A1
· Thomas et al.
· 2012
[cited by applicant]
US 20130058575A1
· Koo et al.
· 2013
[cited by applicant]
US 20130170741A9
· Hsu et al.
· 2013
[cited by applicant]
US 20140002868A1
· Landa et al.
· 2014
[cited by applicant]
US 20140064618A1
· Janssen, Jr.
· 2014
[cited by applicant]
US 20140188647A1
· Argue et al.
· 2014
[cited by applicant]
US 20140195891A1
· Venkata Radha Krishna Rao et al.
· 2014
[cited by applicant]
US 20150039479A1
· Gotanda et al.
· 2015
[cited by applicant]
US 20150127428A1
· Gharachorloo et al.
· 2015
[cited by applicant]
US 20150169951A1
· Khintsitskiy et al.
· 2015
[cited by applicant]
US 20150317642A1
· Argue et al.
· 2015
[cited by applicant]
US 20150363792A1
· Arini et al.
· 2015
[cited by applicant]
US 20150363822A1
· Rowe et al.
· 2015
[cited by applicant]
US 20160005189A1
· Gray
· 2016
[cited by applicant]
US 20160034863A1
· Ross
· 2016
[cited by applicant]
US 20160063469A1
· Etzion
· 2016
[cited by applicant]
US 20160125383A1
· Chan
· 2016
[cited by applicant]
US 20160171585A1
· Singh et al.
· 2016
[cited by applicant]
US 20160203625A1
· Khan et al.
· 2016
[cited by applicant]
US 20160210507A1
· Abdollahian
· 2016
[cited by applicant]
US 20160234431A1
· Kraft et al.
· 2016
[cited by applicant]
US 20160307059A1
· Chaudhury et al.
· 2016
[cited by applicant]
US 20190026803A1
· De Guzman
· 2019
[cited by applicant]
US 20190080207A1
· Chang et al.
· 2019
[cited by applicant]
US 20200249803A1
· Sobel et al.
· 2020
[cited by applicant]
US 20220114821A1
· Arroyo et al.
· 2022
[cited by applicant]
US 20230394859A1
· Montero et al.
· 2023
[cited by applicant]
CA 2957433A1
· 2017
[cited by applicant]
CA 2957433C
· 2020
[cited by applicant]
CN 103123685A
· 2013
[cited by applicant]
CN 104866849A
· 2015
[cited by applicant]
CN 108229397A
· 2018
[cited by applicant]
CN 108829397A
· 2018
[cited by applicant]
CN 109389124A
· 2019
[cited by applicant]
CN 108229397B
· 2020
[cited by applicant]
CN 112446351A
· 2021
[cited by applicant]
CN 112560862A
· 2021
[cited by applicant]
DE 202013005144U1
· 2013
[cited by applicant]
GB 2595412A
· 2021
[cited by applicant]
JP H0749529A
· 1995
[cited by applicant]
JP 2008021850A
· 2008
[cited by applicant]
JP 2008210850A
· 2008
[cited by applicant]
JP 2008211850A
· 2008
[cited by applicant]
JP 2019139737A
· 2019
[cited by applicant]
JP 2013041145A1
· 2023
[cited by applicant]
KR 101831204B1
· 2018
[cited by applicant]
TW 200821850A
· 2008
[cited by applicant]
WO 2013041145A1
· 2013
[cited by applicant]
WO 2013044145A1
· 2013
[cited by applicant]
WO 2018054326A1
· 2018
[cited by applicant]
WO 2018201423A1
· 2018
[cited by applicant]
WO 2020194004A1
· 2020
[cited by applicant]
WO 2022006295A1
· 2022
[cited by applicant]
WO 2022123199A1
· 2022
[cited by applicant]
Park et al. “Cord: a Consolidated Receipt Dataset for Post-OCR Parsing. In Workshop on Document Intelligence,” at NeurIPS 2019, 4 pages.
[cited by applicant]
Wang et al. “LiLT: a Simple yet Effective Language-Independent Layout Transformer for Structured Document Understanding”, in Annual Meeting of the Association for Computational Linguistics (ACL), arXiv, Feb. 28, 2022, 1…
[cited by applicant]
United States Patent and Trademark Office, “Advisory Action,” issued in connection with U.S. Appl. No. 16/692,797, dated Feb. 16, 2022, 2 pages.
[cited by applicant]
Deepdive, “Distant Supervision,” Online available on Stanford University website, retrieved on Apr. 1, 2022, 2 pages, [retrieved from: http://deepdive.stanford.edu/distant supervision].
[cited by applicant]
Datasetlist, “Annotation tools for building datasets,” Labeling tools—List of labeling tools, Datasetlist.com, updated Dec. 2021, downloaded on Apr. 1, 2022, 14 pages. [retrieved from: https://www.datasetlist.com/tools/…
[cited by applicant]
NielsenIQ Brandbank, “Nielsen Brandbank Product Library,” Online Available, Retrieved on Apr. 1, 2022, 5 pages. [retrieved from: https://www.brandbank.com/US/product-librarv/].
[cited by applicant]
Github, “Fiat tool—Fast Image Data Annotation Tool,” Github.com, downloaded on Apr. 1, 2022, 30 pages, [retrieved from: https://github.com/christopher5106/FastAimotationTool].
[cited by applicant]
United States Patent and Trademark Office, “Notice of Allowance and Fee(s)Due,” issued in connection with U.S. Appl. No. 16/692,797, dated Apr. 5, 2022, 10 pages.
[cited by applicant]
Github, “Doccano tool,” Github.com, downloaded on Apr. 11, 2022, 12 pages. [retrieved from:https://github.com/doccano/doccano].
[cited by applicant]
United States Patent and Trademark Office, “Corrected Notice of Allowability,” issued in connection with United States U.S. Appl. No. 16/692,797, dated Apr. 22, 2022, 3 pages.
[cited by applicant]
International Searching Authority, “International Preliminary Report on Patentability Chapter I”, issued in connection with International Patent Application No. PCT/US2020/061269, dated Jun. 2, 2022, 6 Pages.
[cited by applicant]
International Searching Authority, “International Search Report,” issued in connection with PCT No. PCT/US2022/034570, dated Jun. 22, 2022, 3 pages.
[cited by applicant]
International Searching Authority, “Written Opinion,” issued in connection with PCT No. PCT/US2022/034570, dated Jun. 22, 2022, 5 pages.
[cited by applicant]
European Patent Office, “Communication pursuant to Rules 161(2) and 162 EPC,” issued in connection with European patent appl. No. 20891012.5-1218, dated Jun. 29, 2022, 3 pages.
[cited by applicant]
Datasetlist, “A tool using OpenCV to annotate images for image classification, optical character reading, . . . ,” Datasetlist.com, dated Jul. 13, 2022, 30 pages.
[cited by applicant]
United States Patent and Trademark Office, “Non-Final Office Action,” issued in connection with U.S. Appl. No. 17/345,940, dated Aug. 18, 2022, 8 Pages.
[cited by applicant]
International Searching Authority, “International Search Report,” issued in connection with International Patent Appl. No. PCT/US2023/011859, dated Jun. 1, 2023, 3 pages.
[cited by applicant]
United States Patent and Trademark Office, “Non-Final Office Action” , issued in connection with U.S. Appl. No. 17/075,675, dated Sep. 22, 2022, 12 Pages.
[cited by applicant]
European Patent Office, “Extended Search Report,” issued in connection with European Patent Appl. No. 19921870.2, dated Oct. 12, 2022, 11 pages.
[cited by applicant]
International Searching Authority, “International Search Report,” issued in connection with PCT No. PCT/US2022/034570, dated Oct. 20, 2022, 3 pages.
[cited by applicant]
International Searching Authority, “Written Opinion,” issued in connection with PCT No. PCT/US2022/034570, dated Oct. 20, 2022, 5 pages.
[cited by applicant]
International Searching Authority, “Written Opinion,” issued in connection with International Patent Appl. No. PCT/US2023/011859, dated Jun. 1, 2023, 4 pages.
[cited by applicant]
European Patent Office, “Communication pursuant to Rules 70(2) and 70a(2) EPC,” issued in connection with Application No. 19921870.2, dated Nov. 2, 2022, 1 page.
[cited by applicant]
United States Patent and Trademark Office, “Notice of Allowance and Fee(s) Due,” issued in connection with U.S. Appl. No. 17/364,419, dated Nov. 4, 2022, 10 pages.
[cited by applicant]
Canadian Patent Office, “Examiner's Report,” issued in connection with Canadian Patent Application No. 3,124,868, mailed on Nov. 10, 2022, 4 pages.
[cited by applicant]
United States Patent and Trademark Office, “Corrected Notice of Allowability”, issued in connection with U.S. Appl. No. 17/364,419, dated Nov. 15, 2022, 2 pages.
[cited by applicant]
European Patent Office, “Extended Search Report,” in connection with European Patent Application No. 22180113.7, dated Nov. 22, 2022, 2 pages.
[cited by applicant]
United States Patent and Trademark Office, “Non-Final Office Action,” issued in connection with U.S. Appl. No. 17/379,280, dated Dec. 2, 2022, 14 Pages.
[cited by applicant]
European Patent Office, “European Search Report,” issued in connection with European patent Application No. 22184405.3-1207, dated Dec. 2, 2022, 7 pages.
[cited by applicant]
International Searching Authority, “International Preliminary Report on Patentability,” issued in connection with PCT No. PCT/US2021/039931, dated Dec. 13, 2022, 5 pages.
[cited by applicant]
United States Patent and Trademark Office, “Corrected Notice of Allowability,” issued in connection with U.S. Appl. No. 17/364,419, dated Jan. 4, 2023, 2 pages.
[cited by applicant]
European Patent Office, “Communication Pursuant to Rule 69 EPC,” issued in connection with European Patent Application No. 22180113.7, dated Jan. 10, 2023, 2 pages.
[cited by applicant]
International Searching Authority, “International Preliminary Report on Patentability,” issued in connection with PCT Application No. PCT/US2021/039931, dated Jan. 12, 2023, 6 pages.
[cited by applicant]
United States Patent and Trademark Office, “Non-Final Office Action,” issued in connection with U.S. Appl. No. 17/883,309, dated Jan. 20, 2023, 14 pages.
[cited by applicant]
European Patent Office, “Communication pursuant to Rule 69 EPC,” in connection with European Patent Application No. 22184405.3, dated Jan. 23, 2023, 2 pages.
[cited by applicant]
United States Patent and Trademark Office, “Corrected Notice of Allowability”, issued in connection with U.S. Appl. No. 17/364,419, dated Feb. 15, 2023, 2 pages.
[cited by applicant]
United Kingdom Patent Office, “Examination Report under section 18(3),” issued in connection with GB Application No. 2112299.9, dated Feb. 17, 2023, 2 pages.
[cited by applicant]
United States Patent and Trademark Office, “Final Office Action”, issued in connection with U.S. Appl. No. 17/075,675, dated Mar. 7, 2023, 11 Pages.
[cited by applicant]
United States Patent and Trademark Office, “Non-Final Office Action,” issued in connection with U.S. Appl. No. 17/345,940, dated Mar. 16, 2023, 13 Pages.
[cited by applicant]
United States Patent and Trademark Office, “Final Office Action,” issued in connection with U.S. Appl. No. 17/379,280, dated May 5, 2023, 17 pages.
[cited by applicant]
United States Patent and Trademark Office, “Notice of Allowance and Fee(s) Due,” issued in connection with U.S. Appl. No. 17/883,309, dated May 11, 2023, 9 pages.
[cited by applicant]
European Patent Center, “Extended European Search Report,” issued in connection with Application No. 22214553.4, dated May 17, 2023, 9 pages.
[cited by applicant]
United States Patent and Trademark Office, “Advisory Action,” issued in connection with U.S. Appl. No. 17/075,675, dated May 30, 2023, 3 pages.
[cited by applicant]
United States Patent and Trademark Office, “Corrected Notice of Allowability,” issued in connection with U.S. Appl. No. 17/345,940, dated Jul. 20, 2023, 3 pages.
[cited by applicant]
United States Patent and Trademark Office, “Notice of Allowance,” issued in U.S. Appl. No. 17/075,675, mailed on Jun. 26, 2023, 8 pages.
[cited by applicant]
United States Patent and Trademark Office, “Notice of Allowance and Fee(s) Due,” issued in connection with U.S. Appl. No. 17/345,940, dated Jul. 7, 2023, 8 pages.
[cited by applicant]
United Kingdom Intellectual Property Office, “Intention to Grant under Section 18(4),” issued in connection with United Kingdom Patent Application No. 2112299.9, dated Jul. 13, 2023, 2 pages.
[cited by applicant]
United States Patent and Trademark Office, “Advisory Action,” issued in connection with U.S. Appl. No. 17/379,280, mailed on Jul. 18, 2023, 3 pages.
[cited by applicant]
Oliveira et al., “dhSegment: a generic deep-learning approach for document segmentation,” in 16th International Conference on Frontiers in Handwriting Recognition (ICFHR), dated Aug. 14, 2019, 6 pages.
[cited by applicant]
Zhong et al., “PubLayNet: largest dataset ever for document layout analysis,” in International Conference on Document Analysis and Recognition (ICDAR), dated Aug. 16, 2019, 8 pages.
[cited by applicant]
International Searching Authority, “International Search Report and Written Opinion,” issued in connection with PCT application No. PCT/IB2019/000299, dated Dec. 23, 2019, 9 pages.
[cited by applicant]
Github, “Tesseract OCR,” Tesseract Repository on GitHub, retrieved from: https://github. com/tesseract-ocr/, dated 2020, 3 pages.
[cited by applicant]
Wang et al., “DocStruct: a Multimodal Method to Extract Hierarchy Structure in Document for General Form Understanding”, in Empirical Methods in Natural Language Processing (EMNLP), pp. 898-908, dated 2020, 11 pages.
[cited by applicant]
Zhu et al., “Heterogeneous Mini-Graph Neural Network and Its Application to Fraud Invitation Detection.” 2020 IEEE International Conference on Data Mining (ICDM), dated 2020, 9 pages.
[cited by applicant]
Dong et al. “HNHN: Hypergraph Networks with Hyperedge Neurons,” ArXiv abs/2006.12278, dated 2020, 11 pages.
[cited by applicant]
Carbonell et al., “Named Entity Recognition and Relation Extraction with Graph Neural Networks in Semi Structured Documents,” in International Conference on Pattern Recognition (ICPR), pp. 9622-9627, dated 2021, 6 pages.
[cited by applicant]
Zhong et al., “Hierarchical Message-Passing Graph Neural Networks,” ArXiv abs/2009.03717, dated 2020, 29 pages.
[cited by applicant]
Chen et al., “HGMF: Heterogeneous Graph-based Fusion for Multimodal Data with Incompleteness,” Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, dated 2020, 11 pages.
[cited by applicant]
Wick et al., “Calamari—A High-Performance Tensorflow-based Deep Learning Package for Optical Character Recognition,” Digital Humanities Quarterly, retrieved from: https://arxiv.org/ftp/arxiv/papers/1807/1807.02004.pdf, …
[cited by applicant]
Dwivedi et al., “Benchmarking Graph Neural Networks.” ArXiv abs/2003.00982, dated 2020, 49 pages.
[cited by applicant]
Zacharias et al., “Image Processing Based Scene-Text Detection and Recognition with Tesseract,” arXiv (CoRR), dated Apr. 17, 2020, 6 pages.
[cited by applicant]
Xu et al., “LayoutLM: Pre-training of Text and Layout for Document Image Understanding,” in International Conference on Knowledge Discovery & Data Mining (SIGKDD), dated Jun. 16, 2020, 9 pages.
[cited by applicant]
Yu et al., “Pick: Processing Key Information Extraction from Documents using Improved Graph Learning—Convolutional Networks,” in International Conference on Pattern Recognition (ICPR), dated Jul. 18, 2020, 8 pages. [ret…
[cited by applicant]
Huang et al. “LayoutLMv3: Pre-training for Document AI with Unified Text and Image Masking.” ArXiv abs/2204.08387 (2022), 10 pages.
[cited by applicant]
Arroyo et al., “Multi-label classification of promotions in digital leaflets using textual and visual information,” Proceedings of the Workshop on Natural Language Processing in E-Commerce (EComNLP), pp. 11-20, Barcelon…
[cited by applicant]
Gu et al., “UniDoc: Unified Pretraining Framework for Document Understanding,” NeurIPS, dated 2021, 12 pages.
[cited by applicant]
Gopal et al. “What is Intelligent Document Processing?” Nano Net Technologies, retrieved from: https://nanonets.com/blog/intelligent-document-processing/, dated 2021, 21 pages.
[cited by applicant]
Qian et al. “A region-based hypergraph network for joint entity-relation extraction”, in Knowledge-Based Systems. vol. 228, dated 2021, 8 pages.
[cited by applicant]
Zhang et al. “Entity Relation Extraction as Dependency Parsing in Visually Rich Documents”, in Empirical Methods in Natural Language Processing (EMNLP), dated 2021, 10 pages.
[cited by applicant]
Hwang et al. “Cost-effective End-to-end Information Extraction for Semi-structured Document Images”, in Empirical Methods in Natural Language Processing (EMNLP), dated 2021, 9 pages.
[cited by applicant]
Hong et al., “Bros: a Pre-trained Language Model Focusing on Text and Layout for Better Key information Extraction from Documents,” arXiv (CoRR), dated 2021, 13 pages, [retrieved from: https://arxiv.org/pdf/2108.04539.p…
[cited by applicant]
Davis et al., “Visual Fudge: Form Understanding via Dynamic Graph Editing”, in International Conference on Document Analysis and Recognition (ICDAR), dated 2021, 16 pages.
[cited by applicant]
Garncarek et al., “Lambert: Layout-Aware Language Modeling for Information Extraction,” ICDAR, dated 2021, 16 pages.
[cited by applicant]
Deepdive, “Distant Supervision,” Stanford University website, http://deepdive. stanford.edu/distant_supervision, dated 2021, 2 pages.
[cited by applicant]
Shen et al., “LayoutParser: a Unified Toolkit for Deep Learning Based Document Image Analysis,” in International Conference on Document Analysis and Recognition (ICDAR), 2021, 16 pages, retrieved from: https://arxiv.org…
[cited by applicant]
Villota et al., “Text Classification Models for Form Entity Linking”, arXiv, dated Dec. 14, 2021, 10 pages.
[cited by applicant]
Huang et al., “UniGNN: a Unified Framework for Graph and Hypergraph Neural Networks.” IJCAI, arXiv, dated May 3, 2021, 9 pages.
[cited by applicant]
Li et al., “StrucTexT: Structured Text Understanding with Multi-Modal Transformers”, in ACM International Conference on Multimedia (ACM Multimedia), pp. 1912-1920., arXiv, dated Nov. 8, 2021, 9 pages.
[cited by applicant]
Nguyen Dang et al., “End-to-End Hierarchical Relation Extraction for Generic Form Understanding,” in International Conference on Pattern Recognition (ICPR), pp. 5238-5245, arXiv, dated Jun. 2, 2021, 8 pages.
[cited by applicant]
Prabhu et al., “MTL-FoUn: a Multi-Task Learning Approach to Form Understanding,” in International Conference on Document Analysis and Recognition (ICDAR), pp. 377-388, 2021, 5 pages.
[cited by applicant]
Xu et al., “LayoutLMv2: Multi-modal Pre-training for Visually-rich Document Understanding,” ACL, dated 2021, 13 pages.
[cited by applicant]
Kim et al., “Donut: Document Understanding Transformer without OCR,” arXiv, dated Oct. 6, 2022, 29 pages.
[cited by applicant]
Ma et al., “Graph Attention Networks with Positional Embeddings,” ArXiv abs/2105.04037, Oct. 24, 2021, 13 pages.
[cited by applicant]
International Searching Authority, “International Search Report,” mailed in connection with International Patent Application No. PCT/US2020/061269, on Mar. 11, 2021, 3 pages.
[cited by applicant]
International Searching Authority, “Written Opinion,” mailed in connection with International Patent Application No. PCT/US2020/061269, on Mar. 11, 2021,4 pages.
[cited by applicant]
United States Patent and Trademark Office, “Non-Final Office Action,” issued in connection with U.S. Appl. No. 16/692,797, dated Mar. 16, 2021, 12 pages.
[cited by applicant]
Google, “Detect Text in Images,” Mar. 29, 2021, 16 pages. Retrieved from http://cloud.google.com/vision/docs/ocr.
[cited by applicant]
Chen et al., “TextPolar: irregular scene text detection using polar representation,” International Journal on Document Analysis and Recognition (IJDAR), May 23, 2021, 9 pages.
[cited by applicant]
Shen et al., “LayoutParser: a Unified Toolkit for Deep Learning Based Document Image Analysis,” in International Conference on Document Analysis and Recognition (ICDAR), Jun. 1, 2021, 16 pages. [retrieved from: https://…
[cited by applicant]
Hwang et al., “Spatial Dependency Parsing for Semi-Structured Document Information Extraction,” in International Joint Conference on Natural Language Processing (IJCNLP), Jul. 1, 2021, 14 pages. [retrieved from: https:/…
[cited by applicant]
Hong et al., “Bros: a Pre-trained Language Model Focusing on Text and Layout for Better Key Information Extraction from Documents,” arXiv (CoRR), Sep. 10, 2021, 13 pages. [retrieved from: https://arxiv.org/pdf/2108.0453…
[cited by applicant]
Appalaraju et al., “DocFormer: End-to-End Transformer for Document Understanding,” arXiv (CoRR), Sep. 20, 2021, 22 pages. [retrieved from: https://arxiv.org/pdf/2106.11539.pdf].
[cited by applicant]
International Searching Authority, “International Preliminary Report on Patentability,” issued in connection with International Patent Application No. PCT/IB2019/000299, mailed on Sep. 28, 2021, 5 pages.
[cited by applicant]
United States Patent and Trademark Office, “Final Office Action,” issued in connection with U.S. Appl. No. 16/692,797, dated Oct. 27, 2021, 14 pages.
[cited by applicant]
International Searching Authority, “Search Report,” issued in connection with Application No. PCT/US2021/039931, dated Nov. 4, 2021, 4 pages.
[cited by applicant]
European Patent Office, “Communication pursuant to Rules 161(2) and 162 EPC,” in connection with European Patent Application No. 19921870.2, issued Nov. 5, 2021, 3 pages.
[cited by applicant]
Zhang et al., “Multimodal Pre-training Based on Graph Attention Network for Document Understanding,” ArXivabs/2203.13530, Oct. 23, 2022, 13 pages.
[cited by applicant]
International Searching Authority, “Written Opinion,” issued in connection with Application No. PCT/US2021/039931, dated Nov. 4, 2021, 3 pages.
[cited by applicant]
Smith et al., “Identification of Common Molecular Subsequences,” Reprinted Journal of Molecular Biology, Academic Press Inc. (London) Ltd., pp. 195-197, dated 1981, 3 pages.
[cited by applicant]
Govindan et al., “Character Recognition—a Review,” Pattern Recognition, vol. 23, No. 7, pp. 671-683, published Jul. 20, 1990, 13 pages.
[cited by applicant]
Poulovassilis et al., “A nested-graph model for the representation and manipulation of complex objects,” ACM Trans. Inf. Syst. 12, dated 1994, 34 pages.
[cited by applicant]
Hochreiter et al., “Long Short-Term Memory,” Neural Computation 9, pp. 1735-1780, dated 1997, 46 pages.
[cited by applicant]
Ng. et al., “On Spectral Clustering: Analysis and an algorithm,” NIPS, dated 2001, 8 pages.
[cited by applicant]
Crandall et al., “Extraction of special effects caption text events from digital video,” IJDAR, Department of Computer Science and Engineering, The Pennsylvania State University, 202 Pond Laboratory, University Park, PA…
[cited by applicant]
Lowe, “Distinctive Image Features from Scale-Invariant Key points,” International Journal of Computer Vision (HCV), published Jan. 5, 2004, 20 pages.
[cited by applicant]
Marinai, “Introduction to Document Analysis and Recognition,” Machine Learning in Document Analysis and Recognition, published 2008, 20 pages.
[cited by applicant]
Vogel et al., “Parallel Implementations of Word Alignment Tool,” Software Engineering, Testing, and Quality Assurance for Natural Language Processing, pp. 49-57, published Jun. 2008, 10 pages.
[cited by applicant]
O'Gorman et al., “Document Image Analysis,” IEEE Computer Society Executive Briefings, dated 2009, 125 pages.
[cited by applicant]
Krizhevsky et al., “ImageNet Classification with Deep Convolutional Neural Networks,” in International Conference on Neural Information Processing Systems (NIPS), published 2012, 9 pages.
[cited by applicant]
Chung et al., “Empirical Evaluation of Gated Recurrent Neural Networks on Sequence Modeling,” ArXivabs/1412.3555, dated 2014, 9 pages.
[cited by applicant]
Nshuti, “Mobile Scanner and OCR (a First Step Towards Receipt to Spreadsheet),” published 2015, 3 pages.
[cited by applicant]
Ronneberger et al., “U-Net: Convolutional Networks for Biomedical Image Segmentation,” Medical Image Computing and Computer-Assisted Intervention (MICCAI), dated May 18, 2015, 8 pages.
[cited by applicant]
Lecun et al., “Deep Learning,” Nature, vol. 521, pp. 436-444, dated May 28, 2015, 9 pages.
[cited by applicant]
Genereux et al., “NLP Challenges in Dealing with OCR-ed Documents of Derogated Quality,” Workshop on Replicability and Reproducibility in Natural Language Processing, IJCAI 2015, dated Jul. 2015, 6 pages.
[cited by applicant]
Konda et al., “Magellan: Toward Building Entity Matching Management Systems Over Data Science Stacks,” Proceedings of the VLDB Endowment, vol. 9, No. 13, pp. 1581-1584, dated 2016, 4 pages.
[cited by applicant]
Kim et al., “Character-Aware Neural Language Models,” Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (AAAI'IC), pp. 2741-2749, dated 2016, 9 pages.
[cited by applicant]
Feng et al., “Computer vision algorithms and hardware implementations: a survey,” Integration: the VLSI Journal, vol. 69, pp. 309-320, dated Jul. 27, 2019, 12 pages.
[cited by applicant]
Ren et al., “Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networks,” in International Conference on Neural Information Processing Systems (NIPS), pp. 91-99, dated Jan. 6, 2016, 14 pages.
[cited by applicant]
Osindero et al., “Recursive Recurrent Nets with Attention Modeling for OCR in the Wild,” in Conference on Computer Vision and Pattern Recognition (CVPR), dated Mar. 9, 2016, 10 pages.
[cited by applicant]
Redmon et al., “You Only Look Once: Unified, Real-Time Object Detection,” in Conference on Computer Vision and Pattern Recognition (CVPR), dated May 9, 2016, 10 pages.
[cited by applicant]
Joulin et al., “Bag of Tricks for Efficient Text Classification,” in Proceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics, dated Aug. 9, 2016, 5 pages.
[cited by applicant]
Kipf et al., “Semi-Supervised Classification with Graph Convolutional Networks.” ArXiv abs/1609.02907, dated 2017, 14 pages.
[cited by applicant]
Qasim et al., “Rethinking Table Recognition using Graph Neural Networks,” in International Conference on Document Analysis and Recognition (ICDAR), dated Jul. 3, 2019, 6 pages.
[cited by applicant]
Bojanowski et al., “Enriching Word Vectors with Subword Information,” in Journal Transactions of the Association for Computational Linguistics, 2017, vol. 5, pp. 135-146, dated Jun. 2017, 12 pages.
[cited by applicant]
Ozhiganov et al., “Deep Dive Into OCR for Receipt Recognition,” DZone, dated Jun. 21, 2017, 18 pages.
[cited by applicant]
Bartz et al., “STN-OCT: a Single Neural Network for Text Detection and Text Recognition,” Computer Vision and Pattern Recognition, dated Jul. 27, 2017, 9 pages.
[cited by applicant]
Vaswani et al., “Attention is all you need,” in Advances in Neural Information Processing Systems, 31st Conference on Neural Information Processing Systems (NIPS 2017), Long Beach, CA, last revised Dec. 6, 2017, 15 page…
[cited by applicant]
Follmann et al., “MVTec D2S: Densely Segmented Supermarket Dataset,” in European Conference on Computer Vision (ECCV), dated 2018, 17 pages.
[cited by applicant]
Yadati et al., “HyperGCN: Hypergraph Convolutional Networks for Semi-Supervised Classification,” ArXiv abs/1809.02589, dated 2018, 18 pages.
[cited by applicant]
Elfwing et al., “Sigmoid-Weighted Linear Units for Neural Network Function Approximation in Reinforcement Learning,” Neural networks: the official journal of the International Neural Network Society 107, dated 2018, 18 …
[cited by applicant]
Devlin et al., “BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding,” in Conference of the North American Chapter of the Association for Computational Linguistics (NAACL-HLT), dated Jun. 24,…
[cited by applicant]
Velickovic et al., “Graph Attention Networks,” ICLR 2018, ArXiv abs/1710.10903, dated 2018, 12 pages.
[cited by applicant]
Ray et al., “U-PC: Unsupervised Planogram Compliance,” in European Conference on Computer Vision (ECCV), dated 2018, 15 pages.
[cited by applicant]
Hui, “mAP (mean Average Precision) for Object Detection,” published Mar. 6, 2018, 2 pages.
[cited by applicant]
Mudgal et al., “Deep learning for entity matching: a design space exploration,” in Proceedings of the 2018 International Conference on Management of Data, dated Jun. 10-15, 2018, 16 pages.
[cited by applicant]
Akbik et al., “Contextual String Embeddings for Sequence Labeling,” in Proceedings of the 27th International Conference on Computational Linguistics (COLING), dated Aug. 2018, 12 pages.
[cited by applicant]
Huang et al., “Mask R-CNN with Pyramid Attention Network for Scene Text Detection,” arXiv:1811.09058v1, pp. 1-9, dated Nov. 22, 2018, 9 pages.
[cited by applicant]
Wikipedia, “Precision & Recall,” Dec. 17, 2018 revision, 12 pages.
[cited by applicant]
Liu et al., “RoBERTa: a Robustly Optimized BERT Pretraining Approach,” ArXiv abs/1907.11692, dated 2019, 13 Pages.
[cited by applicant]
Loshchilov et al., “Decoupled Weight Decay Regularization,” ICLR, dated 2019, 19 Pages.
[cited by applicant]
Guillaume et al., “FUNSD: a dataset for form understanding in noisy scanned documents,” in International Conference on Document Analysis and Recognition (ICDAR), dated 2019, 6 pages.
[cited by applicant]
Artificial Intelligence & Image Analysis, “Historic Document Conversion,” Industry Paper, accessed on Jan. 30, 2019, 4 pages.
[cited by applicant]
Artificial Intelligence & Image Analysis, “Intelligent Automation Eliminates Manual Data Entry From Complex Documents,” White Paper, accessed on Jan. 30, 2019, 3 pages.
[cited by applicant]
Canadian Intellectual Property Office, “Examiner's Report,” issued in connection with Canadian Patent Application No. 3,124,868, dated Aug. 10, 2023, 5 pages.
[cited by applicant]
United States Patent and Trademark Office, “Corrected Notice of Allowability,” issued in connection with U.S. Appl. No. 17/883,309, dated Aug. 17, 2023, 2 Pages.
[cited by applicant]
United Kingdom Intellectual Property Office, “Notification of Grant,” issued in connection with United Kingdom Patent Application No. 2112299.9, dated Aug. 29, 2023, 2 pages.
[cited by applicant]
Amazon, “Intelligent Document Processing,” Amazon Web Services, https://aws.amazon.com/machine-learning/ml-use-cases/document-processing/fintech/, retrieved on Sep. 8, 2023, 6 pages.
[cited by applicant]
United States Patent and Trademark Office, “Notice of Allowance and Fee(s) Due,” issued in U.S. Appl. No. 17/075,675, dated on Oct. 10, 2023, 2 pages.
[cited by applicant]
United States Patent and Trademark Office, “Non-Final Office Action,” issued in connection with U.S. Appl. No. 17/710,538, dated Oct. 26, 2023, 6 Pages.
[cited by applicant]
European Patent Office, “Extended European Search Report,” issued in connection with European Patent Application No. 20891012.5, dated Nov. 17, 2023, 12 pages.
[cited by applicant]
European Patent Office, “Communication pursuant to Rules 70(2) and 70a(2) EPC,” issued in connection with European Patent Application No. 20891012.5, dated Dec. 5, 2023, 1 page.
[cited by applicant]
United States Patent and Trademark Office, “Non-Final Office Action” issued in connection with U.S. Appl. No. 17/598,792, mailed on Dec. 29, 2023, 17 pages.
[cited by applicant]
International Searching Authority, “International Preliminary Report on Patentability,” issued in connection with International Patent Application No. PCT/US2022/034570, issued on Dec. 14, 2023, 7 pages.
[cited by applicant]
Visich, “Bar Codes and Their Applications,” Research Foundation of State University of New York, 1990, 59 pages.
[cited by applicant]
Li et al., “StructuralLM: Structural Pre-training for Form Understanding,” 59th Annual Meeting of the Association for Computational Linguistics, Aug. 2021, 10 pages.
[cited by applicant]
European Patent Office, “Communication pursuant to Article 94(3) EPC,” issued in connection with European Patent Application No. 19 921 870.2-1207, on Apr. 9, 2024, 7 pages.
[cited by applicant]
United States Patent and Trademark Office, “Supplemental Notice of Allowability,” issued in connection with U.S. Appl. No. 17/710,538, dated May 8, 2024, 3 pages.
[cited by applicant]
United States Patent and Trademark Office, “Notice of Allowance and Fee(s) Due,” issued in connection with U.S. Appl. No. 17/598,792, dated Jun. 17, 2024, 9 pages.
[cited by applicant]
United States Patent and Trademark Office, “Corrected Notice of Allowability,” issued in connection with U.S. Appl. No. 17/598,792, dated Jul. 3, 2024, 2 pages.
[cited by applicant]
United States Patent and Trademark Office, “Final Office Action,” issued in connection with U.S. Appl. No. 17/566,135, dated Jul. 25, 2024, 17 pages.
[cited by applicant]
Levenshtein, “Binary Codes Capable of Correcting Deletions, Insertions, and Reversals,” Soviet Physics—Doklady, Cybernetics and Control Theory, pp. 707-710, vol. 10, No. 8, Feb. 1966, 4 pages.
[cited by applicant]
Leicester et al., “Using Scanner Technology to Collect Expenditure Data,” Fiscal Studies, vol. 30, Issue 3-4, 2009, 29 pages.
[cited by applicant]
Oliveira et al., “A New Method for Text-Line Segmentation for Warped Documents,” International Conference Image Analysis and Recognition, Jun. 21, 2010, 11 pages.
[cited by applicant]
Velickovic et al. “Graph Attention Networks,” International Conference on Learning Representations, Feb. 4, 2018, 12 pages.
[cited by applicant]
Li et al., “Extracting Figures and Captions from Scientific Publications,” Short Paper, CIKM18, Oct. 22-26, 2018, Torino, Italy, 4 pages.
[cited by applicant]
Nathancy, “How do I make masks to set all of image background, except the text, to white?”, stakoverflow.com, https://stackoverflow.com/questions/56465359/how-do-i-make-masks-to-set-all-of-image-background-except-the-te…
[cited by applicant]
Hu et al., “Semi-supervised Node Classification via Hierarchical Graph Convolutional Networks,” 2019 International Joint Conference on Artificial Intelligence, Aug. 10, 2019, 8 pages.
[cited by applicant]
Jaume et al., “FUNSD: a Dataset for Form Understanding in Noisy Scanned Documents,” International Conference on Document Analysis and Recognition (ICDAR), Sep. 20, 2019, 6 pages.
[cited by applicant]
Bandyopadhyay et al., “Hypergraph Attention Isomorphism Network by Learning Line Graph Expansion.” 2020 IEEE International Conference on Big Data (Big Data) (2020): 669-678, 10 pages.
[cited by applicant]
Xu et al. “LayoutXLM: Multimodal Pre-training for Multilingual Visually-rich Document Understanding”, arXiv, Apr. 2021, 10 pages.
[cited by applicant]
Li et al. “SelfDoc: Self-Supervised Document Representation Learning.” 2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) (2021): 5648-5656, 10 pages.
[cited by applicant]
Tang et al., “MatchVIE: Exploiting Match Relevancy between Entities for Visual Information Extraction”, in International Joint Conference on Artificial Intelligence (IJCAI), pp. 1039-1045, 2021, 7 pages.
[cited by applicant]
Powalski et al., “Going Full-TILT Boogie on Document Understanding with Text-Image-Layout Transformer,” International Conference on Document Analysis and Recognition, Sep. 5, 2021, 17 pages.
[cited by applicant]
Datasetlist, “Annotation tools for building datasets,” Labeling tools—List of Labeling tools, Datasetlist.com, updated Dec. 2021, downloaded on Apr. 1, 2022, 12 pages. [retrieved from https://www.datasetlist.com/tools/].
[cited by applicant]
Nielsen Iq, “Nielsen Brandbank Product Library—Power the Path to Purchase With Brand Approved Content,” URL: [https://www.brandbank.com/US/product-library/], retrieved on Apr. 1, 2022, 5 pages.
[cited by applicant]
Gu et al., “XYLayoutLM: Towards Layout-Aware Multimodal Networks for Visually-Rich Document Understanding,” Conference on Computer Vision and Pattern Recognition (CVPR), Jun. 18, 2022, 10 pages.
[cited by applicant]
United States and Patent and Trademark Office, “Non-Final Office Action,” issued in connection with U.S. Appl. No. 17/566,135, dated Mar. 27, 2024, 13 pages.
[cited by applicant]
United States Patent and Trademark Office, “Non-Final Office Action,” issued in connection with U.S. Appl. No. 18/476,978, dated Apr. 18, 2024, 20 pages.
[cited by applicant]
United States Patent and Trademark Office, “Notice of Allowance and Fee(s) Due,” issued in connection with U.S. Appl. No. 17/710,538, dated Apr. 19, 2024, 8 pages.
[cited by applicant]
United States Patent and Trademark Office, “Non-Final Office Action,” issued in connection with U.S. Appl. No. 17/710,660, on May 28, 2024, 9 pages.
[cited by applicant]
Canadian Intellectual Property Office, “Office Action,” issued in connection with Canadian Patent Application No. 3,182,471, dated May 28, 2024, 5 pages.
[cited by applicant]
United States Patent and Trademark Office, “Notice of Allowance and Fee(s) Due,” issued in connection with U.S. Appl. No. 17/710,538, dated Aug. 14, 2024, 8 pages.
[cited by applicant]
United States Patent and Trademark Office, “Final Office Action,” issued in connection with U.S. Appl. No. 18/476,978, dated Aug. 14, 2024, 22 pages.
[cited by applicant]
International Searching Authority, “International Preliminary Report on Patentability,” issued in connection with International Application No. PCT/US2023/011859, mailed on Aug. 15, 2024, 6 pages.
[cited by applicant]
United States Patent and Trademark Office, “Notice of Allowance and Fee(s) Due,” issued in connection with U.S. Appl. No. 17/710,660, dated Sep. 25, 2024, 9 pages.
[cited by applicant]
United States Patent and Trademark Office, “Notice of Allowance and Fee(s) Due,” issued in connection with U.S. Appl. No. 17/598,792, dated Aug. 27, 2024, 9 pages.
[cited by applicant]
United States Patent and Trademark Office, “Notice of Allowance and Fee(s) Due,” issued in connection with U.S. Appl. No. 17/710,538, dated Sep. 11, 2024, 3 pages.
[cited by applicant]
United States Patent and Trademark Office, “Non-Final Office Action,” issued in connection with U.S. Appl. No. 17/710,649, dated Sep. 16, 2024, 12 pages.
[cited by applicant]
United States Patent and Trademark Office, “Advisory Action,” issued in connection with U.S. Appl. No. 18/476,978, dated Oct. 7, 2024, 3 pages.
[cited by applicant]
United States Patent and Trademark Office, “Corrected Notice of Allowability,” issued in connection with U.S. Appl. No. 17/710,660, dated Oct. 9, 2024, 2 pages.
[cited by applicant]
United States Patent and Trademark Office, “Corrected Notice of Allowability,” issued in connection with U.S. Appl. No. 17/598,792, dated Oct. 10, 2024, 2 pages.
[cited by applicant]
United States Patent and Trademark Office, “Corrected Notice of Allowability,” issued in connection with U.S. Appl. No. 18/191,642, dated Oct. 11, 2024, 2 pages.
[cited by applicant]
United States Patent and Trademark Office, “Notice of Allowance and Fee(s) Due,” issued in connection with U.S. Appl. No. 17/566,135, dated Oct. 11, 2024, 9 pages.
[cited by applicant]
United States Patent and Trademark Office, “Corrected Notice of Allowability,” issued in connection with U.S. Appl. No. 17/710,660, dated Oct. 30, 2024, 2 pages.
[cited by applicant]
United States Patent and Trademark Office, “Corrected Notice of Allowability,” issued in connection with U.S. Appl. No. 17/566,135, dated Oct. 23, 2024, 9 pages.
[cited by applicant]
Cited By (1)