Digital watermarking
Digital watermarking

Digital watermarking
From Wikipedia, the free encyclopedia


Digital watermarking is the process of embedding information into a digital signal in a way that is difficult to remove. The signal may be audio, pictures or video, for example. If the signal is copied, then the information is also carried in the copy. A signal may carry several different watermarks at the same time.
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 (although it may be possible to detect that some amount of information is hidden). The watermark may be intended for widespread use and is thus made easy to retrieve or it may be a form of Steganography, where a party communicates a secret message embedded in the digital signal. In either case, as in visible watermarking, the objective is to attach ownership or other descriptive information to the signal in a way that is difficult to remove. It is also possible to use hidden embedded information as a means of covert communication between individuals.
One application of watermarking is in copyright protection systems, which are intended to prevent or deter unauthorized copying of digital media. In this use a copy device retrieves the watermark from the signal before making a copy; the device makes a decision to copy or not depending on the contents of the watermark. Another application is in source tracing. A watermark is embedded into a digital signal at each point of distribution. If a copy of the work is found later, then the watermark can be retrieved from the copy and the source of the distribution is known. This technique has been reportedly used to detect the source of illegally copied movies.
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.
Contents [hide]
1 Applications
2 Watermarking life-cycle phases
3 Classification
3.1 Robustness
3.2 Perceptibility
3.3 Capacity
3.4 Embedding method
4 Evaluation/benchmarking
5 Secure digital camera
5.1 Precursor cameras
6 Reversible data hiding
7 See also
8 External links
9 References
[edit]Applications

Digital Watermarking can be used for a wide range of applications such as:
Copyright protection
Source Tracking (Different recipients get differently watermarked content)
Broadcast Monitoring (Television news often contains watermarked video from international agencies)
Covert Communication
[edit]Watermarking life-cycle phases



General watermark life-cycle phases with embedding-, attacking- and detection/retrieval functions
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.
[edit]Classification

A digital watermark is called robust with respect to transformations if the embedded information can reliably be detected from the marked signal even if degraded by any number of transformations. Typical image degradations are JPEG compression, rotation, cropping, additive noise and quantization. For video content temporal modifications and MPEG compression are often added to this list. A watermark is called imperceptible if the cover signal and marked signal are indistinguishable with respect to an appropriate perceptual metric[clarification needed]. In general it is easy to create robust watermarks or imperceptible watermarks, but the creation of robust and imperceptible watermarks has proven to be quite challenging.[1] Robust imperceptible watermarks have been proposed as tool for the protection of digital content, for example as an embedded 'no-copy-allowed' flag in professional video content.[2]
Digital watermarking techniques can be classified in several ways.
[edit]Robustness
A watermark is called fragile if it fails to be detected after the slightest modification. Fragile watermarks are commonly used for tamper detection (integrity proof). Modifications to an original work that are clearly noticeable are commonly not referred to as watermarks, but as generalized barcodes.
A watermark is called semi-fragile if it resists 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 may be used in copy protection applications to carry copy and access control information.
[edit]Perceptibility
A watermark is called imperceptible if the original cover signal and the marked signal are (close to) perceptually indistinguishable.
A watermark is called perceptible if its presence in the marked signal is noticeable, but non-intrusive.
[edit]Capacity
The length of the embedded message determines two different main classes of watermarking schemes:
The message is conceptually zero-bit long and the system is designed in order to detect the presence or the absence of the watermark in the marked object. 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 0 the absence) of a watermark.
The message is a n-bit-long stream (, with n = | m | ) or M = {0,1}n and is modulated in the watermark. This kinds of schemes are usually referred to as multiple bit watermarking or non zero-bit watermarking schemes.
[edit]Embedding method
A watermarking method is referred to as spread-spectrum if the marked signal is obtained by an additive modification. Spread-spectrum watermarks are known to be modestly robust, but also to have a low information capacity due to host interference.
A watermarking method is said 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 which is similar to spread spectrum method but is particularly embedded in the spatial domain.
[edit]Evaluation/benchmarking

