On optimal detection for matrix multiplicative data hiding
Pages 203 - 208
Abstract
This paper analyzes a multiplicative data hiding scheme, where the watermark bits are embedded within frames of a Gaussian host signal by two different, but arbitrary, embedding matrices. A closed form expression for the bit error rate (BER) of the optimal detector is derived when the frame sizes tend to infinity. Furthermore, a structure is proposed for the optimal detector which divides the detection process into two main blocks: host signal estimation and decision making. The proposed structure preserves optimality, and allows for a great deal of flexibility: The estimator can be selected according to the a priori knowledge about host signal. For example, if the host signal is an Auto-Regressive (AR) process, we argue that a Kalman filter may serve as the estimator. Compared to a direct implementation of the Neyman-Pearson detector, this approach results in significantly reduced complexity while keeping optimal performance.
References
[1]
M. Akhaee, S. Sahraeian, B. Sankur, and F. Marvasti. Robust scaling-based image watermarking using maximum-likelihood decoder with optimum strength factor. IEEE Transactions on Multimedia, 11(5):822--833, Aug. 2009.
[2]
M. Barni and F. Bartolini, editors. Watermarking Systems Engineering: Enabling Digital Assets Security and Other Applications. CRC Press, 1 edition, Feb. 2004.
[3]
Q. Cheng and T. Huang. Robust optimum detection of transform domain multiplicative watermarks. IEEE Transactions on Signal Processing, 51(4):906--924, Apr. 2003.
[4]
I. Cox, J. Kilian, F. Leighton, and T. Shamoon. Secure spread spectrum watermarking for multimedia. IEEE Transactions on Image Processing, 6(12):1673--1687, Dec. 1997.
[5]
J. P. Imhof. Computing the distribution of quadratic forms in normal variables. Biometrika, 48(3/4):419--426, Dec. 1961.
[6]
S. Katzenbeisser. Information Hiding Techniques for Steganography and Digital Watermarking. Artech Print on Demand, Dec. 1999.
[7]
S. M. Kay. Fundamentals of Statistical Signal Processing, Volume I: Estimation Theory. Prentice Hall, 1 edition, Apr. 1993.
[8]
S. M. Kay. Fundamentals of Statistical Signal Processing, Volume 2: Detection Theory. Prentice Hall, 1 edition, Feb. 1998.
[9]
S. Sahraeian, M. Akhaee, and F. Marvasti. Information hiding with optimal detector for highly correlated signals. In IEEE International Conference on Communications, 2009. ICC '09, pages 1--5, June 2009.
[10]
J. Seitz, editor. Digital Watermarking For Digital Media. Information Science Publishing, May 2005.
[11]
V. Solachidis and I. Pitas. Optimal detector for multiplicative watermarks embedded in the DFT domain of non-white signals. EURASIP Journal on Advances in Signal Processing, 2004(16):402--942, Dec. 2004.
[12]
A. Valizadeh and Z. Wang. An improved multiplicative spread spectrum embedding scheme for data hiding. Information Forensics and Security, IEEE Transactions on, 7(4):1127--1143, 2012.
Index Terms
- On optimal detection for matrix multiplicative data hiding
Recommendations
Data Hiding Using Flexible Multi-bit MER
ISBAST '13: Proceedings of the 2013 International Symposium on Biometrics and Security TechnologiesMulti-bit minimum error replacement (MER) is a method that can embed multi-bit logo/secret data into k least-significant bits (LSBs) of cover data only introduces minimum embedding error (MEE). However, k-LSBs MER suffers from weak robustness. Moreover, ...
A lossless robust data hiding scheme
This paper presents a lossless robust data hiding scheme. The original cover image can be recovered without any distortion after the hidden data have been extracted if the stego-image remains intact, and on the other hand, the hidden data can still be ...
A novel reversible data hiding scheme based on AMBTC compression technique
Data hiding encompasses a wide range of applications for embedding messages in content. However, hiding data inevitably destroys the host image, even though the distortion is imperceptible. To enhance the hiding capacity and maintain the quality of the ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
June 2013
242 pages
ISBN:9781450320818
DOI:10.1145/2482513
- General Chair:
- William Puech,
- Program Chairs:
- Marc Chaumont,
- Jana Dittmann,
- Patrizio Campisi
Copyright © 2013 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 17 June 2013
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
IH&MMSec '13
Sponsor:
IH&MMSec '13: ACM Information Hiding and Multimedia Security Workshop
June 17 - 19, 2013
Montpellier, France
Acceptance Rates
IH&MMSec '13 Paper Acceptance Rate 27 of 74 submissions, 36%;
Overall Acceptance Rate 128 of 318 submissions, 40%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 143Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)0
Reflects downloads up to 15 Feb 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in