西安电子科技大学学报 ›› 2022, Vol. 49 ›› Issue (2): 164-172.doi: 10.19665/j.issn1001-2400.2022.02.019

• 计算机科学与技术 & 网络空间安全 • 上一篇    下一篇

一种基于宏块复杂度的视频隐写算法

杨晓元1,2(),唐洪琼1(),钮可1,2(),张英男1()   

  1. 1.中国人民武装警察部队工程大学 密码工程学院,陕西 西安 710086
    2.中国人民武装警察部队网络与信息安全重点实验室,陕西 西安 710086
  • 收稿日期:2020-08-11 出版日期:2022-04-20 发布日期:2022-05-31
  • 作者简介:杨晓元(1959—),男,教授,E-mail: yxyangyxyang@163.com;|唐洪琼(1994—),男,中国人民武装警察部队工程大学硕士研究生,E-mail: hqtang@foxmail.com;|钮 可(1981—),男,副教授,博士,E-mail: niuke@163.com;|张英男(1990—),男,讲师,博士,E-mail: zyn583@163.com
  • 基金资助:
    国家自然科学基金(61872384);国家自然科学基金(U1636114)

Video steganography based on macroblock complexity

YANG Xiaoyuan1,2(),TANG Hongqiong1(),NIU Ke1,2(),ZHANG Yingnan1()   

  1. 1. School of Cryptography Engineering,Engineering University of PAP,Xi’an 710086,China
    2. Key Laboratory of Network and Information Security of PAP,Xi’an 710086,China
  • Received:2020-08-11 Online:2022-04-20 Published:2022-05-31

摘要:

基于运动矢量的视频隐写算法通常会破坏运动矢量的局部最优性,这种统计特性的破坏容易被对应的隐写分析算法所检测,致使算法的抗隐写检测性能降低,隐写安全性受到威胁。为降低对运动矢量局部最优性的破坏,在分析运动矢量的修改对视频质量和运动矢量局部最优性影响的基础上,提出一种基于宏块复杂度的视频隐写算法,选择低复杂度的宏块运动矢量作为隐写载体,有效地保持了嵌入信息后运动矢量的局部最优性。首先利用希尔伯特填充曲线对宏块像素进行扫描并定义复杂度,然后统计宏块复杂度,根据待嵌信息长度动态确定嵌入阈值,最后选择复杂度低于嵌入阈值的宏块运动矢量进行随机匹配修改以嵌入秘密信息。实验结果表明,以1 000 kb/s的压缩率对视频进行压缩并嵌入信息时,新算法隐写视频的峰值信噪比和结构相似性值下降分别不超过0.30 dB和0.04,比特率增长不超过0.97 %。与同类算法对比结果显示,新算法的隐写视频质量高,比特率增长小,算法具有较高的抗隐写检测能力和安全性。

关键词: 运动矢量, 隐写, 希尔伯特曲线, 宏块复杂度, 隐写分析

Abstract:

The video steganography based on the motion vector (MV) usually destroys the local optimality MV,and the destruction of such statistical properties is easily detected by the corresponding steganography analytical algorithms,resulting in a reduced performance of anti-stegoanalysis and steganography security.In order to reduce the damage to the local optimality of MVs,a video steganography algorithm based on macroblock complexity is proposed through the analysis of the influence of MV modification on the video quality and the local optimality of MV,and the low-complexity macroblock motion vectors are selected as carriers to effectively maintain the local optimality after embedding information.The proposed algorithm first introduces the Hilbert filling curve to scan macroblock pixels and defines macroblock complexity,then the macroblock complexity distribution is counted and the embedding threshold is dynamically determined according to the length of to-be-embedded data,and finally selects the MV of macroblock whose complexity is lower than the embedding threshold for random matching modification to embed secret information.Experimental results show that the stego video PSNR and SSIM degradation of the proposed algorithmare no more than 0.30 dB and 0.04,respectively,and the bit rate increase does not exceed 0.97 % when the video is compressed and embedded with a compression rate of 1000 Kb/s.Its comparison with related algorithms show that the stego video of the proposed algorithm has a high-level visual quality and a low-level bit rate growth,and that the proposed algorithm has good anti-steganalysis detection capability and security.

Key words: motion vector, steganography, Hilbert curve, macroblock complexity, steganalysis

中图分类号: 

  • TP309.7
Baidu
map