基于广义骑士巡游的图像和视频压缩与加密同步技术研究

项目名称： 基于广义骑士巡游的图像和视频压缩与加密同步技术研究

项目编号： No.61272043

项目类型： 面上项目

立项/批准年度： 2013

项目学科： 自动化技术、计算机技术

项目作者： 柏森

作者单位： 中国人民解放军重庆通信学院

项目金额： 61万元

中文摘要： 图像和视频高效、安全传输越来越需要，这激发我们从事图像和视频压缩加密同步技术的研究。加密造成相关性破坏，影响压缩性能；压缩后用传统方法加密又不大适合数据量大的图像和视频。本项目探索利用广义骑士巡游来解决这一矛盾的方法。 本项目将骑士巡游问题推广到2维和3维空间，率先研究并证实了广义骑士巡游Hamilton路（圈）可应用于图像和视频加密。在此基础上，用分治、同构、代数、数论、蚁群优化等方法，探索3维空间广义骑士巡游Hamilton路（圈）存在的条件、快速求解算法及Hamilton路（圈）数量等；研究Hamilton路（圈）在M序列生成、图像和视频压缩与加密同步进行算法中的应用；揭示巡游起止点、巡游步长、搜索策略等"巡游参数"与Hamilton路（圈）的存在性、数量等的关系，为图像和视频压缩与加密同步的密码体制设计及安全性评估等问题奠定基础，为图像和视频高效、安全传输提供新的解决方案。

中文关键词： 图像压缩；图像加密；视频压缩；视频加密；广义骑士巡游问题

英文摘要： 。 Nowadays the security of images and videos has become increasingly important in many fields, such as confidential transmission, video surveillance, military and medical applications and so on. This requires that the communication systems have a good security level (encryption) and an acceptable transmission rate (compression rate). Compression and encryption technologies are important to the efficient solving of network bandwidth and security issues. So it is the major motivation for us to focus our research on this direction. In order to use optical correlation, encryption and compression techniques cannot be deployed independently or in a cascade manner. Otherwise, our system will suffer from two major problems. Firstly，in fact, we cannot simply use these techniques in a cascade manner without considering the impact of one technique on another. Secondly, a standard compression can affect the correlation decision, because the correlation is sensitive to the loss of information. To solve both problems, we are exploring a new technique to compress & encrypt images and videos simultaneously by using generalized knight's tour (GKT). Knight's tour Problem (KTP) is to find a sequence or knight's tour matrix (KTM) of legal moves such that a knight visits each square of an 8×8 chessboard once and only once. This pro

英文关键词： image compression；image encryption；video compression；video encryption；generalized knight's tour problem