# Compression embedding

## Abstract

A method and apparatus for embedding auxiliary information into the digital representation of host data created by a lossy compression technique and a method and apparatus for constructing auxiliary data from the correspondence between values in a digital key-pair table with integer index values existing in a representation of host data created by a lossy compression technique are disclosed. The methods apply to data compressed with algorithms based on series expansion, quantization to a finite number of symbols, and entropy coding. Lossy compression methods represent the original data as ordered sequences of blocks containing integer indices having redundancy and uncertainty of value by one unit, allowing indices which are adjacent in value to be manipulated to encode auxiliary data. Also included is a method to improve the efficiency of lossy compression algorithms by embedding white noise into the integer indices. Lossy compression methods use loss-less compression to reduce to the final size the intermediate representation as indices. The efficiency of the loss-less compression, known also as entropy coding compression, is increased by manipulating the indices at the intermediate stage. Manipulation of the intermediate representation improves lossy compression performance by 1 to 10%. 21 figs.

- Inventors:

- Issue Date:

- Research Org.:
- University of California

- Sponsoring Org.:
- USDOE, Washington, DC (United States)

- OSTI Identifier:
- 672590

- Patent Number(s):
- 5,778,102

- Application Number:
- PAN: 8-772,188

- Assignee:
- Univ. of California, Office of Technology Transfer, Alameda, CA (United States) PTO; SCA: 990200; PA: EDB-98:124008; SN: 98002024844

- DOE Contract Number:
- W-7405-ENG-36

- Resource Type:
- Patent

- Resource Relation:
- Other Information: PBD: 7 Jul 1998

- Country of Publication:
- United States

- Language:
- English

- Subject:
- 99 MATHEMATICS, COMPUTERS, INFORMATION SCIENCE, MANAGEMENT, LAW, MISCELLANEOUS; INFORMATION THEORY; DIGITAL SYSTEMS; DATA PROCESSING; ALGORITHMS; PERFORMANCE

### Citation Formats

```
Sandford, M.T. II, Handel, T.G., and Bradley, J.N.
```*Compression embedding*. United States: N. p., 1998.
Web.

```
Sandford, M.T. II, Handel, T.G., & Bradley, J.N.
```*Compression embedding*. United States.

```
Sandford, M.T. II, Handel, T.G., and Bradley, J.N. Tue .
"Compression embedding". United States.
```

```
@article{osti_672590,
```

title = {Compression embedding},

author = {Sandford, M.T. II and Handel, T.G. and Bradley, J.N.},

abstractNote = {A method and apparatus for embedding auxiliary information into the digital representation of host data created by a lossy compression technique and a method and apparatus for constructing auxiliary data from the correspondence between values in a digital key-pair table with integer index values existing in a representation of host data created by a lossy compression technique are disclosed. The methods apply to data compressed with algorithms based on series expansion, quantization to a finite number of symbols, and entropy coding. Lossy compression methods represent the original data as ordered sequences of blocks containing integer indices having redundancy and uncertainty of value by one unit, allowing indices which are adjacent in value to be manipulated to encode auxiliary data. Also included is a method to improve the efficiency of lossy compression algorithms by embedding white noise into the integer indices. Lossy compression methods use loss-less compression to reduce to the final size the intermediate representation as indices. The efficiency of the loss-less compression, known also as entropy coding compression, is increased by manipulating the indices at the intermediate stage. Manipulation of the intermediate representation improves lossy compression performance by 1 to 10%. 21 figs.},

doi = {},

journal = {},

number = ,

volume = ,

place = {United States},

year = {1998},

month = {7}

}