A vector watermarking using the generalized square mask

Abstract

Presents an algorithm for watermark insertion and extraction in a vector image. Most parts of the vector image consist of an array of coordinate values. First, the image is partitioned into blocks with the same area, and every vertex coordinate value within a block is changed to a new coordinate value whose origin is at the south-west vertex of the mask belonging to the associated block. The insertion area is different according to the value of the watermark. Unlike the work of M. Sakamoto et al. (2000), we are able to use an arbitrary size for the square mask. The mask of Sukamoto et al.'s work is restrictive since the length of the mask is 2/sup R/-1, where R=1, 2, ..., n. We also show that our method is superior to the previous work against noise attacks.