Abstract
A new Interpolation based Reversible Data Hiding (IRDH) scheme is reported in this paper. For different applications of an IRDH scheme to the digital image, video, multimedia, big-data and biological data, the embedding capacity requirement usually varies. Disregarding this important consideration, existing IRDH schemes do not offer a better embedding rate-distortion performance for varying size payloads. To attain this varying capacity requirement with our proposed adaptive embedding, we formulate a capacity control parameter and propose to utilize it to determine a minimum set of embeddable bits in a pixel. Additionally, we use a logical (or bit-wise) correlation between the embeddable pixel and estimated versions of an embedded pixel. Thereby, while a higher range between an upper and lower limit of the embedding capacity is maintained, a given capacity requirement within that limit is also attained with a better-embedded image quality. Computational modeling of all new processes of the scheme is presented, and performance of the scheme is evaluated with a set of popular test-images. Experimental results of our proposed scheme compared to the prominent IRDH schemes have recorded a significantly better-embedding rate-distortion performance.
Highlights
Reversible data hiding (RDH), known as a reversible or lossless watermarking, is being widely investigated for different applications to the digital image, video, multimedia, big-data and biological data [1,2,3,4,5,6,7,8,9,10]
In Section Computational efficiency of our simplified PI technique (SPI) technique, we analyze the computational efficiency of our SPI technique, and in Section Rate-distortion performance of the proposed scheme, the embedding rate-distortion performance of our interpolation-based RDH (IRDH) scheme is analyzed and
SSIM values are computed using Eq (12), where μy and μy0 are the average values of yi,j and y0i;j, and s2y and s2y0 are the variance of yi,j and y0i;j, respectively;σy,y0 is the covariance of yi,j and yi0;j; and c1 = (k1L)2 and c2 = (k2L)2 are two regularization constants for the 2L − 1 dynamic range of the pixel values and a set of small constants, k1 and k2 [41]
Summary
Reversible data hiding (RDH), known as a reversible or lossless watermarking, is being widely investigated for different applications to the digital image, video, multimedia, big-data and biological data [1,2,3,4,5,6,7,8,9,10]. A recent DLE based IRDH scheme reported in [29] introduced Base-3 conversion of the embeddable data bits and demonstrated an improved rate-distortion performance with the embedding of a large size payload, which includes location maps for complete extraction of the embedded data. Those location maps are compressed and embedded along with the base-converted secret data, this essentially reduces the effective embedding capacity of the scheme [38]. We formulate the capacity control parameter more formally and present the simplified up-sampling, new embedding and extraction processes with their algorithmic details in Section Modeling our proposed IRDH scheme. 16 C padðIu0 pÞ ⊳ padding in the last row and last column of Iu0 p to make its size FM × FN
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.
