A reinforcement learning method for decision making process of watermark strength in still images
Author(s) -
Alimohammad Latif,
Reza Naghsh Nilchi Ahmad,
Vali Derhami
Publication year - 2011
Publication title -
scientific research and essays
Language(s) - English
Resource type - Journals
ISSN - 1992-2248
DOI - 10.5897/sre10.886
Subject(s) - watermark , digital watermarking , robustness (evolution) , discrete cosine transform , computer science , reinforcement learning , artificial intelligence , computer vision , reinforcement , image (mathematics) , engineering , biochemistry , chemistry , gene , structural engineering
Summary of the embedding and extracting procedures. Embedding procedure Compute the DCT of the whole image; Select the middle frequency coefficients; Embed the watermark according to Equation 5; Compute the inverse DCT of the result to obtain the watermarked image. Detection procedure Compute the DCT of watermarked image; Select the middle frequency coefficients; Compute NCC between the coefficients and original watermark; Compare the NCC with the predefined threshold; Decide the image is watermarked or not. without loss of the robustness against signal processing operations (Liang, 2008). Then, the watermark is scaled according to the watermark strength of the particular frequency component. The vector Xc { xK 1, xK 2, , xKc M } with the marked DCT coefficients is computed according to the following rule: c K 1 Ox K i wi (5) action Where i 1,2, ,M and O is the watermark strength. Finally, Xc is reinserted in the zig-zag scan and the inverse DCT is performed, thus obtaining the watermarked image
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom