EUSIPCO 2004, 12th European Signal Processing Conference, September 6-10, 2004, Vienna, Austria
In this paper, we study the robustness of different grid types used for the embedding rules described in a previous work [1]. In this algorithm, we embed a mark in the uncompressed domain by disturbing slightly the motion vectors computed by an exhaustive BMA on blocks of size N*N. The embedding rule is based on a reference grid that allows to slightly displace the marked vectors in a neighbourhood of there original marked position without missing the watermarking information. The grid tested are a square, a circular and an angular one. To increase the robustness, we embed the mark by generating a hierarchy of motion vectors to spread the mark on the lower level associated to block N*N with N=k*n.
Type:
Conference
City:
Vienna
Date:
2004-09-06
Department:
Digital Security
Eurecom Ref:
1553
Copyright:
© EURASIP. Personal use of this material is permitted. The definitive version of this paper was published in EUSIPCO 2004, 12th European Signal Processing Conference, September 6-10, 2004, Vienna, Austria and is available at :
See also:
