# US 2023/0055042 A1 · Partial Perceptual Image Hashing for Document Deconstruction

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2023/0055042 A1
- Document ID: US20230055042A1
- Status: Published application
- Kind: A1
- Application number: 17/980,926
- Filed: 2022-11-04
- Published: 2023-02-23
- Earliest claimed: 2019-10-14
- Assignees: Bottomline Technologies, Inc.
- Applicants: Bottomline Technologies Limited
- Inventors: Shane O'Hara; Mitchell Ransom
- Web page: https://patentgrep.com/patent/US20230055042A1

## CPC

- G06Q 30/04: Billing or invoicing
- G06V 30/414: Extracting the geometrical structure, e.g. layout tree; Block segmentation, e.g. bounding boxes for graphics or text
- G06F 16/93: Document management systems
- G06F 40/194: Calculation of difference between files
- G06T 7/11: Region-based segmentation
- G06V 30/418: Document matching, e.g. of document images
- H04L 12/14: Charging, metering or billing arrangements specially adapted for data communications, e.g. authentication, authorisation and accounting [AAA] framework
- H04L 12/1428: {Invoice generation, e.g. customization, lay-out, database processing, algorithms for calculating the bill or formatting invoices as WWW pages (invoicing in general G06Q30/04)}
- H04M 15/41: {Billing record details, i.e. parameters, identifiers, structure of call data record [CDR]}
- H04M 15/43: {Billing software details}
- H04M 15/44: {Augmented, consolidated or itemized billing statement or bill presentation}
- H04M 15/49: {Connection to several service providers}
- H04M 15/8033: {location-dependent, e.g. business or home}
- H04N 1/40012: {Conversion of colour to monochrome}
- H04W 4/24: Accounting or billing
- G06T 2207/10024: Color image
- G06T 2207/30176: Document
- G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06V: IMAGE OR VIDEO RECOGNITION OR UNDERSTANDING
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06T: IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- H04M: TELEPHONIC COMMUNICATION (circuits for controlling other apparatus via a telephone cable and not involving telephone switching apparatus G08)
- H04N: PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)

## Abstract

A system and method for deconstructing a document is described herein, where the method is an improvement over existing document deconstruction techniques. These improvements increase speed and accuracy by rapidly identifying the source in a document by splitting the document into a plurality of sections and performing a perceptual image hashing on each section. Then a hamming distance is used to compare the hash for each section with the hashes of known documents to identify the source who sent the document.

## Claims

### Claim 1

An apparatus for identifying a source associated with a new document, the apparatus comprising:
a special purpose processor with a plurality of cores;
a memory electrically connected to the special purpose processor; and
a mass storage device holding a database of known sources, the mass storage device electrically connected to the special purpose processor, wherein each known source in the database includes a known source image hash for each of a plurality of known sections of a known source document, said plurality of known sections containing a visually discernable image;
wherein an image of the new document stored in the memory is split into a plurality of new sections by the special purpose processor, said plurality of new sections containing a visually discernable image,
a perceptual image hash is calculated by the special purpose processor for each of the plurality of new sections of the new document, and
a hamming distance is calculated between the perceptual image hash of at least one of the plurality of new sections of the new document and each entry in the database of the known sources for a corresponding section of the known source document, the known source associated with a smallest hamming distance identified as the source associated with the new document.

### Claim 2 (depends on 1)

The apparatus of claim 1 wherein the perceptual image hash is calculated with an average algorithm.

### Claim 3 (depends on 1)

The apparatus of claim 1 wherein the perceptual image hash is calculated with a difference algorithm.

### Claim 4 (depends on 1)

The apparatus of claim 1 wherein the perceptual image hash is calculated with a pHash algorithm.

### Claim 5 (depends on 1)

The apparatus of claim 1 wherein the new document is reduced to an eight by eight grid of pixels before calculating the perceptual image hash.

### Claim 6 (depends on 1)

The apparatus of claim 1 wherein the new document is reduced to grayscale color before calculating the perceptual image hash.

### Claim 7 (depends on 1)

The apparatus of claim 1 wherein the new document is a prescription.

### Claim 8 (depends on 1)

The apparatus of claim 1 wherein the new document is a document.

### Claim 9 (depends on 1)

The apparatus of claim 1 wherein the smallest hamming distance is compared to a threshold and the source associated with the smallest hamming distance is added to the database of the known sources if the smallest hamming distance is greater than the threshold.

### Claim 10 (depends on 9)

The apparatus of claim 9 wherein the source that is added is identified as the source associated with the new document.

### Claim 11

A method for identifying a source associated with a new document, the method comprising:
splitting an image of the new document stored in a memory into a plurality of new sections of the new document by a special purpose processor with a plurality of cores, wherein the memory is electrically connected to the special purpose processor, said plurality of new sections containing a visually discernable image;
calculating a perceptual image hash by the special purpose processor for each of the plurality of new sections of the new document;
calculating a hamming distance between the perceptual image hash of at least one of the plurality of new sections of the new document and for each entry in a database of known sources for a corresponding section; and
identifying the known source associated with a smallest hamming distance as the source associated with the new document;
wherein a mass storage device holds the database of the known sources, the mass storage device electrically connected to the special purpose processor.

### Claim 12 (depends on 11)

The method of claim 11 wherein the perceptual image hash is calculated with an average algorithm.

### Claim 13 (depends on 11)

The method of claim 11 wherein the perceptual image hash is calculated with a difference algorithm.

### Claim 14 (depends on 11)

The method of claim 11 wherein the perceptual image hash is calculated with a pHash algorithm.

### Claim 15 (depends on 11)

The method of claim 11 further comprises reducing the new document to an eight by eight grid of pixels before calculating the perceptual image hash.

### Claim 16 (depends on 11)

The method of claim 11 further comprises reducing the new document to grayscale color before calculating the perceptual image hash.

### Claim 17 (depends on 11)

The method of claim 11 wherein the new document is a prescription.

### Claim 18 (depends on 11)

The method of claim 11 wherein the new document is a document.

### Claim 19 (depends on 11)

The method of claim 11 further comprises comparing the smallest hamming distance to a threshold and adding the source associated with the smallest hamming distance to the database of the known sources if the smallest hamming distance is greater than the threshold.

### Claim 20 (depends on 19)

The method of claim 19 wherein the source that is added is identified as the source associated with the new document.
