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

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

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

  • Yang, Ching-Yu;Lin, Chih-Hung
    • ETRI Journal
    • /
    • 제34권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.

A Reversible Audio Watermarking Scheme

  • Kim, Hyoung-Joong;Sachnev, Vasiliy;Kim, Ki-Seob
    • 정보통신설비학회논문지
    • /
    • 제5권1호
    • /
    • pp.37-42
    • /
    • 2006
  • A reversible audio watermarking algorithm is presented in this paper. This algorithm transforms the audio signal with the integer wavelet transform first in order to enhance the correlation between neighbor audio samples. Audio signal has low correlation between neighbor samples, which makes it difficult to apply difference expansion scheme. Second, a novel difference expansion scheme is used to embed more data by reducing the size of location map. Therefore, the difference expansion scheme used in this paper theoretically secures high embedding capacity under low perceptual distortion. Experiments show that this scheme can hide large number of information bits and keeps high perceptual quality.

  • PDF

차분 영상의 히스토그램을 이용한 무손실 영상 인증 방법 (Reversible Image Authentication Using Histogram of Difference Image)

  • 이상광;서영호;호요성
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2006년도 하계종합학술대회
    • /
    • pp.407-408
    • /
    • 2006
  • In this paper, we propose a new reversible image authentication technique based on watermarking where if the image is authentic, the distortion due to embedding can be completely removed from the watermarked image after the hidden data has been extracted. This technique utilizes histogram characteristics of the difference image and modifies pixel values slightly to embed more data than other reversible data hiding algorithm. The proposed scheme is quite simple and the execution time is rather short. Experimental results demonstrate that the proposed scheme can detect any modifications of the watermarked image.

  • PDF

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

움직이는 창을 이용한 고성능 무손실 데이터 삽입 방법 (High Performance Lossless Data Embedding Using a Moving Window)

  • 강지홍;;최윤식
    • 방송공학회논문지
    • /
    • 제16권5호
    • /
    • pp.801-810
    • /
    • 2011
  • 본 논문에서는 디지털 영상을 위한 공간 영역에서의 무손실 데이터 삽입 방법을 제안한다. 제안하는 방법은 데이터 삽입 및 추출을 위해 위치 지도 등의 부가 정보를 삽입하는 대신에 단 한 개의 파라미터 만을 필요로 한다. 삽입 과정에서는 $3{\times}3$ 크기의 창이 대상 영상 위를 한 화소 단위로 움직이며 각 위치에서 한 비트의 데이터를 삽입 할 수 있다. 따라서, 이상적인 삽입 용량은 영상의 화소수와 동일하다. 또한, 추가적인 실제 삽입 용량의 증가를 위해, 삽입 대상 화소의 예측을 위한 새로운 계수를 적용하였다. 그 결과 기존의 방법에 비해 삽입 용량이 매우 큰 폭으로 증가하고, 고용량 데이터 삽입 시의 영상 화질 또한 향상되었다. 제안 방법은 컴퓨터 시뮬레이션을 통해 검증하였다.

A novel, reversible, Chinese text information hiding scheme based on lookalike traditional and simplified Chinese characters

  • Feng, Bin;Wang, Zhi-Hui;Wang, Duo;Chang, Ching-Yun;Li, Ming-Chu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제8권1호
    • /
    • pp.269-281
    • /
    • 2014
  • Compared to hiding information into digital image, hiding information into digital text file requires less storage space and smaller bandwidth for data transmission, and it has obvious universality and extensiveness. However, text files have low redundancy, so it is more difficult to hide information in text files. To overcome this difficulty, Wang et al. proposed a reversible information hiding scheme using left-right and up-down representations of Chinese characters, but, when the scheme is implemented, it does not provide good visual steganographic effectiveness, and the embedding and extracting processes are too complicated to be done with reasonable effort and cost. We observed that a lot of traditional and simplified Chinese characters look somewhat the same (also called lookalike), so we utilize this feature to propose a novel information hiding scheme for hiding secret data in lookalike Chinese characters. Comparing to Wang et al.'s scheme, the proposed scheme simplifies the embedding and extracting procedures significantly and improves the effectiveness of visual steganographic images. The experimental results demonstrated the advantages of our proposed scheme.

