• 沒有找到結果。

A steganographic scheme based on wet paper codes suitable for uniformly distributed wet pixels

N/A
N/A
Protected

Academic year: 2022

Share "A steganographic scheme based on wet paper codes suitable for uniformly distributed wet pixels"

Copied!
2
0
0

加載中.... (立即查看全文)

全文

(1)
(2)

題名: A steganographic scheme based on wet paper codes suitable for uniformly distributed wet pixels

作者: Chang, Chin-Chen;Chou, Yung-Chen;Lin, Chia-Chen

貢獻者: Department of Computer Science and Information Engineering 關鍵詞: Communication channels (information theory);Cryptography;Image

quality;Inverse problems;Pixels;Automorphisms;Communications networking;Computational costs;Critical issues;General

approach;Gray-scale images;Hiding capacity;Hiding strategy;Host images;Image hiding schemes;Inverse matrix;Multiplication operations;Real-time application;Secret images;Steganographic schemes;Steganography;Stego image;Wet paper codes;Wet paper coding

日期: 2009

上傳時間: 2010-04-08T12:22:24Z 出版者: Asia University

摘要: Protecting data transmitted over the Internet has become a critical issue driven by the progress in data digitalization and communications networking over the past decade. The content being transmitted can be in the form of images, text and voice. To ensure that transmitted data are secure and cannot be tampered with or noticed by malicious attackers, several approaches have been proposed. Steganography is one general approach among them. The hiding capacity and image quality of stego-images are two major measures with which to evaluate an image hiding scheme. To enhance the hiding capacity of Fridrich et al.'s scheme, an improved image hiding scheme for

grayscale images based on wet paper coding is proposed in this paper.

The significant difference between Fridrich et al.'s scheme and ours is that we shuffle all the pixels in the host image by adopting toral automorphism, then segment all pixels before using our proposed wet pixel hiding strategies to hide the data. Experimental results show that our proposed scheme embeds a larger-sized secret image while maintaining acceptable image quality of the stego-image better than

(3)

Fridrich et al.'s scheme does. Moreover, the computational cost of our proposed scheme is significantly less than that of Fridrich et al.'s scheme because inverse matrix and multiplication operations are not required. Therefore, our proposed scheme is suitable for real time applications.

參考文獻

相關文件

The case where all the ρ s are equal to identity shows that this is not true in general (in this case the irreducible representations are lines, and we have an infinity of ways

Light rays start from pixels B(s, t) in the background image, interact with the foreground object and finally reach pixel C(x, y) in the recorded image plane. The goal of environment

Schools participating in the Pilot Scheme on Promoting Interflows between Sister Schools in Hong Kong and the Mainland (the “Pilot Scheme”) have been organising various

For a deep NNet for written character recognition from raw pixels, which type of features are more likely extracted after the first hidden layer.

contributions to the nearby pixels and writes the final floating point image to a file on disk the final floating-point image to a file on disk. • Tone mapping operations can be

 After the graph is constructed, we can realize that for all

The proof is suitable for R n if the statement is that every closed set in R n is the intersection of a countable collection of open sets.. All we need is to change intervals

For your reference, the following shows an alternative proof that is based on a combinatorial method... For each x ∈ S, we show that x contributes the same count to each side of