IP Library Granted Patent US 12,327,425
Granted Patent B2
US 12,327,425 · App. 17/710,649 · Granted Jun 10, 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
G06V30/416G06Q30/0283G06V30/147G06V30/15G06V30/413G06V30/414
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,327,425
App. No.
17/710,649
Granted
Jun 10, 2025
Kind
B2
Abstract

Methods, apparatus, systems, and articles of manufacture are disclosed that decode purchase data using an image. An example apparatus includes processor circuitry to execute machine readable instructions to at least crop an image of a receipt based on detected regions of interest, apply a first mask to a first cropped image to generate first bounding boxes corresponding to rows of the receipt, apply a second mask to a second cropped image to generate second bounding boxes corresponding to columns of the receipt, generate a structure of the receipt by mapping words detected by an optical character recognition engine to corresponding first bounding boxes and second bounding boxes based on a mapping criterion, classify the second bounding boxes by identifying an expression of interest in ones of the second bounding boxes, and generate purchase information by extracting text of interest from the structured receipt based on the classifications.

Claims (55)

1. An apparatus comprising:

interface circuitry to obtain an image of a receipt;

machine-readable instructions; and

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

cause generation of a first cropped image and a second cropped image based on the image of the receipt, the first and second cropped images based on regions of the receipt detected in the image;

apply a first mask to the first cropped image to generate first bounding boxes, the first bounding boxes corresponding to rows of the receipt;

apply a second mask to the second cropped image to generate second bounding boxes, the second bounding boxes corresponding to columns of the receipt;

generate a structure of the receipt by mapping (a) words detected by an optical character recognition (OCR) engine to corresponding first bounding boxes based on a mapping criterion, and (b) ones of the words to respective ones of the second bounding boxes based on the mapping criterion;

cause classification of the columns based on the ones of the words mapped to the respective ones of the second bounding boxes;

extract purchase information from the structured receipt based on the classifications, the purchase information corresponding to products listed in the receipt, the products including a first product; and

generate promotion information based on the first product being associated with a promotion by:

identifying a first price associated with the first product, the first price corresponding to a first column, the first column classified as a price column;

identifying a second price associated with the first product, the second price corresponding to the promotion; and

determining a third price associated with the first product based on the first price and the second price.

2. The apparatus of claim 1 , wherein the regions include (1) a receipt region, and (2) a purchase region, the purchase region corresponding to an area of the receipt that includes information about the products listed in the receipt.

3. The apparatus of claim 2 , wherein the first cropped image is based on the receipt region and the second cropped image is based on the purchase region.

4. The apparatus of claim 1 , wherein the first mask causes identification of first pixels of the first cropped image classified as belonging to a first class and second pixels of the first cropped image classified as belonging to a second class.

5. The apparatus of claim 4 , wherein the first class is corresponds to a text line and the second class is corresponds to a background.

6. The apparatus of claim 1 , wherein the second mask identifies of first pixels of the second cropped image classified as belonging to a first class and second pixels of the second cropped image classified as belonging to a second class.

7. The apparatus of claim 6 , wherein the first class is corresponds to a column and the second class corresponds to another class.

8. The apparatus of claim 1 , wherein one or more of the at least one processor circuit is to merge a first one of the first bounding boxes and a second one of the first bounding boxes based on a row connection criterion, the first one and the second one of the first bounding boxes to satisfy a length criterion.

9. The apparatus of claim 1 , wherein one or more of the at least one processor circuit is to merge a first one of the second bounding boxes and a second one of the second bound boxes based on a column connection criterion.

10. The apparatus of claim 1 , wherein one or more of the at least one processor circuit is to identify first words of the ones of the words assigned to the respective ones of the second bounding boxes that include a regular expression, the regular expression to correspond to a targeted fact.

11. The apparatus of claim 10 , wherein the targeted fact includes at least one of a product description, a quantity, or a price.

12. The apparatus of claim 1 , wherein the purchase information includes purchase details and promotion information, and wherein one or more of the at least one processor circuit is to;

