# US 2003/0076245 A1 · Types-based, lossy data embedding

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

- Number: US 2003/0076245 A1
- Document ID: US20030076245A1
- Status: Published application
- Kind: A1
- Application number: 10/143,959
- Filed: 2002-05-14
- Published: 2003-04-24
- Earliest claimed: 2001-05-31
- Assignees: Southern Methodist University
- Inventors: Jerry Don Gibson; Mark Gavin Kokes; Geoffrey Charles Orsak; Victor James Stolpman
- Web page: https://patentgrep.com/patent/US20030076245A1

## CPC

- H04L 1/0006: {by adapting the transmission format}
- H04L 1/0007: {by modifying the frame length}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A new approach to data embedding within ITU G.722 and ITU G.711 based upon the method of types and universal classification is disclosed. A secondary data sequence is embedded in the original (host) data stream using the method of types. The embedded data is extracted using a type-based universal receiver, with or without the use of a key. The choice of type and rate for the embedded data is based upon an analysis of portions of the original ITU G.722 or ITU G.711 coded data stream. The universal receiver learns the type from the received data alone, and hence, there is no side information required as in previous data embedding techniques. The embedding process and the receiver may both be data adaptive, so the original data stream can be reconstructed at the decoder without error.

## Claims

### Claim 1

An embedded data encoder comprising:
a data precision module configured to determine a number of bits to embed in a data frame; and
a data-embedding module coupled to said data precision module and configured to receive a secondary data input and to modulate said data frame according to a secondary data symbol and a secondary data precision.

### Claim 2 (depends on 1)

The embedded data encoder according to claim 1, further including a universal classifier.

### Claim 3 (depends on 1)

The embedded data encoder according to claim 1, wherein the data precision module is adaptive.

### Claim 4 (depends on 1)

The embedded data encoder according to claim 1, wherein the embedded data includes at least one of e-mail data, video data, wireless data, control data, file-transfer data, quality-enhancement data, and storage data.

### Claim 5 (depends on 1)

The embedded data encoder according to claim 1, wherein the embedded data is associated with a key.

### Claim 6 (depends on 1)

The embedded data encoder according to claim 1, wherein the data precision module is configured for at least one of maximizing the embedded data, minimizing data errors, and adaptively embedding maximum data subject to a limit on lost data errors.

### Claim 7 (depends on 1)

The embedded data encoder according to claim 1, wherein the data embedding module is configured for at least one of modulation by circular shifting and modulation according to an identified data type.

### Claim 8 (depends on 2)

The embedded data encoder according to claim 2, wherein the universal classifier is configured for the method of types.

### Claim 9

A embedded data decoder comprising:
a data precision module configured to determine a number of bits embedded in a data frame; and
a data extraction module coupled to said data precision module and configured to produce a secondary data output and to demodulate said data frame according to a secondary data symbol and a secondary data precision, wherein said secondary data symbol is determined by M-ary hypothesis testing of said data frame.

### Claim 10 (depends on 9)

The embedded data decoder according to claim 9, further including a universal classifier.

### Claim 11 (depends on 9)

The embedded data decoder according to claim 9, wherein the data precision module is adaptive.

### Claim 12 (depends on 9)

The embedded data decoder according to claim 9, wherein the embedded data includes at least one of e-mail data, video data, wireless data, control data, file-transfer data, quality-enhancement data, and storage data.

### Claim 13 (depends on 9)

The embedded data decoder according to claim 9, wherein the embedded data is associated with a key.

### Claim 14 (depends on 9)

The embedded data decoder according to claim 9, wherein the data precision module is configured for at least one of maximizing the embedded data, minimizing data errors, and adaptively embedding maximum data subject to a limit on lost data errors.

### Claim 15 (depends on 9)

The embedded data decoder according to claim 9, wherein the data embedding module is configured for at least one of modulation by circular shifting and modulation according to an identified data type.

### Claim 16 (depends on 10)

The embedded data decoder according to claim 10, wherein the universal classifier is configured for the method of types.

### Claim 17

