Abstract
Improving embedding efficiency is important for watermarking with large payloads. In this paper, we propose a coding scheme named Minority codes by observing the relationship between the populations and positions of the binary bits in a sequence whose length is an odd number. In such a sequence, there is always a bit value, whose population is minority. We observe that the positions of the minority bit in two complement sequences are the same. By using this property, we create Minority codes whose codebook is composed of a pair of complement sequences for each entry. Minority codes can be combined with watermarking algorithms to improve embedding efficiency, because we can always identify the codeword that causes fewer embedding changes according to the host image and the watermarking method. The performance of Minority codes is analyzed theoretically and supported experimentally. The complexity of Minority codes is quite low and suitable for large payloads.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Fridrich J, Soukal D (2006) Matrix embedding for large payloads. IEEE Trans Inf Foren Sec 1(3):390–394
Fridrich J, Goljan M, Soukal D (2006) Wet paper codes with improved embedding efficiency. IEEE Trans Inf Forensics Security 1(1):102–110
Galand F, Kabatiansky G (2003) Information hiding by coverings, in Proc. ITW, Paris, France, pp 151–154
Gou H, Wu M (2007) Improving embedding payload in binary image with super-pixels, in Proc. ICIP 2007, III-277-III-280, Oct. 2007
Huang HC, Chen YH (2009) Genetic fingerprinting for copyright protection of multicast media. Soft Comput 13(4):383–391
Huang HC, Chu CM, Pan JS (2009) The optimized copyright protection system with genetic watermarking. Soft Comput 13(4):333–343
Johnson NF, Duric Z, Jajodia S (2001) Information hiding. steganography and watermarking—attacks and countermeasures. Kluwer Academic, Boston
Lu H, Kot AC, Cheng J (2003) Secure data hiding in binary document images for authentication. Proc ISCAS 3:806–809
Moulin P, Koetter R (2005) Data-hiding codes. Proc IEEE 93(12):2083–2126
Petitcolas FAP, Anderson RJ, Kuhn MG (1999) Information hiding—a survey. Proc IEEE 87:1062
Van Dijk M, Willems F (2001) Embedding information in grayscale images, in Proc. 22nd Symp. Information and Communication Theory Benelux, Enschede, The Netherlands, May 15–16, pp 147–154
Westfeld (2001) High capacity despite better steganalysis (F5—a steganographic algorithm). In: Moskowitz IS (ed) Information Hiding, 4th International Workshop. New York, Springer-Verlag, Vol. 2137, pp 289–302, Lecture Notes Comput Sci
Wu M, Liu B (2004) Data hiding in binary images for authentication and annotation. IEEE Trans Multimedia 6(4):528–538
Wu M, Tang E, Liu B (2000) Data hiding in digital binary image, in IEEE Int. Conf. Multimedia & Expo (ICME’00), New York
Yang H, Kot AC (2007) Pattern-Based Data Hiding for Binary Image Authentication by Connectivity-Preserving, IEEE Transactions on Multimedia 9(3) April 2007
Acknowledgements
This work was supported by NSFC under Grants 60633030, 973 Program under Grant 2006CB303104 GDIID Program under Grant GDIID 200815046 and GDSTC program under Grant 2009B090300345.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Liu, H., Yao, X. & Huang, J. Minority codes with improved embedding efficiency for large payloads. Multimed Tools Appl 52, 431–443 (2011). https://doi.org/10.1007/s11042-009-0431-4
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11042-009-0431-4