# US 2018/0025462 A1 · Method and Apparatus for Publishing Locational Copyrighted Watermarking Video

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

- Number: US 2018/0025462 A1
- Document ID: US20180025462A1
- Status: Published application
- Kind: A1
- Application number: 15/533,147
- Filed: 2014-12-18
- Published: 2018-01-25
- Earliest claimed: 2014-12-18
- Assignees: Nokia Technologies Oy
- Applicants: Nokia Technologies Oy
- Inventors: Desheng Li
- Web page: https://patentgrep.com/patent/US20180025462A1

## CPC

- G06T 1/0085: {Time domain based watermarking, e.g. watermarks spread over several images}
- G06F 21/16: Program or content traceability, e.g. by watermarking
- G06T 1/0028: {Adaptive watermarking, e.g. Human Visual System [HVS]-based watermarking}
- H04L 63/061: {for key exchange, e.g. in peer-to-peer networks (cryptographic mechanisms or cryptographic arrangements for key agreement H04L9/0838)}
- H04N 5/913: for scrambling {; for copy protection}
- G06F 2221/2111: Location-sensitive, e.g. geographical location, GPS
- G06T 2201/0051: Embedding of the watermark in the spatial domain
- G06T 2201/0052: Embedding of the watermark in the frequency domain
- G06T 2201/0064: for copy protection or copy management, e.g. CGMS, copy only once, one-time copy
- G06T 2201/0065: Extraction of an embedded watermark; Reliable detection
- G06T 2201/0083: whereby only watermarked image required at decoder, e.g. source-based, blind, oblivious
- H04N 19/467: characterised by the embedded information being invisible, e.g. watermarking
- H04N 2005/91335: {the copy protection signal being a watermark}
- G06T: IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- H04N: PICTORIAL COMMUNICATION, e.g. TELEVISION

## Abstract

Method and apparatus are disclosed for publishing locational copyrighted watermarking video. According to some embodiments, a method for embedding location information into a video comprises: separating the video into at least one key frame and at least one in-between frame set corresponding to the at least one key frame; receiving location data for the at least one key frame; encrypting the location data for the at least one key frame based on a location private key; and embedding the encrypted location data into the at least one key frame.

## Claims

### Claim at position 1

1-50. (Cancelled)

### Claim 51

An apparatus for embedding location information into a video, the apparatus comprising:
at least one processor; and
at least one memory including computer-executable code,
wherein the at least one memory and the computer-executable code are configured to, with the at least one processor, cause the apparatus to:
separate the video into at least one key frame and at least one in-between frame set corresponding to the at least one key frame;
receive location data for the at least one key frame;
encrypt the location data for the at least one key frame based on a location private key; and
embed the encrypted location data into the at least one key frame.

### Claim 52 (depends on 51)

The apparatus according to claim 51, wherein the computer-executable code are further configured to, when executed by the at least one processor, cause the apparatus to:
embed the encrypted location data into each frame of the at least one in-between frame set.

### Claim 53 (depends on 51)

The apparatus according to claim 51, wherein the computer-executable code are further configured to, when executed by the at least one processor, cause the apparatus to:
detect a longest stroke from the at least one key frame; and
embed the encrypted location data into the longest stroke.

### Claim 54 (depends on 52)

The apparatus according to claim 52, wherein the computer-executable code are further configured to, when executed by the at least one processor, cause the apparatus to:
detect a longest stroke from each frame of the at least one in-between frame set; and
embed the encrypted location data into the longest stroke.

### Claim 55

An apparatus for extracting location information from a video, the apparatus comprising:
at least one processor; and
at least one memory including computer-executable code,
wherein the at least one memory and the computer-executable code are configured to, with the at least one processor, cause the apparatus to:
separate the video into at least one key frame and at least one in-between frame set corresponding to the at least one key frame;
extract encrypted location data from the at least one key frame; and
decrypt the encrypted location data based on a location public key.

### Claim 56 (depends on 55)

The apparatus according to claim 55, wherein the computer-executable code are further configured to, when executed by the at least one processor, cause the apparatus to:
detect a longest stroke from the at least one key frame; and
extract the encrypted location data from the longest stroke.

### Claim 57 (depends on 55)

The apparatus according to claim 55, wherein the computer-executable code are further configured to, when executed by the at least one processor, cause the apparatus to:
in response to the encrypted location data being decrypted successfully, cause to play the video and show the decrypted location data.

### Claim 58

An apparatus for hiding at least first and second copyright watermark data into a video, the apparatus comprising:
at least one processor; and
at least one memory including computer-executable code,
wherein the at least one memory and the computer-executable code are configured to, with the at least one processor, cause the apparatus to:
separate the video into at least one key frame and at least one in-between frame set corresponding to the at least one key frame; and
merge the at least first and second copyright watermark data into the at least one key frame.

### Claim 59 (depends on 58)

The apparatus according to claim 58, wherein the computer-executable code are further configured to, when executed by the at least one processor, cause the apparatus to:
merge the at least first and second copyright watermark data into each frame of the at least one in-between frame set.

### Claim 60 (depends on 58)

The apparatus according to claim 58, wherein the computer-executable code are further configured to, when executed by the at least one processor, cause the apparatus to:
store the at least first and second copyright watermark data in a stack structure or an array structure; and
merge the stack structure or the array structure into the at least one key frame.

### Claim 61 (depends on 60)

The apparatus according to claim 60, wherein the computer-executable code are further configured to, when executed by the at least one processor, cause the apparatus to:
merge the stack structure or the array structure into each frame of the at least one in-between frame set.

### Claim 62

An apparatus for decoding a copyright watermark data from a video, the apparatus comprising:
at least one processor; and
at least one memory including computer-executable code,
wherein the at least one memory and the computer-executable code are configured to, with the at least one processor, cause the apparatus to:
separate the video into at least one key frame and at least one in-between frame set corresponding to the at least one key frame;
read a data structure from the at least one key frame, the data structure having stored therein at least first and second copyright watermark data; and
decode the first or second copyright watermark data according to a property of the data structure.

### Claim 63 (depends on 62)

The apparatus according to claim 62, wherein the computer-executable code are further configured to, when executed by the at least one processor, cause the apparatus to:
when the data structure is an array structure, decode the first or second copyright watermark data based on its corresponding private key; and
when the data structure is a stack structure, decode the first watermark data based on the first private key, and decode the second watermark data based on the first and second private keys, wherein the first watermark data is located on top of the second watermark data in the stack structure.
