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 keypair 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 lossless compression to reduce to the final size the intermediate representation as indices. The efficiency of the lossless 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)
 Publication Date:
 Research Org.:
 Los Alamos National Laboratory (LANL), Los Alamos, NM
 OSTI Identifier:
 871696
 Patent Number(s):
 US 5778102
 Assignee:
 Regents of University of California, Office of Technology (Alameda, CA) LANL
 DOE Contract Number:
 W7405ENG36
 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; keypair; 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; lossless; 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.. 1998.
"Compression embedding". United States.
doi:. 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 keypair 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 lossless compression to reduce to the final size the intermediate representation as indices. The efficiency of the lossless 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 = 1998,
month = 1
}

A method of embedding auxiliary information into the digital representation of host data created by a lossy compression technique is disclosed. The method applies to data compressed with lossy algorithms based on series expansion, quantization to a finite number of symbols, and entropy coding. Lossy compression methods represent the original data as integer indices having redundancy and uncertainty in value by one unit. Indices which are adjacent in value are manipulated to encode auxiliary data. By a substantially reverse process, the embedded auxiliary data can be retrieved easily by an authorized user. Lossy compression methods use lossless compressions known alsomore »

Compression embedding
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 keypair 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 uncertaintymore » 
Compression embedding
A method of embedding auxiliary information into the digital representation of host data created by a lossy compression technique. The method applies to data compressed with lossy algorithms based on series expansion, quantization to a finite number of symbols, and entropy coding. Lossy compression methods represent the original data as integer indices having redundancy and uncertainty in value by one unit. Indices which are adjacent in value are manipulated to encode auxiliary data. By a substantially reverse process, the embedded auxiliary data can be retrieved easily by an authorized user. Lossy compression methods use lossless compressions known also as entropymore » 
Data embedding
A method is disclosed for embedding auxiliary information into a set of host data, such as a photograph, television signal, facsimile transmission, or identification card. All such host data contain intrinsic noise, allowing pixels in the host data which are nearly identical and which have values differing by less than the noise value to be manipulated and replaced with auxiliary data. As the embedding method does not change the elemental values of the host data, the auxiliary data do not noticeably affect the appearance or interpretation of the host data. By a substantially reverse process, the embedded auxiliary data canmore »