IP Library Granted Patent US 12,700,251
Granted Patent B2
US 12,700,251 · App. 18/148,928 · Granted Aug 4, 2026

Methods, systems, articles of manufacture, and apparatus to detect lines on documents

Inventors: David Montero (Valladolid, ES); Jose Javier Yebes Torres (Valladolid, ES)
Assignee: Nielsen Consumer LLC
G06V30/153G06V10/82G06V30/146G06V30/1801G06V30/414G06Q30/0201
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,700,251
App. No.
18/148,928
Filed
Dec 30, 2022
Granted
Aug 4, 2026
Kind
B2
Art Unit
2675
USPC
382/158
Abstract

Methods, apparatus, systems, and articles of manufacture are disclosed that detect lines in a document. An example apparatus includes at least one memory; machine readable instructions; and processor circuitry to at least one of instantiate or execute the machine readable instructions to: generate feature embeddings for text segments detected in a document image, the segments associated with respective bounding boxes, wherein the segments are to be represented by nodes in a graph; identify candidate edges between ones of the segments; pass the feature embeddings through graph attention layers (GAT) to update the feature embeddings with information from neighbor nodes; generate an adjacency matrix for the document image by determining confidence scores for the edges; and cluster the nodes based on the adjacency matrix to group ones of the nodes that belong to a same line.

Claims (52)

1 . An apparatus to detect lines, comprising:

at least one memory;

machine readable instructions; and

at least one processor circuit to be programmed by the machine readable instructions to:

generate feature embeddings for text segments detected in a document image, the text segments associated with respective bounding boxes, wherein the text segments are to be represented by nodes in a graph;

identify candidate edges between ones of the text segments;

pass the feature embeddings through graph attention (GAT) layers to update the feature embeddings with information from neighbor nodes;

generate an adjacency matrix for the document image by determining confidence scores for the candidate edges based on the updated feature embeddings; and

cluster the nodes based on the adjacency matrix to group ones of the nodes that belong to a same line.

2 . The apparatus of claim 1 , wherein the document image corresponds to a receipt, and the text segments correspond to words in the receipt image.

3 . The apparatus of claim 1 , wherein the text segments include the bounding boxes and respective text strings, and wherein one or more of the at least one processor circuit is to discard the text strings.

4 . The apparatus of claim 1 , wherein one or more of the at least one processor circuit is to generate a first one of the feature embeddings for a first text segment of the text segments by:

extracting features for the feature embeddings from the first text segment, the features including a left center coordinate, a right center coordinate, and a rotation angle of a respective bounding box;

normalizing the left center and right center coordinates using a width of the document; and

concatenating the normalized left and right center coordinates and the rotation angle.

5 . The apparatus of claim 1 , wherein one or more of the at least one processor circuit is to identify a first candidate edge between a first text segment and a second text segment of the text segments in response to determining that an absolute value of vertical distance between a center coordinate of the first text segment and a center coordinate of the second text segment is less than a height of the first text segment multiplied by a constant.

6 . The apparatus of claim 1 , wherein one or more of the at least one processor circuit is to generate a global node by averaging the feature embeddings, the global node to be passed through the GAT layers with the feature embeddings to provide a global document perspective.

7 . The apparatus of claim 1 , wherein the graph attention layers include residual connections.

8 . The apparatus of claim 1 , wherein one or more of the at least one processor is to apply a sigmoid linear unit (SiLu) activation to an output of ones of the graph attention layers.

9 . The apparatus of claim 1 , wherein one or more of the at least one processor circuit is to determine a first confidence score for a first edge connecting a first text segment and a second text segment of the text segments by:

identifying respective updated feature embeddings for the first text segment and the second text segment;

concatenating the updated feature embeddings for the first text segment and the second text segment; and

passing the concatenated feature embeddings for the first text segment and the second text segment through a multi-layer perceptron, the multi-layer perceptron including two fully-connected layers and a sigmoid function.

10 . The apparatus of claim 1 , wherein one or more of the at least one processor circuit is to cluster the text segments based on the adjacency matrix by applying a limited connected component algorithm to the adjacency matrix.

11 . At least one non-transitory machine readable storage medium comprising machine readable instructions to cause at least one processor circuit to at least:

obtain text segments corresponding to a document image, the text segments including rotated bounding box coordinates, wherein the text segments are to be represented by nodes of a graph;

sample edges between ones of the text segments to generate a graph, the graph including nodes representing the text segments;

generate feature embeddings for the nodes based on geometric features extracted from the text segments;

provide the graph and the feature embeddings to graph attention layers, the graph attention layers to determine message passing weight values, the graph attention layers to enrich the feature embeddings with neighborhood nodes and a global node;

determine confidence values for the edges based on the enriched feature embeddings; and

cluster the text segments by line based on the confidence values to detect lines in the document image.

12 . The at least one non-transitory machine readable storage medium of claim 11 , wherein the text segments include text strings, the machine readable instructions are to cause one or more of the at least one processor circuit to dispose of the text strings.

13 . The at least one non-transitory machine readable storage medium of claim 11 , wherein the machine readable instructions are to cause one or more of the at least one processor circuit to extract the geometric features from bounding boxes associated with the text segments, the geometric features including left center coordinates, right center coordinates, and rotation angles.

