• Title/Summary/Keyword: reversible data hiding

Search Result 68, Processing Time 0.022 seconds

An Improved Reversible Data Hiding Technique using Histogram Characteristics of Image

  • Soo-Mok, Jung
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.15 no.1
    • /
    • pp.63-69
    • /
    • 2023
  • In this paper, we propose an effective reversible data hiding technique that increases the confidential data hiding amount of the NSAS technique itself by utilizing the characteristics of image. The proposed technique shifts the histogram using multiple zeros of the histogram and hides 2 bits of confidential data at each peak point. Using the proposed technique, the amount of confidential data that can be hidden is doubled compared to the existing technique, and high-quality stego-image can be created. Confidential data can be restored without loss from the stego- image, and the original cover image can be restored without loss. Through experiments, it was confirmed that the proposed technique can hide twice as much confidential data than the existing technique, and the image quality of the stego-image is very good with a maximum of 39.75dB.

A Lossless Data Hiding Scheme for VQ Indexes Based on Joint Neighboring Coding

  • Rudder, Andrew;Kieu, The Duc
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.8
    • /
    • pp.2984-3004
    • /
    • 2015
  • Designing a new reversible data hiding technique with a high embedding rate and a low compression rate for vector quantization (VQ) compressed images is encouraged. This paper proposes a novel lossless data hiding scheme for VQ-compressed images based on the joint neighboring coding technique. The proposed method uses the difference values between a current VQ index and its left and upper neighboring VQ indexes to embed n secret bits into one VQ index, where n = 1, 2, 3, or 4. The experimental results show that the proposed scheme achieves the embedding rates of 1, 2, 3, and 4 bits per index (bpi) with the corresponding average compression rates of 0.420, 0.483, 0.545, and 0.608 bit per pixel (bpp) for a 256 sized codebook. These results confirm that our scheme performs better than other selected reversible data hiding schemes.

Reversible Data Hiding in Permutation-based Encrypted Images with Strong Privacy

  • Shiu, Chih-Wei;Chen, Yu-Chi;Hong, Wien
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.2
    • /
    • pp.1020-1042
    • /
    • 2019
  • Reversible data hiding in encrypted images (RDHEI) provides some real-time cloud applications; i.e. the cloud, acting as a data-hider, automatically embeds timestamp in the encrypted image uploaded by a content owner. Many existing methods of RDHEI only satisfy user privacy in which the data-hider does not know the original image, but leaks owner privacy in which the receiver can obtains the original image by decryption and extraction. In the literature, the method of Zhang et al. is the one providing weak content-owner privacy in which the content-owner and data-hider have to share a data-hiding key. In this paper, we take care of the stronger notion, called strong content-owner privacy, and achieve it by presenting a new reversible data hiding in encrypted images. In the proposed method, image decryption and message extraction are separately controlled by different types of keys, and thus such functionalities are decoupled to solve the privacy problem. At the technique level, the original image is segmented along a Hilbert filling curve. To keep image privacy, segments are transformed into an encrypted image by using random permutation. The encrypted image does not reveal significant information about the original one. Data embedment can be realized by using pixel histogram-style hiding, since this property, can be preserved before or after encryption. The proposed method is a modular method to compile some specific reversible data hiding to those in encrypted image with content owner privacy. Finally, our experimental results show that the image quality is 50.85dB when the averaged payload is 0.12bpp.

High-Quality and Robust Reversible Data Hiding by Coefficient Shifting Algorithm

  • Yang, Ching-Yu;Lin, Chih-Hung
    • ETRI Journal
    • /
    • v.34 no.3
    • /
    • pp.429-438
    • /
    • 2012
  • This study presents two reversible data hiding schemes based on the coefficient shifting (CS) algorithm. The first scheme uses the CS algorithm with a mean predictor in the spatial domain to provide a large payload while minimizing distortion. To guard against manipulations, the second scheme uses a robust version of the CS algorithm with feature embedding implemented in the integer wavelet transform domain. Simulations demonstrate that both the payload and peak signal-to-noise ratio generated by the CS algorithm with a mean predictor are better than those generated by existing techniques. In addition, the marked images generated by the variant of the CS algorithm are robust to various manipulations created by JPEG2000 compression, JPEG compression, noise additions, (edge) sharpening, low-pass filtering, bit truncation, brightness, contrast, (color) quantization, winding, zigzag and poster edge distortion, and inversion.

Reversible Data Hiding Based on Block Median Preservation and image local characteristic

  • Qu, Xiao-Chao;Kim, Hyoung-Joong
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2011.04a
    • /
    • pp.986-989
    • /
    • 2011
  • Reversible data hiding is a technique that can embed information into cover media (image, video, voice signal) and can recover the original cover media after extracting the embedded information. In this papa, we propose a new reversible data hiding methods that based on block median preservation and the image local characteristic. By using the median value of a block, a high payload can be got and by considering the image local characteristic, a lot of distortion can be avoided and a high PSNR can be got. In the experiment, our methods can generate better result than the previous reversible data hiding methods.

