Compression embedding
- Los Alamos, NM
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%.
- Research Organization:
- Los Alamos National Laboratory (LANL), Los Alamos, NM
- DOE Contract Number:
- W-7405-ENG-36
- Assignee:
- Regents of University of California, Office of Technology (Alameda, CA)
- Patent Number(s):
- US 5778102
- OSTI ID:
- 871696
- Country of Publication:
- United States
- Language:
- English
Similar Records
Compression embedding
Compression embedding
Related Subjects
10
adjacent
algorithms
algorithms based
allowing
apparatus
apply
auxiliary
auxiliary data
auxiliary information
based
blocks
coding
compressed
compression
compression embedding
compression methods
compression technique
constructing
containing
correspondence
created
data
data compressed
data created
digital
digital representation
efficiency
embedding
embedding auxiliary
encode
entropy
existing
expansion
final
final size
finite
host
host data
improve
improves
included
increased
index
indices
information
integer
intermediate
intermediate stage
key-pair
loss-less
lossy
lossy compression
manipulated
manipulating
manipulation
method
methods
noise
original
original data
performance
quantization
reduce
redundancy
represent
representation
sequences
series
series expansion
size
stage
symbols
table
technique
uncertainty
unit
value
values
white
white noise