Paper
17 February 2006 Matrix embedding for large payloads
Author Affiliations +
Proceedings Volume 6072, Security, Steganography, and Watermarking of Multimedia Contents VIII; 60721W (2006) https://doi.org/10.1117/12.639933
Event: Electronic Imaging 2006, 2006, San Jose, California, United States
Abstract
Matrix embedding is a general coding method that can be applied to most steganographic schemes to improve their embedding efficiency-the number of message bits embedded per one embedding change. Because smaller number of embedding changes is less likely to disrupt statistic properties of the cover object, schemes that employ matrix embedding generally have better steganographic security. This gain is more important for long messages than for shorter ones because longer messages are easier to detect. Previously introduced approaches to matrix embedding based on Hamming codes are, however, not efficient for long messages. In this paper, we present novel matrix embedding schemes that are effcient for embedding messages close to the embedding capacity. One is based on a family of codes constructed from simplex codes and the second one on random linear codes of small dimension. The embedding effciency of the proposed methods is evaluated with respect to theoretically achievable bounds.
© (2006) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Jessica Fridrich and David Soukal "Matrix embedding for large payloads", Proc. SPIE 6072, Security, Steganography, and Watermarking of Multimedia Contents VIII, 60721W (17 February 2006); https://doi.org/10.1117/12.639933
Lens.org Logo
CITATIONS
Cited by 37 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Binary data

Matrices

Radon

Algorithm development

Coding theory

Computer programming

Image compression

RELATED CONTENT

Convolutional codes for partial-response channels
Proceedings of SPIE (December 08 1995)
New quantization matrices for JPEG steganography
Proceedings of SPIE (May 02 2007)
Fast recursive-least-squares algorithms for Toeplitz matrices
Proceedings of SPIE (December 01 1991)
Writing on wet paper
Proceedings of SPIE (March 21 2005)

Back to Top