An Improved Lossless Information Hiding in SMVQ Compressed Images

Chin-Feng Lee, Jau-Ji Shen, Zih-Cyuan Chao, Somya Agrawal
{"title":"An Improved Lossless Information Hiding in SMVQ Compressed Images","authors":"Chin-Feng Lee, Jau-Ji Shen, Zih-Cyuan Chao, Somya Agrawal","doi":"10.1145/3404709.3404764","DOIUrl":null,"url":null,"abstract":"Reversible data hiding has always been the focus of researchers, because it can retrieve the cover image at the same time when obtaining secret message. Chang, Nguyen and Lin's scheme [1] proposed a reversible compression code hiding based on search order coding (SOC) algorithm and SMVQ. Based on their method, we have proposed some modification in this paper. In the embedding phase, we used SOC or SMVQ to encode the index, and used 1 bit as an indicator to indicate that the index is encoded. In the extraction phase, the receiver extracts the secret message and reconstructs the original SMVQ index us simple steps. Experimental results show that in the case of a state codebook with a size of 32, the compression rate of the proposed method was 0.26 bpp, which is better than the compression rate of 0.36 bpp, proposed by Chang et al.'s scheme. In the case of a state codebook with a size of 64, the compression rate of the proposed method was 0.27 bpp, which is still better than the compression rate of 0.41 bpp proposed by Chang et al.'s scheme. In the above two cases, embedding rate was kept same as the scheme proposed by Chang et al.","PeriodicalId":149643,"journal":{"name":"Proceedings of the 6th International Conference on Frontiers of Educational Technologies","volume":"60 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 6th International Conference on Frontiers of Educational Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3404709.3404764","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Reversible data hiding has always been the focus of researchers, because it can retrieve the cover image at the same time when obtaining secret message. Chang, Nguyen and Lin's scheme [1] proposed a reversible compression code hiding based on search order coding (SOC) algorithm and SMVQ. Based on their method, we have proposed some modification in this paper. In the embedding phase, we used SOC or SMVQ to encode the index, and used 1 bit as an indicator to indicate that the index is encoded. In the extraction phase, the receiver extracts the secret message and reconstructs the original SMVQ index us simple steps. Experimental results show that in the case of a state codebook with a size of 32, the compression rate of the proposed method was 0.26 bpp, which is better than the compression rate of 0.36 bpp, proposed by Chang et al.'s scheme. In the case of a state codebook with a size of 64, the compression rate of the proposed method was 0.27 bpp, which is still better than the compression rate of 0.41 bpp proposed by Chang et al.'s scheme. In the above two cases, embedding rate was kept same as the scheme proposed by Chang et al.
一种改进的SMVQ压缩图像无损信息隐藏方法
可逆数据隐藏一直是研究人员关注的焦点,因为它可以在获取秘密信息的同时检索到封面图像。Chang, Nguyen和Lin的方案[1]提出了一种基于搜索顺序编码(SOC)算法和SMVQ的可逆压缩码隐藏方法。在此基础上,本文提出了一些改进意见。在嵌入阶段,我们使用SOC或SMVQ对索引进行编码,并使用1位作为指示符,表示索引已编码。在提取阶段,接收方通过简单的步骤提取秘密消息并重建原始SMVQ索引。实验结果表明,对于大小为32的状态码本,本文方法的压缩率为0.26 bpp,优于Chang等人提出的方案的0.36 bpp压缩率。对于大小为64的状态码本,本文方法的压缩率为0.27 bpp,仍然优于Chang等人方案的0.41 bpp压缩率。在上述两种情况下,嵌入率与Chang等人提出的方案保持一致。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信