identify first ones of the words assigned to the first bounding boxes that do not correspond to a respective classification of a respective bounding box; and

remove the first ones of the words from the first bounding boxes prior to extracting the purchase details.

13. The apparatus of claim 12 , wherein the purchase details include, for respective ones of the products in the receipt, a respective product description, a respective price, and a respective quantity.

14. The apparatus of claim 13 , wherein one or more of the at least one processor circuitry circuit is to cause decoding of the purchase details to decoding circuitry.

15. The apparatus of claim 1 , wherein the first price is an original price of the first product, the second price is a discount amount, and the third price is a purchase price for the first product.

16. The apparatus of claim 1 , wherein one or more of the at least one processor circuit is to apply a trained object detection model to the image to detect the regions.

17. At least one non-transitory computer readable storage medium comprising instructions that, when executed, to cause at least one processor circuit to at least:

cause generation of a first receipt region and a second receipt region based on an image of a receipt, the first and second receipt regions based on regions detected in the image;

apply a first mask to the first receipt region to generate first bounding boxes, the first bounding boxes corresponding to rows of the receipt;

apply a second mask to the second of the receipt region to generate second bounding boxes, the second bounding boxes corresponding to columns of the receipt;

form a structure of the receipt by (a) assigning words detected by an optical character recognition (OCR) engine to corresponding first bounding boxes based on a mapping criterion and (b) assigning ones of the words to respective ones of the second bounding boxes based on the mapping criterion;

cause classification of the the columns based on ones of the words assigned to the respective ones of the second bounding boxes;

extract purchase information from the structured receipt based on the classifications, the purchase information to include items listed in the receipt, the items to include a first item associated with a promotion; and

generate promotion information for the first item by:

identifying a first price associated with the first item, the first price corresponding identified from a first column classified as a price column;

identifying a second price associated with the first item, the second price corresponding to the promotion; and

determining a third price associated with the first item based on the first price and the second price.

18. The at least one non-transitory computer readable storage medium as defined in claim 17 , wherein the instructions, are to cause one or more of the at least one processor circuit to merge a first one of the first bounding boxes and a second one of the first bounding boxes based on a row connection criterion, the first one and the second one of the first bounding boxes to satisfy a length criterion.

19. The at least one non-transitory computer readable storage medium as defined in claim 17 , wherein the instructions cause one or more of the at least one processor circuit to apply a trained object detection model to the image to detect the regions.

20. An apparatus comprising:

means for generating row bounding boxes to generate row bounding boxes on an image based on a first mask, the first mask applied to a first region detected in the image, the row bounding boxes corresponding to rows of a receipt;

means for generating column bounding boxes to generate column bounding boxes on the image based on a second mask, the second mask to applied to a second region detected in the image, the column bounding boxes corresponding to columns of the receipt; and

means for extracting purchase information to:

generate a data structure to represent the receipt by (a) mapping words extracted from the image to respective ones of the row bounding boxes based on a mapping criterion and (b) mapping ones of the words to respective ones of the column bounding boxes based on the mapping criterion;

cause classification of the columns based on respective ones of the words mapped to the respective ones of the column bounding boxes, the columns including a price column;

extract purchase data from the data structure based on the classifications, the purchase data including a first product indicated in the receipt, the first product associated with a promotion; and

generate promotion data for the first product by:

identifying a first price associated with the first product, the first price identified from the price column;

identifying a second price associated with the first product, the second price corresponding to the promotion; and

determining a third price associated with the first product based on the first price and the second price.