14 . The at least one non-transitory machine readable storage medium of claim 13 , wherein the machine readable instructions are to cause one or more of the at least one processor circuit to generate a first one of the feature embeddings for a first text segment of the text segments by:

normalizing respective ones of the left and right center coordinates using a width of the document image; and

concatenating a respective rotation angle for the first text segment and the normalized left and right center coordinates for the first text segment.

15 . The at least one non-transitory machine readable storage medium of claim 11 , wherein the machine readable instructions are to cause one or more of the at least one processor circuit to identify a first edge between a first text segment and a second text segment in response to determining that an absolute value of vertical distance between a center coordinate of the first text segment and a center coordinate of the second text segment is less than a height of the first text segment multiplied by a constant.

16 . The at least one non-transitory machine readable storage medium of claim 11 , wherein the machine readable instructions are to cause one or more of the at least one processor circuit to generate the global node by averaging the feature embeddings for the text segments.

17 . The at least one non-transitory machine readable storage medium of claim 11 , wherein the document image is an image of a receipt, and the text segments correspond to words in the receipt image.

18 . The at least one non-transitory machine readable storage medium of claim 11 , where a first one of the text segments is connected to (a) a second one of the text segments that is laterally adjacent the first one of the text segments in a first direction, and (b) a third one of the text segments that is laterally adjacent the first one of the text segments in a second direction.

19 . An apparatus comprising:

means for extracting node features to generate feature embeddings for text segments detected in a document, the text segments associated with bounding boxes and represented by nodes in a graph;

means for sampling edges to identify candidate edges between ones of the text segments;

means for message passing to pass the feature embeddings through graph attention (GAT) layers, the means for message passing to update the feature embeddings for the text segments with information from neighbor nodes;

means for generating confidence scores to generate an adjacency matrix for the document by determining confidence scores for the candidate edges based on the updated feature embeddings; and

means for grouping to cluster the nodes based on the adjacency matrix to group ones of the nodes that belong to a same line.

20 . The apparatus of claim 19 , wherein the text segments include text strings, the means for extracting node features to remove text strings.

21 . The apparatus of claim 19 , wherein the means for extracting node features is to extract bounding box features from the text segments, the bounding box features including left-center coordinates, right-center coordinates, and rotation angles.

22 . The apparatus of claim 21 , wherein the means for extracting node features is to concatenate ones of the bounding box features corresponding to respective text segments.

23 . The apparatus of claim 19 , wherein the means for message passing is to generate a global node by averaging the feature embeddings for the text segments and to add a global aspect to the updated feature embeddings for the text segments based on the global node.

24 . The apparatus of claim 19 , wherein the means for generating confidence scores is to apply a multi-layer perceptron model to the updated feature embeddings and the candidate edges.

25 . The apparatus of claim 19 , wherein the means for grouping is to apply a limited connected components (LCC) algorithm to the confidence scores to group the text segments by line.