The evaluation of digital watermarking schemes can provide detailed information for a watermark designer or for end users. Therefore, different evaluation strategies exist. Often used by a watermark designer is the evaluation of single properties to show, for example, an improvement. End users are mostly not interested in detailed information. They want to know if a given digital watermarking algorithm can be used for their application scenario, and if so, which parameter sets seems to be the best.
[edit]Secure digital camera

A secure digital camera (SDC) is proposed by Mohanty, et al. in 2003 which got published in January 2004 [3] Blythe and Fridrich have also worked on SDC in 2004[4] for a digital camera that would use lossless watermarking to embed a biometric identifier together with a cryptographic hash.[5]
[edit]Precursor cameras
Epson and Kodak have produced cameras with security features such as the Epson PhotoPC 3000Z and the Kodak DC-290. Both cameras added irremovable features to the pictures which distorted the original image, making them unacceptable for some applications such as forensic evidence in court. According to Blythe and Fridrich, "[n]either camera can provide an undisputable proof of the image origin or its author".[4]
[edit]Reversible data hiding

Reversible data hiding is a technique which enables images to be authenticated and then restored to their original form by removing the watermark and replacing the image data which had been overwritten. This would make the images acceptable for legal purposes. The US army is also interested in this technique for authentication of reconnaissance images.[6]
[edit]See also

Audio watermark detection
Copy attack
Watermark (data file)
Watermark detection
Pattern Recognition (novel), a digital watermarking themed sci-fi thriller written by noted cyberpunk author William Gibson
EURion constellation - Used in banknotes
Coded Anti-Piracy - Used to track films
Steganography
[edit]External links

Digital Watermarking Alliance – Furthering the Adoption of Digital Watermarking
Digital Watermarking & Data Hiding research papers at Forensics.nl
Directory of Books, Journals & Conferences on Digital Watermarking and Digital Watermarking Assessment Tools
Information hiding homepage by Fabien Petitcolas
Comparison of watermarking methods
Robust Mesh Watermarking
PhotoWaterMark technology: Holographic approach
Open Platform for testing digital watermarking systems
[edit]References

^ Ingemar J. Cox, Matthew L. Miller, Jeffrey A. Bloom, Jessica Fridrich and Ton Kalker, "Digital Watermarking and Steganography" (Second Edition), Morgan Kaufmann, 2008
^ Copy Protection Technical Working Group (CPTWG)
^ . Saraju P. Mohanty, Nagarajan Ranganathan, and Ravi K. Namballa, VLSI Implementation of Visible Watermarking for a Secure Digital Still Camera Design
^ a b Paul Blythe and Jessica Fridrich, Secure Digital Camera
^ Toshikazu Wada, Fay Huang (2009), Advances in Image and Video Technology, p. 340–341, ISBN 9783540929567
^ Unretouched by human hand, The Economist, December 12th 2002
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
M. V. Smirnov. Holographic approach to embedding hidden watermarks in a photographic image //Journal of Optical Technology, Vol. 72, Issue 6, pp. 464-468

Register your author's rights and get the full juridical protection.

Copyright Registration will cost - $ 20

Public offer - read carefully before registration!

F.A.Q SciReg

Copyright Registration

Recent Publications
reg № 295617897
logo solcity
More >>
reg № 166145146
GPS Навигационная дорожная карта Доминиканской республики.
More >>
Terms of use
Article 1. Contracting parties.
1. The Parties of this Public Offer (paid service agreement), hereinafter referred to as the “Agreement” or “Offer”, are, as follows:
a) Executor is a person, who makes this Offer and who executes this Agreement in accordance with its terms and conditions: Solcity World Investment and Development; and
b) Customer is a person, who accepts this Offer and who is the author of any publication.

