Robust high capacity data embedding

Abstract

We present a novel algorithm for high capacity data embedding. The proposed algorithm gives high hiding ratios up to 1/13 (1 embedded bit out of 13 raw image pixels) subject to JPEG compression with quality factor equals 75. With such high capacity, one can easily embed some important regions of an image inside the image itself with very small perceptual distortion. In the proposed algorithm, the DCT coefficients of 8/spl times/8 blocks are first rearranged using Hilbert curves. Data is embedded using projections on a random orthogonal set. The algorithm recovers the embedded data without any reference to the original image, with very low BER (around 0.1%). Finally, the proposed algorithm shows robustness to JPEG compression.