IP Library Granted Patent US 12,242,620
Granted Patent B2
US 12,242,620 · App. 17/971,461 · Granted Mar 4, 2025

Methods and apparatus to encrypt media for identification

Inventor: Venkadachalam Ramalingam (Nagercoil, IN)
Assignee: The Nielsen Co. (LLC)
G06F21/602G06F17/16G06F21/10
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,242,620
App. No.
17/971,461
Granted
Mar 4, 2025
Kind
B2
Abstract

Methods, apparatus, systems, and articles of manufacture are disclosed to encrypt media for identification. An example apparatus accesses a mesh points matrix. Additionally, the example apparatus sets an upper limit equal to a larger of two values of a vector, respective ones of the two values equal to elements of the vector at indices equal to respective values of a coordinate pair of the mesh points matrix and set a lower limit equal to a smaller of the two values of the vector. The example apparatus also appends a value to an encryption vector, the value based on whether the lower limit is equal to zero, the value equal to a lowest integer not less than a quotient of a number based on a square of the upper limit and two and encrypt an input matrix with the encryption vector.

Claims (51)

1. An apparatus comprising:

memory;

machine readable instructions; and

processor circuitry to execute the machine readable instructions to at least:

access a mesh points matrix, the mesh points matrix representative of a mesh generated based on an encryption matrix and excluding overlapping edge connections;

set an upper limit equal to a larger of two values of a vector, respective ones of the two values equal to elements of the vector at indices equal to respective values of a coordinate pair of the mesh points matrix;

set a lower limit equal to a smaller of the two values of the vector;

append a value to an encryption vector, the value based on whether the lower limit is equal to zero, the value equal to a lowest integer not less than a quotient of a number based on a square of the upper limit and two; and

encrypt an input matrix with the encryption vector.

2. The apparatus of claim 1 , wherein in response to the lower limit not equaling zero, the processor circuitry is to:

determine the lowest integer not less than the quotient, the quotient being of (1) a difference between the square of the upper limit and a square of the lower limit and (2) two; and

append the lowest integer not less than the quotient to the encryption vector.

3. The apparatus of claim 1 , wherein in response to the lower limit equaling zero, the processor circuitry is to:

determine the lowest integer not less than the quotient, the quotient being of (1) the square of the upper limit and (2) two; and

append the lowest integer not less than the quotient to the encryption vector.

4. The apparatus of claim 1 , wherein the coordinate pair includes non-zero values.

5. The apparatus of claim 1 , wherein the input matrix is representative of media to be encrypted.

6. The apparatus of claim 1 , wherein the encryption matrix includes a binary representation of a watermark.

7. The apparatus of claim 1 , wherein the number is a first number, the value is a first value, and the processor circuitry is to append a second number of second values to the encryption vector, the second number of second values equal to a third number of non-zero coordinate pairs of the mesh points matrix.

8. A non-transitory computer readable storage medium comprising instructions which, when executed, cause processor circuitry to at least:

access a mesh points matrix, the mesh points matrix representative of a mesh generated based on an encryption matrix and excluding overlapping edge connections;

set an upper limit equal to a larger of two values of a vector, respective ones of the two values equal to elements of the vector at indices equal to respective values of a coordinate pair of the mesh points matrix;

set a lower limit equal to a smaller of the two values of the vector;

append a value to an encryption vector, the value based on whether the lower limit is equal to zero, the value equal to a lowest integer not less than a quotient of a number based on a square of the upper limit and two; and

encrypt an input matrix with the encryption vector.

9. The computer readable storage medium of claim 8 , wherein in response to the lower limit not equaling zero, the instructions cause the processor circuitry to:

determine the lowest integer not less than the quotient, the quotient being of (1) a difference between the square of the upper limit and a square of the lower limit and (2) two; and

append the lowest integer not less than the quotient to the encryption vector.

10. The computer readable storage medium of claim 8 , wherein in response to the lower limit equaling zero, the instructions cause the processor circuitry to:

determine the lowest integer not less than the quotient, the quotient being of (1) the square of the upper limit and (2) two; and

append the lowest integer not less than the quotient to the encryption vector.

11. The computer readable storage medium of claim 8 , wherein the coordinate pair includes non-zero values.

12. The computer readable storage medium of claim 8 , wherein the input matrix is representative of media to be encrypted.

13. The computer readable storage medium of claim 8 , wherein the encryption matrix includes a binary representation of a watermark.

14. The computer readable storage medium of claim 8 , wherein the number is a first number, the value is a first value, and the instructions cause the processor circuitry to append a second number of second values to the encryption vector, the second number of second values equal to a third number of non-zero coordinate pairs of the mesh points matrix.