Article 2. Acceptance.
1. The Customer shall accept this Offer in case of and after the following activities:
a) fill in and send to the Executor an application in electronic format in the form established by this Agreement and posted on the Executor’s official website; and
b) provide the author’s abstract specifying what material was created by the author; and
c) provide a list of all key words (tags) that enable finding the location of the author’s abstract of the Customer on the Executor’s website; and
d) post (“upload”) the material itself on the Executor’s official website; and
e) pay for the Executor’s services in the amount and following the procedure set forth by this Agreement.
2. The Executor shall verify the Customer’s data and post the information about the Customer and his/her work of authorship on SciReg.org in Internet. From this moment on, the Customer shall be considered as an acceptor of this Offer and a Party to this Agreement.
3. The Executor shall be entitled, without giving any reasons, to refuse the Customer to accept this Offer and the Customer unconditionally, entirely and irrevocably agrees with this provision.

Article 3. Scope of the Agreement.
1. The Executor hereof shall render services on establishing, formation and maintenance of the Copyright register in electronic format on the Executor’s official website in Internet.
2. The Executor hereof shall render to the Customer paid services on posting (publishing) of information about the applicant as the author of the material under the terms and in accordance with this Agreement.
3. The work of authorship shall be understood by the Parties as a subject matter of copyright established by the Civil Code or other laws of the Author’s Country of domicile. 
4. The Executor shall publish information (data), hereinafter referred to as the “summary”, about the applicant as the author of the material in the Register posted on the Executor’s official website in Internet under the terms set forth by this Agreement.
5. The Executor shall be entitled, at his own discretion and without coordination with the Customer, to assign his obligations for execution of this Agreement to any third party, and the Customer unconditionally agrees with this provision.


Article 4. Register.
1. The Register shall be an ordered and standardized register containing a summary of the Customer: Author’s information, including co-authors, name of the work of authorship, publication date, author’s abstract revealing the content of the work of authorship and its unique character, as well as a unique number of posting in the Register assigned to the author and his/her material automatically by the Executor, key words (tags) that enable any person to find information about the author and his/her publication posted in the Register on the Executor’s official website in Internet.
2. The author’s abstract shall be a brief description of the author’s publication designating its unique character and showing that the Customer is its author.
3. The Register shall be maintained in electronic form on the Executor’s official website in Internet.
4. Information about the author, work of authorship and other information required by the rules for information posting in the Register, set forth by the Executor, except for the unique number, shall be posted by the Customer individually on the Executor’s official website in Internet.
5. Both the Register and the official website shall be the Executor’s property.
6. Any and all information posted by the Customer in the Register in accordance with the terms set forth by this Agreement shall be the Executor’s property. Hereby, the Customer shall not transfer copyright for his/her work of authorship to the Executor.
7. The rules for maintenance of the Register, its execution, posting of any details (information) in it shall constitute Appendix 1 to this Agreement forming an integral part hereof. The rules shall be issued exclusively by the Executor. The Executor, without coordination with the Customer and the Customer’s consent, shall have the right to make any changes in and/or amendment to the Register maintenance rules and the Customer unconditionally agrees with this provision. The Register maintenance rules shall be unconditionally mandatory for the Customer.

Article 5. Obligations of the Parties.
1. The Parties hereto shall (hereby shall be obliged to) unconditionally, voluntarily, conscientiously, and accurately follow all provisions of this Agreement, as well as any and all supplements, amendments and/or alterations hereto made under the terms set forth by this Agreement.
2. The Customer shall pay for the Executor’s services following the procedure and in the amount established by this Agreement.
3. The Customer, in contemplation of his/her death, shall be obliged to bind defendants to the terms of this Agreement.
4. If the Customer’s copyright is assigned to a third party, he/she shall be obliged to bind such third party to his/her obligations hereunder.
5. The Customer shall have an exclusive right to refer, in any form, to his/her summary (synopsis, author’s abstract) posted in the Register on the Executor’s official website in Internet in case of complete and fair execution of his/her obligations under this Agreement.

