Share Email Print

Proceedings Paper

Matrix embedding for large payloads
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 17 February 2006
PDF: 12 pages
Proc. SPIE 6072, Security, Steganography, and Watermarking of Multimedia Contents VIII, 60721W (17 February 2006); doi: 10.1117/12.639933
Show Author Affiliations
Jessica Fridrich, SUNY Binghamton (United States)
David Soukal, SUNY Binghamton (United States)

Published in SPIE Proceedings Vol. 6072:
Security, Steganography, and Watermarking of Multimedia Contents VIII
Edward J. Delp III; Ping Wah Wong, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?