• Title/Summary/Keyword: Bit embedding

Search Result 114, Processing Time 0.023 seconds

Secure Modulus Data Hiding Scheme

  • Kuo, Wen-Chung
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.3
    • /
    • pp.600-612
    • /
    • 2013
  • In 2006, Zhang and Wang proposed a data hiding scheme based on Exploiting Modification Direction (EMD) to increase data hiding capacity. The major benefit of EMD is providing embedding capacity greater than 1 bit per pixel. Since then, many EMD-type data hiding schemes have been proposed. However, a serious disadvantage common to these approaches is that the embedded data is compromised when the embedding function is disclosed. Our proposed secure data hiding scheme remedies this disclosure shortcoming by employing an additional modulus function. The provided security analysis of our scheme demonstrates that attackers cannot get the secret information from the stegoimage even if the embedding function is made public. Furthermore, our proposed scheme also gives a simple solution to the overflow/underflow problem and maintains high embedding capacity and good stegoimage quality.

A fast watermark embedding method for MPEG-2 bit stream (MPEG-2 비트 스트림에 대한 고속 워터마크 삽입방법)

  • 김성일;서정일;김구영;원치선
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 1997.11a
    • /
    • pp.151-154
    • /
    • 1997
  • In this paper, we propose a new watermarking algorithm for copyright protection of video data. The proposed algorithm inserts a watermark directly on the MPEG-2 bitstream. Since more and more video data are stored and transmitted in a compressed form, it is desirable to insert a watermark on the compressed bit stream to avoid the expensive full-decoding and re-encoding process. Embedding a watermark in the compressed domain, we can also avoid the effect of the compression error which may erase the watermark.

  • PDF

A Study on Korean Fake news Detection Model Using Word Embedding (워드 임베딩을 활용한 한국어 가짜뉴스 탐지 모델에 관한 연구)

  • Shim, Jae-Seung;Lee, Jaejun;Jeong, Ii Tae;Ahn, Hyunchul
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2020.07a
    • /
    • pp.199-202
    • /
    • 2020
  • 본 논문에서는 가짜뉴스 탐지 모델에 워드 임베딩 기법을 접목하여 성능을 향상시키는 방법을 제안한다. 기존의 한국어 가짜뉴스 탐지 연구는 희소 표현인 빈도-역문서 빈도(TF-IDF)를 활용한 탐지 모델들이 주를 이루었다. 하지만 이는 가짜뉴스 탐지의 관점에서 뉴스의 언어적 특성을 파악하는 데 한계가 존재하는데, 특히 문맥에서 드러나는 언어적 특성을 구조적으로 반영하지 못한다. 이에 밀집 표현 기반의 워드 임베딩 기법인 Word2vec을 활용한 텍스트 전처리를 통해 문맥 정보까지 반영한 가짜뉴스 탐지 모델을 본 연구의 제안 모델로 생성한 후 TF-IDF 기반의 가짜뉴스 탐지 모델을 비교 모델로 생성하여 두 모델 간의 비교를 통한 성능 검증을 수행하였다. 그 결과 Word2vec 기반의 제안모형이 더욱 우수하였음을 확인하였다.

  • PDF

Robust Watermarking Scheme Based on Radius Weight Mean and Feature-Embedding Technique

  • Yang, Ching-Yu
    • ETRI Journal
    • /
    • v.35 no.3
    • /
    • pp.512-522
    • /
    • 2013
  • In this paper, the radius weight mean (RWM) and the feature-embedding technique are used to present a novel watermarking scheme for color images. Simulations validate that the stego-images generated by the proposed scheme are robust against most common image-processing operations, such as compression, color quantization, bit truncation, noise addition, cropping, blurring, mosaicking, zigzagging, inversion, (edge) sharpening, and so on. The proposed method possesses outstanding performance in resisting high compression ratio attacks: JPEG2000 and JPEG. Further, to provide extra hiding storage, a steganographic method using the RWM with the least significant bit substitution technique is suggested. Experiment results indicate that the resulting perceived quality is desirable, whereas the peak signal-to-noise ratio is high. The payload generated using the proposed method is also superior to that generated by existing approaches.

High capacity multi-bit data hiding based on modified histogram shifting technique

  • Sivasubramanian, Nandhini;Konganathan, Gunaseelan;Rao, Yeragudipati Venkata Ramana
    • ETRI Journal
    • /
    • v.40 no.5
    • /
    • pp.677-686
    • /
    • 2018
  • A novel data hiding technique based on modified histogram shifting that incorporates multi-bit secret data hiding is proposed. The proposed technique divides the image pixel values into embeddable and nonembeddable pixel values. Embeddable pixel values are those that are within a specified limit interval surrounding the peak value of an image. The limit interval is calculated from the number of secret bits to be embedded into each embeddable pixel value. The embedded secret bits can be perfectly extracted from the stego image at the receiver side without any overhead bits. From the simulation, it is found that the proposed technique produces a better quality stego image compared to other data hiding techniques, for the same embedding rate. Since the proposed technique only embeds the secret bits in a limited number of pixel values, the change in the visual quality of the stego image is negligible when compared to other data hiding techniques.

