2017 7th International Conference on Cloud Computing, Data Science &Amp; Engineering - Confluence 2017
DOI: 10.1109/confluence.2017.7943222
|View full text |Cite
|
Sign up to set email alerts
|

A secure and robust image watermarking system using wavelet domain

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 9 publications
(7 citation statements)
references
References 12 publications
0
7
0
Order By: Relevance
“…In addition, our proposed method implements the blind extraction approach. We also compared the results of our proposed method with those reported by [7,13,18,23] shown in Table 4. The normalized correlation were calculated between the watermark image and recovered image.…”
Section: Experimental Results Of Svd and Dwtmentioning
confidence: 99%
See 3 more Smart Citations
“…In addition, our proposed method implements the blind extraction approach. We also compared the results of our proposed method with those reported by [7,13,18,23] shown in Table 4. The normalized correlation were calculated between the watermark image and recovered image.…”
Section: Experimental Results Of Svd and Dwtmentioning
confidence: 99%
“…In addition, the authors employed a median filter function to smooth the image before decomposition took place. Siddiqui et al proposed a hybrid DWT and SVD watermarking approach, in which the host image was decomposed into four bands: LL, LH, HL, and HH [7]. Then the LL subband was further decomposed into the fourth level.…”
Section: Literature Reviewmentioning
confidence: 99%
See 2 more Smart Citations
“…▪ For example, if a block index shown below is input, let X = 30, y = 33, N = 7, and n = 2 S1 = [8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37] S2 = [9,11,13,15,17,19,21,23,25,27,29,31,33,35,37,36,34,32,30,28,26,24,22,20,18,16,14,12,…”
Section: Graph Theory and Random Selectionmentioning
confidence: 99%