Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/100812
Title: | Channel models for high-capacity information hiding in images |
Authors: | Briffa, Johann A. Das, Manohar |
Keywords: | Cryptography Data compression (Computer science) Digital images -- Watermarking Coding theory Error-correcting codes (Information theory) |
Issue Date: | 2003 |
Publisher: | SPIE |
Citation: | Briffa, J. A., & Das, M. (2003, January). Channel models for high-capacity information hiding in images. In Mathematics of Data/Image Coding, Compression, and Encryption V, with Applications Vol. 4793, Seattle, WA, United States. 135-144. |
Abstract: | We consider the scenario of blind information hiding in images as a communications channel, where the channel noise is caused by the embedding and blind extraction method as well as by any lossy compression method utilized to store and transmit the image. We assume that the objectives of the information hiding method are the maximization of payload and its visual and statistical imperceptibility; also, we assume that the warden is passive. For the specific method of Spread Spectrum Image Steganography (SSIS) we show that the channel can be modeled as a Laplacian distribution, and use this to estimate the channel SNR to be expected for any given signal embedding strength by applying the technique to a range of typical images. Finally, we model the effects of various signal extraction methods and lossy compression. This allows a fair comparison with respect to payload capacity. The results shown in this paper are useful for maximizing the channel usage. |
URI: | https://www.um.edu.mt/library/oar/handle/123456789/100812 |
Appears in Collections: | Scholarly Works - FacICTCCE |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Channel_models_for_high_capacity_information_hiding_in_images_2003.pdf Restricted Access | 393.35 kB | Adobe PDF | View/Open Request a copy |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.