Abstract

Pattern substitution (PS) method (Ho et al., Comput. Stand. Interfaces 31:787–794, 2009) is a recent reversible data hiding method for binary images. It generates one pattern pair, the patterns in which are called PM and PF, and substitutes between them to embed one bit. Two types of PS have been proposed: non-overlapping PS and overlapping PS. However, Dong et al. (ETRI J. 37:990–1000, 2015) states that the overlapping PS sometimes cannot decode correctly, which is called as miscoding problem. Moreover, to the PS-based methods (Ho et al., Comput. Stand. Interfaces 31:787–794, 2009; Dong et al., ETRI J. 37:990–1000, 2015; Dong et al., Lect. Notes Comput. Sci. 6526:3516–3522, 2011), although chosen of two patterns to form the pattern pair which relates the embedding performance much, the previous methods only use a fixed pattern pair during the whole data hiding process. In order to overcome these two shortcomings, this paper proposes an adaptive overlapping PS method. Firstly, two modes of the embedding are proposed so that the miscoding problem can be solved. Secondly, one window which contains the context of current processing pixel is generated and updated when the process proceeds to the next pixel. Thus, the optimum pair of the local context for embedding can be chosen. Thirdly, in order to get a smaller location map, a three-round embedding mechanism is also proposed. With these three improvements, our method can embed larger payloads with less distortion than the previous works.

Highlights

  • Due to the rapid development of internet and computer technique, more and more multimedia files are stored and transmitted through the internet

  • Assume the binary cover image is denoted as B and this image is called as image or image matrix throughout the rest of the paper; the Pattern substitution (PS) method first transforms the image to difference matrix by Eq 1

  • To show how the adaptive embedding mechanism affects the performance, the same secret data is embedded to one image several times, and for each time, only the length of the window is set by different value

Read more

Summary

Introduction

Due to the rapid development of internet and computer technique, more and more multimedia files are stored and transmitted through the internet. Tseng et al [11] partition the host image into non-overlapping blocks, and embed one bit of secret data by flipping one binary pixel in that block. They proposed a quality control mechanism to improve the visual quality of the embedded image [12]. Excluding the block-based methods, Yang [20] used a morphological transform to achieve high embedding capacity All these algorithms are lossy and cannot be used to reversible data hiding. The proposed PWLC mechanism is applied to the specific patterns “000000” and “111111” in this edge area to achieve reversible data hiding. The experiments show that the adaptive embedding and the three-round embedding mechanism efficiently improve the PS method, and the comparison with the other stateof-the-art methods shows the superiority of the proposed method

Related work
7: Decompress LM1C to LM1
Experiments
Conclusion and further research
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call