• 제목/요약/키워드: reversible data embedding

검색결과 51건 처리시간 0.019초

Reversible Watermarking with Adaptive Embedding Threshold Matrix

  • Gao, Guangyong;Shi, Yun-Qing;Sun, Xingming;Zhou, Caixue;Cui, Zongmin;Xu, Liya
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권9호
    • /
    • pp.4603-4624
    • /
    • 2016
  • In this paper, a new reversible watermarking algorithm with adaptive embedding threshold matrix is proposed. Firstly, to avoid the overflow and underflow, two flexible thresholds, TL and TR, are applied to preprocess the image histogram with least histogram shift cost. Secondly, for achieving an optimal or near optimal tradeoff between the embedding capacity and imperceptibility, the embedding threshold matrix, composed of the embedding thresholds of all blocks, is determined adaptively by the combination between the composite chaos and the average energy of Integer Wavelet Transform (IWT) block. As a non-liner system with good randomness, the composite chaos is suitable to search the optimal embedding thresholds. Meanwhile, the average energy of IWT block is calculated to adjust the block embedding capacity, and more data are embedded into those IWT blocks with larger average energy. The experimental results demonstrate that compared with the state-of-the-art reversible watermarking schemes, the proposed scheme has better performance for the tradeoff between the embedding capacity and imperceptibility.

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

  • 김영주;김평한;유기영
    • 한국멀티미디어학회논문지
    • /
    • 제20권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.

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)
    • /
    • 제9권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.

웨이블릿 영역에서 히스토그램 수정을 이용한 무손실 정보은닉 (Lossless Data Hiding Using Modification of Histogram in Wavelet Domain)

  • 정철호;엄일규;김유신
    • 대한전자공학회논문지SP
    • /
    • 제43권4호
    • /
    • pp.27-36
    • /
    • 2006
  • 무손실 정보은닉은 정보를 삽입하되 추출과정에서 원본 영상으로의 완벽한 복원이 가능하도록 정보를 삽입하는 기술이다. 본 논문에서는 웨이블릿 영역에서 영상에 대한 무손실 정보은닉 알고리즘을 제안한다. 제안된 알고리즘은 히스토그램 수정을 웨이블릿 계수에 적용한 방법으로 두 단계의 삽입과정으로 이루어진다. 1차 삽입과정에서 히스토그램을 수정함으로써 웨이블릿 계수에 정보를 은닉한다. 2차 삽입과정은 1차 삽입 과정에서 발생한 영상의 왜곡을 줄이는 동시에 정보를 은닉할 수 있는 방법으로 높은 삽입용량을 얻을 수 있게 한다. 제안 알고리즘은 모의실험을 통해 기존의 방법들보다 삽입용량 대 PSNR 측면에 서 향상된 성능을 보여주었다.

Reversible Data Hiding in Block Truncation Coding Compressed Images Using Quantization Level Swapping and Shifting

  • Hong, Wien;Zheng, Shuozhen;Chen, Tung-Shou;Huang, Chien-Che
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권6호
    • /
    • pp.2817-2834
    • /
    • 2016
  • The existing reversible data hiding methods for block truncation coding (BTC) compressed images often utilize difference expansion or histogram shifting technique for data embedment. Although these methods effectively embed data into the compressed codes, the embedding operations may swap the numerical order of the higher and lower quantization levels. Since the numerical order of these two quantization levels can be exploited to carry additional data without destroying the quality of decoded image, the existing methods cannot take the advantages of this property to embed data more efficiently. In this paper, we embed data by shifting the higher and lower quantization levels in opposite direction. Because the embedment does not change numerical order of quantization levels, we exploit this property to carry additional data without further reducing the image quality. The proposed method performs no-distortion embedding if the payload is small, and performs reversible data embedding for large payload. The experimental results show that the proposed method offers better embedding performance over prior works in terms of payload and image quality.

Reversible Data Hiding Algorithm Based on Pixel Value Ordering and Edge Detection Mechanism

  • Nguyen, Thai-Son;Tram, Hoang-Nam;Vo, Phuoc-Hung
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제16권10호
    • /
    • pp.3406-3418
    • /
    • 2022
  • Reversible data hiding is an algorithm that has ability to extract the secret data and to restore the marked image to its original version after data extracting. However, some previous schemes offered the low image quality of marked images. To solve this shortcoming, a new reversible data hiding scheme based on pixel value ordering and edge detection mechanism is proposed. In our proposed scheme, the edge image is constructed to divide all pixels into the smooth regions and rough regions. Then, the pixels in the smooth regions are separated into non overlapping blocks. Then, by taking advantages of the high correlation of current pixels and their adjacent pixels in the smooth regions, PVO algorithm is applied for embedding secret data to maintain the minimum distortion. The experimental results showed that our proposed scheme obtained the larger embedding capacity. Moreover, the greater image quality of marked images are achieved by the proposed scheme than that other previous schemes while the high EC is embedded.

