Correlation-Based Watermarking Scheme Using Complete Complementary Code

Digital watermarking technologies with spread spectrum sequences (SS) have previously proposed. However, the SS sequences used in previous studies do not necessarily have good correlation properties. The previous studies also have proposed the complete complementary codes (CCC), which have an ideal auto-correlation and cross-correlation properties and methods for the construction and extension of the complete complementary codes. However, some methods in the studies do not have good auto-correlation or crosscorrelation properties. In this paper, we used the latest complete complementary code constructor to detect the embedded secret information from the watermarked images. In the experimental results, we successfully detected the secret information from the watermark against various attacks.

[1]  M. A. Mokhtar,et al.  The Twin Image Watermarking Algorithm (TIWA): A New Techniques for Single and Multi-Message Watermarking Based on Optimum Complete Complementary Codes , 2005, EUROCON 2005 - The International Conference on "Computer as a Tool".

[2]  Tetsuya Kojima,et al.  On digital watermarks based on complete complementary codes , 2009, 2009 Fourth International Workshop on Signal Design and its Applications in Communications.

[3]  Udaya Parampalli,et al.  A blind digital watermarking scheme based on complete complementary codes , 2011, 2011 Australian Communications Theory Workshop.

[4]  Xiaokang Lin,et al.  Iterative Method for Constructing Complete Complementary Sequences with Lengths of 2mN , 2005 .

[5]  N. Suchiro,et al.  A generation method for constructing (N,N,MN/P) complete complementary sequences , 2004, SympoTIC '04. Joint 1st Workshop on Mobile Future & Symposium on Trends In Communications (IEEE Cat. No.04EX877).

[6]  Naoki Suehiro,et al.  Very efficient frequency usage system using convolutional spread time signals based on complete complementary code , 2000, 11th IEEE International Symposium on Personal Indoor and Mobile Radio Communications. PIMRC 2000. Proceedings (Cat. No.00TH8525).

[7]  LI Shu-feng,et al.  Research of Simple Constructing Method of Complete Complementary Sequences , 2007 .

[8]  Xing Yang,et al.  New Complete Complementary Codes and Their Analysis , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[9]  Chadi Khirallah,et al.  Image-in-image hiding using complete complementary sequences , 2008, 2008 IEEE International Conference on Multimedia and Expo.

[10]  Markus G. Kuhn,et al.  Information hiding-a survey , 1999, Proc. IEEE.

[11]  Naoki Suehiro,et al.  General construction of periodic complete complementary codes composed of expanded modulatable orthogonal sequences , 2000, Proceedings ISCC 2000. Fifth IEEE Symposium on Computers and Communications.

[12]  N. Suehiro,et al.  Generalized method for constructing modulatable periodic complete complementary codes , 2001, 2001 IEEE Third Workshop on Signal Processing Advances in Wireless Communications (SPAWC'01). Workshop Proceedings (Cat. No.01EX471).

[13]  Takeshi Hashimoto,et al.  A Systematic Framework for the Construction of Optimal Complete Complementary Codes , 2010, IEEE Transactions on Information Theory.

[14]  Tetsuya Kojima,et al.  Properties of a Convoluted-Time and Code Division Multiple Access Communication Systems Based upon Complete Complementary Codes , 2008, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[15]  V. Kyovtorov,et al.  Comparison of communication signals for passive radar application , 2010, 11-th INTERNATIONAL RADAR SYMPOSIUM.

[16]  Min Wu,et al.  Anti-collusion fingerprinting for multimedia , 2003, IEEE Trans. Signal Process..

[17]  Naoki Suehiro,et al.  N-shift cross-orthogonal sequences , 1988, IEEE Trans. Inf. Theory.