# US 2024/0187710 A1 · Methods and apparatus to extend a timestamp range supported by a watermark

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

- Number: US 2024/0187710 A1
- Document ID: US20240187710A1
- Status: Published application
- Kind: A1
- Application number: 18/509,269
- Filed: 2023-11-14
- Published: 2024-06-06
- Earliest claimed: 2018-07-02
- Assignees: The Nielsen Company (US), LLC
- Applicants: The Nielsen Company (US), LLC
- Inventors: Vladimir Kuznetsov; Alexander Topchy
- Web page: https://patentgrep.com/patent/US20240187710A1

## CPC

- H04N 21/812: {involving advertisement data (advertising per se G06Q30/02)}
- H04N 21/8358: involving watermark {(protecting executable software by watermarking G06F21/16; image watermarking in general G06T1/0021; watermarks inserted in still images for transmission purposes H04N1/32144; inserting watermarks during video coding H04N19/467)}
- H04N 21/23892: {involving embedding information at multiplex stream level, e.g. embedding a watermark at packet level}
- H04N 21/2407: {Monitoring of transmitted content, e.g. distribution time, number of downloads (arrangements for monitoring programmes for broadcast or for distribution combined with broadcast H04H20/14)}
- H04N 21/8352: involving content or source identification data, e.g. Unique Material Identifier [UMID]
- H04N 21/8547: involving timestamps for synchronizing content
- H04N: PICTORIAL COMMUNICATION, e.g. TELEVISION

## Abstract

Methods, apparatus, systems and articles of manufacture to extend a time range supported by a watermark are disclosed. Example watermark encoding apparatus disclosed herein determine which one of a plurality of timestamp cycles is to be represented by a timestamp of a watermark. Disclosed example apparatus also swap at least two symbols of the watermark when the timestamp is to represent a second one of the timestamp cycles, but do not swap the at least two symbols of the watermark when the timestamp is to represent a first one of the timestamp cycles. Disclosed example apparatus further embed the watermark in a first piece of media.

## Claims

### Claim 1

(canceled)

### Claim 2

A method for watermark decoding, the method comprising:
detecting a watermark embedded in a media content;
decoding the watermark to obtain a first sequence of data symbols;
determining that the first sequence of the data symbols is invalid;
swapping, based on the determining that the first sequence of the data symbols is invalid, at least two data symbols of the first sequence of the data symbols to form a second sequence of data symbols; and
storing the second sequence of data symbols.

### Claim 3 (depends on 2)

The method of claim 2, wherein the swapping of at least two data symbols comprises using one of a plurality of configurations; wherein the plurality of configurations comprises at least a first configuration and a second configuration;
wherein the first configuration corresponds to swapping a first pair of data symbols in the first sequence; and wherein the second configuration corresponds to swapping a different second pair of data symbols in the first sequence.

### Claim 4 (depends on 2)

The method of claim 2, further comprising:
determining that the second sequence of data symbols is valid; and
wherein the storing is based on the determining that the second sequence of data symbols is valid.

### Claim 5 (depends on 4)

The method of claim 4, further comprising:
associating, based on determining that the second sequence of data symbols is valid, a timestamp cycle with the watermark, wherein the watermark comprises a first sequence of timestamp symbols corresponding to a first timestamp; and
updating, using the timestamp cycle, the first sequence of timestamp symbols to form a second timestamp.

### Claim 6 (depends on 5)

The method of claim 5, further comprising:
reporting the second sequence of data symbols and a time associated with the second timestamp.

### Claim 7 (depends on 2)

The method of claim 2, wherein the swapping of at least two symbols comprises using one of a plurality of swapping configurations; and wherein each swapping configuration of the plurality of swapping configurations correspond to different timestamp cycles.

### Claim 8 (depends on 7)

The method of claim 7, wherein the different timestamp cycles comprise a first timestamp cycle and a second timestamp cycle; wherein the first timestamp cycle corresponds to a first period of time; and wherein the second timestamp cycle corresponds to a second period of time, subsequent to the first period of time.

