IP Library Granted Patent US 12,229,741
Granted Patent B2
US 12,229,741 · App. 17/710,660 · Granted Feb 18, 2025

Methods, systems, articles of manufacture, and apparatus for decoding purchase data using an image

Inventors: Jose Javier Yebes Torres (Valladolid, ES); Aditi Sinha (Weehawken, NY); Christine Lebrun (Paris, FR); Fabio Oppini (Milan, IT); Atul Bansal (New York, NY); Mukul Kumar (New York, NY); Vignesh Chandramouli (New York, NY); Filipa Sousa (New York, NY); Gisella Mercaldi (Oxford, GB)
Assignee: Nielsen Consumer LLC
G06Q20/201G06K7/1413G06V30/414G06V30/42
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,229,741
App. No.
17/710,660
Granted
Feb 18, 2025
Kind
B2
Abstract

Methods, apparatus, systems, and articles of manufacture are disclosed that decode purchase data using an image. An example apparatus includes a dictionary including associated product descriptions and barcodes, interface circuitry, and processing circuitry to execute machine readable instructions to obtain purchase details and barcodes corresponding to a receipt, the purchase details including receipt product descriptions, generate a search query that includes a first receipt product description of the receipt product descriptions, a list of barcodes corresponding to the barcodes, and a store identifier associated with the receipt, execute a search against the dictionary using the search query to identify a barcode from the list of barcodes that corresponds to the first receipt product description, and in response to identifying the barcode that corresponds to the first receipt product description, associating the barcode and the first receipt product description and adding the association to the dictionary.

Claims (71)

1. An apparatus comprising:

a first dictionary including images of product descriptions and barcodes;

interface circuitry;

machine readable instructions; and

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

train a region detection machine learning model based on (a) the images of the product descriptions and barcodes, (b) ground truth annotations, and (c) intersection over union (IoU) comparisons of bounding boxes associated with the images;

based on satisfying a threshold IoU value of the region detection machine learning model, obtain purchase details and barcodes corresponding to a receipt, the purchase details including a first product description;

generate a first search query that includes the first product description, a list of barcodes corresponding to the barcodes, and a store identifier associated with the receipt;

execute a first search against the first dictionary using the first search query to identify a first barcode from the list of barcodes that corresponds to the first product description;

generate a second search query when the first search does not identify the first barcode, the second search query to include the first product description, the list of barcodes, and the store identifier;

execute a second search against a second dictionary based on the second search query to identify the first barcode;

associate the first barcode and the first product description; and

add the association to the first dictionary.

2. The apparatus of claim 1 , wherein the list of barcodes is a list of unique barcodes, one or more of the at least one processor circuit is to remove duplicate ones of the barcodes to generate the unique list of barcodes.

3. The apparatus of claim 1 , wherein one or more of the at least one processor circuit is to execute the first search against the first dictionary using the first search query by:

identifying first candidate barcodes in the first dictionary that correspond to the list of barcodes in the first search query;

identifying second candidate barcodes from the first candidate barcodes that correspond to the store identifier; and

identifying a first one of the second candidate barcodes, the first one of the second candidates barcodes to that include the first product description.

4. The apparatus of claim 1 , wherein the second dictionary is a products datastore that includes a plurality of products and corresponding attributes, ones of the attributes to include, at least, a respective second barcode and a respective second product description.

5. The apparatus of claim 1 , wherein one or more of the at least one processor circuit is to execute the second search against the second dictionary using the second search query includes by:

identifying second barcodes in the second dictionary that correspond to the list of barcodes in the second search query;

comparing second product descriptions associated with the second barcodes identified in the second dictionary to the first product description in the second search query;

generating a similarity value for ones of the second product descriptions associated with the second barcodes identified in the second dictionary based on the comparison; and

selecting a candidate barcode from the list of barcodes based on the similarity value for the ones of the second product descriptions associated with the second barcodes identified in the second dictionary, the similarity value of the candidate barcode to reach a threshold value.

6. The apparatus of claim 5 , wherein the execution of the second search reveals a plurality of the second barcodes as having a respective second product description that receives a similarity score that reaches the threshold value, one or more of the at least one processor circuit is to select one of the plurality of the second barcodes that includes a similarity value with a largest value.