Article 6. Payment for the Executor’s services. Agreement price.
1. The Customer shall pay for the Executor’s services following the procedure and in the amount established by the provisions of this Article.
2. The price for one posting by the applicant of one his/her summary in the Register shall be 20 (twenty) US Dollars – price of this Agreement.
3. The procedure for paying the amount set forth by this Article of the Agreement shall be determined in Appendix 1 to this Agreement.
4. The applicant shall pay the amount stated in para 2 of this Article (pay for the Executor’s service) to the Executor at the time of registration.
5. The amounts paid hereunder by the Customer to the Executor shall be nonreturnable.
6. Each Party shall individually pay any and all own taxes, duties and/or fees established by the legislation of the Party in connection with execution of the terms hereof by the Party. Neither party shall be a fiscal agent of the other Party.

Article 7. Withdrawal from the Agreement.
1. The Customer shall be entitled to withdraw from execution of this Agreement in the form of non-payment of a next settlement set forth by this Agreement.
2. The Executor shall have the right, including in his sole discretion, to withdraw from execution of this Agreement without reimbursement to the Customer of any expenses and/or losses (damages), as well as without payment of any penalty and/or penalty fee and/or any other forfeit, and the Customer unconditionally and entirely agrees with this provision, in the following case (cases):
a) failure to pay by the Customer for the services to the Executor in the amount and under the terms set forth by this Agreement; and/or
b) provision of false information by the Customer; and/or
c) any other technical reasons.

Article 8. Information sharing. 
1. Unless otherwise provided for in this Agreement, the Parties hereto may share information, and this information for the Parties shall be regarded as official, by phone, fax, sms, Skype, via e-mail and/or in writing (in hard copy). 
2. The Parties hereto may share documents and these documents shall be legally effective for the Parties and considered properly received by the Parties by fax, Skype, via e-mail, in writing in hard copy, unless otherwise provided for in this Agreement. A signature affixed to the document forwarded by any Party via e-mail shall be accepted by the Parties. A signature affixed to the document forwarded by any Party by fax shall be accepted by the Parties. A signature affixed to the document forwarded by any Party via Skype shall be accepted by the Parties.
3. Along with the afore-mentioned, the Parties may have electronic documentary interchange and affix their electronic digital signatures (EDS) on any and all documents.

Article 9. Arbitration.
1. All disputes arising between the Parties in relation to interpretation of this Agreement and/or execution of this Agreement shall be settled by the Parties in the form of bilateral negotiations. 
2. If the Parties fail to reach a compromise during negotiations, they shall settle their dispute in the arbitration court (arbitration) of the Chamber of Commerce and Industry of British Virgin Islands.
3. As the rules of procedural law based on which the Parties shall settle their dispute, the Parties shall accept the rules of arbitration court (arbitration) of the Chamber of Commerce and Industry of British Virgin Islands.
4. As the rules of substantive law based on which the Parties settle their dispute, the Parties shall accept this Agreement and rules of international agreements (conventions) regulating copyright legal relationship.

Article 10. Other terms and conditions.
1. This Agreement is made in written and electronic form, in one counterpart, which: 
a) Agreement in writing is kept in the Executor’s office, and 
b) posted in electronic form on the Executor’s official website in Internet.
2. Alteration, amendments and/or supplements to this Agreement shall be made in written and electronic form by the Executor individually, in a single hard counterpart and a single electronic counterpart posted on the official website in Internet and the Customer unconditionally agrees with this provision. 
3. Changes in this Agreement shall be made by the Executor as a new version of the Agreement.
4. If the Customer disagrees with new terms and conditions, he/she shall have a right to withdraw from the Agreement following the procedure and terms set forth by this Agreement.

copyright

Global Info  |  Service Info  |  About SciReg  |  Investor Relations  |  Careers  |  Privacy Policy
This site is protected by copyright and trademark laws under US and International law. All rights reserved. © 1995-2012 SciReg