122 research outputs found

    Enhancement Of Pixel Value Ordering Based Data Hiding By Row Block Partition

    Get PDF
    The development of information and communication technology that support digital data transmission such as text, image, audio and video gives several effects. One of them is data security that becomes the main priority during the transmission process. Pixel-Value-Ordering (PVO) which one of data hiding methods can be implemented to achieve the requirement. It embeds data on maximum pixel and minimum pixel in a blok which is a part of the carrier image. However, PVO has capacity a problem, that only 2 bits per block can be hidden. To handle this problem, we propose a new approach by dividing blocks dinamically based on its complexity. These blocks are grouped into 4: smooth block, semi-smooth block, normal block and rough block. Using this approach, the stego capacity can be improved up to 2.6 times in average of previous method by keeping the quality stego more than 65 dB for all testing image

    ENHANCEMENT OF PIXEL VALUE ORDERING BASED DATA HIDING BY ROW BLOCK PARTITION

    Get PDF
    The development of information and communication technology that support digital data transmission such as text, image, audio and video gives several effects. One of them is data security that becomes the main priority during the transmission process. Pixel-Value-Ordering (PVO) which one of data hiding methods can be implemented to achieve the requirement. It embeds data on maximum pixel and minimum pixel in a blok which is a part of the carrier image. However, PVO has capacity a problem, that only 2 bits per block can be hidden. To handle this problem, we propose a new approach by dividing blocks dinamically based on its complexity. These blocks are grouped into 4: smooth block, semi-smooth block, normal block and rough block. Using this approach, the stego capacity can be improved up to 2.6 times in average of  previous method by keeping the quality stego more than 65 dB for all testing image

    Pixel grouping of digital images for reversible data hiding

    Get PDF
    Pixel Grouping (PG) of digital images has been a key consideration in recent development of the Reversible Data Hiding (RDH) schemes. While a PG kernel with neighborhood pixels helps compute image groups for better embedding rate-distortion performance, only horizontal neighborhood pixel group of size 1×3 has so far been considered. In this paper, we formulate PG kernels of sizes 3×1, 2×3 and 3×2 and investigate their effect on the rate-distortion performance of a prominent PG-based RDH scheme. Specially, a kernel of size 3×2 (or 2×3) that creates a pair of pixel-trios having triangular shape and offers a greater possible correlation among the pixels. This kernel thus can be better utilized for improving a PG-based RDH scheme. Considering this, we develop and present an improved PG-based RDH scheme and the computational models of its key processes. Experimental results demonstrated that our proposed RDH scheme offers reasonably better  embedding rate-distortion performance than the original scheme

    AN EFFECTIVE REVERSIBLE DATA HIDING METHOD BASED ON PIXEL-VALUE-ORDERING

    Get PDF
    This paper presents a new effective reversible data hiding method based on pixel-value-ordering (iGePVO-K) which is improvement of a recent GePVO-K method that recently is considered as a PVO-used method having highest embedding capacity. In comparison with GePVO-K method, iGePVO-K has the following advantages. First, the embedding capacity of the new method is higher than that of GePVO-K method by using data embedding formulas reasonably and reducing the location map size. Second, for embedding data, in the new method, each pixel value is modified at most by one, while in GePVO-K method, each pixel value may be modified by two. In fact, in the GePVO-K method, the largest pixels are modified by two for embedding bits 1 and by one for bits 0. This is also true for the smallest pixels. Meanwhile, in the proposed method, the largest pixels are modified by one for embedding bits 1 and are unchanged if embedding bits 0. Therefore, the stego-image quality in proposed method is better than that in GePVO-K method. Theoretical analysis and experiment results show that the proposed method has higher embedding capacity and better stego image quality than GePVO-K method

    Generalized PVO‐based dynamic block reversible data hiding for secure transmission using firefly algorithm

    Get PDF
    In this paper, we proposed a novel generalized pixel value ordering–based reversible data hiding using firefly algorithm (GPVOFA). The sequence of minimum and maximum number pixels value has been used to embed the secret data while prediction and modification are held on minimum, and the maximum number of pixel blocks is used to embed the secret data into multiple bits. The host image is divided into the size of noncoinciding dynamic blocks on the basis of firefly quadtree partition, whereas rough blocks are divided into a larger size; moreover, providing more embedding capacity used small flat blocks size and optimal location in the block to write the information. Our proposed method becomes able to embed large data into a host image with low distortion. The rich experimental results are better, as compared with related preceding arts

    Reversible difference expansion multi-layer data hiding technique for medical images

    Get PDF
    Maintaining the privacy and security of confidential information in data communication has always been a major concern. It is because the advancement of information technology is likely to be followed by an increase in cybercrime, such as illegal access to sensitive data. Several techniques were proposed to overcome that issue, for example, by hiding data in digital images. Reversible data hiding is an excellent approach for concealing private data due to its ability to be applied in various fields. However, it yields a limited payload and the quality of the image holding data (Stego image), and consequently, these two factors may not be addressed simultaneously. This paper addresses this problem by introducing a new non-complexity difference expansion (DE) and block-based reversible multi-layer data hiding technique constructed by exploring DE. Sensitive data are embedded into the difference values calculated between the original pixels in each block with relatively low complexity. To improve the payload capacity, confidential data are embedded in multiple layers of grayscale medical images while preserving their quality. The experiment results prove that the proposed technique has increased the payload with an average of 369999 bits and kept the peak signal to noise ratio (PSNR) to the average of 36.506 dB using medical images' adequate security the embedded private data. This proposed method has improved the performance, especially the secret size, without reducing much the quality. Therefore, it is suitable to use for relatively big payloads

    Adaptive Reversible Data Hiding Scheme for Digital Images Based on Histogram Shifting

    Get PDF
    Existing histogram based reversible data hiding schemes use only absolute difference values between the neighboring pixels of a cover image. In these schemes, maxima and minima points at maximum distance are selected in all the blocks of the image which causes shifting of the large number of pixels to embed the secret data. This shifting produces more degradation in the visual quality of the marked image. In this work, the cover image is segmented into blocks, which are classified further into complex and smooth blocks using a threshold value. This threshold value is optimized using firefly algorithm. Simple difference values between the neighboring pixels of complex blocks have been utilized to embed the secret data bits. The closest maxima and minima points in the histogram of the difference blocks are selected so that number of shifted pixels get reduced, which further reduces the distortion in the marked image. Experimental results prove that the proposed scheme has better performance as compared to the existing schemes. The scheme shows minimum distortion and large embedding capacity. Novelty of work is the usage of negative difference values of complex blocks for secret data embedding with the minimal number of pixel shifting

    Reversible Data Hiding scheme using modified Histogram Shifting in Encrypted Images for Bio-medical images

    Get PDF
    Existing Least Significant Bit (LSB) steganography system is less robust and the stego-images can be corrupted easily by attackers. To overcome these problems Reversible data hiding (RDH) techniques are used. RDH is an efficient way of embedding confidential message into a cover image. Histogram expansion and histogram shifting are effective techniques in reversible data hiding. The embedded message and cover images can be extracted without any distortion. The proposed system focuses on implementation of RDH techniques for hiding data in encrypted bio-medical images without any loss. In the proposed techniques the bio-medical data are embedded into cover images by reversible data hiding technique. Histogram expansion and histogram shifting have been used to extract cover image and bio- medical data. Each pixel is encrypted by public key of Paillier cryptosystem algorithm. The homomorphic multiplication is used to expand the histogram of the image in encrypted domain. The histogram shifting is done based on the homomorphic addition and adjacent pixel difference in the encrypted domain. The message is embedded into the host image pixel difference. On receiving encrypted image with additional data, the receiver using his private key performs decryption. As a result, due to histogram expansion and histogram shifting embedded message and the host image can be recovered perfectly. The embedding rate is increased in host image than in existing scheme due to adjacency pixel difference
    • 

    corecore