1. If an authorized user knows the watermark, the exact original image can be obtained. The LSB plane is
not irrecoverably altered as it is with a checksum technique.
2. An attacker can only swap pixels with the same m-sequence bit without affecting the correlation properties. This requires knowledge of the private embedded sequence to successfully forge any reasonable area of the
image.
3. Multiple watermarks can overlap each other and will not change the average value (brightness) of the image. Successive watermarks would treat the previously watermarked image as the original. This would also trace an image's chain of custody or audit history.
ข้อเสีย
1. If the watermark covers the entire image, an attacker must merely guess if a given pixel has increased or
decreased by one gray level to identify a particular bit in the watermark.
2. An attacker could compute an entire watermark block if 2n consecutive bits are known. More secure non- linear codes, such as the Gold or Kasami codes, address this problem [6].
3. This method does not specifically protect the DC value of the pixels covered by an individual block.