A system comprising:
a framing module configured to receive data input;
a mapping module coupled to said framing module;
an entropy module coupled to said mapping module;
a hypothesis testing module coupled to said entropy module;
a precision module coupled to said hypothesis testing module; and
a data-embedding module coupled to said precision module and said mapping module and configured to receive secondary data input.
a data-extracting module coupled to said precision module and said mapping module and configured to output secondary data output.

### Claim 18 (depends on 17)

The system according to claim 17, further including a universal classifier.

### Claim 19 (depends on 17)

The system according to claim 17, wherein the data precision module is adaptive.

### Claim 20 (depends on 17)

The system according to claim 17, wherein the embedded data includes at least one of e-mail data, video data, wireless data, control data, file-transfer data, quality-enhancement data, and storage data.

### Claim 21 (depends on 17)

The system according to claim 17, wherein the embedded data is associated with a key.

### Claim 22 (depends on 17)

The system according to claim 17, wherein the data precision module is configured for at least one of maximizing the embedded data, minimizing data errors, and adaptively embedding maximum data subject to a limit on lost data error.

### Claim 23 (depends on 17)

The system according to claim 17, wherein the data embedding module is configured for at least one of modulation by circular shifting or modulation according to an identified data type.

### Claim 24 (depends on 18)

The system according to claim 18, wherein the universal classifier is configured for the method of types.

### Claim 25

A method for data embedding, comprising the steps of:
(1) framing input codewords;
(2) mapping framed codewords into base master types;
(3) determining a number of bits that can be embedded into a frame;
(4) forming secondary bit sequences into embedded data symbols; and
(5) modulating a frame based on the embedded data symbols and a current frame type.

### Claim 26 (depends on 25)

The method according to claim 25, further comprising the step of universal classification.

### Claim 27 (depends on 25)

The method according to claim 25, wherein said step of determining a number of bits that can be embedded is adaptive.

### Claim 28 (depends on 25)

The method according to claim 25, further comprising the step of transmitting at least one of e-mail data, video data, wireless data, control data, file-transfer data, quality-enhancement data, and storage data.

### Claim 29 (depends on 25)

The method according to claim 25, wherein at least one of steps (1)-(5) is associated with a key.

### Claim 30 (depends on 25)

The method according to claim 25, wherein said step of determining a number of bits that can be embedded comprises at least one of maximizing the embedded data, minimizing data errors, and adaptively embedding maximum data subject to a limit on lost data errors.

### Claim 31 (depends on 25)

The method according to claim 25, further comprising at least one of the steps of modulation by circular shifting and modulation according to an identified data type.

### Claim 32 (depends on 26)

The method according to claim 26, wherein said step of universal classification comprises the method of types.

### Claim 33

A method for extracting embedded data, comprising the steps of:
(1) framing input (received) codewords;
(2) determining a number of bits that are embedded into a frame;
(3) demodulating a frame based on the embedded data symbols and a current frame type;
(4) reverse mapping base master types into framed codewords; and
(5) forming embedded data symbols into secondary bit sequences.

### Claim 34 (depends on 33)

The method according to claim 33, further comprising the step of universal classification.

### Claim 35 (depends on 33)

The method according to claim 33, wherein said step of determining a number of bits that can be extracted is adaptive.

### Claim 36 (depends on 33)

The method according to claim 33, further comprising the step of receiving at least one of e-mail data, video data, wireless data, control data, file-transfer data, quality-enhancement data, and storage data.

### Claim 37 (depends on 33)

The method according to claim 33, wherein at least one of steps (1)-(5) is associated with a key.

### Claim 38 (depends on 33)

The method according to claim 33, wherein said step of determining a number of bits that can be extracted comprises at least one of maximizing the embedded data, minimizing data errors, and adaptively extracting maximum data subject to a limit on lost data errors.

### Claim 39 (depends on 33)

The method according to claim 33, further comprising at least one of the steps of modulation by circular shifting and modulation according to an identified data type.

### Claim 40 (depends on 34)

The method according to claim 34, wherein said step of universal classification comprises the method of types.

### Claim 41 (depends on 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40)

A computer program product comprising:
computer storage media containing computer executable instructions stored therein, wherein said computer executable instructions, when executed by a computer, implement the method of at least one of claims 25-40.
