Added to Favorites

Related Searches

Digital watermarking is the process of embedding information into a digital signal. The signal may be audio, pictures or video, for example. If the signal is copied, then the information is also carried in the copy. ## Instance of a Digital Watermarking Scheme

A general watermarking scheme is defined as: ## Watermarking Life-Cycle Phases

In general, the usage of digital watermarking can be simplified as follows. An unmarked (mostly original) signal ($S$, with $Sinmathbb\{S\}$) is the source signal, where the watermark ($w$) is embedded by using an embedding function $E$. The result is the marked signal $S\_E$. It can be defined, that this process is done in a secure environment. The following step could be, for example, the distribution of $S\_E$ over the Internet or storage of it to provide authenticity or integrity checks. These processes can be seen as an insecure part, where attacks ($A\_\{i,j\}inmathbb\{A\}$) occur on $S\_E$. After distribution of $S\_E$, the signal is defined as $S\_\{EA\}$ because potential attacks could have destroyed the watermark. A detecting function $D$ tries to detect the watermark $w$ or a retrieval function $R$ tries to retrieve the embedded message $m\text{'}$. The detection/retrieval can be done in a secure or insecure environment, depending on the used application of the watermarking algorithm. ## Watermark Parameters

In general, the fundamental watermarking parameters are classifies into the 7 watermarking properties capacity, complexity, invertibility, transparency, robustness, security and verification (alphabetic order):
### Capacity

The Capacity is in general divided into embedding and retrieval capacity.
#### Embedding Capacity

The embedding capacity $text\{cap\}\_E$ of a watermarking scheme is defined as the amount of information that is (seems to be) embedded into the cover object to obtain the marked object. A simple definition for a capacity measure $text\{cap\}\_E$ would be related to the size of the embedded message, i.e. $text\{cap\}\_E(Omega^*,S)=text\{size(M)\}=|M|$. In addition, capacity is often given relative to the size of the cover object: #### Retrieval Capacity

The definition of retrieval capacity defines the capacity with respect to the retrieved message $m\text{'}$. First of all, zero-bit watermarking schemes do not transmit any message, since the watermark $w$ is just detected but a message $m\text{'}$ is not retrieved. In such a case, the retrieval capacity of these schemes is zero.

m_ioplus m'_i, > where $m=m\_1\; m\_2\; dots\; m\_$

>, $m\text{'}=m\text{'}\_1\; m\text{'}\_2\; dots\; m\text{'}\_$

> and $oplus$ depicts the exclusive or operation. This equation counts the number of correctly transmitted bits (those which are equal on both sides of the communication channel) and it is assumed that $m$ and $m\text{'}$ have exactly the same length (otherwise $m$ or $m\text{'}$ should be padded or cut in some manner).

m_i oplus m'_{ji}right], > where $p\_\{max\}$ is the counted number of maximal retrieved $m\text{'}$. In the sequel, no repeat coding is assumed for notational simplicity, but all the formulae can be easily extended to that case. If the watermark is not embedded multiple times, then $p\_\{max\}=1$. ### Complexity

Given a function $F$, the complexity of it can be measured. Thereby the effort or investment needed to embed or attack or detect and retrieve the watermark is defined with complexity. A measuring function $C$ is defined as $C(F)$ to measure the complexity of $F$. If it is adapted to, for example, the embedding function of $Omega$, then the embedding complexity can be computed $C(E,S)$. Depending on $C$, for example the computation cost of time, needed memory or IO operations, lines of code, etc. could be measured. The relative complexity of a watermarking scheme $Omega^*$ and a particular object $S$ is defines as: $C(E,S)rightarrowtext\{com\}^*\_text\{rel\}(Omega^*,S)$ However, this definition of complexity depends on the signal $S$. Thereby, a normalization is needed to provide results independent on $S$. The normalization can be done with the signal and it length (or size) or with the embedded capacity. If the length (or size) of the signal is used for normalization, then the length can be time or size needed for streaming or file size on the storage. Which exactly is defined with the function $mathrm\{size\}(S)$. The normalization done by the embedding capacity measures the needed effort to embed one single bit. Note, that this normalization is only usable for n-bit watermarking schemes. In the following both normalizations are formalized. $text\{com\}^S\_text\{rel\}(Omega^*,S)=frac\{text\{com\}^*\_text\{rel\}\}\{mathrm\{size\}(S)\}=frac\{C(E,S)\}\{mathrm\{size\}(S)\}$ Note, that in this case a linear complexity depending on the length of $S$ is assumed. If it is non-linear, then this function cannot be used to measure the complexity. Then, the normalization depending on, for example, the embedding capacity, introduced in the following can be used. $text\{com\}^C\_text\{rel\}(Omega^*,S)=frac\{text\{com\}^*\_text\{rel\}\}\{text\{cap\}^*\_E\}=frac\{C(E,S)\}\{text\{cap\}^*\_E\}$ Both definitions of complexity are related to a particular object $S$. Similar to other watermark properties, a definition of absolute values applies any of the following definitions:

