WMW
  NEWS     ABOUT     PARTNERS     CONTACT  
  HELP
WATERMARKING
  • Biography
  • FAQ
MAILINGLIST
  • Management
  • Archive
CONFERENCES
  • Calls
BENCHMARKING
  • Stirmark
  • CheckMark
  • Optimark
BOOKS
LINKS
  • Companies
  • Research
  • Others
WEBRING
DISCLAIMER

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

[WM]: Re: question about one-bit and multiple-bit watermark and ask for papers



Dear Anna,



Go back to the original watermarking model, there are two main steps: the watermark embedding and watermark detection/extraction.
The embedding process is input a watermark, and a key..etc. The output of the embedding process is a new digital image (watermarked
image). The payload of a watermark is the amount of information (measured in bits). Payloads of watermarks may vary from one bit of
information to several bits-bytes of information. Of course, larger payloads are preferable, but depend on the invisible of
watermark or called the trade off between the robustness and the capacity.

For example the patchwork algorithm - may be the simplest form of a watermark which provides a payload of one bit.



>said that the one-bit watermark
> is,also referred to as semi-private watermakring, at detection a binary 
> decision is made as to the presence of the watermark most
> often using the hypothesis testing; The multiple-bit watermark,also 
> referred to as blind watermarking, extracts the embedded
> information of the watermark. This defination was given from the detection 
> aspect.
>

I do not agree with your statement you may misunderstand from paper



Ching-Yung Lin, "Public Watermarking Surviving General Scaling and Cropping: 
An

Application for Print-and-Scan Process", ACM Multimedia 99, Orlando, FL, 
USA, Oct 1999



Cited

 "Several types of watermarking systems have been proposed since 1990 [1]. 
Among them, public watermarking is considered to have a broader application 
value, because it can detect the watermarks without the original object. 
There are two types of public watermarking systems: one-bit watermark and

multiple-bit watermark [2]. The one-bit public watermarking system (also 
referred to as semi-private watermarking) detects the existence of a 
specific identification watermark in the multimedia content. It usually 
serves as evidence of ownership. The multiplebit public watermarking system 
(or blind watermarking) extracts the embedded information of the watermark. 
It is usually used for data hiding or ownership declaration."



Read this papers also

 J. Fridrich "Comparing Robustness of Watermarking Techniques," SPIE 
Security and Watermarking of Multimedia Content, San Jose, CA, Jan 1999



tdhien



----- Original Message ----- 
From: "Xiaohong Pang" <xhpang@hotmail.co.uk>
To: <watermarking@watermarkingworld.org>
Sent: Wednesday, June 08, 2005 2:15 AM
Subject: [WM]: question about one-bit and multiple-bit watermark and ask for 
papers


> Hi, watermarkers:
>
> 1.
>
> I am confused about the defination of one-bit watermark and multiple-bit 
> watermark.  Some papers said that the one-bit watermark
> is,also referred to as semi-private watermakring, at detection a binary 
> decision is made as to the presence of the watermark most
> often using the hypothesis testing; The multiple-bit watermark,also 
> referred to as blind watermarking, extracts the embedded
> information of the watermark. This defination was given from the detection 
> aspect.
>
> While other literatures mentioned one-bit watermark or multiple-bit 
> watermark in the aspect of payload( the information embedded in
> the original image). I can be easy to understand embeding a multiple-bit 
> watermark in the original image(or other multimedia
> content). But is it possible only embed 1 bit watermark?
>
> Could anybody tell me the real meaning of one-bit watermark and 
> multiple-bit watermark and give me a clear explanation?
>
> 2.
>
> Does anybody have the following papers and could you sent them to me?
>
> (1) S.Pereira,J.J.K.O Ruanaidh,and T. Pun.  Secure robust digital image 
> watermarking using the lapped orthogonal transform.   In ISET/SPIE 
> Electronic Imaging'99. San Jose,CA,USA, January 1999.
>
> (2) S. Pereira and T.Pun.  Fast robust template matching for affine 
> resistant watermarks. In 3rd International Information Hiding
> Workshop, Dreseden, Germany,September 1999.
>
>
> Thanks,
>
> Anna



______________________________________________________________________________

Watermarking Mailing List - http://www.watermarkingworld.org/ml.html
To unsubscribe send email to "majordomo@watermarkingworld.org" with
"unsubscribe watermarking YOURMAIL" in the body.
______________________________________________________________________________


© 2000-2002 by WatermarkingWorld
Design and Concept by Martin Kutter