Modified Matrix Encoding Technique for Minimal Distortion Steganography

Benchmarking for Steganography

“…For example, methods that use matrix embedding [14] exhibit sharp non-linear decrease in detectability with decreasing payload due to significantly lower number of embedding changes, while other methods do not allow matrix embedding (e.g., adaptive schemes). Moreover, some steganographic algorithms are inherently limited to binary codes, such as methods based on perturbed quantization [25,15], while methods that use ±1 type of embedding can utilize more powerful ternary codes [14]. Thus, one steganographic method can be embedding significantly higher payload than some other method for the same distortion budget.…”

Ternary Bose - Chaudhuri - Hocquenghem (BCH) with t = 2 code for steganography

“…The concept was introduced by Fridrich et al [10], [11], [12], [13], [14], [15], [19]. The method creates JPEG images from original bitmap image and utilizes side information from bitmap image to choose DCT coefficients which cause minimum distortion effect.…”

Minimizing additive distortion functions with non-binary embedding operation in steganography

“…Note that when ̺ i = 1, D is the number of embedding changes. In the MMx algorithm [14], ̺ i is dependent on the quantization error of the ith DCT coefficient.…”

“…Since Crandal [3] pointed out the connection between minimization of D and syndrome coding, many practical algorithms for the binary embedding operation have been proposed, such as those based on Hamming codes [19,14], BCH codes [17,20], random codes [13], and their combination [21]. Special codes, called wet paper codes, were proposed for embedding with wet pixels [4,11] (pixels prohibited to be modified for which I i = {x i }).…”

“…At least, this is how today's least detectable image steganographic schemes work [14,20,16]. This paper provides a coding scheme how to embed with minimal distortion once the steganographer agreed on the distortion function and the embedding operation.…”