Directional PVO for reversible data hiding scheme with image interpolation
- PDF / 7,732,557 Bytes
- 31 Pages / 439.642 x 666.49 pts Page_size
- 58 Downloads / 216 Views
Directional PVO for reversible data hiding scheme with image interpolation Sudipta Meikap1 · Biswapati Jana2
Received: 21 July 2017 / Revised: 2 April 2018 / Accepted: 23 May 2018 © Springer Science+Business Media, LLC, part of Springer Nature 2018
Abstract Pixel Value Ordering (PVO) is an efficient data hiding scheme where pixels are ranked in ascending order within an image block and then modify minimum and maximum pixel value to embed secret data. The embedding capacity of existing PVO based data hiding schemes were limited to embed only two bits in a row of any block and unable to perform repeated embedding. To solve the existing problem, we have proposed a generalized directional PVO (DPVO) with varying block size. The original image is partitioned into blocks and then enlarged using image interpolation. A new parameter (α) is introduced and added with maximum pixel value and subtracted from minimum pixel value to maintain the order of the rank which is dependent on the size of the image block. To improve data hiding capacity, overlapped embedding has been considered in three different directions (1) Horizontal, (2) Vertical and (3) Diagonal of each block. Experiments show that the proposed scheme has a good margin of performance compared with the state-of-the-art methods. Several steganographic analysis deemed robust against several attacks. Keywords Reversible data hiding · Pixel-value-ordering · Prediction-error expansion · Embedding capacity · Steganalysis · Steganographic attacks
Sudipta Meikap
[email protected] Biswapati Jana [email protected] 1
Department of Computer Science, Hijli College, Paschim Medinipur, West Bengal, Pin-721306, India
2
Department of Computer Science, Vidyasagar University, Midnapore, West Bengal, Pin-721102, India
Multimed Tools Appl
1 Introduction Innocent hidden data communication is increasing day by day due to the demanding issue for online valuable information exchange. This can be categorized in two major categories, irreversible and reversible. Irreversible schemes are unable to recover original cover image whereas Reversible Data Hiding (RDH) can reconstruct original image after data extraction which is desirable in many human-centric application areas such as medical image processing, military communication, remote sensing, judicial application and used for copyright protection, authentication, tampered detection etc. The performance of RDH schemes are evaluated using two important parameters, such as data hiding capacity and visual distortion. The main challenges of an the efficient RDH scheme is to improve both data hiding capacity and visual quality by reducing pixel modification for a given amount of secret data. The early data hiding scheme was initiated by modifying LSB bits in cover image introduced by Turner [35] in 1989. There was asymmetry which can be overcome by Sharp [32] in 2001. To improve LSB based data hiding scheme, Milikainen [26] proposed good quality stegos. Recently, RDH schemes are attracted much attention to the researchers.
Data Loading...
