Optimal frame selection-based watermarking using a meta-heuristic algorithm for securing video content

IF 4 3区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
Roop Singh , Raju Pal , Deepak Joshi
{"title":"Optimal frame selection-based watermarking using a meta-heuristic algorithm for securing video content","authors":"Roop Singh ,&nbsp;Raju Pal ,&nbsp;Deepak Joshi","doi":"10.1016/j.compeleceng.2024.109857","DOIUrl":null,"url":null,"abstract":"<div><div>Optimal embedding factor selection is still an open challenging issue in video watermarking. To address the same, this paper introduces a modified gravitational search algorithm (MGSA) based video watermarking (VW) scheme, termed VW-MGSA. In this proposed method, a novel variant of gravitational search algorithm i.e MGSA is employed to attain multiple optimal embedding factors (MOEF). VW-MGSA embeds watermark logo into maximum entropy blocks of size 8 × 8 followed by 1-level RDWT and Schur transform. The proposed GSA variant (MGSA) was evaluated experimentally and statistically using 22 standard benchmark functions, covering unimodal, multimodal, and fixed-dimension categories. The performance has been assessed using key metrics such as mean, standard deviation, Friedman test, and convergence graphs. These results confirm that the proposed variant outperforms existing meta-heuristic algorithms. Moreover, VW-MGSA has been validated on 8 standard benchmark videos over 19 attacks and evaluated using PSNR, SSIM, and NC metrics. The experimental and statistical results confirm that VW-MGSA outperforms existing video watermarking methods. It significantly improves the balance between imperceptibility and robustness compared to existing methods, with a measured improvement of 39.63%. The improved performance of the VW-MGSA can be applied to real-world platforms like Netflix and Amazon Prime to safeguard licensed content, with watermarks aiding in tracing piracy sources.</div></div>","PeriodicalId":50630,"journal":{"name":"Computers & Electrical Engineering","volume":"121 ","pages":"Article 109857"},"PeriodicalIF":4.0000,"publicationDate":"2024-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Electrical Engineering","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0045790624007845","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

Abstract

Optimal embedding factor selection is still an open challenging issue in video watermarking. To address the same, this paper introduces a modified gravitational search algorithm (MGSA) based video watermarking (VW) scheme, termed VW-MGSA. In this proposed method, a novel variant of gravitational search algorithm i.e MGSA is employed to attain multiple optimal embedding factors (MOEF). VW-MGSA embeds watermark logo into maximum entropy blocks of size 8 × 8 followed by 1-level RDWT and Schur transform. The proposed GSA variant (MGSA) was evaluated experimentally and statistically using 22 standard benchmark functions, covering unimodal, multimodal, and fixed-dimension categories. The performance has been assessed using key metrics such as mean, standard deviation, Friedman test, and convergence graphs. These results confirm that the proposed variant outperforms existing meta-heuristic algorithms. Moreover, VW-MGSA has been validated on 8 standard benchmark videos over 19 attacks and evaluated using PSNR, SSIM, and NC metrics. The experimental and statistical results confirm that VW-MGSA outperforms existing video watermarking methods. It significantly improves the balance between imperceptibility and robustness compared to existing methods, with a measured improvement of 39.63%. The improved performance of the VW-MGSA can be applied to real-world platforms like Netflix and Amazon Prime to safeguard licensed content, with watermarks aiding in tracing piracy sources.
求助全文
约1分钟内获得全文 求助全文
来源期刊
Computers & Electrical Engineering
Computers & Electrical Engineering 工程技术-工程:电子与电气
CiteScore
9.20
自引率
7.00%
发文量
661
审稿时长
47 days
期刊介绍: The impact of computers has nowhere been more revolutionary than in electrical engineering. The design, analysis, and operation of electrical and electronic systems are now dominated by computers, a transformation that has been motivated by the natural ease of interface between computers and electrical systems, and the promise of spectacular improvements in speed and efficiency. Published since 1973, Computers & Electrical Engineering provides rapid publication of topical research into the integration of computer technology and computational techniques with electrical and electronic systems. The journal publishes papers featuring novel implementations of computers and computational techniques in areas like signal and image processing, high-performance computing, parallel processing, and communications. Special attention will be paid to papers describing innovative architectures, algorithms, and software tools.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信