Image data hiding schemes based on metaheuristic optimization: a review

IF 10.7 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Artificial Intelligence Review Pub Date : 2023-06-18 DOI:10.1007/s10462-023-10537-w
Anna Melman, Oleg Evsutin
{"title":"Image data hiding schemes based on metaheuristic optimization: a review","authors":"Anna Melman,&nbsp;Oleg Evsutin","doi":"10.1007/s10462-023-10537-w","DOIUrl":null,"url":null,"abstract":"<div><p>The digital content exchange on the Internet is associated with information security risks. Hiding data in digital images is a promising direction in data protection and is an alternative to cryptographic methods. Steganography algorithms create covert communication channels and protect the confidentiality of messages embedded in cover images. Watermarking algorithms embed invisible marks in images for further image authentication and proof of the authorship. The main difficulty in the development of data hiding schemes is to achieve a balance between indicators of embedding quality, including imperceptibility, capacity, and robustness. An effective approach to solving this problem is the use of metaheuristic optimization algorithms, such as genetic algorithm, particle swarm optimization, artificial bee colony, and others. In this paper, we present an overview of data hiding techniques based on metaheuristic optimization. We review and analyze image steganography and image watermarking schemes over the past 6 years. We propose three levels of research classification: embedding purpose level, optimization purpose level, and level of metaheuristics. The results demonstrate the high relevance of using metaheuristic optimization in the development of new data hiding algorithms. Based on the results of the review, we formulate the main problems of this scientific field and suggest promising areas for further research.</p></div>","PeriodicalId":8449,"journal":{"name":"Artificial Intelligence Review","volume":"56 12","pages":"15375 - 15447"},"PeriodicalIF":10.7000,"publicationDate":"2023-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Artificial Intelligence Review","FirstCategoryId":"94","ListUrlMain":"https://link.springer.com/article/10.1007/s10462-023-10537-w","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 3

Abstract

The digital content exchange on the Internet is associated with information security risks. Hiding data in digital images is a promising direction in data protection and is an alternative to cryptographic methods. Steganography algorithms create covert communication channels and protect the confidentiality of messages embedded in cover images. Watermarking algorithms embed invisible marks in images for further image authentication and proof of the authorship. The main difficulty in the development of data hiding schemes is to achieve a balance between indicators of embedding quality, including imperceptibility, capacity, and robustness. An effective approach to solving this problem is the use of metaheuristic optimization algorithms, such as genetic algorithm, particle swarm optimization, artificial bee colony, and others. In this paper, we present an overview of data hiding techniques based on metaheuristic optimization. We review and analyze image steganography and image watermarking schemes over the past 6 years. We propose three levels of research classification: embedding purpose level, optimization purpose level, and level of metaheuristics. The results demonstrate the high relevance of using metaheuristic optimization in the development of new data hiding algorithms. Based on the results of the review, we formulate the main problems of this scientific field and suggest promising areas for further research.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于元启发式优化的图像数据隐藏方案综述
互联网上的数字内容交换存在信息安全风险。在数字图像中隐藏数据是数据保护的一个很有前途的方向,是加密方法的一种替代方法。隐写算法创建隐蔽的通信渠道,并保护嵌入封面图像的信息的机密性。水印算法在图像中嵌入不可见的标记,用于进一步的图像认证和作者证明。开发数据隐藏方案的主要困难是实现嵌入质量指标之间的平衡,包括不可感知性、容量和鲁棒性。解决这一问题的有效方法是使用元启发式优化算法,如遗传算法、粒子群优化、人工蜂群等。本文概述了基于元启发式优化的数据隐藏技术。我们回顾和分析了过去6年来的图像隐写和图像水印方案。我们提出了三个层次的研究分类:嵌入目的层次、优化目的层次和元启发式层次。结果表明,在开发新的数据隐藏算法时,使用元启发式优化具有很高的相关性。根据综述的结果,我们提出了该科学领域的主要问题,并提出了进一步研究的前景。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Artificial Intelligence Review
Artificial Intelligence Review 工程技术-计算机:人工智能
CiteScore
22.00
自引率
3.30%
发文量
194
审稿时长
5.3 months
期刊介绍: Artificial Intelligence Review, a fully open access journal, publishes cutting-edge research in artificial intelligence and cognitive science. It features critical evaluations of applications, techniques, and algorithms, providing a platform for both researchers and application developers. The journal includes refereed survey and tutorial articles, along with reviews and commentary on significant developments in the field.
期刊最新文献
Federated learning design and functional models: survey A systematic literature review of recent advances on context-aware recommender systems Escape: an optimization method based on crowd evacuation behaviors A multi-strategy boosted bald eagle search algorithm for global optimization and constrained engineering problems: case study on MLP classification problems Innovative solution suggestions for financing electric vehicle charging infrastructure investments with a novel artificial intelligence-based fuzzy decision-making modelling
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1