An Improved Reversible Data Hiding Technique using Histogram Characteristics and Double Encryption Technique

  • Soo-Mok Jung
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.16 no.1
    • /
    • pp.132-139
    • /
    • 2024
  • In this paper, we proposed an effective technique that uses location-based encryption technique and spatial encryption technique to improve security vulnerabilities in previous reversible data hiding technique that can hide twice as much confidential data as the NSAS technique. If the proposed technique is applied to hide confidential data in an image, the same amount of confidential data can be hidden compared to the previous technique, but the security of confidential data is greatly enhanced. By hiding confidential data in an image using the proposed technique, high-quality stego-image can be generated, making it impossible to visually distinguish whether confidential data is hidden in the image. Additionally, confidential data can be restored from stego-image without loss, and the original cover image can also be restored without loss. Through experiments, it was confirmed that when confidential data is hidden by applying the proposed technique, the quality of the stego-image is maintained up to 39.73dB, and the security of the stego-image is greatly strengthened.

A Reversible Data Hiding Scheme Using 7×7 Sudoku Based on Secret Sharing (비밀 공유 기반의 7×7 스도쿠를 사용한 가역 정보 은닉 기법)

  • Kim, Young-Ju;Kim, Pyung-Han;Yoo, Kee-Young
    • Journal of Korea Multimedia Society
    • /
    • v.20 no.2
    • /
    • pp.261-270
    • /
    • 2017
  • Data hiding is a way to hide the information in multimedia media such as images or video. The scheme proposed by Nguyen and Chang, was able to embed, extract, and restore the cover image and the secret data using Sudoku. But in the extracting phase, the occurrence of duplicate values in the reference matrix was found to decrease the embedding capacity of secret data. This paper has proposed a reversible data hiding scheme while maintaining the quality of the image to provide high embedding capacity using $7{\times}7$ Sudoku and Shamir's secret sharing scheme.

Reversible Data Hiding in JPEG Images Using Ordered Embedding

  • Qian, Zhenxing;Dai, Shu;Chen, Boyang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.2
    • /
    • pp.945-958
    • /
    • 2017
  • This paper proposes a novel method of reversible data hiding in JPEG images. After analyzing the JPEG features, we provide a new algorithm of selecting appropriate blocks and coefficients to carry secret messages. Instead of embedding data into the histogram of all coefficients, we propose a strategy of ordered embedding to hide data by histogram shifts in several rounds. On the recipient end, secret messages can be exactly extracted, and the original JPEG image can be losslessly recovered. Experimental results show that high embedding rate can be achieved with limited distortions. Most importantly, the marked JPEG file generated by the proposed method requires less storage size than state-of-the-art works.

Reversible Data Hiding Using a Piecewise Autoregressive Predictor Based on Two-stage Embedding

  • Lee, Byeong Yong;Hwang, Hee Joon;Kim, Hyoung Joong
    • Journal of Electrical Engineering and Technology
    • /
    • v.11 no.4
    • /
    • pp.974-986
    • /
    • 2016
  • Reversible image watermarking, a type of digital data hiding, is capable of recovering the original image and extracting the hidden message with precision. A number of reversible algorithms have been proposed to achieve a high embedding capacity and a low distortion. While numerous algorithms for the achievement of a favorable performance regarding a small embedding capacity exist, the main goal of this paper is the achievement of a more favorable performance regarding a larger embedding capacity and a lower distortion. This paper therefore proposes a reversible data hiding algorithm for which a novel piecewise 2D auto-regression (P2AR) predictor that is based on a rhombus-embedding scheme is used. In addition, a minimum description length (MDL) approach is applied to remove the outlier pixels from a training set so that the effect of a multiple linear regression can be maximized. The experiment results demonstrate that the performance of the proposed method is superior to those of previous methods.

Reversible Data Hiding Scheme for VQ Indices Based on Absolute Difference Trees

  • Chang, Chin-Chen;Nguyen, Thai-Son;Lin, Chia-Chen
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.7
    • /
    • pp.2572-2589
    • /
    • 2014
  • Reversible data hiding is a technique for recovering original images without any distortion after secret data are extracted from the image. The technique continues to attract attention from many researchers. In this paper, we introduce a new reversible data hiding scheme based on the adjacent index differences of vector quantization (VQ) indices. The proposed scheme exploits the differences between two adjacent indices to embed secret data. Experimental results show that our scheme can achieve a lower compression rate than an earlier scheme by Yang and Lin. Our scheme's average compression rate, 0.44 bpp, outperforms that of Yang and Lin's scheme, which averages 0.53 bpp. Moreover, the embedding capacity of our scheme can rise to 1.45 bpi, which also is superior to that of Chang et al.'s scheme [35] (1.00 bpi)Yang and Lin's scheme [27] (0.91 bpi) as well as Chang et al.'s scheme [26] (0.74 bpi).