Reversible Watermarking Method Using Optimal Histogram Pair Shifting Based on Prediction and Sorting

  • Hwang, Hee-Joon;Kim, Hyoung-Joong;Sachnev, Vasiliy;Joo, Sang-Hyun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제4권4호
    • /
    • pp.655-670
    • /
    • 2010
  • To be reversible as a data hiding method, the original content and hidden message should be completely recovered. One important objective of this approach is to achieve high embedding capacity and low distortion. Using predicted errors is very effective for increasing the embedding capacity. Sorting the predicted errors has a good influence on decreasing distortion. In this paper, we present an improved reversible data hiding scheme using upgraded histogram shifting based on sorting the predicted errors. This new scheme is characterized by the algorithm which is able to find the optimum threshold values and manage the location map effectively. Experimental results compared with other methods are presented to demonstrate the superiority of the proposed method.

Reversible Watermarking Using Adaptive Edge-Guided Interpolation

  • Dai, Ningjie;Feng, Guorui;Zeng, Qian
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제5권4호
    • /
    • pp.856-873
    • /
    • 2011
  • Reversible watermarking is an open problem in information hiding field, with embedding the encoded bit '1' or '0' into some sensitive images, such as the law enforcement, medical records and military images. The technique can retrieve the original image without distortion, after the embedded message has been extracted. Histogram-based scheme is a remarkable breakthrough in reversible watermarking schemes, in terms of high embedding capacity and low distortion. This scheme is lack of capacity control due to the requirement for embedding large-scale data, because the largest hidden capacity is decided by the amount of pixels with the peak point. In this paper, we propose a reversible watermarking scheme to enlarge the number of pixels with the peak point as large as possible. This algorithm is based on an adaptive edge-guided interpolation, furthermore, hides messages by interpolation-error, i.e. the difference between the original and interpolated image value. Simulation results compared with other state-of-the-art reversible watermarking schemes in this paper demonstrate the validity of the proposed algorithm.

지역적 유사성을 이용한 픽셀 값 예측 기법에 기초한 가역 데이터 은닉 알고리즘 (Reversible Data Embedding Algorithm based on Pixel Value Prediction Scheme using Local Similarity in Image)

  • 정수목
    • 한국정보전자통신기술학회논문지
    • /
    • 제10권6호
    • /
    • pp.617-625
    • /
    • 2017
  • 본 논문에서는 기밀 데이터를 커버 이미지에 은닉하는 효과적인 가역 데이터 은닉 기법을 제안하였다. 제안된 기법에서는 이미지에 존재하는 지역적 유사성을 이용하여 픽셀 값을 정확하게 예측하여 예측 이미지를 생성하였고, 생성된 예측 이미지와 원본 커버 이미지를 사용하여 차분 시퀀스를 생성한 후, 히스토그램 쉬프트 기법을 적용하여 기밀데이터가 은닉된 스테고 이미지(stego-image)를 생성하였다. 스테고 이미지로부터 기밀 데이터를 추출하고 원본 커버 이미지를 손실 없이 복원할 수 있다. 제안된 기법을 적용하면 기존의 APD 기법에 비하여 더 많은 기밀 데이터를 은닉할 수 있음을 실험으로 확인하였다.

효율적인 가역 데이터 은닉 기법 (An Efficient Reversible Data Hiding Algorithm)

  • 정수목
    • 서비스연구
    • /
    • 제6권1호
    • /
    • pp.71-81
    • /
    • 2016
  • Cover image에 데이터를 임베딩 하여 stego-image를 생성하고, stego-image로부터 cover image를 손실 없이 복원하며 임베딩 된 데이터를 손실 없이 복원할 수 있는 가역 데이터 은닉기법의 성능을 개선하는 효율적인 기법을 제안하였다. 제안된 기법에서의 임베딩 된 데이터 크기는 이전의 기법에 비하여 더 크고, stego-image의 PSNR값은 48dB보다 더 크게 되는 것이 보장된다. 실험을 통하여 제안된 기법의 성능을 확인하였다.