### Claim 9

A computing system comprising:
a processor; and
a non-transitory computer-readable storage medium, having stored thereon program instructions that, upon execution by the processor, cause performance of a set of operations comprising:
detecting a watermark embedded in a media content;
decoding the watermark to obtain a first sequence of data symbols;
determining that the first sequence of the data symbols is invalid;
swapping, based on the determining that the first sequence of the data symbols is invalid, at least two data symbols of the first sequence of the data symbols to form a second sequence of data symbols; and
storing the second sequence of data symbols.

### Claim 10 (depends on 9)

The computing system of claim 9, wherein the swapping of at least two data symbols comprises using one of a plurality of configurations; wherein the plurality of configurations comprises at least a first configuration and a second configuration;
wherein the first configuration corresponds to swapping a first pair of data symbols in the first sequence; and wherein the second configuration corresponds to swapping a different second pair of data symbols in the first sequence.

### Claim 11 (depends on 9)

The computing system of claim 9, the set of operations further comprising:
determining that the second sequence of data symbols is valid and
wherein the storing is based on the determining that the second sequence of data symbols is valid.

### Claim 12 (depends on 11)

The computing system of claim 11, the set of operations further comprising:
storing, based on determining that the second sequence of data symbols is valid, a final timestamp.

### Claim 13 (depends on 12)

The computing system of claim 12, the set of operations further comprising:
reporting the second sequence of data symbols and a time associated with the final timestamp.

### Claim 14 (depends on 9)

The computing system of claim 9, wherein the swapping of at least two symbols comprises using one of a plurality of swapping configurations; and wherein each swapping configuration of the plurality of swapping configurations correspond to different timestamp cycles.

### Claim 15 (depends on 14)

The computing system of claim 14, wherein the different timestamp cycles comprise a first timestamp cycle and a second timestamp cycle; wherein the first timestamp cycle corresponds to a first period of time; and wherein the second timestamp cycle corresponds to a second period of time, subsequent to the first period of time.

### Claim 16

A non-transitory computer-readable storage medium, having stored thereon program instructions that, upon execution by a processor, cause performance of a set of operations comprising:
detecting a watermark embedded in a media content;
decoding the watermark to obtain a first sequence of data symbols;
determining that the first sequence of the data symbols is invalid;
swapping, based on the determining that the first sequence of the data symbols is invalid, at least two data symbols of the first sequence of the data symbols to form a second sequence of data symbols; and
storing the second sequence of data symbols.

### Claim 17 (depends on 16)

The non-transitory computer-readable storage medium of claim 16, wherein the swapping of at least two data symbols comprises using one of a plurality of configurations; wherein the plurality of configurations comprises at least a first configuration and a second configuration; wherein the first configuration corresponds to swapping a first pair of data symbols in the first sequence; and wherein the second configuration corresponds to swapping a different second pair of data symbols in the first sequence.

### Claim 18 (depends on 16)

The non-transitory computer-readable storage medium of claim 16, wherein the swapping of at least two symbols comprises using one of a plurality of swapping configurations; and wherein each swapping configuration of the plurality of swapping configurations correspond to different timestamp cycles.

### Claim 19 (depends on 16)

The non-transitory computer-readable storage medium of claim 16, the set of operations further comprising:
determining that the second sequence of data symbols is valid; and
wherein the storing is based on the determining that the second sequence of data symbols is valid.

### Claim 20 (depends on 19)

The non-transitory computer-readable storage medium of claim 19, the set of operations further comprising:
storing, based on determining that the second sequence of data symbols is valid, a final timestamp.

### Claim 21 (depends on 20)

The non-transitory computer-readable storage medium of claim 20, wherein the final timestamp is determined by:
associating, based on determining that the second sequence of data symbols is valid, a timestamp cycle with the watermark, wherein the watermark comprises a first sequence of timestamp symbols corresponding to a first timestamp; and
updating, using the timestamp cycle, the first sequence of timestamp symbols to form the final timestamp.
