Please use this identifier to cite or link to this item:
|標題:||A Novel Data Hiding Scheme for Binary Images with Low Distortion||作者:||Hsieh, W.C.
|關鍵字:||Data hiding;Steganography;Binary image;Visual artifact;steganographic method;lsb substitution;modulus function;large;payloads;authentication;quality;domain||Project:||Journal of Internet Technology||期刊/報告no：:||Journal of Internet Technology, Volume 11, Issue 7, Page(s) 1057-1069.||摘要:||
In this paper, we propose a novel data hiding scheme for binary image which is capable of significantly reducing the visual artifacts caused by secret data embedding. Our new scheme includes three parts. Firstly, the cover image represented by a binary sequence of 0 or 1 pixel values is subdivided into blocks of sub-images. For each block we introduce a simple yet efficient scheme to estimate a pixel's "flippable value" by examining its neighbor. We give high "flippable value" to a pixel where its neighbors are much different from the current pixel value being examined. Secondly, we utilize the Arnold transform to shuffle the binary image into a noise image. The transformation is conducted several times until each block of sub-image contains at least one pair of pixels with "flippable value," which indicates that this block of sub-image is feasible to embed a bit of secret message by flipping the corresponding pixel value. Finally, we present a novel data embedding technique, which employs three blocks of sub-image as a basic embedding unit. This technique ensures the basic unit to convey 3 bits of secret message by at most flipping two pixels with "flippable values" on any of two blocks. Our scheme belongs to the blind extraction where the secret data can be extracted without referring to the cover image. Experimental results show the stego image produced by our scheme is imperceptible to the human eyes. Comparing to existing schemes, our method produces the least image distortion, being 0.333 bits per pixel.
|Appears in Collections:||資訊科學與工程學系所|
Show full item record
TAIR Related Article
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.