Abstract
Reversible data hiding (RDH) algorithm is developing rapidly for many years. Usually, the histogram shifting (HS) based RDH algorithm has two main steps: Firstly, a steep difference histogram is generated with some effective methods for difference. Secondly, by extending and shifting some differences in the histogram, bits of information can be embedded into the cover image which can be restored reversibly. In this paper, we proposed the second-order difference to obtain a steeper difference histogram. Firstly, we slide a window with size 2 × 2 through the image. For each block, we can get the two first-order differences by calculating the absolute values of the two differences for its two columns. Thus, the second-order difference of each block, which is the absolute values of the difference of the two first-order differences, can be obtained. By extending and shifting the second-order difference, a bit may be embedded into the block finally. Experiments reveal that the proposed algorithm outperforms the previous state-of-the-art RDH methods in terms of the computational complexity, image distortion and the embedding performance.
Highlights
Information security is becoming more and more important as the rapid development of information technology, so data hiding (DH) technology is becoming the best method to protect the information transmitted through public media [1], [2], where secret message is embedded into a cover digital medium such as image, video or text to produce a corresponding marked-medium
Based on second-order difference histogram (SODH), we select some highest bins for expansion embedding while shift the other bins to create vacancies, so, for each second-order difference di,j, the marked secondorder difference d i,j is calculated by d i,j =
Based on the analysis of histogram shifting (HS) and difference expansion (DE) technologies, a novel second-order HS algorithm is proposed in this paper
Summary
Information security is becoming more and more important as the rapid development of information technology, so data hiding (DH) technology is becoming the best method to protect the information transmitted through public media [1], [2], where secret message is embedded into a cover digital medium such as image, video or text to produce a corresponding marked-medium. Alattar developed it for color image data hiding [9], where the differences of four pixels are employed to embed 3 secret message bits and improved the embedding capacity (EC). Ni et al [22] proposed the first HS based RDH algorithm, which employed the high frequencies in image histogram for embedding data. It has low EC for the histogram of cover image. Wang et al [28] introduced a rate and distortion optimization model and employed genetic algorithm to search the nearly optimal zero and peak bins for the improvement of EC and the quality of marked image.
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.
