A digital watermark

  title={A digital watermark},
  author={Ron G. van Schyndel and Andrew Z. Tirkel and Charles F. Osborne},
  journal={Proceedings of 1st International Conference on Image Processing},
  pages={86-90 vol.2}
The paper discusses the feasibility of coding an "undetectable" digital water mark on a standard 512/spl times/512 intensity image with an 8 bit gray scale. The watermark is capable of carrying such information as authentication or authorisation codes, or a legend essential for image interpretation. This capability is envisaged to find application in image tagging, copyright enforcement, counterfeit protection, and controlled access. Two methods of implementation are discussed. The first is… 

Figures from this paper


The feasibility of coding a robust, undetectable, digital water mark on a standard 512*512 intensity image with an 8 bit gray scale and some constructions to extend this work to two dimensions are discussed.


This paper discusses the feasibility of coding a robust, undetectable, digital water mark on a standard 512*512 intensity image with an 8 bit gray scale and discusses compatibility of the technique with JPEG image transmission.

Image watermarking-a spread spectrum application

The feasibility of coding a robust, undetectable, digital watermark on a standard 512*512 intensity image with an 24 bit RGB format, capable of carrying such information as authentication or authorisation codes, or a legend essential for image interpretation is discussed.

Phase watermarking of digital images

Techniques for embedding watermark marks in grey scale digital images are discussed and a novel phase based method of conveying the watermark information is proposed.

A DCT-domain system for robust image watermarking

A DCT-Domain System for Digital Watermarking

A new DCT-domain system for digital watermarking algorithm for digital images is presented: the method, which operates in the frequency domain, embeds a pseudo-random sequence of scrambled image in a selected set of DCT coefficients, thus ensuring the watermark invisibility.

A Short Summary of Digital Watermarking Techniques for Multimedia Data

The desirable characteristics of digital watermarking are outlined and several recent approaches that address these issues are also discussed.

Digital watermarking by DCT coefficient manipulation

The expectation and variance of the correlation between the investigated image and the watermark is derived, from which the performance of the spread spectrum watermarking algorithm is analyzed and is found to be consistent with the experiment results.

Robust image watermarking in the spatial domain


From the simulation results it can be said that NEA will be a substitute of modified Cox’s algorithm with better performance.



Maximal connected sets—application to microcell CDMA

The scheme presented in this paper enables new cells to be added to the network without any impact on the hardware, and is appropriate to systems which demand flexibility with minimum overheads.

Crosscorrelation properties of pseudorandom and related sequences

This paper presents a survey of recent results and provides several new results on the periodic and aperiodic crosscorrelation functions for pairs of m-sequences and for Pair of related (but not maximal-length) binary shift register sequences.

Constructions and properties of Costas arrays

A Costas array is an n × n array of dots and blanks with exactly one dot in each row and column, and with distinct vector differences between all pairs of dots. As a frequency-hop pattern for radar

Spread-spectrum communications

The characteristics of spread-spectrum systems that account for their growing use are examined. They offer low probability of intercept, signal hiding, and jammer rejection. Spread spectrum also

Pseudo-random sequences and arrays

A simple description of pseudo-random sequences, or maximal-length shift-register sequences, and two-dimensional arrays of area n = 2lm- 1 with the same property.

Property of the Legendre subsequence

The authors have proposed the use of subsequences of the Legendre sequences for spread spectrum communication systems, and discussed its randomness, correlation properties, frequency-domain

Auto- and crosscorrelation properties for extended m-sequences and related sequences

  • U. Fiebig
  • Computer Science
    Proceedings of IEEE 3rd International Symposium on Spread Spectrum Techniques and Applications (ISSSTA'94)
  • 1994
Extended m- sequences and sequences obtained from extended m-sequences are investigated and compared to m- Sequences and Gold-codes and the even auto- and crosscorrelation functions are evaluated.

Adaptive Signal Processing

This chapter discusses Adaptive Arrays and Adaptive Beamforming, as well as other Adaptive Algorithms and Structures, and discusses the Z-Transform in Adaptive Signal Processing.

Multi-Valued Cross-Correlation Functions between Two Maximal Linear Recursive Sequences

The explicit evaluation of A (y) is equivalent to the explicit Evaluation of weight distribution of the (2-l,2n) cyclic code whose dual code is generated by f1(x)f (x), the product of two primitive polynomials of degree n.

Crosscorrelation Properties of m-Sequences

This chapter will continue the study of m-sequences, and in particular the crosscorrelation properties of m.sequences are studied, and one reason why these crosscor correlation properties are so important is explained.