Minimizing embedding impact in steganography using trellis-coded quantization

@inproceedings{Filler2010MinimizingEI,
  title={Minimizing embedding impact in steganography using trellis-coded quantization},
  author={Tom{\'a}s Filler and Jan Judas and Jessica J. Fridrich},
  booktitle={Electronic Imaging},
  year={2010}
}
In this paper, we propose a practical approach to minimizing embedding impact in steganography based on syndrome coding and trellis-coded quantization and contrast its performance with bounds derived from appropriate rate-distortion bounds. We assume that each cover element can be assigned a positive scalar expressing the impact of making an embedding change at that element (single-letter distortion). The problem is to embed a given payload with minimal possible average embedding impact. This… Expand
Minimizing Additive Distortion in Steganography Using Syndrome-Trellis Codes
TLDR
This paper proposes a complete practical methodology for minimizing additive distortion in steganography with general (nonbinary) embedding operation and reports extensive experimental results for a large set of relative payloads and for different distortion profiles, including the wet paper channel. Expand
Optimizing Distortion in Steganography Using S-T Codes
This paper proposes a complete practical methodology for minimizing additive distortion in steganography with general (non binary) embedding operation. Let every possible value of every stego elementExpand
Minimizing Embedding Impact for H.264 Steganography by Progressive Trellis Coding
  • Yu Wang, Yun Cao, Xianfeng Zhao
  • Computer Science
  • IEEE Transactions on Information Forensics and Security
  • 2021
TLDR
A novel coding strategy to achieve distortion minimization for H.264 steganography with quantized discrete cosine transform (QDCT) coefficients, named progressive trellis coding (PTC). Expand
Performances of polar codes in steganographic embedding impact minimization
TLDR
A new practical polar coding methodology for constructing steganographic scheme using syndrome coding with binary embedding operation, which minimizes the embedding impact with a reduced time complexity compared to the first Polar Coding Steganography (PCS). Expand
An image steganography based on Multi-Layered Syndrome-Trellis Codes in DWT domain
TLDR
The non-binary embedding operations with Multi-Layered Syndrome-Trellis Codes (ML-STCs) are used to design image steganography method instead of simply binary embedding operation with STCs to maintain a good visual quality of stego-image and have a high security against steganalysis in space and wavelet domain. Expand
CEC: Cluster Embedding Coding for H.264 Steganography
TLDR
The proposed CEC scheme performs both message embedding and video compression in the block-wise manner where a cluster of elements in a cover block are modified simultaneously, and defines a joint distortion function on the cover block to reflect the features of rate-distortion optimization. Expand
A JPEG Steganographic Method Based on Syndrome-Trellis Codes with Wetness-Scale
Aiming at the JSTC’s shortcomings, we present an improved JPEG Steganographic method using Syndrome-Trellis Codes with Wetness-Scale in this paper. Firstly, the proposed method excludes the DCExpand
New Distortion Metric for Efficient JPEG Steganography Using Linear Prediction
TLDR
A new distortion metric is constructed for JPEG steganography, which employs a local linear predictor to generate both the intra- and inter-block prediction errors of a quantized DCT coefficeint, and then accumulates them to form the distortion metric for this coefficient. Expand
A Further Study of Optimal Matrix Construction for Matrix Embedding Steganography
TLDR
Experimental results show that compared with existing methods, two novel matrix embedding methods achieve higher embedding efficiency and faster embedding speed. Expand
Using of Polar Codes in Steganography
In this paper, we propose a new steganographic scheme based on the polar codes. The scheme works according to two steps. The first offers a stego vector from given cover vector and message. The stegoExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 36 REFERENCES
Practical methods for minimizing embedding impact in steganography
TLDR
A general framework and practical coding methods for constructing steganographic schemes that minimize the statistical impact of embedding by associating a cost of an embedding change with every element of the cover are proposed. Expand
Modified Matrix Encoding Technique for Minimal Distortion Steganography
TLDR
This paper proposes an efficient algorithm for information hiding in the LSBs of JPEG coefficients that derives the expected value of the embedding distortion as a function of the message length and the probability distribution of the JPEG quantization errors of cover images. Expand
Perturbed quantization steganography
TLDR
The recently proposed wet paper codes are used and a new approach to passive-warden steganography called perturbed quantization is introduced, which provides better steganographic security than current JPEG steganographers methods. Expand
Matrix embedding for large payloads
TLDR
Two new approaches to matrix embedding for large payloads suitable for practical steganographic schemes are presented-one based on a family of codes constructed from simplex codes and the second one based on random linear codes of small dimension. Expand
Embedding with syndrome coding based on BCH codes: The corrected version of this paper is now available as full text. To view the original document as presented in the printed proceedings (with its errors), download the supplemental file
With Matrix Embedding based on Hamming Codes, coding theory has entered the field of steganography. Even though this class of structured codes had been used successfully in practical systems toExpand
Influence of embedding strategies on security of steganographic methods in the JPEG domain
TLDR
The goal is to shed some light on how the choice of the embedding operation and domain, adaptive selection channels, and syndrome coding influence statistical detectability. Expand
Some Notes on Steganography
This essay presents some observations concerning low rate steganography in images where the amount of covert information is below one bit per pixel. This discussion is restricted to paletted images,Expand
Wet paper codes with improved embedding efficiency
TLDR
This paper proposes a new approach to wet paper codes using random linear codes of small codimension that at the same time improves the embedding efficiency (number of random message bits embedded per embedding change). Expand
Improving the Embedding Efficiency of Wet Paper Codes by Paper Folding
TLDR
A novel approach to wet paper codes is proposed by folding the cover into several layers and applying basic wet paper coding methods with low computational complexity to each layer to achieve high embedding efficiency. Expand
Fisher Information Determines Capacity of ε-Secure Steganography
TLDR
It is proved that the ±1 embedding operation is asymptotically optimal among all mutually independent embedding operations that modify cover elements by at most 1. Expand
...
1
2
3
4
...