Granted Patent B2

US 11,575,454 · App. 17/402,742 · Granted Feb 7, 2023

Inventors: Dyon Anniballi (Wayne, PA); Philippe Generali (Scarsdale, NY)

Assignee: iHeartMedia Management Services, Inc.

H04H60/37H04H60/64H04H60/65H04H2201/90

Abstract

Claims (94)

1. An automated data-matching method comprising:

obtaining a first stored fingerprint generated from first data;

obtaining a second stored fingerprint generated from second data;

dividing the first stored fingerprint and the second stored fingerprint into frames;

grouping the frames of the first stored fingerprint into first blocks, wherein the first blocks includes a number of frames;

grouping the frames of the second stored fingerprint into second blocks, wherein the second blocks include the same number of frames included in the first blocks;

comparing each frame included in a current first block to each frame included in a current second block to determine a number of matching frames;

determining a hamming distance between the current first block and the current second block based, at least in part, on the number of matching frames; and

determining, based at least in part on the hamming distance, whether the current first block and the current second block match.

2. The automated data-matching method of claim 1 , further comprising:

iteratively performing the following steps until the current first block either matches the current second block or there are insufficient frames of the second stored fingerprint to form a second block:

modifying the current second block by removing a first frame from the current second block and adding an adjacent frame to the current second block;

comparing each frame included in the current first block to each frame included in the current second block to determine the number of matching frames;

determining the hamming distance between the current first block and the current second block based, at least in part, on the number of matching frames; and

determining, based at least in part on the hamming distance, whether the current first block and the current second block match.

3. The automated data-matching method of claim 1 , further comprising:

determining a second hamming distance between a current frame included in the current first block and each frame included in the current second block; and

determining whether two frames match based on the second hamming distance.

4. The automated data-matching method of claim 1 , wherein:

two frames match only if the two frames are identical.

5. The automated data-matching method of claim 1 , further comprising:

generating a hamming distance score representing the hamming distance between the current first block and the current second block modified by applying a weighting factor based on bit differences occurring within particular frames of the current first block and the current second block; and

determining, based at least in part on the hamming distance score, whether the current first block and the current second block match.

6. The automated data-matching method of claim 1 , further comprising:

iteratively performing the following steps until there are insufficient frames of the first stored fingerprint to form a first block:

selecting a subsequent first block to be processed as the current first block;

comparing each frame included in the current first block to each frame included in a current second block to determine a number of matching frames;

determining a hamming distance between the current first block and the current second block based, at least in part, on the number of matching frames; and

determining, based at least in part on the hamming distance, whether the current first block and the current second block match.

7. The automated data-matching method of claim 1 , wherein:

the first stored fingerprint and the second stored fingerprint are continuous fingerprints generated from media broadcasts.

8. An automated data-matching device comprising:

a processor;

memory operably associated with the processor;

a program of instructions configured to be stored in the memory and executed by the processor, the program of instructions comprising:

at least one instruction to obtain a first stored fingerprint generated from first data;

at least one instruction to obtain a second stored fingerprint generated from second data;

at least one instruction to divide the first stored fingerprint and the second stored fingerprint into frames;

at least one instruction to group the frames of the first stored fingerprint into first blocks, wherein the first blocks includes a number of frames;

at least one instruction to group the frames of the second stored fingerprint into second blocks, wherein the second blocks include the same number of frames included in the first blocks;

at least one instruction to compare each frame included in a current first block to each frame included in a current second block to determine a number of matching frames;

at least one instruction to determine a hamming distance between the current first block and the current second block based, at least in part, on the number of matching frames; and

at least one instruction to determine, based at least in part on the hamming distance, whether the current first block and the current second block match.

9. The automated data-matching device of claim 8 , further comprising:

at least one instruction to cause the processor to iteratively perform the following steps until the current first block either matches the current second block or there are insufficient frames of the second stored fingerprint to form a second block:

modifying the current second block by removing a first frame from the current second block and adding an adjacent frame to the current second block;

comparing each frame included in the current first block to each frame included in the current second block to determine the number of matching frames;