7. The apparatus of claim 5 , wherein one or more of the at least one processor circuit is to:

identify a match between the first product description and the candidate barcode;

generate an association between the first product description and the candidate barcode; and

add the association to the second dictionary.

8. The apparatus of claim 5 , wherein the execution of the second search does not identify a candidate barcode in the second dictionary that includes a respective second product description that receives a similarity score above the threshold value, one or more of the at least one processor circuit is to:

adjust the second search query to remove the store identifier; and

execute a third search against the second dictionary using the adjusted second search query to identify the candidate barcode from the list of barcodes that corresponds to the first product description.

9. The apparatus of claim 8 , wherein, after executing searches against the first dictionary and the second dictionary for the receipt product descriptions and the receipt barcodes corresponding to the receipt, one or more of the at least one processor circuit is to add unassociated receipt product descriptions and unassociated receipt barcodes to a list of unassociated products.

10. The apparatus of claim 9 , further including a third dictionary, wherein one or more of the at least one processor circuit is to:

generate a fourth search query that includes the unassociated receipt product descriptions from the list of unassociated products, the unassociated receipt barcodes from the list of unassociated products, and the store identifier corresponding to the receipt; and

execute a fourth search against the third dictionary using the fourth search query.

11. The apparatus of claim 10 , wherein the third dictionary is a database that includes records of previous searches corresponding to a plurality of processed receipts that did not yield associations between at least one product description and at least one barcode, ones of the records including at least unassociated product description and at least one unassociated barcode that were not matched.

12. The apparatus of claim 11 , wherein one or more of the at least one processor circuit is to execute the fourth search against the third dictionary using the fourth search query by:

comparing the unassociated receipt product descriptions and the unassociated receipt barcodes of the fourth search query to the processed receipts;

identifying a first processed receipt that includes one of the unassociated receipt product descriptions and one of the unassociated receipt barcodes;

in response to identifying the first processed receipt, identifying a match between the one of the unassociated receipt product descriptions and the one of the unassociated receipt barcodes; and

in response to not identifying the first processed receipt, adding the one of the unassociated receipt product descriptions and the one of the unassociated receipt barcodes corresponding to the receipt to as a record to a previous jobs database.

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

train a region detection machine learning model based on (a) images of product descriptions and barcodes in a first dictionary, (b) ground truth annotations, and (c) intersection over union (IoU) comparisons of bounding boxes associated with the images;

based on satisfying a threshold IoU value of the region detection machine learning model, obtain purchase details and barcodes corresponding to a receipt, the purchase details including a first product description;

generate a first search query that includes the first product description, a list of barcodes corresponding to the barcodes, and a store identifier associated with the receipt;

execute a first search against the first dictionary using the first search query to identify a first barcode from the list of barcodes that corresponds to the first product description;

generate a second search query when the first search does not identify the first barcode, the second search query to include the first product description, the list of barcodes, and the store identifier;

execute a second search against a second dictionary based on the second search query to identify the first barcode;

associate the first barcode and the product description; and

add the association to the first dictionary.

14. The at least one non-transitory computer readable storage medium as defined in claim 13 , wherein the list of barcodes is a list of unique barcodes, the instructions are to cause the processor circuit to remove duplicate ones of the barcodes to generate the unique list of barcodes.

15. The at least one non-transitory computer readable storage medium as defined in claim 13 , wherein the instructions are to cause one or more of the at least one processor circuit to execute the search against the first dictionary using the first search query by:

identifying first candidate barcodes in the first dictionary that correspond to the list of barcodes in the first search query;

identifying second candidate barcodes from the first candidate barcodes that correspond to the store identifier; and

identifying a first one of the second candidate barcodes that includes the first product description.

16. The at least one non-transitory computer readable storage medium as defined in claim 13 , wherein the second dictionary is a products datastore that includes a plurality of products and corresponding attributes, ones of the attributes to include, at least, a respective second barcode and a respective second product description.