의료 영상을 위한 추정오차 히스토그램 기반 가역 워터마킹 알고리즘 (Reversible Watermarking based on Predicted Error Histogram for Medical Imagery)

  • 오기태;장한별;도엄지;이해연
    • 정보처리학회논문지:소프트웨어 및 데이터공학
    • /
    • 제4권5호
    • /
    • pp.231-240
    • /
    • 2015
  • 의료 영상은 원본 콘텐츠의 품질을 유지하는 것이 중요한 동시에 사생활 보호의 요구가 증가함에 따라서 가역 워터마킹 기술에 대한 필요성이 증가하고 있다. 기존의 가역 워터마킹 알고리즘은 의료 영상이 아닌 일반 영상에서는 고용량 고품질을 유지할 수 있으나 영상 전체에 왜곡을 야기한다. 따라서 촬영 대상물의 품질 유지가 중요한 의료 영상에 직접적으로 적용하기에는 부적합하다는 단점을 가진다. 본 논문에서는 의료 영상의 촬영 대상물 영역의 영상 품질을 유지하며, 워터마크를 효율적으로 삽입할 수 있는 가역 워터마킹 알고리즘을 제안한다. 먼저 대상물과 배경 영역을 분할하기 위한 알고리즘을 설계하고, 그 후에 분할된 대상물과 배경에 대해 추정오차 히스토그램에 기반하여 가역 워터마킹 기법을 적용한다. 대상물 영역에는 삽입 레벨을 낮게 설정하고, 배경 영역에 삽입 레벨을 높게 설정함으로써 대상물의 화질은 최소한으로 변형을 하며 효율적인 삽입이 가능하도록 하였다. 실험에서 다양한 의료 영상에 대하여 제안한 알고리즘을 기존 추정오차 히스토그램 기반 가역 워터마킹 기술과 삽입 용량 및 영상 품질에 대한 비교를 수행하였고, 그 결과 제안하는 알고리즘이 기존 알고리즘에 비해 높은 영상 품질을 유지하면서 우수한 삽입 용량을 얻을 수 있었다.

A reversible data hiding scheme in JPEG bitstreams using DCT coefficients truncation

  • Zhang, Mingming;Zhou, Quan;Hu, Yanlang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제14권1호
    • /
    • pp.404-421
    • /
    • 2020
  • A reversible data hiding scheme in JPEG compressed bitstreams is proposed, which could avoid decoding failure and file expansion by means of removing of bitstreams corresponding to high frequency coefficients and embedding of secret data in file header as comment part. We decode original JPEG images to quantified 8×8 DCT blocks, and search for a high frequency as an optimal termination point, beyond which the coefficients are set to zero. These blocks are separated into two parts so that termination point in the latter part is slightly smaller to make the whole blocks available in substitution. Then spare space is reserved to insert secret data after comment marker so that data extraction is independent of recovery in receiver. Marked images can be displayed normally such that it is difficult to distinguish deviation by human eyes. Termination point is adaptive for variation in secret size. A secret size below 500 bits produces a negligible distortion and a PSNR of approximately 50 dB, while PSNR is also mostly larger than 30 dB for a secret size up to 25000 bits. The experimental results show that the proposed technique exhibits significant advantages in computational complexity and preservation of file size for small hiding capacity, compared to previous methods.

A Novel Reversible Data Hiding Scheme for VQ-Compressed Images Using Index Set Construction Strategy

  • Qin, Chuan;Chang, Chin-Chen;Chen, Yen-Chang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제7권8호
    • /
    • pp.2027-2041
    • /
    • 2013
  • In this paper, we propose a novel reversible data hiding scheme in the index tables of the vector quantization (VQ) compressed images based on index set construction strategy. On the sender side, three index sets are constructed, in which the first set and the second set include the indices with greater and less occurrence numbers in the given VQ index table, respectively. The index values in the index table belonging to the second set are added with prefixes from the third set to eliminate the collision with the two derived mapping sets of the first set, and this operation of adding prefixes has data hiding capability additionally. The main data embedding procedure can be achieved easily by mapping the index values in the first set to the corresponding values in the two derived mapping sets. The same three index sets reconstructed on the receiver side ensure the correctness of secret data extraction and the lossless recovery of index table. Experimental results demonstrate the effectiveness of the proposed scheme.

An Improved Data Hiding Algorithm for Increasing Hidden Capacity

  • Dae-Jea Cho
    • International Journal of Internet, Broadcasting and Communication
    • /
    • 제16권1호
    • /
    • pp.11-16
    • /
    • 2024
  • Illegal manipulation and alteration of digital content are becoming a social issue. To address this problem, there is an increasing demand for the development of technologies to prevent the manipulation and alteration of digital content. This paper proposes a data hiding algorithm capable of embedding a larger amount of confidential data in the original cover image while minimizing the degradation of image quality in stego images. The algorithm presented in this paper analyzes the characteristics of the image to extract corner points and then uses a method to insert watermarks around these extracted corner points. Additionally, through experimentation, it has been proven that this algorithm can insert a greater amount of watermark without degrading the image quality compared to other existing algorithms.