Assignments (3)
INTELLECTUAL PROPERTY SECURITY AGREEMENT Recorded Jun 20, 2024
From: NIELSEN CONSUMER LLC
To: BANK OF AMERICA, N.A., AS ADMINISTRATIVE AND COLLATERAL AGENT
Reel/Frame 067792/0978 →
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 Mar 11, 2023
From: TORRES, JOSE JAVIER YEBES; MONTERO, DAVID
To: NIELSEN CONSUMER LLC
Reel/Frame 062954/0065 →
Continuity (2)
Provisional Application 63349898 · Jun 7, 2022
Related Publication 20230394859A1 · Dec 7, 2023
References Cited (400)
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 8855375B2 · Macciola 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 · 2015 [cited by applicant]
US 9239952B2 · Hsu · 2016 [cited by applicant]
US 9262686B1 · Singer · 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 9384389B1 · Sankaranarayanan · 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 · 2018 [cited by applicant]
US 10026061B2 · Cheek · 2018 [cited by applicant]
US 10032072B1 · Tran et al. · 2018 [cited by applicant]
US 10157425B2 · Chelst et al. · 2018 [cited by applicant]
US 10235585B2 · Deng · 2019 [cited by applicant]
US 10242285B2 · Thrasher et al. · 2019 [cited by applicant]
US 10395772B1 · Lucas et al. · 2019 [cited by applicant]
US 10679283B1 · Pesce · 2020 [cited by applicant]
US 10970768B2 · Zheng et al. · 2021 [cited by applicant]
US 11256760B1 · Corcoran · 2022 [cited by applicant]
US 11257049B1 · Durazo Almeida · 2022 [cited by applicant]
US 11321956B1 · Geng · 2022 [cited by applicant]
US 11410446B2 · Shanmuganathan et al. · 2022 [cited by applicant]
US 11414053B2 · Tanaami et al. · 2022 [cited by applicant]
US 11468491B2 · Dalal · 2022 [cited by applicant]
US 11476981B2 · Wei et al. · 2022 [cited by applicant]
US 11562557B2 · Miginnis et al. · 2023 [cited by applicant]
US 11587148B2 · Elder · 2023 [cited by applicant]
US 11593552B2 · Sarkar · 2023 [cited by applicant]
US 11609956B2 · Jain · 2023 [cited by applicant]
US 11625930B2 · Rodriguez et al. · 2023 [cited by applicant]
US 11809985B2 · Polanía Cabrera · 2023 [cited by applicant]
US 11810380B2 · Arroyo · 2023 [cited by applicant]
US 11810383B2 · Patel et al. · 2023 [cited by applicant]
US 11842035B2 · Jahjah et al. · 2023 [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 20060245650A1 · Jun · 2006 [cited by applicant]
US 20070033533A1 · Sull · 2007 [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 20110289395A1 · Breuel 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 · 2014 [cited by applicant]
US 20140195891A1 · Venkata Radha Krishna Rao · 2014 [cited by applicant]
US 20150039479A1 · Gotanda · 2015 [cited by applicant]
US 20150127428A1 · Gharachorloo · 2015 [cited by applicant]
US 20150169951A1 · Khintsitskiy et al. · 2015 [cited by applicant]
US 20150254778A1 · Kmak et al. · 2015 [cited by applicant]
US 20150317642A1 · Argue · 2015 [cited by applicant]
US 20150363792A1 · Arini · 2015 [cited by applicant]
US 20150363822A1 · Rowe · 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 · 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 20160342863A1 · Kwon et al. · 2016 [cited by applicant]
US 20160350954A1 · Agarwala · 2016 [cited by applicant]
US 20170206536A1 · Brelig · 2017 [cited by applicant]
US 20170293819A1 · Deng · 2017 [cited by applicant]
US 20170329749A1 · Milward · 2017 [cited by applicant]
US 20170364450A1 · Struttmann · 2017 [cited by applicant]
US 20180005345A1 · Apodaca et al. · 2018 [cited by applicant]
US 20180053045A1 · Lorenzini et al. · 2018 [cited by applicant]
US 20180060302A1 · Liang et al. · 2018 [cited by applicant]
US 20180317116A1 · Komissarov et al. · 2018 [cited by applicant]
US 20180336509A1 · Guttmann · 2018 [cited by applicant]
US 20190026803A1 · De Guzman · 2019 [cited by applicant]
US 20190050639A1 · Ast · 2019 [cited by applicant]
US 20190080207A1 · Chang · 2019 [cited by applicant]
US 20190130622A1 · Hoover · 2019 [cited by applicant]
US 20190171900A1 · Thrasher et al. · 2019 [cited by applicant]
US 20190244020A1 · Yoshino et al. · 2019 [cited by applicant]
US 20190272360A1 · Kursun · 2019 [cited by applicant]
US 20190325211A1 · Ordonez et al. · 2019 [cited by applicant]
US 20190332662A1 · Middendorf et al. · 2019 [cited by applicant]
US 20190354818A1 · Reisswig et al. · 2019 [cited by applicant]
US 20200097718A1 · Schäfer · 2020 [cited by applicant]
US 20200097759A1 · Nadim · 2020 [cited by applicant]
US 20200142856A1 · Neelamana · 2020 [cited by applicant]
US 20200151444A1 · Price et al. · 2020 [cited by applicant]
US 20200151902A1 · Almazán · 2020 [cited by applicant]
US 20200175267A1 · Schäfer et al. · 2020 [cited by applicant]
US 20200190963A1 · Gooneratne · 2020 [cited by applicant]
US 20200249803A1 · Sobel et al. · 2020 [cited by applicant]
US 20200279107A1 · Staar · 2020 [cited by applicant]
US 20200364451A1 · Ammar et al. · 2020 [cited by applicant]
US 20200401798A1 · Foncubierta Rodriguez et al. · 2020 [cited by applicant]
US 20200410231A1 · Chua et al. · 2020 [cited by applicant]
US 20210004880A1 · Benkreira et al. · 2021 [cited by applicant]
US 20210009163A1 · Urtasun · 2021 [cited by applicant]
US 20210019287A1 · Prasad et al. · 2021 [cited by applicant]
US 20210034856A1 · Torres et al. · 2021 [cited by applicant]
US 20210090694A1 · Colley et al. · 2021 [cited by applicant]
US 20210117665A1 · Simantov et al. · 2021 [cited by applicant]
US 20210117668A1 · Zhong et al. · 2021 [cited by applicant]
US 20210142092A1 · Zhao et al. · 2021 [cited by applicant]
US 20210149926A1 · Komninos et al. · 2021 [cited by applicant]
US 20210158038A1 · Shanmuganathan et al. · 2021 [cited by applicant]
US 20210216765A1 · Xu · 2021 [cited by applicant]
US 20210248420A1 · Zhong et al. · 2021 [cited by applicant]
US 20210287313A1 · McCarthy · 2021 [cited by applicant]
US 20210295101A1 · Tang et al. · 2021 [cited by applicant]
US 20210319217A1 · Wang et al. · 2021 [cited by applicant]
US 20210334737A1 · Balaji · 2021 [cited by applicant]
US 20210343030A1 · Sagonas et al. · 2021 [cited by applicant]
US 20210357710A1 · Zhang et al. · 2021 [cited by applicant]
US 20210406533A1 · Arroyo et al. · 2021 [cited by applicant]
US 20220004756A1 · Jennings · 2022 [cited by applicant]
US 20220114821A1 · Arroyo et al. · 2022 [cited by applicant]
US 20220156489A1 · Agarwal · 2022 [cited by examiner]
US 20220180113A1 · Patel · 2022 [cited by applicant]
US 20220189190A1 · Arroyo et al. · 2022 [cited by applicant]
US 20220198185A1 · Prebble · 2022 [cited by applicant]
US 20220350946A1 · Hjerrild · 2022 [cited by applicant]
US 20220383651A1 · Shanmuganathan et al. · 2022 [cited by applicant]
US 20220397809A1 · Talpade et al. · 2022 [cited by applicant]
US 20220414630A1 · Yebes Torres et al. · 2022 [cited by applicant]
US 20230004748A1 · Rodriguez et al. · 2023 [cited by applicant]
US 20230005286A1 · Yebes Torres et al. · 2023 [cited by applicant]
US 20230008198A1 · Gadde et al. · 2023 [cited by applicant]
US 20230057687A1 · Mantri · 2023 [cited by applicant]
US 20230065915A1 · Berestovsky · 2023 [cited by applicant]
US 20230196806A1 · Ramalingam et al. · 2023 [cited by applicant]
US 20230214899A1 · Martínez Cebrián et al. · 2023 [cited by applicant]
US 20230230408A1 · Arroyo et al. · 2023 [cited by applicant]
US 20230306203A1 · Hoang · 2023 [cited by examiner]
US 20230394859A1 · Montero et al. · 2023 [cited by applicant]
US 20240013562A1 · Montero · 2024 [cited by applicant]
CA 2957433A1 · 2017 [cited by applicant]
CA 2957433C · 2020 [cited by applicant]
CN 100369049C · 2008 [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 112380835A · 2021 [cited by applicant]
CN 112446351A · 2021 [cited by applicant]
CN 112560862A · 2021 [cited by applicant]
CN 113282726A · 2021 [cited by applicant]
CN 112699662B · 2022 [cited by applicant]
CN 115017144A · 2022 [cited by applicant]
CN 112907973B · 2023 [cited by applicant]
DE 202013005144U1 · 2013 [cited by applicant]
GB 2595412A · 2021 [cited by applicant]
JP H0749529A · 1995 [cited by applicant]
JP 2008210850A · 2008 [cited by applicant]
JP 2008211850A · 2008 [cited by applicant]
JP 2019139737A · 2019 [cited by applicant]
JP 7049529B2 · 2022 [cited by applicant]
KR 101831204B1 · 2018 [cited by applicant]
TW 200821850A · 2008 [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]
Guillaume et al., “FUNSD: A Dataset for Form Understanding in Noisy Scanned Documents,” International Conference on Document Analysis and Recognition (ICDAR), arXiv, Oct. 29, 2019, 6 pages. [cited by applicant]
Yadati et al., “HyperGCN: Hypergraph Convolutional Networks for Semi-Supervised Classification,” Proceedings of the 33rd International Conference on Neural Information Processing Systems, arXiv, Jan. 26, 2019, 18 pages. [cited by applicant]
International Searching Authority, “ Written Opinion,” issued in connection with International Patent Application No. PCT/IB2019/000299, mailed on Dec. 23, 2019, 4 pages. [cited by applicant]
International Searching Authority, “International Search Report,” issued in connection with International Patent Application No. PCT/IB2019/000299, mailed on Dec. 23, 2019, 3 pages. [cited by applicant]
Github, “Tesseract OCR,” Tesseract Repository on GitHub, URL:[https://github. com/tesseract-ocr/], 2020, 3 pages. [cited by applicant]
Carbonell et al., “Named Entity Recognition and Relation Extraction with Graph Neural Networks in Semi Structured Documents,” 2020 International Conference on Pattern Recognition (ICPR), Jan. 10, 2021, 6 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]
Liu et al., “RoBERTa: A Robustly Optimized BERT Pretraining Approach,” ArXiv abs/1907.11692, Jul. 26, 2019, 13 pages. [cited by applicant]
Xu et al., “LayoutLM: Pre-training of Text and Layout for Document Image Understanding,” International Conference on Knowledge Discovery & Data Mining (SIGKDD), Jun. 16, 2020, 9 pages. [cited by applicant]
Dong et al., “HNHN: Hypergraph Networks with Hyperedge Neurons,” ArXiv abs/2006.12278, dated Jun. 22, 2020, 11 pages. [cited by applicant]
Yu et al., “PICK: Processing Key Information Extraction from Documents using Improved Graph Learning-Convolutional Networks,” International Conference on Pattern Recognition (ICPR), arXiv, dated Jul. 18, 2020, 8 pages. [cited by applicant]
Chen et al., “HGMF: Heterogeneous Graph-Based Fusion for Multimodal Data with Incompleteness,” 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, dated Aug. 23-27, 2020, 11 pages. [cited by applicant]
Wang et al., “DocStruct: A Multimodal Method to Extract Hierarchy Structure in Document for General Form Understanding,” 2020 Conference Empirical Methods in Natural Language Processing (EMNLP), Nov. 16, 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), Nov. 17, 2020, 9 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), 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), Dec. 12, 2020, 10 p… [cited by applicant]
Deepdive, “Distant Supervision,” Stanford University, URL:[http://deepdive.stanford.edu/distant supervision], retrieved on Apr. 1, 2022, 2 pages. [cited by applicant]
Nguyen et al. “End-to-End Hierarchical Relation Extraction for Generic Form Understanding”, International Conference on Pattern Recognition (ICPR), arXiv, Jun. 2, 2021, 8 pages. [cited by applicant]
International Searching Authority, “International Search Report,” issued in connection with International Patent Application No. PCT/US2020/061269, mailed on Mar. 11, 2021, 3 pages. [cited by applicant]
International Searching Authority, “Written Opinion,” issued in connection with International Patent Application No. PCT/US2020/061269, mailed 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,” URL:[http://cloud.google.com/vision/docs/ocr], Mar. 29, 2021, 16 pages. [cited by applicant]
Xu et al., “LayoutXLM: Multimodal Pre-training for Multilingual Visually-rich Document Understanding,” arXiv, Sep. 9, 2021, 10 pages. [cited by applicant]
Ma et al., “Graph Attention Networks with Positional Embeddings,” Pacific-Asia Conference on Knowledge Discovery and Data Mining, arXiv, Oct. 24, 2021, 13 pages. [cited by applicant]
Chen et al., “TextPolar: Irregular Scene Text Detection Using Polar Representation,” International Journal on Document Analysis and Recognition (IJDAR), May 7, 2021, 9 pages. [cited by applicant]
Li et al. “SelfDoc: Self-Supervised Document Representation Learning,” 2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), arXiv, Jun. 7, 2021, 10 pages. [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. [cited by applicant]
Li et al., “StructuralLM: Structural Pre-training for Form Understanding,” 59th Annual Meeting of the Association for Computational Linguistics, arXiv, May 24, 2021, 10 pages. [cited by applicant]
Xu et al., “LayoutLMv2: Multi-Modal Pre-Training for Visually-Rich Document Understanding,” 59th Annual Meeting of the Association for Computational Linguistics (ACL), arXiv, dated Jan. 10, 2022, 13 pages. [cited by applicant]
Tang et al., “MatchVIE: Exploiting Match Relevancy between Entities for Visual Information Extraction,” 2021 International Joint Conference on Artificial Intelligence (IJCAI), arXiv, Jun. 24, 2021, 7 pages. [cited by applicant]
Huang et al., “UniGNN: a Unified Framework for Graph and Hypergraph Neural Networks,” 30th International Joint Conference on Artificial Intelligence (IJCAI), arXiv, May 3, 2021, 9 pages. [cited by applicant]
Qian et al., “A Region-Based Hypergraph Network for Joint Entity-Relation Extraction,” Knowledge-Based Systems. vol. 228, Sep. 2021, 8 pages. [cited by applicant]
Prabhu et al., “MTL-FoUn: A Multi-Task Learning Approach to Form Understanding,” 2021 International Conference on Document Analysis and Recognition (ICDAR), Sep. 5, 2021, 5 pages. [cited by applicant]
Garncarek et al., “LAMBERT: Layout-Aware Language Modeling for Information Extraction,” International Conference on Document Analysis and Recognition (ICDAR), arXiv, May 28, 2021, 16 pages. [cited by applicant]
Davis et al., “Visual FUDGE: Form Understanding via Dynamic Graph Editing,” International Conference on Document Analysis and Recognition (ICDAR), arXiv, Jul. 16, 2021, 16 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), arXiv, Jun. 21, 2021, 16 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, arXiv, Mar. 2, 2021, 17 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), Sep. 10, 2021, 13 pages. [cited by applicant]
Appalaraju et al., “DocFormer: End-to-End Transformer for Document Understanding,” arXiv (CoRR), Sep. 20, 2021, 22 pages. [cited by applicant]
International Searching Authority, “International Preliminary Report on Patentability,” issued in connection with International Patent Application No. PCT/IB2019/000299, issued on Sep. 28, 2021, 5 pages. [cited by applicant]
Li et al., “StrucTexT: Structured Text Understanding with Multi-Modal Transformers,” ACM International Conference on Multimedia (ACM Multimedia), arXiv, Nov. 8, 2021, 9 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, “International Search Report,” issued in connection with International Patent Application No. PCT/US2021/039931, mailed on Nov. 4, 2021, 3 pages. [cited by applicant]
International Searching Authority, “Written Opinion,” issued in connection with International Patent Application No. PCT/US2021/039931, mailed on Nov. 4, 2021, 4 pages. [cited by applicant]
Zhang et al., “Entity Relation Extraction as Dependency Parsing in Visually Rich Documents,” Empirical Methods in Natural Language Processing (EMNLP), Nov. 7, 2021, 10 pages. [cited by applicant]
Hwang et al., “Cost-Effective End-to-end Information Extraction for Semi-structured Document Images,” Empirical Methods in Natural Language Processing (EMNLP), arXiv, Aug. 30, 2021, 9 pages. [cited by applicant]
Datasetlist, “Annotation Tools For Building Datasets,” Labeling tools- List of labeling tools, URL:[retrieved from: https://www.datasetlist.com/tools/], updated Dec. 2021, 12 pages. [cited by applicant]
Gu et al., “UniDoc: Unified Pretraining Framework for Document Understanding,” Neural Information Processing Systems (NeurIPS), arXiv, Apr. 28, 2022, 12 pages. [cited by applicant]
Park et al. “CORD: A Consolidated Receipt Dataset for Post-OCR Parsing,” In Workshop on Document Intelligence NeurIPS 2019, 33rd Conference on Neural Information Processing Systems, Vancouver, Canada, 4 pages. [cited by applicant]
Wang et al. “LiLT: A Simple yet Effective Language-Independent Layout Transformer for Structured Document Understanding,” Annual Meeting of the Association for Computational Linguistics (ACL), arXiv, Feb. 28, 2022, 11 p… [cited by applicant]
European Patent Office, “Communication pursuant to Article 94(3) EPC,” issued in connection with European Application No. 22184405.3, dated Mar. 19, 2025, 4 pages. [cited by applicant]
United States Patent and Trademark Office, “Non-Final Office Action,” issued in connection with U.S. Appl. No. 18/176,273, dated Apr. 24, 2025, 7 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]
Visich, “Bar Codes and Their Applications,” Research Foundation of State University of New York, 1990, 59 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]
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]
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]
European Patent Office, “Communication pursuant to Rules 161(2) and 162 EPC,” issuedin connection with Application No. 20891012.5, dated Jun. 29, 2022, 3 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]
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]
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, “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, “Supplemental Notice of Allowability,” issued in connection with U.S. Appl. No. 17/710,538, dated May 8, 2024, 3 pages. [cited by applicant]
Canadian Intellectual Property Office, “Examiner requisition,” 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, “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]
International Searching Authority, “International Preliminary Report on Patentability,” issued in connection with International Application No. PCT/US2023/011859, mailed on Aug. 6, 2024, 5 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]
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, “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. 18/191,642, dated Aug. 28, 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 Sep. 11, 2024, 3 pages. [cited by applicant]
United States Patent and Trademark Office, “Second Notice of Allowability,” issued in connection with U.S. Appl. No. 18/191,642, dated Sep. 16, 2024, 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,649, dated Sep. 16, 2024, 12 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, “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, “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. 18/191,642, dated Oct. 11, 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, 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. 30, 2024, 2 pages. [cited by applicant]
United States Patent and Trademark Office, “Notice of Allowability,” issued in connection with U.S. Appl. No. 17/710,538, dated Nov. 20, 2024, 3 pages. [cited by applicant]
United States Patent and Trademark Office, “Second Corrected Notice of Allowability,” issued in connection with U.S. Appl. No. 18/191,642, dated Nov. 22, 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 Dec. 5, 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. 18/476,978, dated Dec. 13, 2024, 11 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/822,664, dated Dec. 31, 2024, 7 pages. [cited by applicant]
European Patent Office, “Communication pursuant to Article 94(3) EPC,” issued in connection with European Patent Application No. 22180113.7, Jan. 7, 2025, 6 pages. [cited by applicant]
European Patent Office, “Communication pursuant to Article 94(3) EPC,” issued in connection with European Patent Application No. 22214553.4, dated Jan. 7, 2025, 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. 18/148,947, dated Jan. 8, 2025, 12 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,649, dated Jan. 16, 2025, 9 pages. [cited by applicant]
United States Patent and Trademark Office, “Corrected Notice of Allowability,” issued in connection with U.S. Appl. No. 17/822,664, dated Jan. 16, 2025, 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 Jan. 16, 2025, 3 pages. [cited by applicant]
United States Patent and Trademark Office, “Notice of Allowance and Fee(s) Due,”with U.S. Appl. No. 17/872,801, dated Jan. 30, 2025, 13 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]
Smith et al., “Identification of Common Molecular Subsequences,” Reprinted Journal of Molecular Biology, Academic Press Inc. (London) Ltd., 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 Transactions on Information Systems, vol. 12, Jan. 1994, 34 pages. [cited by applicant]
Hochreiter et al., “Long Short-Term Memory,” Neural Computation, vol. 9, No. 8, Nov. 1997, 46 pages. [cited by applicant]
Ng et al., “On Spectral Clustering: Analysis and an Algorithm,” NIPS'01: Proceedings of the 14th International Conference on Neural Information Processing Systems: Natural and Synthetic, Jan. 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, accepted Sep. 13, 2022, 20 pages. [cited by applicant]
Lowe, “Distinctive Image Features from Scale-Invariant Key points,” International Journal of Computer Vision (HCV), published Jan. 22, 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, Jun. 2008, 10 pages. [cited by applicant]
O'Gorman et al., “Document Image Analysis,” IEEE Computer Society Executive Briefings, 2009, 125 pages. [cited by applicant]
Krizhevsky et al., “ImageNet Classification with Deep Convolutional Neural Networks,” 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,” NIPS 2014 Workshop on Deep Learning, Dec. 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), arXiv, dated May 18, 2015, 8 pages. [cited by applicant]
Lecun et al., “Deep Learning,” Nature, vol. 521, 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]
Ren et al., “Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networks,” In International Conference on Neural Information Processing Systems (NIPS), arXiv, Jan. 6, 2016, 14 pages. [cited by applicant]
Kim et al., “Character-Aware Neural Language Models,” Thirtieth AAAI Conference on Artificial Intelligence (AAAI'IO), pp. 2741-2749, arXiv, Dec. 1, 2015, 9 pages. [cited by applicant]
Redmon et al., “You Only Look Once: Unified, Real-Time Object Detection,” Conference on Computer Vision and Pattern Recognition (CVPR), arXiv, May 9, 2016, 10 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), arXiv, Mar. 9, 2016, 10 pages. [cited by applicant]
Joulin et al., “Bag of Tricks for Efficient Text Classification,” Proceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics, arXiv, Aug. 9, 2016, 5 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, 2016, 4 pages. [cited by applicant]
Kipf et al., “Semi-Supervised Classification with Graph Convolutional Networks,” 5th International Conference on Learning Representations, arXiv, Feb. 22, 2017, 14 Pages. [cited by applicant]
Bojanowski et al., “Enriching Word Vectors with Subword Information,” In Journal Transactions of the Association for Computational Linguistics, vol. 5, 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 at, “STN-OCT: A Single Neural Network for Text Detection and Text Recognition,” Computer Vision and Pattern Recognition, arXiv, Jul. 27, 2017, 9 pages. [cited by applicant]
Vaswani et al., “Attention Is All You Need,” Advances in Neural Information Processing Systems, 31st Conference on Neural Information Processing Systems (NIPS 2017), arXiv, last revised Dec. 6, 2017, 15 pages. [cited by applicant]
Hui, “mAP (mean Average Precision) for Object Detection,” URL:[https://medium.eom/@jonathan hui/map-mean-average-precision-for-object-detection-45cl21a311731], dated Mar. 6, 2018, 2 pages. [cited by applicant]
Veličković et al., “Graph Attention Networks,” 2018 International Conference on Learning Representations, arXiv, Feb. 4, 2018, 12 pages. [cited by applicant]
Mudgal et al., “Deep Learning for Entity Matching: A Design Space Exploration,” Proceedings of the 2018 International Conference on Management of Data, dated Jun. 10, 2018, 16 pages. [cited by applicant]
Wick et al., “Calamari—A High-Performance Tensorflow-Based Deep Learning Package for Optical Character Recognition,” Digital Humanities Quarterly, Jul. 5, 2018, 12 pages. [cited by applicant]
Akbik et al., “Contextual String Embeddings for Sequence Labeling,” Proceedings of the 27th International Conference on Computational Linguistics (COLING), dated Aug. 2018, 12 pages. [cited by applicant]
Follmann et al., “MVTec D2S: Densely Segmented Supermarket Dataset,” European Conference on Computer Vision (ECCV), dated 2018, 17 pages. [cited by applicant]
Ray et al., “U-PC: Unsupervised Planogram Compliance,” European Conference on Computer Vision (ECCV), 2018, 15 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]
Elfwing et al. “Sigmoid-Weighted Linear Units for Neural Network Function Approximation in Reinforcement Learning,” Neural Networks: Journal of the International Neural Network Society, vol. 107, arXiv, Nov. 2, 2017, 18… [cited by applicant]
Huang et al., “Mask R-CNN with Pyramid Attention Network for Scene Text Detection”, arXiv:1811.09058v1, Nov. 22, 2018, 9 pages. [cited by applicant]
Wikipedia, “Precision & Recall,” Dec. 17, 2018 revision, 12 pages. [cited by applicant]
A2ia, “Intelligent Automation Eliminates Manual Data Entry From Complex Documents,” Artificial Intelligence & Image Analysis, White Paper, accessed on Jan. 30, 2019, 3 pages. [cited by applicant]
A2ia, “Historic Document Conversion,” Industry Paper, Historic Document Conversion, Artificial Intelligence & Image Analysis, Industry Paper, accessed on Jan. 30, 2019, 4 pages. [cited by applicant]
Loshchilov et al., “Decoupled Weight Decay Regularization,” 2019 International Conference on Learning Representations, arXiv, Jan. 4, 2019, pages. [cited by applicant]
Nathancy, “How Do I Make Masks to Set All of Image Background, Except the Text, to White?”, URL:[https://stackoverflow.com/questions/56465359/how-do-i-make-masks-to-set-all-of-image-background-except-the-text-to-white],… [cited by applicant]
Devlin et al., “BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding,” Conference of the North American Chapter of the Association for Computational Linguistics (NAACL-HLT), arXiv, May 24, 20… [cited by applicant]
Qasim et al., “Rethinking Table Recognition using Graph Neural Networks,” International Conference on Document Analysis and Recognition (ICDAR), arXiv, Jul. 3, 2019, 6 pages. [cited by applicant]
Feng et al., “Computer Vision Algorithms and Hardware Implementations: A Survey,” Integration: the VLSI Journal, vol. 69, dated Jul. 27, 2019, 12 pages. [cited by applicant]
Hu et al., “Semi-Supervised Node Classification via Hierarchical Graph Convolutional Networks,” ArXiv abs/1902.06667, Jun. 10, 2019, 8 pages. [cited by applicant]
Oliveira et al., “dhSegment: A Generic Deep-Learning Approach for Document Segmentation,” 16th International Conference on Frontiers in Handwriting Recognition (ICFHR), arXiv, 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), arXiv, Aug. 16, 2019, 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/075,675, dated Jun. 26, 2023, 3 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]
Datasetlist, “A tool using OpenCV to annotate images for image classification, optical character reading, . . . ,” Datasetlist.com, 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/598,792, dated 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 Jan. 4, 2024, 7 pages. [cited by applicant]
United States Patent and Trademark Office, “Non-Final Office Action,” issued in connection with U.S. Appl. No. 18/191,642, dated Feb. 7, 2024, 18 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, “Non-Final Office Action,” issued in connection with U.S. Appl. No. 17/710,660, on May 28, 2024, 9 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, “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, “Notice of Allowance and Fee(s) Due,” issued in connection with U.S. Appl. No. 18/191,642, dated Jun. 17, 2024, 9 pages. [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]
Nielseniq, “Nielsen Brandbank Product Library, Power the Path To Purchase With Brand Approved Content” URL:[retrieved from: https://www.brandbank.com/us/product-library/], retrieved on Apr. 1, 2022. 5 pages. [cited by applicant]
Github, “Fiat Tool—Fast Image Data Annotation Tool,” Github.com, URL:[https://github.com/christopher5106/FastAimotation Tool], downloaded on Apr. 1, 2022, 30 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. 16/692,797, dated Apr. 5, 2022, 10 pages. [cited by applicant]
Github, “Doccano Tool,” Github.com, URL:[https://github.com/doccano/doccano], downloaded on Apr. 11, 2022, 12 pages. [cited by applicant]
United States Patent and Trademark Office, “Corrected Notice of Allowability,” issued in connection with U.S. Appl. No. 16/692,797, dated Apr. 22, 2022, 3 pages. [cited by applicant]
International Searching Authority, “International Preliminary Report on Patentability,” issued in connection with International Patent Application No. PCT/US2020/061269, issued on May 17, 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]
Villota et al., “Text Classification Models for Form Entity Linking,” International Symposium on Distributed Computing and Artificial Intelligence, arXiv, Dec. 14, 2021, 10 pages. [cited by applicant]
Oliveira et al., “A New Method for Text-Line Segmentation for Warped Documents,” International Conference on Image Analysis and Recognition (ICIAR), Jun. 2010, 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 Aug. 18, 2022, 8 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, issued Sep. 22, 2022, 12 Pages. [cited by applicant]
Huang et al., “LayoutLMv3: Pre-training for Document Al with Unified Text and Image Masking,” 30th ACM International Conference on Multimedia, arXiv, Jul. 19, 2022, 10 pages. [cited by applicant]
Zhang et al.,“Multimodal Pre-Training Based on Graph Attention Network for Document Understanding,” IEEE Transactions on Multimedia, vol. 25, arXiv, Oct. 23, 2022, 13 pages. [cited by applicant]
European Patent Office, “Extended European Search Report,” issued in connection with European Patent Application No. 19921870.2, dated Oct. 12, 2022, 11 pages. [cited by applicant]
International Searching Authority, “International Search Report,” issued in connection with International Patent Application No. PCT/US2022/034570, mailed on Oct. 20, 2022, 3 pages. [cited by applicant]
International Searching Authority, “Written Opinion,” issued in connection with International Patent Application No. PCT/US2022/034570, mailed on Oct. 20, 2022, 5 pages. [cited by applicant]
Kim et al., “Donut: Document Understanding Transformer Without OCR,” European Conference on Computer Vision, arXiv, Oct. 6, 2022, 29 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/364,419, dated Nov. 4, 2022, 10 pages. [cited by applicant]
Canadian Intellectual Property Office, “Examiner's Report,” issued in connection with Canadian Patent Application No. 3,124,868, dated 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]
Zhong et al., “Hierarchical Message-Passing Graph Neural Networks,” Data Mining and Knowledge Discovery, Nov. 17, 2022, 28 pages. [cited by applicant]
European Patent Office, “Extended European Search Report,” in connection with European Patent Application No. 22180113.7, dated Nov. 22, 2022, 7 pages. [cited by applicant]
Dwivedi et al., “Benchmarking Graph Neural Networks,” Journal of Machine Learning Research, arXiv, Dec. 28, 2022, 49 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, dated Dec. 2, 2022, 2 pages. [cited by applicant]
International Searching Authority, “International Preliminary Report on Patentability,” issued in connection with International Patent Application No. PCT/US2021/039931, issued on Dec. 13, 2022, 6 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]
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]
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 U.K. Patent 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 and 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, 14 pages. [cited by applicant]
European Patent Office, “Extended European Search Report,” issued in connection with European Patent 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]
International Searching Authority, “International Search Report,” issued in connection with International Patent Application No. PCT/US2023/011859, mailed on Jun. 1, 2023, 3 pages. [cited by applicant]
International Searching Authority, “Written Opinion,” issued in connection with International Patent Application No. PCT/US2023/011859, mailed on Jun. 1, 2023, 4 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 U.K. 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, dated Jul. 18, 2023, 3 pages. [cited by applicant]
Gopal et al., “What is Intelligent Document Processing?” Nano Net Technologies, URL:[https://nanonets.com/blog/intelligent-document-processing/], Jul. 19, 2023, 21 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]
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 U.K. Patent Application No. 2112299.9, dated Aug. 29, 2023, 2 pages. [cited by applicant]
Amazon, “Intelligent Document Processing,” Amazon Web Services, URL:[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, “Corrected Notice of Allowability,” issued in connection with U.S. Appl. No. 17/075,675, dated 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]
United States Patent and Trademark Office, “Non-Final Office Action”, issued in connection with U.S. Appl. No. 17/941,547, filed Aug. 27, 2025, 7 pages. [cited by applicant]