Abstract
Reversible data hiding (RDH) in dual images is a technique that shares secret messages into two similar shadow images, while the secret messages and the cover image can be restored only when those two shadows are gathered simultaneously. In this paper, a novel turtle shell-based RDH hiding scheme based on the symmetric property is presented in order to increase the embedding capacity and maintain good visual quality in dual images under the guidance of position-aware. First, we classify each pixel pair into one of four types according to their locations and then determine a sunflower area centered around it in order to construct the combination of positions and the embedding table. Using the embedding table, the secret messages are concealed into a cover image by generating two shadow images. At the decoder’s side, the complete restoration of the secret messages and the cover image can be accomplished by identifying the position relationship between the two stego-pixel pairs. The experimental results confirmed that the proposed position-aware guided RDH scheme is superior to some of the relevant works on the aspects of embedding capacity or image quality. In addition, the proposed scheme provides a secure communication that can effectively resist attacks on the pixel value difference histogram, relative entropy, and regular singular analysis.
Highlights
With the development of computer science and tele-communication, the acquisition and sharing of messages have become easy and fast
For Case 1 (UBE), there is a total of 62 position combinations, and each occupies a row of a quaternion sequence, (dt, lt), which indicates to modify the cover pixel pair (x, y) to the dual stego-pixel pairs, and, to carry a 62-ary secret digit, dt, under a total loss lt
CoImnpoarrdiseorn taondfuArnthaelyrsipsrove the excellent performance of the proposed scheme, we compared the results provided by the proposed scheme with the results provided by some releIvnaonrtdwerortoksf,uirnthcleurdpirnogvCe thhaenegxectelalel.n’st spcehrefomrme [a1n7c]e, Loef ethaenpdroHpuoasnedg’sscshcehmeme,ew[e19c]o,mL-in peatreadl.’tshsechreesmuelts[2p2r]o, vXiideeedt ably.’sthsechpermopeo[s2e3d], sCchheenmaenwdiGthutoh’es srcehsuemltsep[2ro4v],idanedd Cbyhesnomaned reHleovnagn’tswscohrekms,ein[2c5lu].ding Chang et al.’s scheme [17], Lee and Huang’s scheme [19], Lin et al.’s scFhiresmt,ew[e22c]o,mXpieareetdatlh.’es mscahxeimmeum[23E]R, CprhoevnidaenddbGyuvoa’rsiosucshescmheem[2e4s],[1a7n,1d9,C2h2–e2n5a] nandd Hoounrga’spspcrhoeamche,[a2l5l]o. f which are Reversible data hiding (RDH) schemes in dual images
Summary
With the development of computer science and tele-communication, the acquisition and sharing of messages have become easy and fast. In 2019, Lin et al [22] observed that there was room for improvement in the design of the turtle shell-based reference matrix, and their scheme succeeded in embedding a 2-ary secret digit into the pixel pair of the first shadow image and a 16-ary secret digit into the pixel pair of the second shadow image On average, this scheme provides an ER of up to 1.25 bpp, and its shadow images have considerable quality, with PSNRs of 49.38 dB and 45.55 dB, respectively. In order to achieve good visual quality, Chen and Guo [24] presented a new RDH scheme based on fully exploiting the combination of the orientations of each pixel pair in the two shadow images. They took a pixel pair as a pivot point and drew a three × three block around it.
Sign-in/Register to view highlights & summary 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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
