A Coloured Image Watermarking Based on Genetic K-Means Clustering Methodology

IF 0.9 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS
Zainab Falah Hassan, Farah Al-Shareefi, Hadeel Qasem Gheni
{"title":"A Coloured Image Watermarking Based on Genetic K-Means Clustering Methodology","authors":"Zainab Falah Hassan, Farah Al-Shareefi, Hadeel Qasem Gheni","doi":"10.12720/jait.14.2.242-249","DOIUrl":null,"url":null,"abstract":"— There are two techniques long-established in image watermarking area, namely the k-means and genetic algorithms. The first one is commonly used to allocate an image’s pixels into distinct clusters. However, the allocation of these pixels is not optimal in all cases. The second technique is usually employed to produce an optimal watermarking solution. In this paper, a hybrid methodology is presented for coloured image watermarking that integrates both genetic algorithm and k-means clustering activity to attain the optimized cluster centroids. These centroids are utilized to optimally distribute the pixels of the cover and watermark images into suitable clusters. This will help decrease the perceptible changes in the watermarked image with the naked eye. For concealment, the Least Significant Bits method is adopted. Typically, the pixels of every watermark cluster are concealed in its closest cover’s cluster; wherein every two successive pixels hide the bits of a single cover image’s pixel. The experimental results demonstrate that the proposed methodology satisfies a sufficient imperceptibility that yields and boosts resistance against common attacks.","PeriodicalId":36452,"journal":{"name":"Journal of Advances in Information Technology","volume":"1 1","pages":""},"PeriodicalIF":0.9000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Advances in Information Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.12720/jait.14.2.242-249","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

— There are two techniques long-established in image watermarking area, namely the k-means and genetic algorithms. The first one is commonly used to allocate an image’s pixels into distinct clusters. However, the allocation of these pixels is not optimal in all cases. The second technique is usually employed to produce an optimal watermarking solution. In this paper, a hybrid methodology is presented for coloured image watermarking that integrates both genetic algorithm and k-means clustering activity to attain the optimized cluster centroids. These centroids are utilized to optimally distribute the pixels of the cover and watermark images into suitable clusters. This will help decrease the perceptible changes in the watermarked image with the naked eye. For concealment, the Least Significant Bits method is adopted. Typically, the pixels of every watermark cluster are concealed in its closest cover’s cluster; wherein every two successive pixels hide the bits of a single cover image’s pixel. The experimental results demonstrate that the proposed methodology satisfies a sufficient imperceptibility that yields and boosts resistance against common attacks.
基于遗传k均值聚类方法的彩色图像水印
在图像水印领域有两种成熟的技术,即k-means和遗传算法。第一个通常用于将图像的像素分配到不同的簇中。然而,这些像素的分配并非在所有情况下都是最优的。第二种技术通常用于生成最优的水印解决方案。本文提出了一种结合遗传算法和k-means聚类活动的彩色图像水印混合方法,以获得优化的聚类质心。利用这些质心将覆盖图像和水印图像的像素最佳地分布到合适的簇中。这将有助于减少肉眼在水印图像中可察觉的变化。对于隐藏,采用最低有效位方法。通常,每个水印簇的像素都隐藏在其最近的覆盖簇中;其中,每两个连续像素隐藏单个封面图像像素的位。实验结果表明,该方法具有较好的隐蔽性,能够有效抵抗常见攻击。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Journal of Advances in Information Technology
Journal of Advances in Information Technology Computer Science-Information Systems
CiteScore
4.20
自引率
20.00%
发文量
46
×
引用
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学术官方微信