XOR-based High Quality Information Hiding Technique Utilizing Self-Referencing Virtual Parity Bit (자기참조 가상 패리티 비트를 이용한 XOR기반의 고화질 정보은닉 기술)

  • Choi, YongSoo;Kim, HyoungJoong;Lee, DalHo
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.49 no.12
    • /
    • pp.156-163
    • /
    • 2012
  • Recently, Information Hiding Technology are becoming increasingly demanding in the field of international security, military and medical image This paper proposes data hiding technique utilizing parity checker for gray level image. many researches have been adopted LSB substitution and XOR operation in the field of steganography for the low complexity, high embedding capacity and high image quality. But, LSB substitution methods are not secure through it's naive mechanism even though it achieves high embedding capacity. Proposed method replaces LSB of each pixel with XOR(between the parity check bit of other 7 MSBs and 1 Secret bit) within one pixel. As a result, stego-image(that is, steganogram) doesn't result in high image degradation. Eavesdropper couldn't easily detect the message embedding. This approach is applying the concept of symmetric-key encryption protocol onto steganography. Furthermore, 1bit of symmetric-key is generated by the self-reference of each pixel. Proposed method provide more 25% embedding rate against existing XOR operation-based methods and show the effect of the reversal rate of LSB about 2% improvement.

PSpice Implementation of Embedding Drive Synchronization using SC-CNN (SC-CNN을 이용한 임베딩 구동 동기기법의 PSpice 구현)

  • 배영철;김주완;손영우
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2003.05a
    • /
    • pp.505-508
    • /
    • 2003
  • In this paper, we introduce embedding drive synchronigation method using SC-CNN. SC-CNN provide us a good method to separate interconnected state variables of a system respectively and to make it possible to change current component to voltage component in the state variables. Using this advantage, We suggest another synchronization method called Embedding Drive Synchronization. Proposed Embedding Drive Synchronization change general drive synchronization method a little bit. we put transmitted signal between into the input of the state variables of the received part, not entirely replacing it. and we showed it proved.

  • PDF

The Performance Analysis of Digital Watermarking based on Merging Techniques

  • Ariunzaya, Batgerel;Chu, Hyung-Suk;An, Chong-Koo
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.12 no.3
    • /
    • pp.176-180
    • /
    • 2011
  • Even though algorithms for watermark embedding and extraction step are important issue for digital watermarking, watermark selection and post-processing can give us an opportunity to improve our algorithms and achieve higher performance. For this reason, we summarized the possibilities of improvements for digital watermarking by referring to the watermark merging techniques rather than embedding and extraction algorithms in this paper. We chose Cox's function as main embedding and extraction algorithm, and multiple barcode watermarks as a watermark. Each bit of the multiple copies of barcode watermark was embedded into a gray-scale image with Cox's embedding function. After extracting the numbers of watermark, we applied the watermark merging techniques; including the simple merging, N-step iterated merging, recover merging and combination of iterated-recover merging. Main consequence of our paper was the fact of finding out how multiple barcode watermarks and merging techniques can give us opportunities to improve the performance of algorithm.

High Quality perceptual Steganographic Techiques (지각적으로 고화질을 보장하는 심층암층기술)

  • 장기식;정창호;이상진;양일우
    • Proceedings of the IEEK Conference
    • /
    • 2003.11b
    • /
    • pp.157-160
    • /
    • 2003
  • Recently, several steganographic algorithms for two-color binary images have been proposed. In this paper, we propose a steganographic algorithm which embeds a secret message into bitmap images and palette-based images. To embed a message, the suggested algorithm divides a bitmap image into bit-plane images from LSB-plane to MSB-plane for each pixel, and considers each bit-plane image as a binary one. The algorithm splits each bit-plane image into m$\times$n blocks. and embeds a r-bit(r=[log$_2$(mn+1]-1) message into the block. And our schemes embed a message to every bit-plane from LSB to MSB to maximize the amount of embedded message and to minimize the degradation. The schemes change at most two pixels in each block. Therefore, the maximal color changes of the new algorithm are much smaller than other bit-plane embedding schemes' such as the substantial substitution schemes.

  • PDF

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

  • Kang, Ji-Hong;Jin, Honglin;Choe, Yoon-Sik
    • Journal of Broadcast Engineering
    • /
    • v.16 no.5
    • /
    • pp.801-810
    • /
    • 2011
  • This paper proposes a new lossless data embedding algorithm on spatial domain of digital images. A single key parameter is required to embed and extract data in the algorithm instead of embedding any additional information such as the location map. A $3{\times}3$ window slides over the cover image by one pixel unit, and one bit can be embedded at each position of the window. So, the ideal embedding capacity equals to the number of pixels in an image. For further increase of embedding capacity, new weight parameters for the estimation of embedding target pixels have been used. As a result, significant increase in embedding capacity and better quality of the message-embedded image in high capacity embedding have been achieved. This algorithm is verified with simulations.