Robust watermarking based on modified Pigeon algorithm in DCT domain

被引:6
|
作者
AlShaikh, Muath [1 ]
Alzaqebah, Malek [2 ,3 ]
Jawarneh, Sana [4 ]
机构
[1] Saudi Elect Univ, Dept Comp Sci, Coll Comp & Informat, Riyadh 11673, Saudi Arabia
[2] Imam Abdulrahman Bin Faisal Univ, Dept Math, Coll Sci, POB 1982, Dammam, Saudi Arabia
[3] Imam Abdulrahman Bin Faisal Univ, Basic & Appl Sci Res Ctr, POB 1982, Dammam, Saudi Arabia
[4] Imam Abdulrahman Bin Faisal Univ, Dept Comp Sci, Appl Coll, POB 1982, City Of Dammam 31441, Saudi Arabia
关键词
Watermarking; DCT; Pigeon algorithm; Robustness; SCHEME;
D O I
10.1007/s11042-022-13233-z
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Watermarking is one of the techniques for improving the authenticity, integrity, and safety of data. A frequency domain approach is more robust against different attacks compared to a spatial domain approach. However, watermarking approaches are characterized by imperceptibility, robustness, and capacity. The problem of finding the optimal location for embedding the watermark can be challenging and affect the performance of the techniques, but it can also be seen as a path planning problem. Our main aim is to determine the optimal region for embedding the watermark in the Discrete Cosine Transform (DCT) based watermarking approach. We employ a modified Pigeon algorithm to determine the optimal embedding path, in which two objectives are considered to determine the optimal embedding place, as well as the behavior of the algorithm is enhanced to handle the nature of the problem. Our analysis indicates that our approach is highly resistant to different attacks, highly imperceptible after embedding the watermark, and consumes less complexity in embedding and extracting.
引用
收藏
页码:3033 / 3053
页数:21
相关论文
共 50 条
  • [1] Robust watermarking based on modified Pigeon algorithm in DCT domain
    Muath AlShaikh
    Malek Alzaqebah
    Sana Jawarneh
    Multimedia Tools and Applications, 2023, 82 : 3033 - 3053
  • [2] ADAPTIVE ROBUST WATERMARKING ALGORITHM BASED ON DCT-DOMAIN
    Cheng, Xianyi
    Ding, Liu
    Gao, Fei
    2009 IEEE INTERNATIONAL CONFERENCE ON NETWORK INFRASTRUCTURE AND DIGITAL CONTENT, PROCEEDINGS, 2009, : 623 - +
  • [3] Robust and blind watermarking algorithm based on DCT and SVD in the contourlet domain
    Tian, Cheng
    Wen, Ru-Hong
    Zou, Wei-Ping
    Gong, Li-Hua
    MULTIMEDIA TOOLS AND APPLICATIONS, 2020, 79 (11-12) : 7515 - 7541
  • [4] Robust and blind watermarking algorithm based on DCT and SVD in the contourlet domain
    Cheng Tian
    Ru-Hong Wen
    Wei-Ping Zou
    Li-Hua Gong
    Multimedia Tools and Applications, 2020, 79 : 7515 - 7541
  • [5] A novel algorithm for robust audio watermarking based on quantification DCT domain
    Zhou, Zhiping
    Zhou, Lihua
    2007 THIRD INTERNATIONAL CONFERENCE ON INTELLIGENT INFORMATION HIDING AND MULTIMEDIA SIGNAL PROCESSING, VOL 1, PROCEEDINGS, 2007, : 441 - 444
  • [6] A high robust blind watermarking algorithm in DCT domain
    Hsieh, CT
    Hsieh, MY
    KNOWLEDGE-BASED INTELLIGENT INFORMATION AND ENGINEERING SYSTEMS, PT 1, PROCEEDINGS, 2005, 3681 : 1205 - 1211
  • [7] A Robust Digital Image Watermarking Algorithm Based on DCT Domain for Copyright Protection
    Zhou, Zhen
    Chen, Shuyu
    Wang, Guiping
    SMART GRAPHICS, SG 2015, 2017, 9317 : 132 - 142
  • [8] A robust watermarking algorithm for encrypted medical images based on DCT encrypted domain
    Dong, Jiangtao
    Li, Jingbing
    Duan, Yucong
    PROCEEDINGS OF THE 2015 INTERNATIONAL CONFERENCE ON ELECTRONIC SCIENCE AND AUTOMATION CONTROL, 2015, 20 : 140 - 143
  • [9] A Robust Watermarking in DCT Domain based on Logistic Mapping
    Lu, Ling
    Ca, Leiting
    Sun, Xinde
    PROCEEDINGS OF 2009 INTERNATIONAL CONFERENCE OF MANAGEMENT ENGINEERING AND INFORMATION TECHNOLOGY, VOLS 1 AND 2, 2009, : 99 - 101
  • [10] Robust image watermarking on the DCT domain
    Lie, WN
    Lin, GS
    Wu, CL
    Wang, TC
    ISCAS 2000: IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS - PROCEEDINGS, VOL I: EMERGING TECHNOLOGIES FOR THE 21ST CENTURY, 2000, : 228 - 231