Loading…
A multibit geometrically robust image watermark based on Zernike moments
In image watermarking, the watermark robustness to geometric transformations is still an open problem. Using invariant image features to carry the watermark is an effective approach to addressing this problem. In this paper, a multibit geometrically robust image watermarking algorithm using Zernike...
Saved in:
Main Authors: | , , |
---|---|
Format: | Conference Proceeding |
Language: | English |
Subjects: | |
Online Access: | Request full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | In image watermarking, the watermark robustness to geometric transformations is still an open problem. Using invariant image features to carry the watermark is an effective approach to addressing this problem. In this paper, a multibit geometrically robust image watermarking algorithm using Zernike moments is proposed. Some Zernike moments of an image are selected, and their magnitudes are dither-modulated to embed an array of bits. The watermarked image is obtained via reconstruction from the modified moments and those left intact. In watermark extraction, the embedded bits are estimated from the invariant magnitudes of the Zernike moments using a minimum distance decoder. Simulation results show that the hidden message can be decoded at low error rates, robust against image rotation, scaling and flipping, and as well, a variety of other distortions such as lossy compression. |
---|---|
ISSN: | 1051-4651 2831-7475 |
DOI: | 10.1109/ICPR.2004.1333908 |