Constructing a secret binary partition of a digital image robust to a loss of synchronization

Authors:
Alexei Lysenko
Affiliations:
Ural State University, Yekaterinburg, Russia
Venue:
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
Year:
2007

Citing 3
Cited 0

Techniques for data hiding

IBM Systems Journal
Rotation, scale and translation invariant spread spectrum digital image watermarking

Signal Processing
Geometrically invariant watermarking using feature points

IEEE Transactions on Image Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Digital watermarking, named after paper watermarking, was proposed to protect copyrights of perceptual content owners. A Watermark, or an author's signature, is hidden in a signal by small modifications of the signal. This signature, particularly, can be used as the evidence of authorship/ownership in a court. Performing attacks, a Malefactor is finding ways to destroy the embedded watermark so that it will not be found by a detection algorithm. Frequently a watermark becomes undetectable after an attack due to the loss of synchronization problem. One of the ways to handle this problem is to build a reference system which would be robust to a certain range of attacks. A novel algorithm of building such a system has been proposed by Delannay in [1]. Starting from ideas of Delannay we propose new approach to constructing a secret binary partition of an image.