17. The at least one non-transitory computer readable storage medium as defined in claim 13 , wherein the instructions are to cause one or more of the at least one processor circuit to execute the second search against the second dictionary using the second search query by:

identifying second barcodes in the second dictionary that correspond to the list of barcodes in the second search query;

comparing second product descriptions associated with the second barcodes identified in the second dictionary to the first product description in the second search query;

generating a similarity value for ones of the second product descriptions associated with the second barcodes identified in the second dictionary based on the comparison; and

selecting a candidate barcode from the second barcodes based on the similarity value for the ones of the second product descriptions associated with the second barcodes identified in the second dictionary, the similarity value of the candidate barcode to reach a threshold value.

18. A method comprising:

training, by executing machine readable instructions with at least one processor circuit, a region detection machine learning model based on (a) images of product descriptions and barcodes, (b) ground truth annotations, and (c) intersection over union (IoU) comparisons of bounding boxes associated with the images;

based on satisfying a threshold IoU value of the region detection machine learning model, obtaining, by executing machine learning instructions with the at least one processor circuit, purchase details and barcodes corresponding to a receipt, the purchase details including a first product description;

generating, by executing machine readable instructions with the least one processor circuit, a first search query that includes the first product description, a list of barcodes corresponding to the barcodes, and a store identifier associated with the receipt;

executing, by executing machine readable instructions with the at least one processor circuit, a first search against the first dictionary using the first search query to identify a barcode from the list of barcodes that corresponds to the first product description;

generating, by executing machine readable instructions with the at least one processor circuit, a second search query when the first search does not identify the barcode, the second search query to include the first product description, the list of barcodes, and the store identifier;

executing, by executing machine readable instructions with the at least one processor circuit, a second search against a second dictionary based on the second search query to identify the barcode;

associating, by executing machine readable instructions with the at least one processor circuit, the barcode and the product description; and

adding the association to the first dictionary.