determining the hamming distance between the current first block and the current second block based, at least in part, on the number of matching frames; and

determining, based at least in part on the hamming distance, whether the current first block and the current second block match.

10. The automated data-matching device of claim 8 , further comprising:

at least one instruction to determine a second hamming distance between a current frame included in the current first block and each frame included in the current second block; and

at least one instruction to determine whether two frames match based on the second hamming distance.

11. The automated data-matching device of claim 8 , wherein:

two frames match only if the two frames are identical.

12. The automated data-matching device of claim 8 , further comprising:

at least one instruction to generate a hamming distance score representing the hamming distance between the current first block and the current second block modified by applying a weighting factor based on bit differences occurring within particular frames of the current first block and the current second block; and

at least one instruction to determine, based at least in part on the hamming distance score, whether the current first block and the current second block match.

13. The automated data-matching device of claim 8 , further comprising:

at least one instruction to cause the processor to iteratively perform the following steps until there are insufficient frames of the first stored fingerprint to form a first block:

selecting a subsequent first block to be processed as the current first block;

comparing each frame included in the current first block to each frame included in a current second block to determine a number of matching frames;

determining a hamming distance between the current first block and the current second block based, at least in part, on the number of matching frames; and

determining, based at least in part on the hamming distance, whether the current first block and the current second block match.

14. The automated data-matching device of claim 8 , wherein:

the first stored fingerprint and the second stored fingerprint are continuous fingerprints generated from media broadcasts.

15. A non-transitory computer readable medium tangibly embodying a program of instructions to be stored in a memory and executed by a processor, the program of instructions including:

at least one instruction to obtain a first stored fingerprint generated from first data;

at least one instruction to obtain a second stored fingerprint generated from second data;

at least one instruction to divide the first stored fingerprint and the second stored fingerprint into frames;

at least one instruction to group the frames of the first stored fingerprint into first blocks, wherein the first blocks includes a number of frames;

at least one instruction to group the frames of the second stored fingerprint into second blocks, wherein the second blocks include the same number of frames included in the first blocks;

at least one instruction to compare each frame included in a current first block to each frame included in a current second block to determine a number of matching frames;

at least one instruction to determine a hamming distance between the current first block and the current second block based, at least in part, on the number of matching frames; and

at least one instruction to determine, based at least in part on the hamming distance, whether the current first block and the current second block match.

16. The non-transitory computer readable medium of claim 15 , further comprising:

at least one instruction to cause the processor to iteratively perform the following steps until the current first block either matches the current second block or there are insufficient frames of the second stored fingerprint to form a second block:

modifying the current second block by removing a first frame from the current second block and adding an adjacent frame to the current second block;

comparing each frame included in the current first block to each frame included in the current second block to determine the number of matching frames;

determining the hamming distance between the current first block and the current second block based, at least in part, on the number of matching frames; and

determining, based at least in part on the hamming distance, whether the current first block and the current second block match.

17. The non-transitory computer readable medium of claim 15 , further comprising:

at least one instruction to determine a second hamming distance between a current frame included in the current first block and each frame included in the current second block; and

at least one instruction to determine whether two frames match based on the second hamming distance.

18. The non-transitory computer readable medium of claim 15 , wherein:

two frames match only if the two frames are identical.

19. The non-transitory computer readable medium of claim 15 , further comprising:

at least one instruction to generate a hamming distance score representing the hamming distance between the current first block and the current second block modified by applying a weighting factor based on bit differences occurring within particular frames of the current first block and the current second block; and

at least one instruction to determine, based at least in part on the hamming distance score, whether the current first block and the current second block match.

20. The non-transitory computer readable medium of claim 15 , further comprising:

at least one instruction to cause the processor to iteratively perform the following steps until there are insufficient frames of the first stored fingerprint to form a first block:

selecting a subsequent first block to be processed as the current first block;

comparing each frame included in the current first block to each frame included in a current second block to determine a number of matching frames;

determining a hamming distance between the current first block and the current second block based, at least in part, on the number of matching frames; and

determining, based at least in part on the hamming distance, whether the current first block and the current second block match.

Assignments (8)

Continuity (6)