Assignments (5)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 4, 2024
From: THE NIELSEN COMPANY (US),LLC
To: NIELSEN CONSUMER LLC
Reel/Frame 067007/0162 →
EMPLOYMENT AGREEMENT Recorded Apr 4, 2024
From: BANSAL, ATUL
To: THE NIELSEN COMPANY (US), LLC
Reel/Frame 067164/0671 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 4, 2024
From: MERCALDI, GISELLA
To: NIELSEN CONSUMER LLC
Reel/Frame 066188/0910 →
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 Jun 22, 2022
From: JAVIER YEBES TORRES, JOSE; SINHA, ADITI; LEBRUN, CHRISTINE; OPPINI, FABIO; KUMAR, MUKUL; CHANDRAMOULI, VIGNESH; SOUSA, FILIPA
To: NIELSEN CONSUMER LLC
Reel/Frame 060279/0462 →
Continuity (2)
Provisional Application 63214571 · Jun 24, 2021
Related Publication 20230005286A1 · Jan 5, 2023
References Cited (359)
US 3323135A · Miller · 1967 [cited by applicant]
US 5410611A · Huttenlocher et al. · 1995 [cited by applicant]
US 5606690A · Hunter et al. · 1997 [cited by applicant]
US 7454063B1 · Kneisl et al. · 2008 [cited by applicant]
US 7792709B1 · Trandal et al. · 2010 [cited by applicant]
US 8285047B2 · Nagarajan et al. · 2012 [cited by applicant]
US 8494281B2 · Nagarajan · 2013 [cited by applicant]
US 8787695B2 · Wu · 2014 [cited by applicant]
US 8792141B2 · Moore et al. · 2014 [cited by applicant]
US 8983170B2 · Nepomniachtchi et al. · 2015 [cited by applicant]
US 9014432B2 · Fan et al. · 2015 [cited by applicant]
US 9158744B2 · Rao et al. · 2015 [cited by applicant]
US 9239952B2 · Hsu · 2016 [cited by applicant]
US 9262686B1 · Singer · 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 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 11032072B2 · Andon · 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 · 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 20070033533A1 · Sull · 2007 [cited by examiner]
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 · Rao et al. · 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 examiner]
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 examiner]
US 20170293819A1 · Deng · 2017 [cited by applicant]
US 20170364450A1 · Struttmann · 2017 [cited by applicant]
US 20180005345A1 · Apodaca et al. · 2018 [cited by applicant]
US 20180053045A1 · Lorenzini · 2018 [cited by applicant]
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 20190130622A1 · Hoover · 2019 [cited by examiner]
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 · 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 · 2020 [cited by applicant]
US 20200151902A1 · Almazán · 2020 [cited by applicant]
US 20200175267A1 · Schäfer · 2020 [cited by applicant]
US 20200190963A1 · Gooneratne · 2020 [cited by examiner]
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 · 2020 [cited by examiner]
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 · 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 · 2021 [cited by examiner]
US 20210216765A1 · Xu · 2021 [cited by applicant]
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 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 20220189190A1 · Arroyo et al. · 2022 [cited by applicant]
US 20220198185A1 · Prebble · 2022 [cited by examiner]
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 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]
CA 2957433C · 2020 [cited by applicant]
CN 100369049C · 2008 [cited by examiner]
CN 103123685A · 2013 [cited by applicant]
CN 104866849A · 2015 [cited by applicant]
CN 108229397A · 2018 [cited by applicant]
CN 108829397A · 2018 [cited by applicant]
CN 109389124A · 2019 [cited by applicant]
CN 108229397B · 2020 [cited by applicant]
CN 112446351A · 2021 [cited by applicant]
CN 112560862A · 2021 [cited by applicant]
CN 112907973B · 2023 [cited by examiner]
DE 202013005144U1 · 2013 [cited by applicant]
GB 2595412A · 2021 [cited by applicant]
JP H0749529A · 1995 [cited by applicant]
JP 2008021850A · 2008 [cited by applicant]
JP 2008210850A · 2008 [cited by applicant]
JP 2008211850A · 2008 [cited by applicant]
JP 2019139737A · 2019 [cited by applicant]
JP 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]
Leicester et al., “Using Scanner Technology to Collect Expenditure Data,” Fiscal Studies, vol. 30, Issue 3-4, 2009, 29 pages. [cited by applicant]
United States and Patent and Trademark Office, “Non-Final Office Action,” issued in connection with U S. Appl. No. 17/566,135, dated Mar. 27, 2024, 13 pages. [cited by applicant]
United States Patent and Trademark Office, “Non-Final Office Action,” issued in connection with U.S. Appl. No. 18/476,978, dated Apr. 18, 2024, 20 pages. [cited by applicant]
United States Patent and Trademark Office, “Notice of Allowance and Fee(s) Due,” issued in connection with U.S. Appl. No. 17/710,538, dated Apr. 19, 2024, 8 pages. [cited by applicant]
United States Patent and Trademark Office, “Non-Final Office Action,” issued in connection with U.S. Appl. No. 17/710,660, on May 28, 2024, 9 pages. [cited by applicant]
Canadian Intellectual Property Office, “Office Action,” issued in connection with U.S. Pat. No. 3,182,471, dated May 28, 2024, 5 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 Barcelona… [cited by applicant]
Levenshtein, “Binary Codes Capable of Correcting Deletions, Insertions, and Reversals,” Soviet Physics-Doklady, Cybernetics and Control Theory, 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., 1981, 3 pages. [cited by applicant]
Govindan et al., “Character Recognition—A Review,” Pattern Recognition, vol. 23, No. 7, Jul. 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. 8, Issue 9, Nov. 1997, 46 pages. [cited by applicant]
Ng et al., “On Spectral Clustering: Analysis and an Algorithm,” 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,” International Journal on Document Analysis and Recognition, 2003, 20 pages. [cited by applicant]
Lowe, “Distinctive Image Features from Scale-Invariant Key points,” International Journal of Computer Vision (HCV), vol. 60, published Nov. 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, dated 2009, 125 pages. [cited by applicant]
Oliveira et al., “A New Method for Text-Line Segmentation for Warped Documents,” International Conference Image Analysis and Recognition, Jun. 21, 2010, 11 pages. [cited by applicant]
Krizhevsky et al., “ImageNet Classification with Deep Convolutional Neural Networks,” In International Conference on Neural Information Processing Systems (NIPS), published 2012, 9 pages. [cited by applicant]
Chung et al. “Empirical Evaluation of Gated Recurrent Neural Networks on Sequence Modeling,” ArXiv abs/1412.3555, Dec. 2014, 9 pages. [cited by applicant]
Nshuti, “Mobile Scanner and OCR (A First Step Towards Receipt to Spreadsheet),” Stanford University, published 2015, 3 pages. [cited by applicant]
Ronneberger et al., “U-Net: Convolutional Networks for Biomedical Image Segmentation,” Medical Image Computing and Computer-Assisted Intervention (MICCAI), dated May 18, 2015, 8 pages. [cited by applicant]
Lecun et al., “Deep Learning,” Nature, vol. 521, published 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, 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), Dec. 7, 2015, 14 pages. [cited by applicant]
Kim et al., “Character-Aware Neural Language Models,” Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (AAAl'IO), pp. 2741-2749, 2016, 9 pages. [cited by applicant]
Redmon et al., “You Only Look Once: Unified, Real-Time Object Detection,” In Conference on Computer Vision and Pattern Recognition (CVPR), dated May 9, 2016, 10 pages. [cited by applicant]
Osindero et al., “Recursive Recurrent Nets with Attention Modeling for OCR in the Wild,” in Conference on Computer Vision and Pattern Recognition (CVPR), dated Jun. 27, 2016, 10 pages. [cited by applicant]
Joulin et al., “Bag of Tricks for Efficient Text Classification,” 15th Conference of the European Chapter of the Association for Computational Linguistics, dated 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, dated 2016, 4 pages. [cited by applicant]
Kipf et al., “Semi-Supervised Classification with Graph Convolutional Networks,” 5th International Conference on Learning Representations, Apr. 24, 2017, 14 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, dated Jun. 2017, 12 pages. [cited by applicant]
Ozhiganov et al., “Deep Dive Into OCR for Receipt Recognition,” DZone, dated Jun. 21, 2017, 18 pages. [cited by applicant]
Bartz et al., “STN-OCT: A Single Neural Network for Text Detection and Text Recognition,” Computer Vision and Pattern Recognition, dated Jul. 27, 2017, 9 pages. [cited by applicant]
Vaswani et al., “Attention is all you need,” Advances in Neural Information Processing Systems, 31st Conference on Neural Information Processing Systems (NIPS 2017), last revised Dec. 6, 2017, 15 pages. [cited by applicant]
Hui, “mAP (mean Average Precision) for Object Detection,” URL:[https://medium.com/@jonathan hui/map-mean-average-precision-for-object-detection-45cl21a311731], Mar. 6, 2018, 2 pages. [cited by applicant]
Velicković et al., “Graph Attention Networks,” 2018 International Conference on Learning Representations, 2018, 12 pages. [cited by applicant]
Mudgal et al., “Deep Learning for Entity Matching: A Design Space Exploration,” 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,” in European Conference on Computer Vision (ECCV), 2018, 15 pages. [cited by applicant]
Li et al., “Extracting Figures and Captions from Scientific Publications,” Short Paper, 27th ACM Conference on Information and Knowledge Management, CIKM'18, 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, Nov. 2018, 18 pages. [cited by applicant]
Huang et al., “Mask R-CNN with Pyramid Attention Network for Scene Text Detection,” 2019 IEEE Winter Conference on Applications of Computer Vision, Jan. 2019, 9 pages. [cited by applicant]
Wikipedia, “Precision & Recall,” URL:[https://en.wikipedia.org/wiki/Precision_and_recall], last edited Dec. 17, 2018, 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,” 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, May 6, 2019, 19 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), Jun. 24, 2019, 16… [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]
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., “Hierarchical Graph Convolutional Networks for Semi-supervised Node Classification,” 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), dated Aug. 14, 2019, 6 pages. [cited by applicant]
Zhong et al., “PubLayNet: Largest Dataset Ever for Document Layout Analysis,” International Conference on Document Analysis and Recognition (ICDAR), dated Aug. 16, 2019, 8 pages. [cited by applicant]
Guillaume et al., “FUNSD: A Dataset for Form Understanding in Noisy Scanned Documents,” International Conference on Document Analysis and Recognition (ICDAR), Sep. 20, 2019, 6 pages. [cited by applicant]
Yadati et al., “HyperGCN: Hypergraph Convolutional Networks for Semi-Supervised Classification,” 33rd International Conference on Neural Information Processing Systems, Dec. 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,” in International Conference on Pattern Recognition (ICPR), 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, KDD '20, Aug. 23-27, 2020, Virtual Event, USA… [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, 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, Dec. 12, 2020, 10 pages. [cited by applicant]
Deepdive, “Distant Supervision,” Stanford University, URL:[http://deepdive.stanford.edu/distant supervision], 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), 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,” Advances in Knowledge Discovery and Data Mining, 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 23, 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), Jun. 20, 2021, 10 pages. [cited by applicant]
Hwang et al., “Spatial Dependency Parsing for Semi-Structured Document Information Extraction,” 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, May 2, 2021, 10 pages. [cited by applicant]
Xu et al., “LayoutLMv2: Multi-modal Pre-training for Visually-rich Document Understanding,” ACL Main Conference, Jan. 10, 2022, 13 pages. [cited by applicant]
Huang et al., “UniGNN: a Unified Framework for Graph and Hypergraph Neural Networks,” International Joint Conference on Artificial Intelligence (IJCAI), May 3, 2021, 9 pages. [cited by applicant]
Tang et al., “MatchVIE: Exploiting Match Relevancy between Entities for Visual Information Extraction”, Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence (IJCAI-21) 2021, 7 pages. [cited by applicant]
Qian et al., “A Region-Based Hypergraph Network for Joint Entity-Relation Extraction,” ScienceDirect, Knowledge- Based Systems, vol. 228, Sep. 27, 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]
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]
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]
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]
Garncarek et al., “LAMBERT: Layout-Aware Language Modeling for Information Extraction,” ICDAR, arXiv, May 28, 2021, 16 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,” 36th AAAI Conference on Artificial Intelligence, arXiv, Sep. 10, 2021, 13 pages. [cited by applicant]
Appalaraju et al., “DocFormer: End-to-End Transformer for Document Understanding,” ICCV Open Access, arXiv, 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 United States U.S. Appl. No. 16/692,797, dated Oct. 27, 2021, 14 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]
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]
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/], Dec. 2021, 12 pages. [cited by applicant]
Gu et al., “UniDoc: Unified Pretraining Framework for Document Understanding,” Neural Information Processing Systems (NeurIPS), Dec. 6, 2021, 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,” Neural Information Processing Systems (NeurIPS), 2019, 4 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/], 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]
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]
Wang et al. “LiLT: A Simple yet Effective Language-Independent Layout Transformer for Structured Document Understanding”, in Annual Meeting of the Association for Computational Linguistics (ACL), arXiv, Feb. 28, 2022, 1… [cited by applicant]
United States Patent and Trademark Office, “Advisory Action,” issued in connection with U.S. Appl. No. 16/692,797, dated Feb. 16, 2022, 2 pages. [cited by applicant]
Datasetlist, “Labeling Tools—List of Labeling Tools,” Datasetlist.com, URL:[https://www.datasetlist.com/tools/updated], Dec. 2021, 14 pages. [cited by applicant]
Nielseniq, “Nielsen Brandbank Product Library—Power the Path to Purchase With Brand Approved Content” URL:[https://www.brandbank.com/us/product-librarv/], retrieved on Apr. 1, 2022. 5 pages. [cited by applicant]
Github, “Fiat tool—Fast Image Data Annotation Tool,” URL:[https://github.com/christopher5106/FastAnnotationTool], 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,” 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]
Datasetlist, “A Tool Using OpenCV to Annotate Images for Image Classification, Optical Character Reading, . . . ,” Datasetlist.com, dated Jul. 13, 2022, 30 pages. [cited by applicant]
United States Patent and Trademark Office, “Non-Final Office Action,” issued in connection with U.S. Appl. No. 17/345,940, dated Aug. 18, 2022, 8 pages. [cited by applicant]
United States Patent and Trademark Office, “Non-Final Office Action,” issued in connection with U.S. Appl. No. 17/075,675, dated Sep. 22, 2022, 12 pages. [cited by applicant]
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, Oct. 23, 2022, 13 pages. [cited by applicant]
European Patent Office, “Extended European Search Report,” issued in connection with European Patent Application No. 19921870, 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]
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]
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, “European Search Report,” issued in connection with European Patent Application No. 22180113.7-1207, dated Nov. 22, 2022, 31 pages. [cited by applicant]
Dwivedi et al., “Benchmarking Graph Neural Networks,” Journal of Machine Learning Research, Dec. 2022, 49 pages. [cited by applicant]
European Patent Office, “Extended European Search Report,” issued in connection with European Patent Application No. 22184405.3, dated Dec. 2, 2022, 4 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]
International Searching Authority, “International Preliminary Report on Patentability,” issued in connection with International Patent Application No. PCT/US2021/039931, issued on Dec. 13, 2022, 5 pages. [cited by applicant]
United States Patent and Trademark Office, “Corrected Notice of Allowability,” issued in connection with U.S. Appl. No. 17/364,419, dated Jan. 4, 2023, 2 pages. [cited by applicant]
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/075,675, dated Jun. 26, 2023, 8 pages. [cited by applicant]
United States Patent and Trademark Office, “Notice of Allowance and Fee(s) Due,” issued in connection with U.S. Appl. No. 17/345,940, dated Jul. 7, 2023, 8 pages. [cited by applicant]
Intellectual Property of United Kingdom, “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]
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]
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]
International Searching Authority, “International Preliminary Report on Patentability,” issued in connection with International Application No. PCT/US2023/011859, mailed on Aug. 6, 2024, 6 pages. [cited by applicant]
United States Patent and Trademark Office, “Notice of Allowance and Fee(s) Due,” issued in connection with U.S. Appl. No. 17/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, “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, “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, “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, “Non-Final Office Action,” issued in connection with U.S. Appl. No. 18/176,273, dated Apr. 24, 2025, 7 pages. [cited by applicant]