Assignments (7)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 12, 2024
From: THE NIELSEN COMPANY (US), LLC
To: NIELSEN CONSUMER LLC
Reel/Frame 069619/0304 →
EMPLOYMENT AGREEMENT Recorded Dec 12, 2024
From: BANSAL, ATUL
To: THE NIELSEN COMPANY (US), LLC
Reel/Frame 069618/0567 →
CHANGE OF NAME Recorded Dec 2, 2024
From: NEUROFOCUS SYSTEMS & SERVICES PRIVATE LIMITED
To: NIELSEN MEDIA INDIA PRIVATE LIMITED
Reel/Frame 069455/0009 →
EMPLOYMENT AGREEMENT Recorded Dec 2, 2024
From: BANSAL, ATUL
To: NEUROFOCUS SYSTEMS AND SERVICES PRIVATE LIMITED
Reel/Frame 069471/0463 →
CORRECTIVE ASSIGNMENT TO CORRECT THE MISSPELLED INVENTOR ADITI SINHA'S LAST NAME PREVIOUSLY RECORDED AT REEL: 60600 FRAME: 564. ASSIGNOR(S) HEREBY CONFIRMS THE ASSIGNMENT. Recorded Aug 29, 2024
From: SINHA, ADITI
To: NIELSEN CONSUMER LLC
Reel/Frame 068807/0151 →
INTELLECTUAL PROPERTY SECURITY AGREEMENT Recorded Dec 16, 2022
From: NIELSEN CONSUMER LLC
To: BANK OF AMERICA, N.A., AS ADMINISTRATIVE AGENT
Reel/Frame 062142/0346 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 23, 2022
From: TORRES, JOSE JAVIER YEBES; SHINA, ADITI; LEBRUN, CHRISTINE; OPPINI, FABIO; KUMAR, MUKUL; CHANDRAMOULI, VIGNESH; SOUSA, FILIPA; MERCALDI, GISELLA
To: NIELSEN CONSUMER LLC
Reel/Frame 060600/0564 →
Continuity (2)
Provisional Application 63214571 · Jun 24, 2021
Related Publication 20220414630A1 · Dec 29, 2022
References Cited (355)
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 et al. · 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 et al. · 2016 [cited by applicant]
US 9262686B1 · Singer · 2016 [cited by examiner]
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 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 · 2018 [cited by examiner]
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 examiner]
US 11032072B2 · Andon · 2021 [cited by applicant]
US 11257049B1 · Durazo Almeida · 2022 [cited by examiner]
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 examiner]
US 11476981B2 · Wei et al. · 2022 [cited by applicant]
US 11562557B2 · Miginnis et al. · 2023 [cited by applicant]
US 11587148B2 · Elder · 2023 [cited by examiner]
US 11593552B2 · Sarkar · 2023 [cited by applicant]
US 11609956B2 · Jain · 2023 [cited by applicant]
US 11625930B2 · Rodriguez et al. · 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 20070041642A1 · Romanoff et al. · 2007 [cited by applicant]
US 20080205759A1 · Zandifar et al. · 2008 [cited by applicant]
US 20090164422A1 · Pacella · 2009 [cited by examiner]
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 examiner]
US 20140195891A1 · Venkata Radha Krishna Rao et al. · 2014 [cited by applicant]
US 20150039479A1 · Gotanda · 2015 [cited by examiner]
US 20150127428A1 · Gharachorloo · 2015 [cited by examiner]
US 20150169951A1 · Khintsitskiy et al. · 2015 [cited by applicant]
US 20150254778A1 · Kmak et al. · 2015 [cited by applicant]
US 20150317642A1 · Argue · 2015 [cited by examiner]
US 20150363792A1 · Arini · 2015 [cited by examiner]
US 20150363822A1 · Rowe · 2015 [cited by examiner]
US 20160005189A1 · Gray · 2016 [cited by applicant]
US 20160034863A1 · Ross · 2016 [cited by applicant]
US 20160063469A1 · Etzion · 2016 [cited by examiner]
US 20160125383A1 · Chan et al. · 2016 [cited by applicant]
US 20160171585A1 · Singh · 2016 [cited by examiner]
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 20170293819A1 · Deng · 2017 [cited by applicant]
US 20180005345A1 · Apodaca et al. · 2018 [cited by applicant]
US 20180053045A1 · Lorenzini · 2018 [cited by examiner]
US 20180060302A1 · Liang et al. · 2018 [cited by applicant]
US 20180317116A1 · Komissarov et al. · 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 20190171900A1 · Thrasher et al. · 2019 [cited by applicant]
US 20190244020A1 · Yoshino et al. · 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 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 20200249803A1 · Sobel · 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 · 2020 [cited by examiner]
US 20210004880A1 · Benkreira et al. · 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 examiner]
US 20210248420A1 · Zhong et al. · 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 examiner]
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 examiner]
US 20220114821A1 · Arroyo et al. · 2022 [cited by applicant]
US 20220189190A1 · Arroyo et al. · 2022 [cited by applicant]
US 20220198185A1 · Prebble · 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 · 2023 [cited by examiner]
US 20230008198A1 · Gadde et al. · 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 20230394859A1 · Montero et al. · 2023 [cited by applicant]
CA 2957433A1 · 2017 [cited by applicant]
CN 103123685 · 2013 [cited by applicant]
CN 104866849 · 2015 [cited by applicant]
CN 108229397 · 2018 [cited by applicant]
CN 108829397A · 2018 [cited by applicant]
CN 109389124 · 2019 [cited by applicant]
CN 112446351 · 2021 [cited by applicant]
CN 112560862 · 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 200821850 · 2008 [cited by applicant]
JP 2008210850A · 2008 [cited by applicant]
JP 2008211850A · 2008 [cited by applicant]
JP 2013041145A · 2013 [cited by applicant]
JP 2019139737 · 2019 [cited by applicant]
JP 7049529B2 · 2022 [cited by applicant]
KR 101831204 · 2018 [cited by applicant]
TW 200821850A · 2008 [cited by applicant]
WO 2013041145A1 · 2013 [cited by applicant]
WO WO2013044145 · 2013 [cited by applicant]
WO 2018054326A1 · 2018 [cited by applicant]
WO 2018201423A1 · 2018 [cited by applicant]
WO 2020194004A1 · 2020 [cited by applicant]
WO WO2022123199 · 2022 [cited by applicant]
Leicester, Andrew, and Zoe Oldfield. “Using scanner technology to collect expenditure data.” Fiscal Studies 30.3-4 (2009): 309-337. (Year: 2009). [cited by examiner]
Google, “Detect Text in Images,” Mar. 29, 2021, 20 pages. Retrieved from http://cloud.google.com/vision/docs/ocr. [cited by applicant]
Qasim et al., “Rethinking Table Recognition using Graph Neural Networks,” In International Conference on Document Analysis and Recognition (ICDAR), Jul. 3, 2019, 6 pages. [cited by applicant]
Nshuti, “Mobile Scanner and OCR (A First Step Towards Receipt to Spreadsheet),” 2015, 3 pages. [cited by applicant]
O'Gorman et al., “Document Image Analysis,” IEEE Computer Society Executive Briefings, 2009, 125 pages. [cited by applicant]
International Searching Authority, “Search Report and Written Opinion,” issued in connection with Application No. PCT/US2021/039931, dated Nov. 4, 2021, 7 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: adaptive methods, resources and software at IJCAI 20… [cited by applicant]
Govindan et al., “Character Recognition—A Review,” Pattern Recognition, vol. 23, No. 7, pp. 671-683, 1990, 13 pages. [cited by applicant]
Lecun et al., “Deep Learning,” Nature, vol. 521, pp. 436-444, May 28, 2015, 9 pages. [cited by applicant]
Kim et al., “Character-Aware Neural Language Models,” Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (AAAI'16), pp. 2741-2749, 2016, 9 pages. [cited by applicant]
Wikipedia, “Precision and Recall,” Dec. 17, 2018 revision, 8 pages. [cited by applicant]
Hui, “mAP (mean Average Precision) for Object Detection,” Mar. 6, 2018, 2 pages. Retrieved from [https://medium.com/@jonathan_hui/map-mean-average-precision-for-object-detection-45c121a31173] on May 11, 2020, 2 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]
Vogel et al., “Parallel Implementations of Word Alignment Tool,” Software Engineering, Testing, and Quality Assurance for Natural Language Processing, pp. 49-57, Jun. 2008, 10 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, issued Mar. 16, 2021, 12 pages. [cited by applicant]
United States Patent and Trademark Office, “Final Office Action,” issued in connection with U.S. Appl. No. 16/692,797, issued Oct. 27, 2021, 14 pages. [cited by applicant]
International Searching Authority, “International Search Report,” mailed in connection with International Patent Application No. PCT/IB2019/000299, on Dec. 23, 2019, 3 pages. [cited by applicant]
International Searching Authority, “Written Opinion,” mailed in connection with International Patent Application No. PCT/IB2019/000299, on Dec. 23, 2019, 4 pages. [cited by applicant]
Bartz et al., “STN-OCT: A Single Neural Network for Text Detection and Text Recognition,” Computer Vision and Pattern Recognition, Jul. 27, 2017, 9 pages. [cited by applicant]
Ozhiganov, “Deep Dive Into OCR for Receipt Recognition,” DZone, Jun. 21, 2017, 18 pages. [cited by applicant]
Akbik et al., “Contextual String Embeddings for Sequence Labeling,” In Proceedings of the 27th International Conference on Computational Linguistics (COLING), 2018, 12 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, 12 p. [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), Jun. 24, 2019,… [cited by applicant]
Deepdive, “Distant Supervision” 2021, 2 pages. [available online on Stanford University website, http://deepdive.stanford.edu/distant_supervision]. [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, Aug. 9, 2016, 5 pages. [cited by applicant]
Krizhevsky et al., “ImageNet Classification with Deep Convolutional Neural Networks,” In International Conference on Neural Information Processing Systems (NIPS), 2012, 9 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, 2016, 4 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]
Mudgal et al., “Deep Learning for Entity Matching: A Design Space Exploration,” In Proceedings of the 2018 International Conference on Management of Data, 2018, Houston, TX, 16 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), May 9, 2016, 10 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, Jan. 6, 2016, 14 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, 1981, 4 pages. [cited by applicant]
Github, “Tesseract OCR” Tesseract Repository on GitHub, 2020, 4 pages. [available online, https://github.com/tesseract-ocr/]. [cited by applicant]
Vaswani et al., “Attention Is All You Need,” 31st Conference on Neural Information Processing Systems (NIPS 2017), Long Beach, CA, 2017, 11 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, 4 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), Aug. 14, 2019, 6 pages. [cited by applicant]
Ronneberger et al., “U-Net: Convolutional Networks for Biomedical Image Segmentation,” Medical Image Computing and Computer-Assisted Intervention (MICCAI), May 18, 2015, 8 pages. [cited by applicant]
Lowe, “Distinctive Image Features from Scale-Invariant Keypoints,” International Journal of Computer Vision (IJCV), Jan. 5, 2004, 28 pages. [cited by applicant]
Marinai, “Introduction to Document Analysis and Recognition,” Machine Learning in Document Analysis and Recognition, 2008, 22 pages. [cited by applicant]
Zhong et al., “PubLayNet: largest dataset ever for document layout analysis,” In International Conference on Document Analysis and Recognition (ICDAR), Aug. 16, 2019, 8 pages. [cited by applicant]
Follmann et al., “MVTec D2S: Densely Segmented Supermarket Dataset,” in European Conference on Computer Vision (ECCV), 2018, 17 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), Mar. 9, 2016, 10 pages. [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-library/]. [cited by applicant]
Ray et al., “U-PC: Unsupervised Planogram Compliance,” in European Conference on Computer Vision (ECCV), 2018, 15 pages. [retrieved from: http://openaccess.thecvf.com/content_ECCV_2018/papers/Archan_Ray_U- PC Unsupervis… [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]
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]
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]
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]
Wick et al., “Calamari—A High-Performance Tensorflow-based Deep Learning Package for Optical Character Recognition,” Digital Humanities Quarterly, 2020, 12 pages. [retrieved from: https://arxiv.org/ftp/arxiv/papers/1807… [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), Jul. 18, 2020, 8 pages. [retrieved… [cited by applicant]
Zacharias et al., “Image Processing Based Scene-Text Detection and Recognition with Tesseract,” arXiv (CoRR), Apr. 17, 2020, 6 pages. [retrieved from: https://arxiv.org/pdf/2004.08079.pdf]. [cited by applicant]
International Searching Authority, “International Preliminary Report on Patentability” mailed in connection with International Patent Application No. PCT/IB2019/000299, on Sep. 28, 2021, 5 pages. [cited by applicant]
Github, “Doccano tool,” Github.com, downloaded on Apr. 1, 2022, 12 pages. [retrieved from: https://github.com/doccano/doccano]. [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/FastAnnotationTool]. [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]
Xu et al., “LayoutLM: Pre-training of Text and Layout for Document Image Understanding,” in International Conference on Knowledge Discovery & Data Mining (SIGKDD), Jun. 16, 2020, 9 pages. [retrieved from: https://arxiv.… [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, issued Apr. 5, 2022, 10 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, issued Apr. 22, 2022, 3 pages. [cited by applicant]
International Searching Authority, “International Preliminary Report on Patentability,” mailed in connection with International Patent Application No. PCT/US2020/061269, on May 17, 2022, 5 pages. [cited by applicant]
European Patent Office, “Communication pursuant to Rules 161(2) and 162 EPC,” issued in connection with Application No. 20891012.5, dated Jun. 29, 2022, 3 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, issued 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]
International Searching Authority, “International Search Report and Written Opinion,” mailed in connection with International Patent Application No. PCT/US2022/034570, on Oct. 20, 2022, 8 pages. [cited by applicant]
European Patent Office, “Extended Search Report,” issued in connection with Application No. 19921870.2, dated Oct. 12, 2022, 11 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 and 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]
European Patent Office, “Extended Search Report,” issued in connection with Application No. 22180113.7, dated Nov. 22, 2022, 7 pages. [cited by applicant]
Chen et al., “TextPolar: irregular scene text detection using polar representation” International Journal on Document Analysis and Recognition (IJDAR), 2021, published May 23, 2021, 9 pages. [cited by applicant]
United States and 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, “Communication pursuant to Rules 161(2) and 162 EPC,” issued in connection with Application No. 19921870.2, dated Nov. 5, 2021, 3 pages. [cited by applicant]
Canadian Patent Office, “Office Action,” issued in connection with Application No. 3,124,868, dated Nov. 10, 2022, 4 pages. [cited by applicant]
Huang et al., “Mask R-CNN with Pyramid Attention Network for Scene Text Detection”, arXiv:1811.09058v1, pp. 1-9, https://arxiv.org/abs/1811.09058, Nov. 22, 2018, 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, https://www.sciencedirect.com/science/article/pii/S0167926019301762, accepted Jul. 2… [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]
Li et al., “Extracting Figures and Captions from Scientific Publications,” Short Paper, CIKM'18, Oct. 22-26, 2018, Torino, Italy, 4 pages. [cited by applicant]
European Patent Office, “Extended Search Report,” issued in connection with Application No. 22184405.3, dated Dec. 2, 2022, 7 pages. [cited by applicant]
United States and 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]
International Searching Authority, “International Preliminary Report on Patentability,” issued in connection with Application No. PCT/US2021/039931, issued Dec. 13, 2022, 5 pages. [cited by applicant]
European Patent Office, “European Search Report,” issued in connection with Patent Application No. 22184405.3, completed Nov. 23, 2022, 2 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,” Communicated by Ronald Williams, Neural Computation, vol. 8, Issue 9, 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, 202 Pond Laboratory, University Park, PA… [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]
Chung et al., “Empirical Evaluation of Gated Recurrent Neural Networks on Sequence Modeling,” ArXiv abs/1412.3555, dated 2014, 9 pages. [cited by applicant]
Kipf et al., “Semi-Supervised Classification with Graph Convolutional Networks,” 5th International Conference on Learning Representations, 2017, 14 Pages. [cited by applicant]
Velickcvic et al., “Graph Attention Networks,” 2018 International Conference on Learning Representations, Feb. 4, 2018, 12 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, 2017, 18 pages. [cited by applicant]
Loshchilov et al., “Decoupled Weight Decay Regularization,” 2019 International Conference on Learning Representations, 2019, 19 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., “Hierarchical Graph Convolutional Networks for Semi-supervised Node Classification,” International Joint Conference on Artificial Intelligence, 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), 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, 2019, 18 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), 6 pages. [cited by applicant]
Liu et al., “RoBERTa: A Robustly Optimized BERT Pretraining Approach,” International Conference on Learning Representations, 2019, 13 pages. [cited by applicant]
Dong et al., “HNHN: Hypergraph Networks with Hyperedge Neurons,” ArXiv abs/2006.12278, 2020, 11 pages. [cited by applicant]
Chen et al., “HGMF: Heterogeneous Graph-Based Fusion for Multimodal Data with Incompleteness,” Research Track Paper, Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, KDD … [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-20, 2020, 11 pag… [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), downloaded on May 18, 2021, 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): 669-678, 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]
Nguyen et al., “End-to-End Hierarchical Relation Extraction for Generic Form Understanding”, In International Conference on Pattern Recognition (ICPR), 2021, 8 pages. [cited by applicant]
Ma et al., “Graph Attention Networks with Positional Embeddings,” Pacific-Asia Conference on Knowledge Discovery and Data Mining, 2021, 13 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, 10 pages. [cited by applicant]
Li et al., “StructuralLM: Structural Pre-training for Form Understanding,” 59th Annual Meeting of the Association for Computational Linguistics, 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, 2022, 13 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), 2021, 9 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]
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]
Davis et al., “Visual FUDGE: Form Understanding via Dynamic Graph Editing,” International Conference on Document Analysis and Recognition (ICDAR), 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, 2021, 17 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), 2021, 16 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), 2021, 9 pages. [cited by applicant]
Zhang et al., “Entity Relation Extraction as Dependency Parsing in Visually Rich Documents,” Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing (EMNLP), Nov. 7-11, 2021, 10 pages. [cited by applicant]
Li et al., “StrucTexT: Structured Text Understanding with Multi-Modal Transformers”, in ACM International Conference on Multimedia (ACM Multimedia), Oct. 20-24, 2021, Virtual Event, China, arXiv, 2021, 9 pages. [cited by applicant]
Gu et al., “UniDoc: Unified Pretraining Framework for Document Understanding,” 35th Conference on Neural Information Processing Systems (NeurIPS 2021), Dec. 6, 2021, 12 pages. [cited by applicant]
Park et al., “CORD: A Consolidated Receipt Dataset for Post-OCR Parsing,” 33rd Conference on Neural Information Processing Systems (NeurIPS 2019), Vancouver, Canada, 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), 2022, 11 pages. [cited by applicant]
International Searching Authority, “International Preliminary Report on Patentability”, issued in connection with International Patent Application No. PCT/US2020/061269, dated Jun. 2, 2022, 6 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]
International Searching Authority, “International Search Report,” issued in connection with International Patent Application No. PCT/US2022/034570, dated Oct. 20, 2022, 3 pages. [cited by applicant]
International Searching Authority, “Written Opinion,” issued in connection with International Patent Application No. PCT/US2022/034570, dated Oct. 20, 2022, 5 pages. [cited by applicant]
Villota et al., “Text Classification Models for Form Entity Linking,” International Symposium on Distributed Computing and Artificial Intelligence, 2021, 10 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]
Huang et al., “LayoutLMv3: Pre-training for Document AI with Unified Text and Image Masking,” 30th ACM International Conference on Multimedia, Oct. 10-14, 2022, Lisboa, Portugal, 10 pages. [cited by applicant]
European Patent Office, “Extended European Search Report,” issued in connection with European Patent Application No. 19921870.2, completed Oct. 3, 2022, 2 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]
Zhang et al.,“Multimodal Pre-training Based on Graph Attention Network for Document Understanding,” IEEE Transactions on Multimedia, vol. 25, Oct. 22, 2022, 13 pages. [cited by applicant]
Kim et al., “OCR-free Document Understanding Transformer”, arXiv, dated 2022, 29 pages. [cited by applicant]
Mexican Institute of Industrial Property, “Office Action,” issued in connection with Mexican Patent Application No. MX/a/2022/008170, dated Oct. 27, 2022, 36 pages. [English Machine Translation Included]. [cited by applicant]
European Patent Office, “Extended Search Report,” in connection with European Patent Application No. 22180113.7, completed Nov. 14, 2022, 2 pages. [cited by applicant]
Zhong et al., “Hierarchical Message-Passing Graph Neural Networks,” Data Mining and Knowledge Discovery, Nov. 17, 2022, 29 pages. [cited by applicant]
Dwivedi et al., “Benchmarking Graph Neural Networks,” Journal of Machine Learning Research, Dec. 2022, 49 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]
International Searching Authority, “International Preliminary on Patentability,” issued in connection with PCT Application No. PCT/US2021/039931, dated Dec. 13, 2022, 5 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, issued 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, daed 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 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, 9 pages. [cited by applicant]
European Patent Office, “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 PCT Application No. PCT/US2023/011859, mailed on Jun. 1, 2023, 3 pages. [cited by applicant]
International Searching Authority, “Written Opinion,” issued in connection with PCT 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 U.S. Appl. No. 17/075,675, dated on Jun. 26, 2023, 8 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/345,940, dated Jul. 7, 2023, 8 pages. [cited by applicant]
Intellectual Property Office of United Kingdom, “Intention to Grant under Section 18(4),” issued in connection with British Patent Application GB2112299.9, mailed on 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]
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/191,642, dated Feb. 7, 2024, 18 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]
Intellectual Property of United Kingdom, “Notification of Grant ,” issued in connection with United Kingdom Patent Application No. 2112299.9, mailed on 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, “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]
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]
International Searching Authority, “International Preliminary Report on Patentability,” issued in connection with PCT No. PCT/US2022/034570, issued on Dec. 14, 2023, 7 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 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]
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, “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, “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, “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/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, “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]