Watermark design and detection have been studied as two separate problems so far. However, we show that, if the watermarking algorithm is based on the watermark detection method, then significant gains can be achieved. With a watermark detector based on a sequential hypothesis test rather than a fixed sample size test, the number of watermark pixels can be reduced almost by a factor of two for ...

An N -dimensional digital binary image (I) is a function I : Z → {0, 1}. I is B3N−1,W3N−1 connected if and only if its black pixels and white pixels are each (3 − 1)-connected. I is only B3N−1 connected if and only if its black pixels are (3 − 1)-connected. For a 3-D binary image, the respective connectivity models are B26,W26 and B26. A pair of (3 N − 1)-neighboring opposite-valued pixels is c...