{sum_{S inmathbb{S}}text{com}^S_text{rel}(Omega^*,S)}> $text\{com\}^C\_text\{av\}(Omega^*)=frac\{1\}$

{sum_{S inmathbb{S}}text{com}^C_text{rel}(Omega^*,S)}>
Maximum complexity for audio signal and capacity normalization: $text\{com\}^S\_text\{mx\}(Omega^*)=max\_\{S\; inmathbb\{S\}\}left\{text\{com\}^S\_text\{rel\}(Omega^*,S)right\}$ $text\{com\}^C\_text\{mx\}(Omega^*)=max\_\{S\; inmathbb\{S\}\}left\{text\{com\}^C\_text\{rel\}(Omega^*,S)right\}$
Minimum complexity for audio signal and capacity normalization: $text\{com\}^S\_text\{mn\}(Omega^*)\; =\; min\_\{S\; inmathbb\{S\}\}left\{text\{com\}^S\_text\{rel\}(Omega^*,S)right\}$ $text\{com\}^C\_text\{mn\}(Omega^*)=min\_\{S\; inmathbb\{S\}\}left\{text\{com\}^C\_text\{rel\}(Omega^*,S)right\}$ ### Invertibility

Refers to the property of a watermarking scheme which has the possibility to remove the watermark $w$ from the marked signal $S\_E$ completely to receive signal $S\text{'}$ and if $Omega$ is invertible, then $S=S\text{'}$. To provide this feature, the watermarking algorithms must provide special embedding techniques. Furthermore, secret keys are mostly used to protect the original content from unauthorized access. The measured value of invertibility for a watermarking scheme $Omega^*$ is a boolean value. If this value is $0$, then $Omega^*$ cannot remove $w$ from the marked object. If $Omega$ can remove $w$ completely and $S=S\text{'}$, then $1$ is returned. $text\{inv\}(Omega^*,S\_E)=\; begin\{cases\}\; 0\; \&\; ((Omega^*,S\_E)\; rightarrow\; S\text{'})\; wedge\; (Snot\; =S\text{'})\; =\; text\{true\}\; 1\; \&\; ((Omega^*,S\_E)\; rightarrow\; S\text{'})\; wedge\; (S=\; S\text{'})\; =\; text\{true\}\; end\{cases\}$
### Robustness

In this section, the robustness of a digital watermarking scheme is described. To introduce the robustness itself, the detection success is needed and introduced as first.
#### Detection Success

To measure the overall success of a detection or retrieval function, the detection success function is introduced. Therefore, the connection to zero-bit an n-bit watermarking scheme are introduced as follows. For zero-bit watermarking schemes, $text\{det\}\_D$D returns $0$, if the watermark could not be successful detected and $1$ if the detection function was able to detect the watermark, see the following equation: $text\{det\}\_D(Omega^*,S\_\{EA\})=\; begin\{cases\}\; 0,\; text\{no\; successful\; detection\; (negative)\},\; 1,\; text\{positive\; successful\; detection\; (positive).\}\; end\{cases\}$ To measure the successfully embedding rate over a test set $mathbb\{S\}$, the average of $text\{det\}\_D$ can be computed as follows: $\{text\{det\}\_D\}\_text\{av\}(Omega^*)=frac\{1\}$

sum_{Sinmathbb{S}}text{det}_D > For n-bit watermarking schemes, it is important to know, if the watermark was successfully detected at least once (in case of multiple embedding). If, for example, a watermark scheme embeds the message $m$ multiple times $left(p\_\{max\}right)$, and the retrieval function $\{text\{cap\}^*\_R\}\_text\{rel\}$ returns, that 10% are positive retrievable, then it is unknown, which $m\_i$ are affected. Therefore, it is useful to define a successful detection, if at least one embedded message could be retrieved positively, which is introduced in the following equation. $text\{det\}\_R(Omega^*,S\_\{EA\})=\; begin\{cases\}\; 1,\; exists\; j\; indisplaystyleleft\{1,dots,p\_\{max\}right\}:\; sum\_\{i=1\}^$

m'_{ji} oplus m_{ji} = 0, 0, text{otherwise}. end{cases} > Note that this is not the only possible definition of the detection function in case of repeat coding. For example, another definition could be the following: $text\{det\}\_\{Rtau\}(Omega^*,S\_\{EA\})=\; begin\{cases\}\; 1,\; text\{if\; \}\{text\{cap\}^\{\$\}\_\{R\}\}\_text\{rel\}(Omega^*,tilde\; S)\; geq\; tau,\; 0,\; text\{otherwise\}.\; end\{cases\}$ i.e. detection is reported if the ratio of correctly recovered bits is above some threshold $tau$ (which is equal to or close to 1).
#### Watermark Robustness

The robustness measure $text\{rob\}\_text\{rel\}$ of a watermarking scheme is a value in the closed interval $[0,1]$, where 0 is the worst possible value (the scheme is not robust for the signal S) and 1 is the best possible value (the method is robust for the signal S). There is a difference, for example, depending on whether the bit error rate (BER) or byte error rate (BYR) is used to measure the robustness. If the robustness is measured based on the byte error rate $text\{rob\}^\{byte\}$, then a given watermarking scheme is classified as robust if the bytes of the embedded massage (characters) are correctly retrieved. This measurement is similar to the Levenstein distance, which works and measured a distance between two given strings. It is useful in applications scenarios that need to determine how similar two strings are. Another robustness measure function based on the bit error rate $text\{rob\}^\{bit\}$ returns the percentage robustness of the watermarking scheme measured over the whole attacking and test set and is based on the bit changes within the retrieved message. This measurement is similar to the Hamming distance based on bit-strings. Hence, a watermarking scheme is classified as not robust, if more than $nu$ numbers of retrieved bits are destroyed and the transparency of the attacks if higher than $tau$. For zero-bit watermarking schemes no retrieval function exists and no classification based on bit or byte error rates are possible. To simplify matters, the robustness measure for zero-bit watermarking schemes is always classified to $text\{rob\}^\{byte\}$.

sum_{Sinmathbb{S}}sum_{A_{i,j}inmathbb{A}} begin{cases} 1, & left({text{cap}^$_R}_text{rel} >< tau right) wedge left({text{tra}_A}_text{rel} > nuright) 0, & text{otherwise} end{cases} That is, given a marked object $S\_E$ and all the attacks which attack the watermark, even for optimal embedding and detection parameters ($p\_E^mathrm\{opt\},\; p\_D^mathrm\{opt\}$), the one which produces less distortion in the marked object $S\_E$ determines how robust the scheme is. If none of the attacks in the family $mathbb\{A\}$ erases the embedded mark, then this measure is (by definition) equal to 1 (the best possible value).

In visible watermarking, the information is visible in the picture or video. Typically, the information is text or a logo which identifies the owner of the media. The image on the right has a visible watermark. When a television broadcaster adds its logo to the corner of transmitted video, this is also a visible watermark.

In invisible watermarking, information is added as digital data to audio, picture or video, but it cannot be perceived as such. An important application of invisible watermarking is to copyright protection systems, which are intended to prevent or deter unauthorized copying of digital media. Steganography is an application of digital watermarking, where two parties communicate a secret message embedded in the digital signal. Annotation of digital photographs with descriptive information is another application of invisible watermarking. While some file formats for digital media can contain additional information called metadata, digital watermarking is distinct in that the data is carried in the signal itself.

The use of the word of watermarking is derived from the much older notion of placing a visible watermark on paper.

$Omega^*\; =\; left(E,D,R,M,p\_E,p\_D,p\_Rright)$

where E defines the embedding function, D detecting function, R retrieval function and M the message. Furthermore, the embedding parameters $p\_E\; inmathcal\{P\}\_E$ defines the parameter set used for watermark embedding, $p\_D\; inmathcal\{P\}\_D$ defines the detection parameters and $p\_R\; inmathcal\{P\}\_R$ retrieval parameters. Hence, each watermarking scheme $Omega$ may have different instances according to the values that these parameters may adopt. An instance $Omega^*$ of the watermarking scheme $Omega$ for a particular value of the parameter vectors.

The complete scenario is defined as life cycle of a watermark, because it begins with embedding and ends with detection/retrieval. This is shown in the following figure with expected secure and insecure parts.

The information to be embedded is called a digital watermark, although in some contexts the phrase digital watermark means the difference between the watermarked signal and the cover signal. The signal where the watermark is to be embedded is called the host signal. A watermarking system is usually divided into three distinct steps, embedding, attack and detection. In embedding, an algorithm accepts the host and the data to be embedded and produces a watermarked signal.

The watermarked signal is then transmitted or stored, usually transmitted to another person. If this person makes a modification, this is called an attack. While the modification may not be malicious, the term attack arises from copyright protection application, where pirates attempt to remove the digital watermark through modification. There are many possible modifications, for example, lossy compression of the data, cropping an image or video, or intentionally adding noise.

Detection (often called extraction) is an algorithm which is applied to the attacked signal to attempt to extract the watermark from it. If the signal was unmodified during transmission, then the watermark is still present and it can be extracted. In robust watermarking applications, the extraction algorithm should be able to correctly produce the watermark, even if the modifications were strong. In fragile watermarking, the extraction algorithm should fail if any change is made to the signal.

$\{text\{cap\}\_E\}\_text\{rel\}(Omega^*,S)=frac\{text\{cap\}\_E\}\{text\{size\}(S)\}.$

Note that such measure only takes into account the information embedded, but not the information that is retrieved. Note, also, that this measure does not consider the possibility of repeat coding, in which the mark is replicated as many times as needed prior to its insertion. All these issues are related to the retrieval capacity which is defined in the retrieval function.

For non zero-bit watermarking schemes the retrieval capacity is considered after data extraction. The following retrieval capacity function is defined: $\{text\{cap\}\_R\}\_text\{rel\}(Omega^*,S\_\{EA\})=|m|\; -\; sum\_\{i=1\}^$

In case of repeat coding, the retrieved message is several times longer than the embedded message: $m\text{'}=m\text{'}\_\{11\}\; m\text{'}\_\{12\}\; dots\; m\text{'}\_\{1|m\; m\text{'}\_\{21\}\; m\text{'}\_\{22\}\; dots\; m\text{'}\_\{2|m\; dots\; dots\; m\text{'}\_\{p\_\{max\}|m$. In such a situation, the retrieval capacity should consider all the repetitions as follows $\{text\{cap\}^*\_R\}\_text\{rel\}(Omega^*,S\_\{EA\})=sum\_\{j=1\}^\{p\_\{max\}\}left[|m|\; -\; sum\_\{i=1\}^$

There are two relevant comments about this definition of relative capacity. The first is that usually this kind of measure is given in terms of the size of the cover object $S$: $\{text\{cap\}\_R\}\_text\{rel\}(Omega^*,S\_\{EA\})=frac\{\{text\{cap\}^*\_R\}\_text\{rel\}(Omega^*,S\_\{EA\})\}\{text\{size\}(S\_\{EA\})\}$ and it is assumed that the sizes of $S$, and $S\_\{EA\}$ are, at least, similar. This second definition provides measures such as bits per second or in bits of transmitted information per bit of the marked object. If the latter is used, a value in the interval $[0,1]$ is obtained, where 1 means that all the transmitted bits are used for the message, which is the best case as capacity is concerned. The second comment is that $\{text\{cap\}\_R\}\_text\{rel\}$ is relative to a given pair $S\_\{EA\}$ and $S$. An absolute measure is provided below.

Another capacity measure can be defined in terms of the ratio of correctly recovered bits normalized by $p\_\{max\}$. If $p\_\{max\}$ is unknown, the measure of $\{text\{cap\}^\{\$\}\_R\}\_text\{rel\}$ can also be used, but would result in highest, not normalized values.: $\{text\{cap\}^\{\$\}\_R\}\_text\{rel\}(Omega^*,S\_\{EA\})=frac\{\{text\{cap\}^*\_R\}\_text\{rel\}(Omega^*,S\_\{EA\})\}$

- Average complexity based on signal and capacity normalization: $text\{com\}^S\_text\{av\}(Omega^*)=frac\{1\}$

The following example motivates the distinction between the robustness measure based on bit and byte error rate. If the message $m$="123", with 3 bytes and 3*8=24 bits, is embedded and after attacking, the last 6 bits are destroyed and incorrectly retrieved, then the byte error rate returns, that 2 bytes are correct (the first two) and one is false (the last), which has a value of $frac\{1\}\{3\}=0.3overline\{3\}$. The bit error rate returns, that 18~bits are correct (the first) and 6 bits are false (the last), which has a value of $frac\{6\}\{24\}=0.25$. If now the 1., 2., 8., 9., 16. and 17. bit are destroyed, then the byte error rate returns, that all bytes (characters) are false and the result has a value of $frac\{3\}\{3\}=1.0$ and this shows, that 100% of the bytes are destroyed. In contrast, the bit error rate returns, that 18 bits are correct retrieved and 6 bits are wrong, which has a value of $frac\{6\}\{24\}=0.25$. Although the bit error rate does not change to the first example, differences are apparent in the byte error rater. Therefore, the following equations introduce the robustness for n-bit watermarking schemes divided into $text\{rob\}^\{byte\}$ and $text\{rob\}^\{bit\}$ and for zero-bit watermarking schemes only for $text\{rob\}^\{byte\}$. The two robustness measures $text\{rob\}^\{byte\}$ and $text\{rob\}^\{bit\}$ returns completely different robustness values. It is introduced to show, that different approaches are possible and depending on test goals, choices are to be made to select the measure function. It is noted, that different measure methods are available to measure the robustness, i.e. based on $text\{det\}\_R$ in relation to attacking transparency.

The following function relates robustness based on the byte error rate to transparency for a zero-bit and n-bit watermarking scheme as follows, given $S\_\{EA\}=A\_\{i,j\}(S\_E)$: $text\{rob\}^\{byte\}\_text\{rel\}(Omega^*,S\_E)=\; 1\; -\; max\_\{A\_\{i,j\}\; inmathcal\{A\}\}\; left\{Tleft(S\_E,S\_\{EA\}right):\; text\{det\}\_Dleft(S\_\{EA\},p\_E^mathrm\{opt\},p\_D^mathrm\{opt\},p\_\{mathrm\{cod\}\},[S,m]right)=0right\}$ and for a n-bit watermarking scheme: $text\{rob\}^\{byte\}\_text\{rel\}(Omega^*,S\_E)=\; 1\; -\; max\_\{A\_\{i,j\}\; inmathcal\{A\}\}\; left\{Tleft(S\_E,S\_\{EA\}right):\; text\{det\}\_Rleft(S\_\{EA\},p\_E^mathrm\{opt\},p\_D^mathrm\{opt\},p\_\{mathrm\{cod\}\},[S,m]right)=0right\}$

And the robustness based on the bit error rate related to the transparency for n-bit watermarking schemes is given as: $text\{rob\}^\{bit\}\_text\{av\}(Omega^*)=\; frac\{1\}$

mathbb{A} |

The functions measure robustness in a worst case sense. When the security of a system is to be assessed, it is usually considered that a given system is as weak as the weakest of its components. Similarly, the equation establishes that the worst possible attack (in the sense that the mark is erased but the attacked signal preserves good quality) in a given family determines how robust the watermarking scheme $Omega$ is. If the best (maximum) transparency amongst all the attacks which destroy the mark is $0.23$, then the robustness of the method as given by is $1-0.23=0.77$.

However, the functions of the equation introduced above are textit{relative} to a given object $S\_\{EA\}$ (hence the use of the subindex "rel") but usually to define the robustness of a watermarking scheme as an inherent property not related to any particular object, but to a family or collection of objects. This may be referred to as the absolute robustness ($text\{rob\}^\{byte\}\_\{text\{rel\}\}$) which can be defined in several ways. Given a family $mathbb\{S\}$ of cover objects, and their corresponding marked objects $S\_E$ obtained by means of the embedding, the absolute robustness based on bit and byte error rate can be defined according to different criteria, for example:

- Average robustness based on byte error rate: $text\{rob\}^\{byte\}\_text\{av\}(Omega^*)=frac\{1\}${sum_{S inmathbb{S}}text{rob}^{byte}_text{rel}(Omega^*,S_E)}. > * Minimum robustness (worst case approach) based on byte error rate: $text\{rob\}^\{byte\}\_text\{mn\}(Omega^*)=min\_\{S\; inmathbb\{S\}\}text\{rob\}^\{byte\}\_text\{rel\}(Omega^*,S\_E).$
- Probabilistic approach based on byte error rate: $text\{rob\}^\{byte\}\_mathrm\{prob\}(Omega^*,r)=1\; -\; underset\{Sinmathbb\{S\}\}\{p\}(text\{rob\}^\{byte\}\_text\{rel\}(Omega^*,S\_E)),\; math>\; where$ p$stands\; for\; ``probability\text{'}\text{'}\; and$ r$is\; some\; given\; threshold.\; For\; example,\; if$ r=0.75$and$ text\{rob\}\_text\{prob\}=0.9$,\; this\; means\; that\; 90\%\; of\; the\; objects\; in$ mathbb\{S\}$provide\; a\; relative\; robustness\; greater\; than\; or\; equal\; to$ 0.75$for\; the\; scheme$ Omega$.\; Although\; a\; maximum\; robustness\; measure\; could\; thus\; be\; defined,\; it\; does\; not\; seem\; to\; have\; any\; applicability,\; since\; worst\; or\; average\; cases\; are\; often\; reported\; as\; robustness\; is\; concerned.$
- Average total security: $text\{se\}c^text\{tot\}\_text\{av\}(Omega^*)=frac\{1\}$
- Maximum total security: $text\{sec\}^text\{tot\}\_text\{mx\}(Omega^*)=text\{max\}\_\{S\; inmathbb\{S\}\}left\{max\_\{text\{sec\}^*\_text\{mx\}\}left\{text\{sec\}^*\_text\{rel\}(Omega^*,S)right\}right\}$
- Minimum total security: $text\{sec\}^text\{tot\}\_text\{mn\}(Omega^*)=min\_\{S\; inmathbb\{S\}\}left\{min\_\{text\{sec\}^*\_text\{mn\}\}left\{text\{sec\}^*\_text\{rel\}(Omega^*,S)right\}right\}$
- Maximum transparency:
- Minimum transparency:
- $|m|=0$: The message $m$ is conceptually zero-bit long and the system is designed in order to detect the presence or the absence of the watermark $w$ in the marked object $S\_E$. This kind of watermarking schemes is usually referred to as Italic zero-bit or Italic presence watermarking schemes. Sometimes, this type of watermarking scheme is called 1-bit watermark, because a 1 denotes the presence and a 0the absence of a watermark.
- $|m|=n>0$: The message $m$ is a n-bit long stream ($m=m\_1ldots\; m\_n,;\; ninN$, with $n=|m|$) or $M=\{0,1\}^n$ and is modulated in $w$. This kind of schemes is usually referred to as multiple bit watermarking or non zero-bit watermarking schemes.
- Copyright protection.
- Fingerprinting (Different recipients get differently watermarked content).
- Broadcast Monitoring (Television news often contains watermarked video from international agencies).
- Covert Communication (steganography).
- Digital Watermarking Alliance – Furthering the Adoption of Digital Watermarking
- Digital Watermarking & Data Hiding research papers at Forensics.nl
- StirMark for Images – Watermarking robustness test developed by Markus Kuhn and Fabien Petitcolas.
- StirMark for Audio – Watermarking robustness and fragility test developed by Andreas Lang.
- Directory of Books, Journals & Conferences on Digital Watermarking and Digital Watermarking Assessment Tools
- Slashdot article – "Warezed SoundForge Files In Windows Media Player"
- Information hiding homepage by Fabien Petitcolas * Comparison of watermarking methods
- Watermarking used in monitoring television broadcasts
- Robust Mesh Watermarking
- PhotoWaterMark technology: Holographic approach
- ECRYPT report: Audio Benchmarking Tools and Steganalysis
- ECRYPT report: Watermarking Benchmarking
- Jana Dittmann, David Megias, Andreas Lang, Jordi Herrera-Joancomarti; Theoretical framework for a practical evaluation and comparison of audio watermarking schemes in the triangle of robustness, transparency and capacity; In: Transaction on Data Hiding and Multimedia Security I; Springer LNCS 4300; Editor Yun Q. Shi; pp. 1-40; ISBN 978-3-540-49071-5,2006 PDF

$\{text\{tra\}\}\_text\{av\}(Omega^*)=frac\{1\}$

mathcal{L} |

$\{text\{tra\}\}\_text\{mx\}(Omega^*)=text\{max\}\_\{S\; inmathbb\{S\}\}left\_text\{rel\}(Omega^*,S)right\}.$

$\{text\{tra\}\}\_text\{mn\}(Omega^*)=text\{min\}\_\{S\; inmathbb\{S\}\}left\_text\{rel\}(Omega^*,S)right\}.$

Non-blind: If the watermarking scheme requires the cover object $S$, then it is associated as non-blind watermarking scheme. Often, this type of watermark scheme is referred as informed watermarking scheme. Mostly, the watermark detector/retriever is only usable from a defined group of people, which hides the watermark detector and the required original signal $S$.

Informed: If the watermarking scheme requires the embedded message $m$, the embedding parameters $p\_E$ or other additional information (except the original signal $S$) for detection or retrieval, then the watermarking scheme is associated to this group. Often, watermarking schemes where the embedding function creates a data file needed for detection/retrieval, are associated to this type of verification.

Blind: If the watermarking scheme does not require the original signal nor additional information (e.g. $m$ or $p\_E$), then the watermarking scheme is associated to this group. The verification ($text\{ver\}$) is defined as list $\{0,\; 0.5,1\}$, whereby the $1$ is associated with non-blind, a $0.5$ with informed and a $0$ with blind. The formalization is introduced in the following equation. $text\{ver\}(Omega^*,S)=\; begin\{cases\}\; 0\; \&\; (Omega^*,S)quad\; text\{is\; non-blind\}\; 0.5\; \&\; (Omega^*,S)quad\; text\{is\; informed\}\; 1\; \&\; (Omega^*,S)quad\; text\{is\; blind\}\; end\{cases\}$

Digital watermarking techniques can be classified in several ways.

A watermark is called semi-fragile if it resist benign transformations but fails detection after malignant transformations. Semi-fragile watermarks are commonly used to detect malignant transformations.

A watermark is called robust if it resists a designated class of transformations. Robust watermarks are commonly used in copyright applications (to carry ownership or forensic information) and copy protection applications (to carry copy and access control information).

A watermark is called perceptible if its presence in the marked signal is noticeable, but non-intrusive.

A watermarking method is referred to be of quantization type if the marked signal is obtained by quantization. Quantization watermarks suffer from low robustness, but have a high information capacity due to rejection of host interference.

A watermarking method is referred to as amplitude modulation if the marked signal is embedded by additive modification method which it similar to spread spectrum method but this method is especially embedded in spatial domain.

Wikipedia, the free encyclopedia © 2001-2006 Wikipedia contributors (Disclaimer)

This article is licensed under the GNU Free Documentation License.

Last updated on Wednesday October 08, 2008 at 08:23:10 PDT (GMT -0700)

View this article at Wikipedia.org - Edit this article at Wikipedia.org - Donate to the Wikimedia Foundation

This article is licensed under the GNU Free Documentation License.

Last updated on Wednesday October 08, 2008 at 08:23:10 PDT (GMT -0700)

View this article at Wikipedia.org - Edit this article at Wikipedia.org - Donate to the Wikimedia Foundation

Copyright © 2014 Dictionary.com, LLC. All rights reserved.