15. A method comprising:

accessing a mesh points matrix, the mesh points matrix representative of a mesh generated based on an encryption matrix and excluding overlapping edge connections;

setting, by executing an instruction with processor circuitry, an upper limit equal to a larger of two values of a vector, respective ones of the two values equal to elements of the vector at indices equal to respective values of a coordinate pair of the mesh points matrix;

setting, by executing an instruction with the processor circuitry, a lower limit equal to a smaller of the two values of the vector;

appending, by executing an instruction with the processor circuitry, a value to an encryption vector, the value based on whether the lower limit is equal to zero, the value equal to a lowest integer not less than a quotient of a number based on a square of the upper limit and two; and

encrypting, by executing an instruction with the processor circuitry, an input matrix with the encryption vector.

16. The method of claim 15 , further including in response to the lower limit not equaling zero:

determining the lowest integer not less than the quotient, the quotient being of (1) a difference between the square of the upper limit and a square of the lower limit and (2) two; and

appending the lowest integer not less than the quotient to the encryption vector.

17. The method of claim 15 , further including in response to the lower limit equaling zero:

determining the lowest integer not less than the quotient, the quotient being of (1) the square of the upper limit and (2) two; and

appending the lowest integer not less than the quotient to the encryption vector.

18. The method of claim 15 , wherein the coordinate pair includes non-zero values.

19. The method of claim 15 , wherein the input matrix is representative of media to be encrypted.

20. The method of claim 15 , wherein the encryption matrix includes a binary representation of a watermark.

21. The method of claim 15 , wherein the number is a first number, the value is a first value, and the method further includes appending a second number of second values to the encryption vector, the second number of second values equal to a third number of non-zero coordinate pairs of the mesh points matrix.

Assignments (4)
SECURITY INTEREST Recorded May 8, 2023
From: GRACENOTE DIGITAL VENTURES, LLC; GRACENOTE MEDIA SERVICES, LLC; GRACENOTE, INC.; TNC (US) HOLDINGS, INC.; THE NIELSEN COMPANY (US), LLC
To: ARES CAPITAL CORPORATION
Reel/Frame 063574/0632 →
SECURITY INTEREST Recorded Apr 28, 2023
From: GRACENOTE DIGITAL VENTURES, LLC; GRACENOTE MEDIA SERVICES, LLC; GRACENOTE, INC.; TNC (US) HOLDINGS, INC.; THE NIELSEN COMPANY (US), LLC
To: CITIBANK, N.A.
Reel/Frame 063561/0381 →
SECURITY AGREEMENT Recorded Jan 31, 2023
From: GRACENOTE DIGITAL VENTURES, LLC; GRACENOTE MEDIA SERVICES, LLC; GRACENOTE, INC.; TNC (US) HOLDINGS, INC.; THE NIELSEN COMPANY (US), LLC
To: BANK OF AMERICA, N.A.
Reel/Frame 063560/0547 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 7, 2023
From: RAMALINGAM, VENKADACHALAM
To: THE NIELSEN COMPANY (US), LLC
Reel/Frame 062319/0908 →
Priority Claims (1)
IN 202011017496 · Apr 23, 2020 · national
Continuity (3)
Continuation PCTUS2021028482 · Apr 21, 2021
Continuation 17187422 · Feb 26, 2021
Related Publication 20230045053A1 · Feb 9, 2023
References Cited (11)
US 20080080738A1 · Takahashi · 2008 [cited by examiner]
US 20090110231A1 · Rzeszewski · 2009 [cited by examiner]
US 20090164762A1 · Huang · 2009 [cited by examiner]
US 20150288518A1 · Wiegand · 2015 [cited by examiner]
US 20180232844A1 · Cai · 2018 [cited by examiner]
US 20200019867A1 · Nandakumar · 2020 [cited by examiner]
US 20210334388A1 · Ramalingam · 2021 [cited by applicant]
CN 110969564A · 2020 [cited by applicant]
International Searching Authority, “International Preliminary Report on Patentability,” in connection with International Patent Application No. PCT/US2021/028482, issued Oct. 25, 2022, 5 pages. [cited by applicant]
International Searching Authority: “International Search Report,” mailed in connection with corresponding International Patent Application No. PCT/US2021/028482 on Aug. 4, 2021, 3 pages. [cited by applicant]
International Searching Authority: “Written Opinion,” mailed in connection with corresponding International Patent Application No. PCT/US2021/028482 on Aug. 4, 2021, 3 pages. [cited by applicant]