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. 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%.
- Inventors:
-
- (Los Alamos, NM)
- Los Alamos, NM
- Issue Date:
- Research Org.:
- Los Alamos National Laboratory (LANL), Los Alamos, NM (United States)
- OSTI Identifier:
- 871696
- Patent Number(s):
- 5778102
- Assignee:
- Regents of University of California, Office of Technology (Alameda, CA)
- Patent Classifications (CPCs):
-
H - ELECTRICITY H04 - ELECTRIC COMMUNICATION TECHNIQUE H04N - PICTORIAL COMMUNICATION, e.g. TELEVISION
- DOE Contract Number:
- W-7405-ENG-36
- Resource Type:
- Patent
- Country of Publication:
- United States
- Language:
- English
- Subject:
- compression; embedding; method; apparatus; auxiliary; information; digital; representation; host; data; created; lossy; technique; constructing; correspondence; values; key-pair; table; integer; index; existing; methods; apply; compressed; algorithms; based; series; expansion; quantization; finite; symbols; entropy; coding; represent; original; sequences; blocks; containing; indices; redundancy; uncertainty; value; unit; allowing; adjacent; manipulated; encode; included; improve; efficiency; white; noise; loss-less; reduce; final; size; intermediate; increased; manipulating; stage; manipulation; improves; performance; 10; compression methods; auxiliary information; compression technique; host data; auxiliary data; lossy compression; original data; embedding auxiliary; digital representation; series expansion; compression embedding; final size; data created; white noise; intermediate stage; algorithms based; data compressed; /382/
Citation Formats
Sandford, II, Maxwell T., Handel, Theodore G, and Bradley, Jonathan N. Compression embedding. United States: N. p., 1998.
Web.
Sandford, II, Maxwell T., Handel, Theodore G, & Bradley, Jonathan N. Compression embedding. United States.
Sandford, II, Maxwell T., Handel, Theodore G, and Bradley, Jonathan N. Thu .
"Compression embedding". United States. https://www.osti.gov/servlets/purl/871696.
@article{osti_871696,
title = {Compression embedding},
author = {Sandford, II, Maxwell T. and Handel, Theodore G and Bradley, Jonathan 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. 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%.},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = {Thu Jan 01 00:00:00 EST 1998},
month = {Thu Jan 01 00:00:00 EST 1998}
}