TY  - JOUR
Y1  - 2022///
VL  - 10
UR  - https://www.scopus.com/inward/record.uri?eid=2-s2.0-85131519325&doi=10.1109%2fACCESS.2022.3174964&partnerID=40&md5=4842ebf6befd5d3e1965ff7a1100a2f0
JF  - IEEE Access
A1  - Singh, R.
A1  - Izhar, L.I.
A1  - Elamvazuthi, I.
A1  - Ashok, A.
A1  - Aole, S.
A1  - Sharma, N.
KW  - Color; Color image processing; Cosine transforms; Discrete cosine transforms; Frequency domain analysis; Image compression; Image watermarking; Maximum entropy methods; Robustness (control systems); Signal reconstruction; Singular value decomposition; Watermarking; Wavelet decomposition
KW  -  Arnold transform; Color watermarking; Discrete-wavelet-transform; False positive; False positive problem; Frequency domains; Frequency-domain analysis; Maximum-entropy; Robustness; Watermarking methods
KW  -  Discrete wavelet transforms
ID  - scholars17624
N2  - False-positive problem (FPP) is a one of the challenging tasks for the researchers. It authenticates the wrong owner to access the multimedia content. To overcome, the FPP problem, this paper introduces an efficient watermarking method based on the selection of highest entropy blocks. In this method, cover and watermark images are initially shuffled through Arnold transform. Then, the encrypted images are further processed by a 2-level discrete wavelet transform followed by singular value decomposition. The proposed method has been evaluated with geometrical, filtering, noise, and contrast adjustment attacks on the standard image datasets against five recently developed watermarking methods. The simulation results reveal that the proposed method outperforms the existing methods. © 2013 IEEE.
SN  - 21693536
PB  - Institute of Electrical and Electronics Engineers Inc.
EP  - 52723
AV  - none
TI  - Efficient Watermarking Method Based on Maximum Entropy Blocks Selection in Frequency Domain for Color Images
SP  - 52712
N1  - cited By 8
ER  -