Sharif Digital Repository

A family of matrix embedding steganographic schemes for digital images is investigated. The target schemes are applied to blocks of n pixels in a cover image. In every block, at most m pixels are allowed to change with q-ary steps. We have derived some upper bounds on the embedding efficiency of these schemes for different values on m. It is also shown that these upper bounds approach the general upper bound on the embedding efficiency of q-ary steganography. For the case of q=3, we have shown that there is no feasible optimum member of the family for m=2, although for m=1, a well-known example exists. Instead, for m=2, a new close-to-bound scheme in the family is presented which exploits... 

Many high performance steganographic schemes work at a limited or sparsely distributed set of embedding rates. We have shown that some steganographic changes will be wasted as these schemes are utilized individually for messages of various lengths. To measure the wasted changes and compare different schemes in this respect, we have built a framework based on two new criteria: the Relative Change Waste (RCW) and the Expected Changes per Pixel (ECP). To decrease the wasted changes a systematic combination of schemes is introduced and proved to be equivalent to nonlinear interpolation of points in a two-dimensional space. We have proved that a special case which leads to a linear interpolation... 

Multi-layer schemes have been proposed for steganography. Also some authors have combined these methods with the idea of wet paper codes and gained higher embedding efficiency. This paper proposes a generalized multi-layer method for wet paper embedding. First, the cover bits are divided into blocks and, by combining these bits in groups of 3, a pyramid is formed. Next, the secret message is embedded through a layer-by-layer procedure. The proposed method has higher embedding efficiency in some cases and provides more flexibility for choosing the embedding payload, especially in lower payload conditions  

A family of matrix embedding steganographic schemes for digital images is investigated. The target schemes are applied to blocks of n pixels in a cover image. In every block, at most m pixels are allowed to change with q-ary steps. We have derived some upper bounds on the embedding efficiency of these schemes for different values on m. It is also shown that these upper bounds approach the general upper bound on the embedding efficiency of q-ary steganography. For the case of q=3, we have shown that there is no feasible optimum member of the family for m=2, although for m=1, a well-known example exists. Instead, for m=2, a new close-to-bound scheme in the family is presented which exploits...