|
|
|
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [WM]: How many bits were embedded in it
As presented, the Cox algorithm and many others, describe a watermark that
can be called "zero-bit" watermarks. You are right that the detector will
tell you if the watermark is present or not, but the watermark itself
carries no information bits. You can use these watermarks to build
multi-bit watermarks (see chapter 4 of Cox, Miller, Bloom watermarking
book). Miller, Doerr, and Cox have even demonstrated robust embedding of
1380 bits in 240x386 grayscale images. The underlying watermark is not
fundamentally different from the 1995 Cox algorithm.
At 04:04 AM 5/19/2005, water sun wrote:
>Hi,all
>How many bits were embedded in the Cox's algorithem or Barni's algorithem?
>or the capacity of such watermarking system is how many?
>In my opinion, only one bit is embedded, because the result of such system
>can only tell us the watermark is embeded or not? am i
>wrong?
>Thank you!
=============================
Dr. Jeffrey A Bloom, Sarnoff Corporation, 201 Washington Road, CN 5300,
Princeton, NJ 08543-5300
jbloom@sarnoff.com, http://www.geocities.com/Jeffrey_Bloom, (609) 734-3287,
(609) 734-2662 fax
______________________________________________________________________________
Watermarking Mailing List - http://www.watermarkingworld.org/ml.html
To unsubscribe send email to "majordomo@watermarkingworld.org" with
"unsubscribe watermarking YOURMAIL" in the body.
______________________________________________________________________________
|
