Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.

Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.

Like this presentation? Why not share!

No Downloads

Total views

600

On SlideShare

0

From Embeds

0

Number of Embeds

2

Shares

0

Downloads

41

Comments

0

Likes

1

No embeds

No notes for slide

- 1. AbstractTo solve the sensitive problem of signal processing and geometricdistortion of digital image watermarking, an image watermarkingalgorithm against geometric attacks was proposed in the paper.After decomposing the whole image with 3 level of discrete wavelettransform and transforming the watermark image by Arnoldshuffling, embed the watermark data to the media frequencycoefficients of wavelet domain according to the conceal quality ofHuman Visual System (HVS); and extract two invariant centroids asfactors to correcting geometric transformation by using thetheories of invariant centroid, the watermarked image could becorrected. The experimental results show that the algorithm isrobust to general signal processing and geometric attack such asrotation, scaling and translation.
- 2. Secure Part In Secure Part In Secure Part Result Embedding Attacking DetectingSignals Function E Function A Retrieval Function S General digital watermark life-cycle phases with embedding-, attacking-, and detection and retrieval functions
- 3. • The transformation for a square digital image is
- 4. (1) Use Haar wavelet, the images A be done 3 level discrete wavelettransform, to produce LL3, HL3, LH3, HH3 and so on ten sub-band.(2) Use ascending order for the intermediate region HL3, LH3 ofimage, get the sequence C, and note the location corresponding toorder (3) Arnold scrambling the watermark information, then obtainscrambling watermark information W.(4) Using the multiplicative rule, large absolute value coefficientwith C embed , then get the watermark information W.c′ i = ci(1 + alpha*wi)where the size of determines the intensity of the image frequencymodified by the watermark signal.
- 5. (5) According to corresponding sequence in step (2), the modifiedmedia frequency sequence c′i is assigned to corresponding location of original intermediatefrequency regions HL3, LH3.(6) Use the modified wavelet coefficients in step (5) by discreteinverse wavelet transform to get image embedded with thewatermark information.(7) Extract the two invariant centroid points tm, tn of the imagesembedded watermark information, and obtain the coordinates andcorresponding radius r1, r2 of the two points as geometricdistortion correction key for watermark detection.
- 6. (1) Use the methods described before as well as the key of geometric distortion of thewatermark image rotation, scaling, translation correction.(2) Use DWT for watermarking image A∗ with geometric distortion correction to get LL3, HL3,LH3, HH3 and so on ten sub-bands.(3) According to the corresponding position sequence and the embedded watermarksequence size, a embedding position of intermediate frequency regions HL3, LH3 inwatermarkimage is determined, and embedded watermark sequence c′ i is obtained.(4) Use the Eq. (4), to get scrambling watermark information W′.W′i = (c′ /ci − 1)/alpha(5) Use the saved Arnold scrambling key to do periodic transformation for W′, then get theextracted watermark image W∗.
- 7. • Extraction of the Invariant Centroid• Parameter Correction of Geometric Distortion• Image Rotation Correction Algorithm• Image Scaling Correction Algorithm• Image Translation Correction Algorithm
- 8. Wavelet Host Image LL3,LH3,HL3 transformAnother strategy use only high value Use LL3 butcoefficients to hide your coefficients low energy or LH3 and/or HL3 for higher energyAnother strategy use additive way ormultiplicative way
- 9. Wavelet Wavelet Wavelet Host Image transform transform transform Watermark Image LL3,LH3,HL3 Use LL3 but Arnold low energy scramblingWatermarked Wavelet +* Image inverse 3 levels
- 10. Wavelet Wavelet Wavelet Host Image transform transform transform Watermark Image LL3,LH3,HL3 Use HL3 Arnold scramblingWatermarked Wavelet +* Image inverse 3 levels
- 11. ans = Correlation between watermark andrecovered watermark 0.1215
- 12. Wavelet Wavelet Wavelet Host Image transform transform transform Watermark Image LL3,LH3,HL3 Use HL3 Secret Key RC4 EncryptionWatermarked Wavelet +* Image inverse 3 levels
- 13. Wavelet Wavelet Wavelet Host Image transform transform transform Watermark Image LL3,LH3,HL3 Use HL3 PermutationWatermarked Wavelet +* Image inverse 3 levels
- 14. Wavelet Wavelet Wavelet Host Image transform transform transform Watermark Image LL3,LH3,HL3 Use HL3 Secret key XORWatermarked Wavelet +* Image inverse 3 levels
- 15. Wavelet Wavelet Wavelet WaveletHost Image transform transform transform transform Watermark Image LL4,LH4,HL4 Use HL4 or LH4 or LL Secret key XOR Watermarked Wavelet +* Image inverse 3 levels
- 16. Wavelet Wavelet Wavelet Host Image transform transform transform Pseudo random LL3,LH3,HL3 generator or Use HL3 LFSRWatermarked Wavelet +* Image inverse 3 levels
- 17. Wavelet Wavelet Wavelet Host Image transform transform transform Host Watermark Watermarked LL3,LH3,HL3 Watermark Use HL3 ArnoldWatermark #2 ScramblingWatermarked Wavelet +* Image inverse 3 levels

No public clipboards found for this slide

×
### Save the most important slides with Clipping

Clipping is a handy way to collect and organize the most important slides from a presentation. You can keep your great finds in clipboards organized around topics.

Be the first to comment