IP Library › Granted Patent US 12,387,518
Granted Patent B2
US 12,387,518 · App. 18/601,101 · Granted Aug 12, 2025

Extracting multiple documents from single image

Inventors: Ivan Zagaynov (Dolgoprudniy, RU); Aleksandra Stepina (Dubna, RU)
Assignee: ABBYY Development Inc.
G06V30/414G06F18/214G06V10/25
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,387,518
App. No.
18/601,101
Granted
Aug 12, 2025
Kind
B2
Abstract

System and method for document image detection, comprising: producing, using a neural network, a superpixel segmentation map of an input image; generating a superpixel binary mask by associating each superpixel of the superpixel segmentation map with a class of a predetermined set of classes; identifying one or more connected components in the superpixel binary mask; for each connected component of the superpixel binary mask, identifying a corresponding minimum bounding polygon; creating one or more image dividing lines based on the minimum bounding polygons; and defining boundaries of one or more objects of interest based on at least a subset of the image dividing lines.

Claims (51)

1. A computer-implemented method for document image detection, comprising:

generating a superpixel binary mask associated with an input image, wherein each superpixel of the superpixel binary mask is derived from a probability characteristic reflecting a probability of the superpixel belonging to a certain object found in an input image;

identifying a connected component in the superpixel binary mask;

responsive to determining that a first number of pixels in a first line of the superpixel binary mask exceeds, by at least a predetermined threshold, a second number of pixels in a second line of the superpixel binary mask which is adjacent to the first line of the superpixel binary mask, utilizing the second line as a candidate boundary of a minimum bounding polygon associated with the connected component;

creating one or more image dividing lines based on the minimum bounding polygon; and

defining boundaries of one or more regions of interest based on at least a subset of the image dividing lines.

2. The method of claim 1 , wherein the superpixel binary mask is generated based on a chosen binarization threshold.

3. The method of claim 1 , wherein the first line is provided by one of: a row of the superpixel binary mask or a column of the superpixel binary mask.

4. The method of claim 1 , wherein identifying the minimum bounding polygon further comprises:

generating a plurality of candidate lines for the minimum bounding polygon;

computing a value of a quality metric for the one or more regions of interest.

5. The method of claim 4 , wherein generating the plurality of candidate lines for the minimum bounding polygon further comprises:

responsive to determining that a first number of pixels in a first line of the superpixel binary mask exceeds, by at least a predetermined threshold, a second number of pixels in a second line of the superpixel binary mask which is adjacent to the first line of the superpixel binary mask, utilizing the second line as a second candidate boundary of the bounding polygon, wherein the first line is provided by one of: a row of the superpixel binary mask or a column of the superpixel binary mask.

6. The method of claim 4 , wherein generating the plurality of candidate lines for the minimum bounding polygon further comprises:

utilizing, as a second candidate boundary of the bounding polygon, a line traversing a center of the superpixel binary mask.

7. The method of claim 4 , wherein computing a value of a quality metric for one or more regions of interest further comprises:

applying, to the one or more regions of interest, a trainable classifier.

8. A system, comprising:

a memory;

a processor, coupled to the memory, the processor configured to:

generate a superpixel binary mask associated with an input image, wherein each superpixel of the superpixel binary mask is derived from a probability characteristic reflecting a probability of the superpixel belonging to a certain object found in an input image;

identify a connected component in the superpixel binary mask;

responsive to determining that a first number of pixels in a first line of the superpixel binary mask exceeds, by at least a predetermined threshold, a second number of pixels in a second line of the superpixel binary mask which is adjacent to the first line of the superpixel binary mask, utilize the second line as a candidate boundary of a minimum bounding polygon associated with the connected component;

create one or more image dividing lines based on the minimum bounding polygon; and

define boundaries of one or more regions of interest based on at least a subset of the image dividing lines.

9. The system of claim 8 , wherein the superpixel binary mask is generated based on a chosen binarization threshold.

10. The system of claim 8 , wherein the first line is provided by one of: a row of the superpixel binary mask or a column of the superpixel binary mask.

11. The system of claim 8 , wherein identifying the minimum bounding polygon further comprises:

generating a plurality of candidate lines for the minimum bounding polygon;

computing a value of a quality metric for the one or more regions of interest.

12. The system of claim 11 , wherein generating the plurality of candidate lines for the minimum bounding polygon further comprises:

responsive to determining that a first number of pixels in a first line of the superpixel binary mask exceeds, by at least a predetermined threshold, a second number of pixels in a second line of the superpixel binary mask which is adjacent to the first line of the superpixel binary mask, utilizing the second line as a second candidate boundary of the bounding polygon, wherein the first line is provided by one of: a row of the superpixel binary mask or a column of the superpixel binary mask.

13. The system of claim 11 , wherein generating the plurality of candidate lines for the minimum bounding polygon further comprises:

utilizing, as a second candidate boundary of the bounding polygon, a line traversing a center of the superpixel binary mask.

14. The system of claim 11 , wherein computing a value of a quality metric for one or more regions of interest further comprises:

applying, to the one or more regions of interest, a trainable classifier.

15. A non-transitory computer-readable storage medium comprising executable instructions that, when executed by a computer system, cause the computer system to:

generate a superpixel binary mask associated with an input image, wherein each superpixel of the superpixel binary mask is derived from a probability characteristic reflecting a probability of the superpixel belonging to a certain object found in an input image;

identify a connected component in the superpixel binary mask;

responsive to determining that a first number of pixels in a first line of the superpixel binary mask exceeds, by at least a predetermined threshold, a second number of pixels in a second line of the superpixel binary mask which is adjacent to the first line of the superpixel binary mask, utilize the second line as a candidate boundary of a minimum bounding polygon associated with the connected component;

create one or more image dividing lines based on the minimum bounding polygon; and

define boundaries of one or more regions of interest based on at least a subset of the image dividing lines.

16. The non-transitory computer-readable storage medium of claim 15 , wherein the superpixel binary mask is generated based on a chosen binarization threshold.

17. The non-transitory computer-readable storage medium of claim 15 , wherein the first line is provided by one of: a row of the superpixel binary mask or a column of the superpixel binary mask.

18. The non-transitory computer-readable storage medium of claim 15 , wherein identifying the minimum bounding polygon further comprises:

generating a plurality of candidate lines for the minimum bounding polygon;

computing a value of a quality metric for the one or more regions of interest.

19. The non-transitory computer-readable storage medium of claim 18 , wherein generating the plurality of candidate lines for the minimum bounding polygon further comprises:

responsive to determining that a first number of pixels in a first line of the superpixel binary mask exceeds, by at least a predetermined threshold, a second number of pixels in a second line of the superpixel binary mask which is adjacent to the first line of the superpixel binary mask, utilizing the second line as a second candidate boundary of the bounding polygon, wherein the first line is provided by one of: a row of the superpixel binary mask or a column of the superpixel binary mask.

20. The non-transitory computer-readable storage medium of claim 18 , wherein generating the plurality of candidate lines for the minimum bounding polygon further comprises:

utilizing, as a second candidate boundary of the bounding polygon, a line traversing a center of the superpixel binary mask.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 20, 2024
From: ABBYY PRODUCTION LLC
To: ABBYY DEVELOPMENT INC.
Reel/Frame 066836/0627 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 14, 2024
From: ZAGAYNOV, IVAN; STEPINA, ALEKSANDRA
To: ABBYY PRODUCTION LLC
Reel/Frame 066767/0997 →
Priority Claims (1)
RU RU2020142364 · Dec 22, 2020 · national
Continuity (2)
Continuation 17133794 · Dec 24, 2020
Related Publication 20240212382A1 · Jun 27, 2024
References Cited (22)
US 10685223B2 · Nepomniachtchi et al. · 2020 [cited by applicant]
US 11972626B2 · Zagaynov · 2024 [cited by examiner]
US 20090116755A1 · Neogi et al. · 2009 [cited by applicant]
US 20190206056A1 · Georgescu et al. · 2019 [cited by applicant]
US 20190294641A1 · Alexeev · 2019 [cited by examiner]
US 20190384954A1 · Lyubimov et al. · 2019 [cited by applicant]
US 20200014937A1 · Grangetto et al. · 2020 [cited by applicant]
US 20200125881A1 · Pribble · 2020 [cited by examiner]
US 20210004962A1 · Tsai et al. · 2021 [cited by applicant]
US 20210019883A1 · Krauth et al. · 2021 [cited by applicant]
US 20220122347A1 · Bhatt et al. · 2022 [cited by applicant]
RU 2691214C1 · 2019 [cited by applicant]
RU 2695054C1 · 2019 [cited by applicant]
RU 2699687C1 · 2019 [cited by applicant]
RU 2726185C1 · 2020 [cited by applicant]
Cong N. T., et al., “Information Extraction From ID Card via Computer Vision Techniques,” Faculty of Information Technology, VNU University of Engineering and Technology, 144 Xuan Thuy Street, Cau Giay, Hanoi, Vietnam, … [cited by applicant]
Deng D., et al., “PixelLink: Detecting Scene Text via Instance Segmentation,” In the Thirty-Second AAAI Conference on Artificial Intelligence (AAAI-18), 2018, pp. 6773-6780. [cited by applicant]
Kasliwal V., et al., “ID Card Border Detection using Emgu CV,” Peritos Solutions, Jul. 24, 2017, 7 Pages, Retrieved from URL: https://medium.com/peritos-solutions/id-card-border-detection-using-emgu-cv-59aa1114397d. [cited by applicant]
Stenhagen P., “Improving Realism in Synthetic Barcode Images using Generative Adversarial Networks,” Master of Science Thesis in Electrical Engineering Department of Electrical Engineering, Linkoping University, 2018, 8… [cited by applicant]
Ventsov N.N., et al., “Localization of Barcodes Using Artificial Neural Network,” IEEE East-West Design & Test Symposium (EWDTS), 2018, pp. 1-3, Retrieved from URL: https://ieeeexplore.ieee.org/document/8524837. [cited by applicant]
Yu F., et al., “Multi-scale Context Aggregation by Dilated Convolutions,” CoRR, 2015, vol. abs/1511.07122, 13 Pages. [cited by applicant]
Zhao Q., et al., “Deep Dual Pyramid Network for Barcode Segmentation Using Barcode-30k Database,” Jul. 31, 2018, pp. 1-13. [cited by applicant]