TY - GEN
T1 - Geometrically invariant image watermarking via robust perceptual hashes
AU - Harmanci, Oztan
AU - Monga, Vishal
AU - Mihçak, M. Kivanç
PY - 2006/12/1
Y1 - 2006/12/1
N2 - We consider the problem of blind watermark detection from an image, when the image has undergone a geometric attack. Existing schemes for solving this problem involve insertion of periodic marks or templates, invariant properties of transforms, and feature point based techniques. A major deficiency of these approaches is either a security leak (owing to redundancy in the mark) and/or poor watermark detection performance esp. under lossy geometric attacks, e.g. cropping. In this paper, we introduce a novel watermark synchronization paradigm by using perceptual image hashes. We exploit the fact that a perceptual hash acts as a robust as well as randomized digest of image content, and use it to embed a synchronization mark into the image. Unlike existing synchronization schemes, our synchronization mark has favorable security and robustness to adversarial attacks and hence, cannot be easily removed. Experimental results confirm that our proposed algorithm has significantly lower watermark detection error probabilities than existing methods.
AB - We consider the problem of blind watermark detection from an image, when the image has undergone a geometric attack. Existing schemes for solving this problem involve insertion of periodic marks or templates, invariant properties of transforms, and feature point based techniques. A major deficiency of these approaches is either a security leak (owing to redundancy in the mark) and/or poor watermark detection performance esp. under lossy geometric attacks, e.g. cropping. In this paper, we introduce a novel watermark synchronization paradigm by using perceptual image hashes. We exploit the fact that a perceptual hash acts as a robust as well as randomized digest of image content, and use it to embed a synchronization mark into the image. Unlike existing synchronization schemes, our synchronization mark has favorable security and robustness to adversarial attacks and hence, cannot be easily removed. Experimental results confirm that our proposed algorithm has significantly lower watermark detection error probabilities than existing methods.
UR - http://www.scopus.com/inward/record.url?scp=70350492559&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=70350492559&partnerID=8YFLogxK
U2 - 10.1109/ICIP.2006.312596
DO - 10.1109/ICIP.2006.312596
M3 - Conference contribution
AN - SCOPUS:70350492559
SN - 1424404819
SN - 9781424404810
T3 - Proceedings - International Conference on Image Processing, ICIP
SP - 1397
EP - 1400
BT - 2006 IEEE International Conference on Image Processing, ICIP 2006 - Proceedings
T2 - 2006 IEEE International Conference on Image Processing, ICIP 2006
Y2 - 8 October 2006 through 11 October 2006
ER -